Verification condition generation via theorem proving

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

Volumn 4246 LNAI, Issue , 2006, Pages 362-376

  Matthews, John ^a   Moore, J Strother ^b   Ray, Sandip ^b   Vroon, Daron ^c  

^a Galois Connections Inc   (United States)

^b University of Texas at Austin   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; THEOREM PROVING;

MACHINE-LEVEL PROGRAMS; VERIFICATION CONDITION GENERATOR (VCG);

MACHINE ORIENTED LANGUAGES;

EID: 33845190174     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11916277_25     Document Type: Conference Paper

References (43)

1. Boyer, R.S., Moore, J.S.: Mechanized Formal Reasoning about Programs and Computing Machines. In Veroff, R., ed.: Automated Reasoning and Its Applications: Essays in Honor of Larry Wos, MIT Press (1996) 141-176
2. Moore, J.S.: Proving Theorems about Java and the JVM with ACL2. In Broy, M., Pizka, M., eds.: Models, Algebras, and Logic of Engineering Software, Amsterdam, IOS Press (2003) 227-290
3. Floyd, R.: Assigning Meanings to Programs. In: Mathematical Aspects of Computer Science, Proceedings of Symposia in Applied Mathematcs. Volume XIX., Providence, Rhode Island, American Mathematical Society (1967) 19-32
4. Hoare, C.A.R.: An Axiomatic Basis for Computer Programming. Communications of the ACM 12 (1969) 576-583
5. Ray, S., Moore, J.S.: Proof Styles in Operational Semantics. In: FMCAD 2004. LNCS 3312, Springer-Verlag (2004) 67-81
6. Manna, Z.: The Correctness of Programs. JCSS 3 (1969) 119-127
7. Oheimb, D.v., Nipkow, T.: Machine-checking the Java Specification: Proving Type-Safety. In Alves-Foss, J., ed.: Formal Syntax and Semantics of Java. Volume 1523 of LNCS. Springer (1999) 119-156
8. Greve, D., Wilding, M., Hardin, D.: High-Speed, Analyzable Simulators. In Kaufmann, M., Manolios, P., Moore, J.S., eds.: Computer-Aided Reasoning: ACL2 Case Studies, Kluwer Academic Publishers (2000) 89-106
9. Shankar, N.: Machine-Assisted Verification Using Theorem Proving and Model Checking. In Broy, M., Schieder, B., eds.: Mathematical Methods in Program Development. Volume 158 of NATO ASI Series F: Computer and Systems Science. Springer (1997) 499-528
10. Colby, C., Lee, P., Necula, G.C., Blau, F., Plesko, M., Cline, K.: A Certifying Compiler for Java. In: ACM SIGPLAN 2000 conference on Programming language design and implementation. (2000) 95-107
11. Kaufmann, M., Manolios, P., Moore, J.S.: Computer-Aided Reasoning: An Approach, Kluwer Academic Publishers (2000)
12. Nipkow, T., Paulson, L., Wenzel, M.: Isabelle/HOL: A Proof Assistant for Higher Order Logics. Volume 2283 of LNCS. Springer-Verlag (2002)
13. Manolios, P., Moore, J.S.: Partial Functions in ACL2. Journal of Automated Reasoning 31 (2003) 107-127
14. Boyer, R.S., Goldshlag, D., Kaufmann, M., Moore, J.S.: Functional Instantiation in First Order Logic. In Lifschitz, V., ed.: Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, Academic Press (1991) 7-26
15. Moore, J.S.: Inductive Assertions and Operational Semantics. In Geist, D., ed.: CHARME 2003. Volume 2860 of LNCS., Springer-Verlag (2003) 289-303
16. Slind, K., Hurd, J.: Applications of polytypism in theorem proving. In Basin, D., Wolff, B., eds.: 16th International Conference on Theorem Proving in Higher Order Logics. LNCS 2978 (2003) 103-119
17. Toma, D., Borrione, D.: Formal verification of a SHA-1 circuit core using ACL2. In Hurd, J., Melham, T., eds.: TPHOLS 2005. Springer LNCS 3603 (2005) 326-341
18. Schneier, B.; Applied Cryptography (2nd ed.): Protocols, Algorithms, and Source Code in C. John Wiley & Sons, Inc. (1995)
19. McCarthy, J.: Towards a Mathematical Science of Computation. In: Proceedings of the Information Processing Congress. Volume 62., North-Holland (1962) 21-28
20. Yu, Y.: Automated Proofs of Object Code for a Widely Used Microprocessor. PhD thesis, University of Texas at Austin (1992)
21. Strecker, M.: Formal Verification of a Java Compiler in Isabelle. In Voronkov, A., ed.: CADE 2004. LNCS 2392, Springer-Verlag (2002) 63-77
22. Hamon, G., Rushby, J.: An Operational Semantics for Stateflow. In: FASE 2004. LNCS 2984, Springer-Verlag (2004) 229-243
23. Goldstein, H.H., J. von Neumann: Planning and Coding Problems for an Electronic Computing Instrument. In: John von Neumann, Collected Works, Volume V, Pergamon Press, Oxford (1961)
24. Turing, A.M.: Checking a Laxge Routine. In: Report of a Conference on High Speed Automatic Calculating Machine, University Mathematical Laboratory, Cambridge, England (1949) 67-69
25. Dijkstra, E.W.: Guarded Commands, Non-determinacy and a Calculus for Derivation of Programs. Communications of the ACM 18 (1975) 453-457
26. King, J.C.: A Program Verifier. PhD thesis, Carnegie-Melon University (1969)
27. Detlefs, D.L., Leino, K.R.M., Nelson, G., Saxe, J.B.: Extended Static Checking for Java, Technical Report 159, Compaq Systems Research Center (1998)
28. King, S., Hammond, J., Chapman, R., Pryor, A.: Is Proof More Cost-Effective Than Testing? IEEE Transactions on Software Engineering 28 (2000) 675-686
29. Flanagan, C., Saxe, J.B.: Avoiding Exponential Explosion: Generating Compact Verification Conditions. In: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages. (2001) 193-205
30. Leino, K.R.M.: Efficient weakest preconditions. Inf. Process. Lett. 93 (2005) 281-288
31. Homeier, P., Martin, D.: A Mechanically Verified Verification Condition Generator. The Computer Journal 38 (1995) 131-141
32. Gloess, P.Y.: Imperative Program Verification in PVS. Technical report, École Nationale Supérieure Électronique, Informatique et Radiocommunications de bordeaux (1999)
33. Schirmer, N.: A verification environment for sequential imperative programs in Isabelle/HOL. In Baader, P., Voronkov, A., eds.: LPAR 2004. Volume 3452 of LNAL, Springer (2005) 398-414
34. Norrish, M.: C Formalised in HOL. PhD thesis, University of Cambridge (1998)
35. M.ehta, F., Nipkow, T.: Proving Pointer Programs in Higher Order Logic. In Baader, F., ed.: CADE 2003. LNAI 2741, Springer-Verlag (2003) 121-135
36. Ortner, V., Schirmer, N.: Verification of bdd normalization. In Hurd, J., Melham, T., eds.: TPHOLS 2005. Springer LNCS 3603 (2005) 261-277
37. Matthews, J., Vroon, D.: Partial Clock Functions in ACL2. In Kaufmann, M., Moore, J.S., eds.: 5th ACL2 Workshop. (2004)
38. Necula, G.C.: Proof-Carrying Code. (In: POPL 1997) 106-119
39. Appel, A.W.: Foundational Proof-Carrying Code. In: LICS 2001. (2001) 247-258
40. Greve, D., Richards, R., Wilding, M.: A Summary of Intrinsic Partitioning Verification, In Kaufmann, M., Moore, J.S., eds.: 5th ACL2 Workshop. (2004)
41. Hardin, D., Smith, E.W., Young, W.D.: A Robust Machine Code Proof Framework for Highly Secure Applications. In Manolios, P., Wilding, M., eds.: 6th ACL2 Workshop. (2006)
42. Hunt Jr., W.A., Kaufmann, M., Krug, R.B., Moore, J.S., Smith, E.W.: Meta Reasoning in ACL2. In Hurd, J., Melham, T., eds.: TPHOLS 2005. Springer LNCS 3603 (2005) 373-384
43. Pike, L., Shields, M., Matthews, J.: A Verifying Core for a Cryptographic Language Compiler. In Manolios, P., Wilding, M., eds.: 6th ACL2 Workshop. (2006)