Bytecode analysis for proof carrying code

Electronic Notes in Theoretical Computer Science

Volumn 141, Issue 1 SPEC. ISS., 2005, Pages 19-34

  Wildmoser, Martin ^a   Chaieb, Amine ^a   Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Bytecode; Isabelle HOL; Proof carrying code; Safety policy; Type analyzer

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE; SECURITY OF DATA;

BYTECODE; ISABELLE/HOL; PROOF CARRYING CODE; SAFETY POLICY; TYPE ANALYZER;

CODES (SYMBOLS);

EID: 28044446798     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.02.040     Document Type: Article

References (17)

1. Jissa website http://www.quiss.org/jissa/ 2000
2. VeryPCC project website in Munich http://isabelle.in.tum.de/verypcc/ 2003
3. A.W. Appel. Foundational proof-carrying code. In 16th Annual IEEE Symposium on Logic in Computer Science (LICS '01), pages 247-258, June 2001
4. S. Berghofer, and T. Nipkow Proof terms for simply typed higher order logic J. Harrison M. Aagaard Theorem Proving in Higher Order Logics Lect. Notes in Comp. Sci. volume 1869 2000 Springer-Verlag 38 52
5. A. Chaieb. Proof-producing program analysis. Technical report, TU, München, Dec. 2004
6. B.-Y.E. Chang, A. Chlipala, G.C. Necula, and R.R. Schneck The open verifier framework for foundational verifiers In Proceedings of the ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'05) ACM SIGPLAN Notices 2005
7. P. Cousot, and R. Cousot Systematic design of program analysis frameworks Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages San Antonio, Texas 1979 ACM Press New York, NY 269 282
8. G. Klein and T. Nipkow. A machine-checked model for a Java-like language, virtual machine and compiler. Research report, National ICT Australia, Sydney, 2004
9. G. Morrisett, D. Walker, K. Crary, and N. Glew From system F to typed assembly language Proc. 25th ACM Symp. Principles of Programming Languages 1998 ACM Press 85 97
10. G.C. Necula. Compiling with Proofs. PhD thesis, Carnegie Mellon University, 1998
11. F. Nielson, H.R. Nielson, and C. Hankin Principles of Program Analysis 1999 Springer
12. S. Seo, H. Yang, and K. Yi Automatic construction of hoare proofs from abstract interpretation results The First Asian Symposium on Programming Languages and Systems Beijing LNCS Vol. 2895 2003 Springer 230 245
13. R. Vallée-Rai, L. Hendren, V. Sundaresan, P. Lam, E. Gagnon, and P. Co. Soot - a java optimization framework. In Proceedings of CASCON 1999, pages 125-135, 1999
14. Verificard project website in Munich http://isabelle.in.tum.de/ verificard/ 2002
15. M. Wildmoser, and T. Nipkow Certifying machine code safety: Shallow versus deep embedding Proc. 17th Int. Conf. on Theorem Proving in Higher Order Logics (TPHOLs 2004) 2004 Springer Verlag 16
16. M. Wildmoser and T. Nipkow. Asserting bytecode safety. Proceedings of the 15th European Symposium on Programming (ESOP05), 2005. to appear
17. M. Wildmoser, T. Nipkow, G. Klein, and S. Nanz. Prototyping proof carrying code. In Proc. 3rd IFIP Int. Conf. Theoretical Computer Science (TCS 2004), 2004