Reasoning about comprehensions with first-order SMT solvers

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2009, Pages 615-622

  Leino, K Rustan M ^a   Monahan, Rosemary ^b  

^a MICROSOFT RESEARCH   (United States)

^b NATIONAL UNIVERSITY OF IRELAND   (Ireland)

Author keywords

Matching triggers; Quantifiers; SMT solvers; Spec

Indexed keywords

AXIOMATISATION; BOUND VARIABLES; DIJKSTRA; FIRST-ORDER; PROGRAM VERIFIERS; VERIFICATION CONDITION;

COMPUTER SCIENCE;

EID: 72949104681     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1529282.1529411     Document Type: Conference Paper

References (13)

1. A. Banerjee, M. Barnett, and D. A. Naumann. Boogie meets regions: A verification experience report. In Natarajan Shankar and Jim Woodcock, editors, Verified Software: Theories, Tools, Experiments, VSTTE 2008, volume 5295 of Lecture Notes in Computer Science, pages 177-191. Springer, October 2008.
2. M. Barnett, B.-Y. E. Chang, R. DeLine, B. Jacobs, and K. R. M. Leino. Boogie: A modular reusable verifier for object-oriented programs. In F. S. de Boer, M. M. Bonsangue, S. Graf, and W. de Roever, editors, FMCO 2005, volume 4111 of Lecture Notes in Computer Science, pages 364-387. Springer, September 2006.
3. M. Barnett, K. R. M. Leino, and W. Schulte. The Spec# programming system: An overview. In G. Barthe, L. Burdy, M. Huisman, J. Lanet, and T. Muntean, editors, CASSIS 2004, volume 3362 of Lecture Notes in Computer Science, pages 49-69. Springer, 2005.
4. G. Carter, R. Monahan, and J. M. Morris. Software refinement with Perfect Developer. In B. K. Aichernig and B. Beckert, editors, SEFM 2005, pages 363-373. IEEE Computer Society, September 2005.
5. D. Crocker and J. Carlton. A high productivity tool for formally verified software development. Technical report, Escher Technologies, September 2004. http://www.eschertech.com/papers/pdpaper.pdf.
6. L. de Moura and N. Bjørner. E cient E-matching for SMT solvers. In F. Pfenning, editor, CADE-21, volume 4603 of Lecture Notes in Computer Science, pages 183-198. Springer, July 2007.
7. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: a theorem prover for program checking. Journal of the ACM, 52(3):365-473, May 2005.
8. E. W. Dijkstra and W. H. J. Feijen. A method of programming. Addison-Wesley, July 1988.
9. K. R. M. Leino and R. Monahan. Automatic verification of textbook programs that use comprehensions. 9th Workshop on Formal Techniques for Java-like Programs, FTfJP 2007, 2007.
10. S. Lerner, T. Millstein, and C. Chambers. Automatically proving the correctness of compiler optimizations. In PLDI 2003, pages 220-231. ACM Press, 2003.
11. J. Meng and L. C. Paulson. Translating higher-order problems to first-order clauses. In G. Sutcliffe, R. Schmidt, and S. Schulz, editors, ESCoR 2006: Empirically Successful Computerized Reasoning, volume 192 of CEUR Workshop Proceedings, pages 70{80. http://ceur-ws.org, 2006.
12. G. Nelson. Techniques for program verification. Technical Report CSL-81-10, Xerox PARC, June 1981. The author's PhD thesis.
13. 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.