Certificate translation for optimizing compilers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4134 LNCS, Issue , 2006, Pages 301-317

  Barthe, Gilles ^a   Grégoire, Benjamin ^a   Kunz, César ^a   Rezk, Tamara ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; FORMAL LOGIC; HIGH LEVEL LANGUAGES; OPTIMIZATION;

CERTIFICATE TRANSLATION; COMPILER OPTIMIZATIONS; FUNCTIONAL SPECIFICATION;

PROGRAM COMPILERS;

EID: 33749870194     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11823230_20     Document Type: Conference Paper

References (13)

1. F. Bannwart and P. Müller. A program logic for bytecode. In F. Spoto, editor, Proceedings of Bytecode '05, Electronic Notes in Theoretical Computer Science. Elsevier Publishing, 2005.
2. M. Barnett, K.R.M. Leino, and W. Schulte. The Spec# Programming System: An Overview. In G. Barthe, L. Burdy, M. Huisman, J.-L. Lanet, and T. Muntean, editors, Proceedings of CASSIS'04, volume 3362 of Lecture Notes in Computer Science, pages 50-71. Springer-Verlag, 2005.
3. G. Barthe, T.Rezk, and A. Saabas. Proof obligations preserving compilation. In Proceedings of FAST'05, volume 3866 of Lecture Notes in Computer Science, pages 112-126. Springer-Verlag, 2005.
4. N. Benton. Simple relational correctness proofs for static analyses and program transformations. In Proceedings of POPL'04, pages 14-25. ACM Press, 2004.
5. L. Burdy and M. Pavlova. Annotation carrying code. In Proceedings of SAC'06. ACM Press, 2006.
6. J. D. Guttman and M. Wand. Special issue on VLISP. Lisp and Symbolic Computation, 8(1/2), March 1995.
7. S. Lerner, T. Millstein, E. Rice, and C. Chambers. Automated soundness proofs for dataflow analyses and transformations via local rules. In Proceedings of POPL'05, pages 364-377. ACM Press, 2005.
8. X. Leroy. Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. In Proceedings of POPL'06, pages 42-54. ACM Press, 2006.
9. G.C. Necula. Proof-Carrying Code. In Proceedings of POPL'97, pages 106-119. ACM Press, 1997.
10. G.C. Necula. Compiling with Proofs. PhD thesis, Carnegie Mellon University, October 1998. Available as Technical Report CMU-CS-98-154.
11. G.C. Necula and P. Lee. The Design and Implementation of a Certifying Compiler. In Proceedings of PLDI'98, pages 333-344. ACM Press, 1998.
12. S. Seo, H. Yang, and K. Yi. Automatic Construction of Hoare Proofs from Abstract Interpretation Results. In A. Ohori, editor, Proceedings of APLAS'03, volume 2895 of Lecture Notes in Computer Science, pages 230-245. Springer-Verlag, 2003.
13. M. Wildmoser, A. Chaieb, and T. Nipkow. Bytecode analysis for proof carrying code. In F. Spoto, editor, Proceedings of BYTECODE'05, Electronic Notes in Theoretical Computer Science. Elsevier Publishing, 2005.