Proof-carrying code from certified abstract interpretation and fixpoint compression

Theoretical Computer Science

Volumn 364, Issue 3, 2006, Pages 273-291

  Besson, Frédéric ^a   Jensen, Thomas ^a   Pichardie, David ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Abstract interpretation; Computer security; Data flow analysis; Java byte code; Program logic; Theorem proving

Indexed keywords

ABSTRACT INTERPRETATION; JAVA BYTE CODES; PROGRAM LOGICS; PROOF CARRYING CODE (PCC);

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; DATA FLOW ANALYSIS; FORMAL LOGIC; PROGRAM INTERPRETERS; SECURITY OF DATA; THEOREM PROVING;

CODES (SYMBOLS);

EID: 33749615715     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.08.012     Document Type: Article

References (28)

1. E. Albert, G. Puebla, M. Hermenegildo, Abstraction-carrying code, in: Proc. 11th Int. Conf. on Logic for Programming Artificial Intelligence and Reasoning (LPAR'04), Lecture Notes in Artificial Intelligence, Vol. 3452, Springer, Berlin, 2004, pp. 380-397.
2. Appel A.W. Foundational proof-carrying code. Proc. 16th IEEE Symp. on Logic in Computer Science (LICS '01) (2001), IEEE, London 247-258
3. Appel A.W., and Felty A.P. A semantic model of types and machine instructions for proof-carrying code. Proc. 27th ACM Symp. on Principles of Programming Languages (POPL'00) (2000), ACM, New York 243-253
4. D. Aspinall, S. Gilmore, M. Hofmann, D. Sannella, and I. Stark, Mobile resource guarantees for smart devices, in: Proc. of the Construction and Analysis of Safe, Secure, and Interoperable Smart Devices workshop (CASSIS'04), Lecture Notes in Computer Science, Vol. 3362, Springer, Berlin, 2005, pp. 1-26.
5. L. Beringer, M. Hofmann, A. Momigliano, and O. Shkaravska, Automatic certification of heap consumption, in: Proc. 11th Int. Conf. of Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004), Lecture Notes in Computer Science, Vol. 3452, Springer, Berlin, 2005, pp. 347-362.
6. F. Besson, T. Jensen, and D. Pichardie, A PCC architecture based on abstract interpretation, Technical Report RR-5751, INRIA, November 2005.
7. D. Cachera, T. Jensen, D. Pichardie, and V. Rusu. Extracting a data flow analyser in constructive logic, in: Proc. 13th European Symp. on Programming (ESOP'04), Lecture Notes in Computer Science, Vol. 2986, Springer, Berlin, 2004, pp. 385-400.
8. B.-Y. E. Chang, A. Chlipala, G.C. Necula, R.R. Schneck, The open verifier framework for foundational verifiers, in: G. Morrisett, M. Fähndrich (Eds.), Proc. Second Int. Workshop on Types in Languages Design and Implementation (TLDI'05), ACM, New York, 2005.
9. P. Cousot, The calculational design of a generic abstract interpreter, in: M. Broy, R. Steinbrüggen (Eds.), Calculational System Design, NATO ASI Series F, IOS Press, Amsterdam, 1999.
10. Cousot P., and Cousot R. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixpoints. Proc. Fourth ACM Symp. on Principles of Programming Languages (1977), ACM Press, New York 238-252
11. P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, X. Rival. The Astrée analyser, in: M. Sagiv (Ed.), Proc. 14th European Symp. on Programming (ESOP'05), Lecture Notes in Computer Science, Vol. 3444, Springer, Berlin, 2005, pp. 21-30.
12. Grégoire B., and Leroy X. A compiled implementation of strong reduction. ICFP '02: Proc. Seventh ACM SIGPLAN Int. Conf. on Functional Programming (2002), ACM Press, New York, NY, USA 235-246
13. Klein G., and Nipkow T. Verified bytecode verifiers. Theoret. Comput. Sci. 298 3 (2002) 583-626
14. Leroy X. Formal certification of a compiler back-end or: programming a compiler with a proof assistant. POPL '06: Conf. Record of the 33rd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (2006), ACM Press, New York, NY, USA 42-54
15. P. Letouzey, Programmation fonctionnelle certifiée-L'extraction de programmes dans l'assistant Coq, Ph.D. Thesis, Université Paris-Sud, July 2004.
16. Miné A. The octogon abstract domain. Proc. Eighth Working Conf. On Reverse Engineering (WCRE 01) (2001), IEEE, New York 310-320
17. Momigliano A., and Beringer L. Certification of resource consumption: from types to logic programming. Assoc. Logic Programming Newsletter 18 2 (2005)
18. Necula G.C. Proof-carrying code. Proc. 24th ACM Symp. on Principles of Programming Languages (POPL'97) (1997), ACM, New York 106-119
19. Necula G.C., and Lee P. Efficient representation and validation of proofs. Proc. 13th Annu. IEEE Symp. on Logic in Computer Science (LICS'98) (1998)
20. Necula G.C., and Rahul S.P. Oracle-based checking of untrusted software. Proc. 28th ACM Symp. on Principles of Programming Languages (POPL'01) (2001), ACM Press, New York 142-154
21. G.C. Necula, R.R. Schneck, A sound framework for untrusted verification-condition generators, in: Proc. 18th IEEE Symp. on Logic in Computer Science (LICS 2003), 2003, pp. 248-260.
22. D. Pichardie, Interprétation abstraite en logique intuitioniste : extraction d'analyseurs Java certifiés, Ph.D. Thesis, Université de Rennes 1, September 2005.
23. Rose E. Lightweight bytecode verification. J. Automat. Reason. 31 3-4 (2003) 303-334
24. E. Rose, K. Rose, Lightweight bytecode verification, in: Workshop "Formal Underpinnings of the Java Paradigm", OOPSLA'98, 1998.
25. The Coq Proof Assistant, 〈http://coq.inria.fr/〉.
26. M. Wildmoser, T. Nipkow, Asserting bytecode safety, in: Proc. 15th European Symp on Programming (ESOP'05), 2005.
27. Wildmoser M., Nipkow T., Klein G., and Nanz S. Prototyping proof carrying code. In: Levy J.-J., Mayr E.W., and Mitchell J.C. (Eds). Exploring New Frontiers of Theoretical Informatics, TC1 third Int. Conf. on Theoretical Computer Science (TCS2004) (2004), Kluwer, Dordrecht 333-347
28. Wu D., Appel A.W., and Stump A. Foundational proof checkers with small witnesses. Proc. Fifth ACM Inter. Conf. Principles and Practice of Declarative Programming (PPDP '03) (2003), ACM Press, New York 264-274