Proof obligations preserving compilation

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

Volumn 3866 LNCS, Issue , 2006, Pages 112-126

  Barthe, Gilles ^a   Rezk, Tamara ^a   Saabas, Ando ^b  

^a INRIA   (France)

^b TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CODES (SYMBOLS); COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER PROGRAMMING; INFORMATION ANALYSIS; INTERACTIVE COMPUTER SYSTEMS; OPTIMIZATION;

ANNOTATED PROGRAMS; LOOP INVARIANTS; PROGRAM VERIFICATION; PROOF OBLIGATIONS;

PROGRAM COMPILERS;

EID: 33745662871     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11679219_9     Document Type: Conference Paper

References (16)

1. D. Aspinall, S. Gilmore, M. Hofmann, D. Sannella, and I. Stark. Mobile Resource Guarantees for Smart Devices. 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 1-27, 2005.
2. 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.
3. 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, Proceeings of CASSIS'04, volume 3362 of Lecture Notes in Computer Science, pages 50-71. Springer-Verlag, 2005.
4. N. Benton. A typed logic for stacks and jumps. Manuscript, 2004.
5. L. Burdy and M. Pavlova. Java bytecode specification and verification. In Proceedings of SAC'06, 2006. To appear.
6. P. D'Argenio G. Barthe and T. Rezk. Secure information flow by self-composition. In R. Foccardi, editor, Proceedings of CSFW'04, pages 100-114. IEEE Press, 2004.
7. Joshua D. Guttman and Mitchell Wand. Special issue on VLISP. Lisp and Symbolic Computation, 8(1/2), March 1995.
8. N.A. Hamid and Z. Shao. Interfacing hoare logic and type systems for foundational proof-carrying code. In K. Slind, A. Bunker, and G. Gopalakrishnan, editors, Proceedings of TPHOLs'04, volume 3223 of Lecture Notes in Computer Science, pages 118-135. Springer-Verlag, 2004.
9. G.C. Necula. Proof-Carrying Code. In Proceedings of POPL'97, pages 106-119. ACM Press, 1997.
10. G.C. Necula and P. Lee. The Design and Implementation of a Certifying Compiler. In Proceedings of PLDI'98, pages 333-344, 1998.
11. A. Pnueli, E. Singerman, and M. Siegel. Translation validation. In B. Steffen, editor, Proceedings of TACAS'98, volume 1384 of Lecture Notes in Computer Science, pages 151-166. Springer-Verlag, 1998.
12. C.L. Quigley. A Programming Logic for Java Bytecode Programs. In D. Basin and B. Wolff, editors, Proceedings of TPHOLs'03, volume 2758, pages 41-54, 2003.
13. M. Rinard. Credible compilation. Manuscript, 1999.
14. X. Rival. Abstract Interpretation-Based Certification of Assembly Code. In L.D. Zuck, P.C. Attie, A.Cortesi, and S. Mukhopadhyay, editors, Proceedings of VMCAI'03, volume 2575 of Lecture Notes in Computer Science, pages 41-55, 2003.
15. X. Rival. Symbolic Transfer Functions-based Approaches to Certified Compilation. In Proceedings of POPL'04, pages 1-13. ACM Press, 2004.
16. M. Wildmoser and T. Nipkow. Asserting bytecode safety. In S. Sagiv, editor, Proceedings of ESOP'05, volume 1210 of Lecture Notes in Computer Science. Springer-Verlag, 2005.