Formal verification of a java compiler in isabelle

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

Volumn 2392, Issue , 2002, Pages 63-77

  Strecker, Martin ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; FORMAL VERIFICATION; PROGRAM COMPILERS; THEOREM PROVING;

COMPILER CORRECTNESS; DESIGN DECISIONS; FORMAL PROOFS; ISABELLE; JAVA BYTE CODES; JAVA COMPILERS; JAVA SOURCE; RELEVANT FEATURES;

JAVA PROGRAMMING LANGUAGE;

EID: 84948961094     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45620-1_5     Document Type: Conference Paper

References (16)

1. Stefan Berghofer and T obias Nipkow. Executing higher order logic. In Proc. TYPES Working Group Annual Meeting 2000, LNCS, 2000. Available from http://www4.in.tum.de/˜berghofe/papers/TYPES2000.pdf.
2. Samuel Boutin. Preuve de correction de la compilation de Mini-ML en code CAM dans le système d’aide á la démonstration COQ. Technical Report 2536, INRIA Rocquencourt, April 1995.
3. Paul Curzon. A verifiedVista implementation. Technical Report 311, University of Cambridge, Computer Laboratory, September 1993. Available from http://www.cl.cam.ac.uk/Research/HVG/vista/.
4. A. Dold and V. Vialard. A mechanically verifiedcompiling specification for a Lisp compiler. In Proc. FSTTCS 2001, December 2001.
5. Gerwin Klein and Tobias Nipkow. Verifiedb ytecode verifiers. Theoretical Computer Science, 2002. to appear.
6. J.S. Moore, W.R. Bevier, W. A. Hunt, and W. D. Young. System verification. Special issue of J. of Automated Reasoning, 5(4), 1989.
7. R. Milner and R. Weyhrauch. Proving compiler correctness in a mechanizedlogic. Machine Intelligence, 7:51–70, 1972.
8. Tobias Nipkow. Verified bytecode verifiers. In M. Miculan F. Honsell, editor, Foundations of Software Science and Computation Structures (FOSSACS 2001), volume 2030 of Lecture Notes in Computer Science. Springer Verlag, 2001.
9. Tobias Nipkow, Davidv on Oheimb, and Cornelia Pusch. μJava: Embedding a programming language in a theorem prover. In F.L. Bauer and R. Steinbrüggen, editors, Foundations of Secure Computation. Proc. Int. Summer School Marktoberdorf 1999, pages 117–144. IOS Press, 2000.
10. Tobias Nipkow, Lawrence Paulson, and Markus Wenzel. Isabelle/HOL. A Proof Assistant for Higher-Order Logic. LNCS 2283. Springer, 2002.
11. Davidv on Oheimb. Analyzing Java in Isabelle/HOL: Formalization, Type Safety and Hoare Logic. PhD thesis, Technische Universität München, 2001. http://www4.in.tum.de/˜oheimb/diss/.
12. Davidv on Oheimb. Hoare logic for Java in Isabelle/HOL. Concurrency: Practice and Experience, 13(13), 2001.
13. G. Schellhorn. Verifikation abstrakter Zustandsmaschinen. PhD thesis, Universität Ulm, 1999.
14. R. Stärk, J. Schmid, and E. Börger. Java and the Java Virtual Machine – Definition, Verification, Validation. Springer Verlag, 2001.
15. Martin Strecker. Compilation andb ytecode verification in μJava. Forthcoming, preprint available from http://www4.in.tum.de/˜streckem/ Publications/compbcv02.html, 2002.
16. William D. Young. A mechanically verifiedco de generator. J. of Automated Reasoning, 5(4):493–518, 1989.