Using SMT solvers to verify high-integrity programs

AFM'07: 2nd Workshop on Automated Formal Methods

Volumn , Issue , 2007, Pages 60-68

  Jackson, Paul B ^a   Ellis, Bill J ^b   Sharp, Kathleen ^c  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b HERIOT WATT UNIVERSITY   (United Kingdom)

^c IBM   (United Kingdom)

Author keywords

Ada; SAT modulo theories solver; SMT solver; SPARK

Indexed keywords

FORMAL VERIFICATIONS; HIGH-INTEGRITY SYSTEMS; LOOP INVARIANTS; MODULO THEORIES; NON-LINEAR; NONLINEAR PROBLEMS; SECURITY INDUSTRY; THEOREM PROVERS; UK COMPANIES; VERIFICATION CONDITION;

ATOMIC FORCE MICROSCOPY; FORMAL LOGIC; FORMAL METHODS;

ELECTRIC SPARKS;

EID: 77954589699     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1345169.1345177     Document Type: Conference Paper

References (33)

1. CVC3: an automatic theorem prover for Satisfiability Modulo Theories (SMT). Homepage at http://www.cs.nyu.edu/acsys/cvc3/.
2. ESC/Java2: Extended Static Checker for Java version 2. Development coordinated by KindSoftware at University College Dublin. Homepage at http: //secure.ucd.ie/products/opensource/ESCJava2/.
3. B. Akbarpour and L. C. Paulson. Towards automatic proofs of inequalities involving elementary functions. In PDPAR: Workshop on Pragmatics of Decision Procedures in Automated Reasoning, 2006.
4. T. Ball, B. Cook, V. Levin, and S. K. Rajamani. SLAM and Static Driver Verifier: technology transfer of formal methods inside Microsoft. Technical Report MSR-TR-2004-08, Microsoft Research, 2004. The SDV homepage is http://www.microsoft.com/whdc/ devtools/tools/sdv.mspx.
5. J. Barnes. High Integrity Software: The SPARK approach to safety and security. Addison Wesley, 2003.
6. M. Barnett, K. R. M. Leino, and W. Schulte. The Spec# programming system: An overview. In Post workshop proceedings of CASSIS: Construction and Analysis of Safe, Secure and Interoperable Smart devices, volume 3362 of Lecture Notes in Computer Science. Springer, 2004.
7. S. Bensalem and Y. Lakhnech. Automatic generation of invariants. Formal Methods in System Design, 15:75-92, 1999.
8. E. Denney, B. Fischer, and J. Schumann. An empirical evaluation of automated theorem provers in software certification. International Journal of AI tools, 15(1):81-107, 2006. (Pubitemid 44099599)
9. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: a theorem prover for proof checking. Journal of the ACM, 52(3):365-473, 2005.
10. B. Dutertre and L. de Moura. The Yices SMT solver. Tool paper at http://yices.csl.sri.com/tool-paper.pdf, August 2006.
11. C. Flanagan and K. R. M. Leino. Houdini, an annotation assistant for ESC/Java. In FME: International Symposium of Formal Methods Europe, volume 2021 of Lecture Notes in Computer Science, pages 500-517. Springer, 2001.
12. C. Flanagan and S. Qadeer. Predicate abstraction for software verification. In POPL: Principles of Programming Languages, pages 191-202. ACM, 2002.
13. H. Ganzinger and K. Korovin. New directions in instantiation-based theorem proving. In LICS: Logic in Computer Science, pages 55-64. IEEE, 2003.
14. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV: Computer Aided Verification, volume 1254 of Lecture Notes in Computer Science, pages 72-83. Springer, 1997.
15. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Software verification with BLAST. In SPIN: workshop on model checking software, volume 2648 of Lecture Notes in Computer Science, pages 235-239. Springer, 2003.
16. H. Hong and C. Brown. QEPCAD: Quantifier elimination by partial cylindrical algebraic decomposition, 2004. See http://www.cs.usna.edu/~qepcad/B/ QEPCAD.html for current implementation.
17. W. A. Hunt, Jr., R. B. Krug, and J. Moore. Linear and nonlinear arithmetic in ACL2. In CHARME: Correct Hardware Design and Verification Methods, volume 2860 of Lecture Notes in Computer Science, pages 319-333. Springer, 2003.
18. A. Ireland, B. Ellis, A. Cook, R. Chapman, and J. Barnes. An integrated approach to high integrity software verification. Journal of Automated Reasoning, 36(4):379-410, 2006. (Pubitemid 46046676)
19. L. I. Kovács and T. Jebelean. An algorithm for automated generation of invariants for loops with conditionals. In SYNASC: Symbolic and Numeric Algorithms for Scientific Computing. IEEE, 2005.
20. K. R. M. Leino and F. Logozzo. Loop invariants on demand. In APLAS: Programming Languages and Systems, Third Asian Symposium, volume 3780 of Lecture Notes in Computer Science, pages 119-134. Springer, 2005.
21. K. R. M. Leino, J. Saxe, C. Flanagan, J. Kiniry, et al. The logics and calculi of ESC/Java2, revision 1.10. Technical report, University College Dublin, November 2004. Available from the documentation section of the ESC/Java2 web pages.
22. K. L. McMillan. Lazy abstraction with interpolants. In CAV: Computer Aided Verification, volume 4144 of Lecture Notes in Computer Science, pages 123-136. Springer, 2006.
23. T. F. Melham. PROSPER: an investigation into software architecture for embedded proof engines. In FRoCoS: Frontiers of Combining Systems, volume 2309 of Lecture Notes in Artificial Intelligence, pages 193-206. Springer, 2002.
24. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Trans. on programming Languages and Systems, 1(2):245-257, 1979.
25. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of Lecture Notes in Computer Science. Springer, 2002. See http://www.cl.cam.ac.uk/research/hvg/Isabelle/ for current information.
26. P. A. Parrilo. Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming, 96(2):293-320, 2003.
27. J. Rushby. Harnessing disruptive innovation in formal verification. In SEFM: Software Engineering and Formal Methods. IEEE, 2006.
28. S. Sankaranarayanan, H. B. Sipma, and Z. Manna. Non-linear loop invariant generation using Gröbner bases. In POPL: Principles of Programming Languages, pages 318-329. ACM, 2004.
29. C.-J. Seger, R. B. Jones, J. W. O'Leary, T. Melham, M. D. Aagaard, C. Barrett, and D. Syme. An industrially effective environment for formal hardware verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 24(9):1381-1405, 2005.
30. A. Tiwari. An algebraic approach for the unsatisfiability of nonlinear constraints. In CSL: Computer Science Logic, volume 3634 of Lecture Notes in Computer Science, pages 248-262. Springer, 2005.
31. A. Tiwari, H. Rueß, H. Saïdi, and N. Shankar. A technique for invariant generation. In TACAS: tools and algorithms for the construction and analysis of systems, volume 2031 of Lecture Notes in Computer Science, pages 113-127. Springer, 2001.
32. B. Wegbreit. The synthesis of loop predicates. Communications of the ACM, 17(2), 1974.
33. L. Zhang and S. Malik. The quest for efficient boolean satisfiability solvers. In CAV: Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, pages 17-36. Springer, 2002.