Certifying Machine Code Safety: Shallow Versus Deep Embedding

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

Volumn 3223, Issue , 2004, Pages 305-320

  Wildmoser, Martin ^a   Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ASSEMBLY LANGUAGE; DATA TYPE; ISABELLE/HOL; LOGICAL FORMULAS; MACHINE CODES; SAFETY POLICIES; SHALLOW EMBEDDING; SPECIFIC STRENGTH;

FORMAL LOGIC;

EID: 35048877560     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30142-4_22     Document Type: Article

References (17)

1. VeryPCC project:, http://isaballe.in.tum.de/verypcc/, 2003.
2. A. W. Appel. Foundational proof-carrying code. In 16th Annual IEEE Symposium on Logic in Computer Science (LICS '01), pages 247-258, June 2001.
3. A. W. Appel and A. P. Felty. A semantic model of types and machine instructions for proof-carrying code. In 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '00), pages 243-253, January 2000.
4. S. Berghofer. Program extraction in simply-typed higher order logic. In H. Geuvers and F. Wiedijk, editors, Types for Proofs and Programs, International Workshop, (TYPES 2002), Lect. Notes in Comp. Sci. Springer-Verlag, 2003.
5. S. Berghofer and T. Nipkow. Executing higher order logic. In P. Callaghan, Z. Luo, J. McKinna, and R. Pollack, editors, Types for Proofs and Programs, International Workshop, (TYPES 2000), Lect. Notes in Comp. Sci. Springer-Verlag, 2000.
6. S. Berghofer and T. Nipkow. Proof terms for simply typed higher order logic. In J. Harrison and M. Aagaard, editors, Theorem Proving in Higher Order Logics, volume 1869 of Lect. Notes in Comp. Sci., pages 38-52. Springer-Verlag, 2000.
7. J. Chen, D. Wu, A. W. Appel, and H. Fang. A provably sound tal for back-end optimization. In Programming Languages Design and Implementation (PLDI). ACM Sigplan, 2003.
8. C. Colby, P. Lee, G. C. Necula, F. Blau, M. Plesko, and K. Cline. A certifying compiler for Java. In Proc. ACM SIGPLAN conf. Programming Language Design and Implementation, pages 95-107, 2000.
9. K. Gerwin and N. Tobias. A machine-checked model for a Java-like language, virtual machine and compiler. Research report, National ICT Australia, Sydney, 2004.
10. N. Hamid, Z. Shao, V. Trifonov, S. Monnier, and Z. Ni. A syntactic approach to foundational proof-carrying code. In Proc. 17th IEEE Symp. Logic in Computer Science, pages 89-100, July 2002.
11. P. V. Homeier and D. F. Martin. Secure mechanical verification of mutually recursive procedures, pages 1-19, 2003.
12. G. Klein. Verified Java Bytecode Verification. PhD thesis, Institut für Informatik, Technische Universität München, 2003.
13. G. Morrisett, D. Walker, K. Crary, and N. Glew. From system F to typed assembly language. In Proc. 25th ACM Symp. Principles of Programming Languages, pages 85-97. ACM Press, 1998.
14. G. C. Necula. Proof-carrying code. In Proc. 24th ACM Symp. Principles of Programming Languages, pages 106-119. ACM Press, 1997.
15. G. C. Necula. Compiling with Proofs. PhD thesis, Carnegie Mellon University, 1998.
16. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of Lect. Notes in Comp. Sci. Springer, 2002.
17. G. Winskel. The Formal Semantics of Programming Languages. MIT Press, 1993.