메뉴 건너뛰기




Volumn , Issue , 2006, Pages 108-117

A PVS based framework for validating compiler optimizations

Author keywords

[No Author keywords available]

Indexed keywords

COMMON SUBEXPRESSION ELIMINATION; COMPILER OPTIMIZATIONS; INPUT PROGRAMS; LOOP-INVARIANT CODE MOTION; OPTIMAL CODES; SEMANTIC EQUIVALENCES; SEQUENTIAL COMPOSITIONS;

EID: 82655184735     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2006.4     Document Type: Conference Paper
Times cited : (12)

References (14)
  • 1
    • 34249975771 scopus 로고
    • Overview: The common lisp object system
    • L. G. Demichiel. Overview: The Common Lisp Object System. Lisp and Symbolic Computation, 1(2):227-244, 1988.
    • (1988) Lisp and Symbolic Computation , vol.1 , Issue.2 , pp. 227-244
    • Demichiel, L.G.1
  • 2
    • 18544388421 scopus 로고    scopus 로고
    • Using program checking to ensure the correctness of compiler implementations
    • S. Glesner. Using program checking to ensure the correctness of compiler implementations. Journal of Universal Computer Science, 9(3):191-222, 2003. (Pubitemid 41151350)
    • (2003) Journal of Universal Computer Science , vol.9 , Issue.3 , pp. 191-222
    • Glesner, S.1
  • 4
    • 82655168585 scopus 로고    scopus 로고
    • Structuring optimizing transformations and proving them sound
    • A. Kanade, A. Sanyal, and U. Khedker. Structuring optimizing transformations and proving them sound. In Proceedings of COCV'06, pages 105-121, 2006.
    • (2006) Proceedings of COCV'06 , pp. 105-121
    • Kanade, A.1    Sanyal, A.2    Khedker, U.3
  • 6
    • 0038039859 scopus 로고    scopus 로고
    • Automatically proving the correctness of compiler optimizations
    • S. Lerner, T. Millstein, and C. Chambers. Automatically proving the correctness of compiler optimizations. In Proceedings of PLDI'03, pages 220-231, 2003.
    • (2003) Proceedings of PLDI'03 , pp. 220-231
    • Lerner, S.1    Millstein, T.2    Chambers, C.3
  • 7
    • 34250185973 scopus 로고    scopus 로고
    • Rapid prototyping in PVS
    • NIA-NASA Langley, National Institute of Aerospace, VA, May
    • C. Muñoz. Rapid prototyping in PVS. Technical Report NIA 2003-03, NASA/CR-2003-212418, NIA-NASA Langley, National Institute of Aerospace, VA, May 2003.
    • (2003) Technical Report NIA 2003-03, NASA/CR-2003-212418
    • Muñoz, C.1
  • 9
    • 14744275497 scopus 로고    scopus 로고
    • Theory interpretations in PVS
    • SRI International, Menlo Park, CA, April
    • S. Owre and N. Shankar. Theory interpretations in PVS. Technical Report SRI-CSL-01-01, CSL, SRI International, Menlo Park, CA, April 2001.
    • (2001) Technical Report SRI-CSL-01-01, CSL
    • Owre, S.1    Shankar, N.2
  • 13
    • 0027683919 scopus 로고
    • Generating data flow analysis algorithms from modal specifications
    • B. Steffen. Generating data flow analysis algorithms from modal specifications. Science of Computer Programming, 21:115-139, 1993.
    • (1993) Science of Computer Programming , vol.21 , pp. 115-139
    • Steffen, B.1
  • 14
    • 1442358113 scopus 로고    scopus 로고
    • VOC: A translation validator for optimizing compilers
    • of ENTCS
    • L. Zuck, A. Pnueli, Y. Fang, and B. Goldberg. VOC: A translation validator for optimizing compilers. In Proceedings of COCV'02, volume 65(2) of ENTCS, 2002.
    • (2002) Proceedings of COCV'02 , vol.65 , Issue.2
    • Zuck, L.1    Pnueli, A.2    Fang, Y.3    Goldberg, B.4


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