Preservation of proof obligations from java to the java virtual machine

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

Volumn 5195 LNAI, Issue , 2008, Pages 83-99

  Barthe, Gilles ^a   Grégoire, Benjamin ^b   Pavlova, Mariela ^c  

^a IMDEA SOFTWARE INSTITUTE   (Spain)

^b INRIA   (France)

^c Trusted Labs   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; COMPUTER SOFTWARE REUSABILITY; FINANCIAL DATA PROCESSING; FOOD PRESERVATION; FORMAL LOGIC;

AUTOMATED REASONING; EXECUTABLE PROGRAMS; JAVA PROGRAMS; JAVA VIRTUAL MACHINE; JOINT CONFERENCE; OPTIMIZING COMPILATION; PROGRAM VERIFICATION; PROOF OBLIGATIONS; PROOF-CARRYING CODE; TARGET SOURCE; VERIFICATION CONDITION GENERATORS;

JAVA PROGRAMMING LANGUAGE;

EID: 53049084036     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71070-7_7     Document Type: Conference Paper

References (19)

1. Balakrishnan, G.: WYSISWYX: What you see is not what you execute. PhD thesis, Department of Computer Science, University of Wisconsin (2007)
2. Bannwart, F.Y, Müller, P.: A program logic for bytecode. In: Spoto. F. (ed.) Bytecode Semantics, Verification. Analysis and Transformation. Electronic Notes in Theoretical Computer Science, vol. 141, pp. 255-273. Elsevier, Amsterdam (2005)
3. Barthe, G., Grégoire, B., Kunz, C., Rezk. T.: Certificate translation for optimizing compilers. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 301-317. Springer, Heidelberg (2006)
4. Barthe. G., Kunz, C.: Certificate translation in abstract interpretation. In: Drossopoulou. S. (ed.) European Symposium on Programming, Budapest. Hungary. LNCS, vol. 4960, pp. 368-382. Springer, Heidelberg (2008)
5. Barthe, G., Rezk. T., Saabas, A.: Proof obligations preserving compilation. In: Dimitrakos, T., Martinelli, F, Ryan, P.Y.A., Schneider, S. (eds.) FAST 2005. LNCS, vol. 3866, pp. 112-126. Springer. Heidelberg (2006)
6. Burdy, L., Pavlova, M.: Java bytecode specification and verification. In: Symposium on Applied Computing, pp. 1835-1839. ACM Press, New York (2006)
7. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Principles of Programming Languages, pp. 238-252 (1977)
8. Grégoire, B., Sacchini, J.: Combining a verification condition generator for a bytecode language with static analyses. In: Barthe. G., Fournet. C. (eds.) Trustworthy Global Computing. LNCS. vol. 4912, pp. 23-40. Springer. Heidelberg (2007)
9. Leroy, X.: Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In: Morrisett. J.G., Peyton Jones, S.L. (eds.) Principles of Programming Languages, pp. 42-54. ACM Press, New York (2006)
10. Logozzo, F., Fähndrich, M.: On the relative completeness of bytecode analysis versus source code analysis. In: Hendren, L. (ed.) CC. LNCS, vol. 4959, pp. 197-212. Springer, Heidelberg (2008)
11. Müller, P., Nordio, M.: Proof-transforming compilation of programs with abrupt termination. In: SAVCBS 2007: Proceedings of the 2007 conference on Specification and verification of component-based systems, pp. 39-46. ACM Press, New York (2007)
12. Necula, G.C.: Proof-carrying code. In: Principles of Programming Languages, pp. 106-119. ACM Press, New York (1997)
13. Necula, G.C., Lee, P.: The design and implementation of a certifying compiler. In: Programming Languages Design and Implementation, vol. 33, pp. 333-344. ACM Press. New York (1998)
14. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. A Proof Assistant for Higher-Order Logic. Springer, Heidelberg (2002)
15. Nordio, M., Müller, P., Meyer, B.: Formalizing proof-transforming compilation of eiffel programs. Technical Report 587, ETH Zurich (2008)
16. Pavlova, M.: Specification and verification of Java bytecode. PhD thesis. Université de Nice Sophia-Antipolis (2007)
17. Rival, X.: Symbolic Transfer Functions-based Approaches to Certified Compilation. In: Principles of Programming Languages, pp. 1-13. ACM Press, New York (2004)
18. Saabas, A., Uustalu, T.: A compositional natural semantics and Hoare logic for low-level languages. Theoretical Computer Science 373(3), 273-302 (2007)
19. Saabas, A., Uustalu, T.: Proof optimization for partial redundancy elimination. In: ACM Workshop on Partial Evaluation and Semantics-based Program Manipulation, pp. 91-101. ACM Press, New York (2008)