Automatic construction of Hoare proofs from abstract interpretation results

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

Volumn 2895, Issue , 2003, Pages 230-245

  Seo, Sunae ^a   Yang, Hongseok ^a   Yi, Kwangkeun ^b  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; FORMAL LOGIC; INTEGER PROGRAMMING; MODEL CHECKING; RECONFIGURABLE HARDWARE;

ABSTRACT INTERPRETATIONS; AUTOMATIC APPROACHES; AUTOMATIC CONSTRUCTION; CONSTRUCTION METHOD; FIRST ORDER LOGIC; IMPERATIVE LANGUAGES; PROGRAM PROPERTIES; PROOF-CARRYING CODE;

STATIC ANALYSIS;

EID: 0344152274     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40018-9_16     Document Type: Article

References (14)

1. A. W. Appel. Foundational proof-carrying code. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, pages 247-258, June 2001.
2. A. W. Appel and A. P. Felty. A semantic model of types and machine instructions for proof-carrying code. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 243-253, January 2000.
3. P. Cousot. The calculational design of a generic abstract interpreter. In M. Broy and R. Steinbrüggen, editors, Calculational System Design. NATO ASI Series F. IOS Press, Amsterdam, 1999.
4. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 238-252, January 1977.
5. P. Cousot and R. Cousot. Automatic synthesis of optimal invariant assertions: mathematical foundations. In ACM Symposium on Artificial Intelligence and Programming Languages, volume 12, pages 1-12, Rochester, NY, ACM SIGPLAN Notices, August 1977.
6. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 269-282, San Antonio, Texas, 1979. ACM Press, New York, NY.
7. N. Hamid, Z. Shao, V. Trifonov, S. Monnier, and Z. Ni. A syntactic approach to foundational proof-carrying code. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, pages 89-100, June 2002.
8. Nevin Heintze, Joxan Jaffar, and Razvan Voicu. A framework for combining analysis and verification. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 26-39, Boston, MA, USA, January 2000.
9. C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, 1969.
10. G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to typed assembly language. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 85-97, January 1998.
11. G. C. Necula. Proof-carrying code. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 106-119, January 1997.
12. G. C. Necula and P. Lee. Safe, untrusted agents using proof-carrying code. In Special Issue on Mobile Agent Security, volume 1419 of Lecture Notes in Computer Science, pages 61-91. Springer-Verlag, 1997.
13. G. C. Necula and S. P. Rahul. Oracle-based checking of untrusted software. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 142-154, January 2001.
14. G. C. Necula and R. Schneck. Proof-carrying code with untrusted proof rules. In Software Security - Theories and Systems, volume 2609 of Lecture Notes in Computer Science, pages 283-298. Springer-Verlag, November 2002.