메뉴 건너뛰기




Volumn , Issue , 2004, Pages 249-258

A methodology for generating verified combinatorial circuits

Author keywords

Abstract interpretation; Multi stage programming

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; FAST FOURIER TRANSFORMS; HIGH LEVEL LANGUAGES; OPTIMIZATION;

EID: 24944568375     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1017753.1017794     Document Type: Conference Paper
Times cited : (44)

References (33)
  • 1
    • 0003527514 scopus 로고    scopus 로고
    • The MIT Press (Cambridge, MA) and McGraw-Hill Book Company (New York, NY)
    • H. Abelson, G.J. Sussman, and J. Sussman. Structure and Interpretation of Computer Programs. The MIT Press (Cambridge, MA) and McGraw-Hill Book Company (New York, NY), 1996. Available online from http://mitpress.mit.edu/sicp/full-text/book/book.html.
    • (1996) Structure and Interpretation of Computer Programs
    • Abelson, H.1    Sussman, G.J.2    Sussman, J.3
  • 3
  • 4
    • 35248851156 scopus 로고    scopus 로고
    • Implementing multi-stage languages using ASTs, gensym, and reflection
    • Krzysztof Czarnecki, Frank Pfenning, and Yannis Smaragdakis, editors, Lecture Notes in Computer Science. Springer-Verlag
    • Cristiano Calcagno, Walid Taba, Liwen Huang, and Xavier Leroy. Implementing multi-stage languages using ASTs, gensym, and reflection. In Krzysztof Czarnecki, Frank Pfenning, and Yannis Smaragdakis, editors, Generative Programming and Component Engineering (GPCE), Lecture Notes in Computer Science. Springer-Verlag, 2003.
    • (2003) Generative Programming and Component Engineering (GPCE)
    • Calcagno, C.1    Taba, W.2    Huang, L.3    Leroy, X.4
  • 5
    • 85050550846 scopus 로고
    • Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
    • ACM
    • P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Symposium on Principles of Programming Languages, pages 238-252. ACM, 1977.
    • (1977) 4th ACM Symposium on Principles of Programming Languages , pp. 238-252
    • Cousot, P.1    Cousot, R.2
  • 6
    • 0034174025 scopus 로고    scopus 로고
    • The density advantage of configurable computing
    • Apr
    • A.H. DeHon. The density advantage of configurable computing. In IEEE Computer, pages 41-49, Apr 2000.
    • (2000) IEEE Computer , pp. 41-49
    • Dehon, A.H.1
  • 10
    • 0000531903 scopus 로고    scopus 로고
    • A type system for bounded space and functional in-place update
    • Lecture Notes in Computer Science. Springer-Verlag
    • Martin Hofmann. A type system for bounded space and functional in-place update. In European Symposium on Programming (ESOP), Lecture Notes in Computer Science. Springer-Verlag, 2000.
    • (2000) European Symposium on Programming (ESOP)
    • Hofmann, M.1
  • 12
    • 17144377271 scopus 로고
    • Designing arithmetic circuits by refinement in ruby
    • C. C. Morgan R. S. Bird and J. C. P. Woodcock, editors, Lecture Notes in Computer Science. Springer Verlag
    • Geraint Jones and Mary Sheeran. Designing arithmetic circuits by refinement in ruby. In C. C. Morgan R. S. Bird and J. C. P. Woodcock, editors. Mathematics of Program Construction, Lecture Notes in Computer Science. Springer Verlag, 1993.
    • (1993) Mathematics of Program Construction
    • Jones, G.1    Sheeran, M.2
  • 13
    • 0007772443 scopus 로고
    • HardwareC - A language for hardware design (version 2.0)
    • Stanford University, April
    • D. Ku and G.D. Micheli. HardwareC - a language for hardware design (version 2.0). Technical Report CSL-TR-90-419, Stanford University, April 1990.
    • (1990) Technical Report , vol.CSL-TR-90-419
    • Ku, D.1    Micheli, G.D.2
  • 15
    • 84861268985 scopus 로고    scopus 로고
    • Xavier Leroy. Objective Caml, 2000. Available from http://caml.inria.fr/ocaml/.
    • (2000)
  • 17
    • 0031343311 scopus 로고    scopus 로고
    • Seeking solutions in configurable computing
    • Dec
    • W.H. Mangione-Smith. Seeking solutions in configurable computing. In IEEE Computer, pages 38-43, Dec 1997.
    • (1997) IEEE Computer , pp. 38-43
    • Mangione-Smith, W.H.1
  • 21
    • 0026188821 scopus 로고
    • Notions of computation and monads
    • Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(1), 1991.
    • (1991) Information and Computation , vol.93 , Issue.1
    • Moggi, E.1
  • 24
    • 84858585649 scopus 로고    scopus 로고
    • P.O. Box 91000, Portland, OR 97291-1000, USA
    • Oregon Graduate Institute Technical Reports. P.O. Box 91000, Portland, OR 97291-1000, USA. Available online from ftp://cse.ogi.edu/pub/tech-reports/README.html.
    • Oregon Graduate Institute Technical Reports
  • 27
    • 0003678579 scopus 로고    scopus 로고
    • PhD thesis, Oregon Graduate Institute of Science and Technology. Available from [24]
    • Walid Taha. Multi-Stage Programming: Its Theory and Applications. PhD thesis, Oregon Graduate Institute of Science and Technology, 1999. Available from [24].
    • (1999) Multi-stage Programming: Its Theory and Applications
    • Taha, W.1
  • 29
    • 84947243313 scopus 로고    scopus 로고
    • A gentle introduction to multi-stage programming
    • Don Batory, Charles Consel, Christian Lengauer, and Martin Odersky, editors, Lecture Notes in Computer Science. Springer-Verlag
    • Walid Taha. A gentle introduction to multi-stage programming. In Don Batory, Charles Consel, Christian Lengauer, and Martin Odersky, editors, Domain-specific Program Generation, Lecture Notes in Computer Science. Springer-Verlag, 2004.
    • (2004) Domain-specific Program Generation
    • Taha, W.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.