Simplify: A theorem prover for program checking

Journal of the ACM

Volumn 52, Issue 3, 2005, Pages 365-473

  Detlefs, David ^a,b   Nelson, Greg ^a,c   Saxe, James B ^a,c  

^a HEWLETT PACKARD COMPANY   (United States)

^b SUN MICROSYSTEMS   (United States)

^c HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Decision procedures; Program checking; Theorem proving

Indexed keywords

DECISION PROCEDURES; PROGRAM CHECKING;

FORMAL LANGUAGES; JAVA PROGRAMMING LANGUAGE; SOFTWARE ENGINEERING; SPECIFICATIONS; THEOREM PROVING;

COMPUTER SOFTWARE;

EID: 24944448541     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1066100.1066102     Document Type: Article

References (66)

1. AGESEN, O., DETLEFS, D. L., FLOOD, C. H., GARTHWATTE, A. T., MARTIN, P. A., SHAVIT, N. N., AND STEEL, JR., G. L. 2000. Dcas-based concurrent deques. In ACM Symposium on Parallel Algorithms and Architectures. 137-146.
2. AHRENDT, W., BAAR, T., BECKERT, B., BUBEL, R., GIESE, M., HÄHNLE, R., MENZEL, W., MOSTOWSKI, W., ROTH, A., SCHLAGER, S., AND SCHMITT, P. H. 2003. The KeY tool. Technical report in computing science no. 2003-5, Department of Computing Science, Chalmers University and Göteborg University, Göteborg, Sweden. February.
3. BADROS, G. J., BURNING, A., AND STUCKEY, P. J. 2001. The Cassowary linear arithmetic constraint solving algorithm. ACM Transactions on Computer-Human Interaction 8, 4 (Dec.), 267-306.
4. BALL, T., MAJUMDAR, R., MILLSTEIN, T. D., AND RAJAMANI, S. K. 2001. Automatic predicate abstraction of C programs. In SIGPLAN Conference on Programming Language Design and Implementation. Snowbird, Utah. 203-213.
5. BARRETT, C. W. 2002. Checking validity of quantifier-free formulas in combinations of first-order theories. Ph.D. thesis, Department of Computer Science, Stanford University, Stanford, CA. Available at http://verify.Stanford.edu/barrett/thesis.ps.
6. BARRETT, C. W., DILL, D. L., AND LEVITT, J. 1996. Validity checking for combinations of theories with equality. In Proceedings of Formal Methods In Computer-Aided Design. 187-201.
7. BARRETT, C. W., DILL, D. L., AND LEVITT, J. R. 1998. A decision procedure for bit-vector arithmetic. In Proceedings of the 35th Design Automation Conference. San Francisco, CA.
8. BARRETT, C. W., DILL, D. L., AND STUMP, A. 2002a. Checking satisfiability of first-order formulas by incremental translation to SAT. In Proceedings of the 14th International Conference on Computer-Aided Verification, E. Brinksma and K. G. Larsen, Eds. Number 2404 in Lecture Notes in Computer Science. Springer-Verlag. Copenhagen.
9. BARRETT, C. W., DILL, D. L., AND STUMP, A. 2002b. A generalization of Shostak's method for combining decision procedures. In Frontiers of Combining Systems (FROCOS). Lecture Notes in Artificial Intelligence. Springer-Verlag. Santa Margherita di Ligure, Italy.
10. BIBEL, W., AND EDER, E. 1993. Methods and calculi for deduction. In Handbook of Logic in Artificial Intelligence and Logic Programming - Vol 1: Logical Foundations., D. M. Gabbay, C. J. Hogger, and J. A. Robinson, Eds. Clarendon Press, Oxford, 67-182.
11. CHVATAL, V. 1983. Linear Programming. W H Freeman & Co.
12. CONCHON, S., AND KRSTIĆ, S. 2003. Strategies for combining decision procedures. In Proceedings of the 9th International Conferences on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03). Lecture Notes in Computer Science, vol. 2619. Springer Verlag, 537-553.
13. CROCKER, S. 1988. Comparison of Shostak's and Oppen's solvers. Unpublished manuscript.
14. DANTZIG, G. B. 1963. Linear Programming and Extensions. Princeton University Press, Princeton, NJ.
15. DE MOURA, L., AND RUESS, H. 2002. Lemmas on demand for satisfiability solvers. In Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing.
16. DE MOURA, L. M., AND RUESS, H. 2004. An experimental evaluation of ground decision procedures. In Proceedings of the 16th International Conference on Computer Aided Verification (CAV), R. Alur and D. A. Peled, Eds. Lecture Notes in Computer Science, vol. 3114. Springer, 162-174.
17. See http://www.csl.sri.com/users/demoura/gdp-benchmairks.html for benchmarks and additional results.
18. DETLEFS, D., AND MOIR, M. 2000. Mechanical proofs of correctness for dcas-based concurrent deques. Available at http: //research.sun.com/jtech/pubs/00-dequel-proof.html.
19. DETLEFS, D., NELSON, G., AND SAXE, J. B. 2003a. Simplify benchmarks. Available at http: //www. hpl.hp.com/research/src/esc/simplify_benchmarks.tar.gz. These benchmarks are also available in the appendix to the online version of this article, available via the ACM Digital Library.
20. DETLEFS, D., NELSON, G., AND SAXE, J. B. 2003b. Simplify source code. Available at http://www. research.compaq.com/downloads. html as part of the Java Programming Toolkit Source Release.
21. DETLEFS, D. L., LEINO, K. R. M., NELSON, G., AND SAXE, J. B. 1998. Extended static checking. Research Report 159, Compaq Systems Research Center, Palo Alto, USA. December. Available at http://www.hpl.hp.com/techreports/Compaq-DEC/SRC-RR-159.html.
22. DOWNEY, P. J., SETHI, R., AND TARJAN, R. E. 1980. Variations on the common subexpression problem. JACM 27, 4 (Oct.), 758-771.
23. FLANAGAN, C., JOSHI, R., Ou, X., AND SAXE, J. B. 2003. Theorem proving using lazy proof explication. In Proceedings of the 15th International Conference on Computer Aided Verification. 355-367.
24. FLANAGAN, C., LEINO, K. R. M., LILLIBRJDGE, M., NELSON, G., SAXE, J. B., AND STATA, R. 2002. Extended static checking for Java. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming language Design and Implementation (PLDI' 02). Berlin, 234-245.
25. GALLER, B. A., AND FISCHER, M. J. 1964. An improved equivalence algorithm. CACM 7, 5, 301-303.
26. GANZINGER, H. 2002. Shostak light. In Proceedings 18th International Conference on Automated Deduction (CADE 18), A. Voronkov, Ed. Lecture Notes in Computer Science, vol. 2392. Springer, Copenhagen, 332-346.
27. GANZINGER, H., RUESS, H., AND SHANKAR, N. 2004. Modularity and refinement in inference systems. CSL Technical Report CSL-SRI-04-02, SRI. Dec. Available at ftp://ftp.csl.sri.com/ pub/users/shankar/modularity.ps.gz.
28. GUERRA E SILVA, L., MARQUES-SILVA, J., AND SILVEIRA, L. M. 1999. Algorithms for solving boolean satisfiability in combinational circuits. In Proceedings of the IEEE/ACM Design, Automation and Test in Europe Conference (DATE). Munich, 526-530.
29. GULWANI, S., AND NECULA, G. C. 2003. A randomized satisfiability procedure for arithmetic and uninterpreted function symbols. In 19th International Conference on Automated Deduction. LNCS, vol. 2741. Springer-Verlag, 167-181.
30. JOSHI, R., NELSON, G., AND RANDALL, K. 2002. Denali: A goal-directed superoptimizer. In Proceedings of the ACM 2002 Conference on Programming Language Design and Implementation. Berlin, 304-314.
31. KNUTH, D. E. 1968. The Art of Computer Programming-Vol. 1 Fundamental Algorithms. Addison Wesley, Reading, MA. 2nd ed. 1973.
32. KNUTH, D. E., AND SCHÖNHAGE, A. 1978. The expected linearity of a simple equivalence algorithm. Theoretical Computer Science 6, 3 (June), 281-315.
33. KOZEN, D. 1977. Complexity of finitely presented algebras. In Proceedings Ninth STOC. 164-177.
34. KRSTIĆ, S., AND CONCHON, S. 2003. Canonization for disjoint unions of theories. In Proceedings of the 19th International Conference on Automated Deduction (CADE-19), F. Baader, Ed. Lecture Notes in Computer Science, vol. 2741. Springer Verlag.
35. LISKOV, B., ATKINSON, R., BLOOM, T., Moss, J. E. B., SCHAFFERT, C., SCHEIfIER, R., AND SNYDER, A. 1981. CLU Reference Manual. Lecture Notes in Computer Science, vol. 114. Springer-Verlag, Berlin.
36. LOVELAND, D. W. 1978. Automated Theorem Proving: A Logical Basis. Elsevier Science.
37. MARCUS, L. 1981. A comparison of two simplifiers. Microver Note 94, SRI. January.
38. MARRIOTT, K., AND STUCKEY, P. J. 1998. Programming with Constraints: An Introduction. MIT Press, Cambridge, MA.
39. MCCARTHY, J. 1963. Towards a mathematical science of computation. In Information Processing: The 1962 IFIP Congress. 21-28.
40. MILLSTEIN, T. 1999. Toward more informative ESC/Java warning messages. In Compaq SRC Technical Note 1999-003. Available at http://www.hpl.hp.com/techreports/Compaq-DEC/ SRC-TN-1999-003.html.
41. MOSKEWICZ, M. W., MADIGAN, C. F., ZHAO, Y., ZHANG, L., AND MALIK, S. 2001. Chaff: Engineering an efficient SAT solver. In Proceedings of the 39th Design Automation Conference.
42. NECULA, G. C. 1998. Compiling with Proofs. Ph.D. thesis, Carnegie-Mellon University.
43. Also available as CMU Computer Science Technical Report CMU-CS-98-154.
44. NECULA, G. C., AND LEE, P. 2000. Proof generation in the Touchstone theorem prover. In Proceedings of the 17th International Conference on Automated Deduction. 25-44.
45. NELSON, C. G. 1979. Techniques for program verification. Ph.D. thesis, Stanford University. A revised version of this thesis was published as a Xerox PARC Computer Science Laboratory Research Report [Nelson 1981].
46. NELSON, G. 1981. Techniques for program verification. Technical Report CSL-81-10, Xerox PARC Computer Science Laboratory. June.
47. NELSON, G. 1983. Combining satisfiability procedures by equality-sharing. In Automatic Theorem Proving: After 25 Years, W. W. Bledsoe and D. W. Loveland, Eds. American Mathematical Society, 201-211.
48. NELSON, G., AND OPPEN, D. C. 1979. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1, 2 (Oct.), 245-257.
49. NELSON, G., AND OPPEN, D. C. 1980. Fast decision procedures based on congruence closure. JACM 27, 2 (April), 356-364.
50. OWRE, S., RUSHBY, J. M., AND SHANKAR, N. 1992. PVS: A prototype verification system. In 11h International Conference on Automated Deduction (CADE), D. Kapur, Ed. Lecture Notes in Artificial Intelligence, vol. 607. Springer-Verlag, Saratoga, NY, 748-752. Available at http://www.csl.sri.com/papers/cade92-pvs/.
51. RABIN, M. O. 1981. Fingerprinting by random polynomials. Technical Report TR-15-81, Center for Research in Computing Technology, Harvard University.
52. RUESS, H., AND SHANKAR, N. 2001. Deconstructing Shostak. In Proceedings of the LICS 2001. 10-28.
53. SCHMITT, P. H. 2003. Personal communication (email message to Greg Nelson).
54. SHANKAR, N. 2003. Personal communication (email message to James B. Saxe).
55. SHANKAR, N., AND RUESS, H. 2002. Combining Shostak theories. Invited paper for Floc'02/RTA'02. Available at ftp://ftp.csl.sri.com/pub/users/shankar/rta02.ps.
56. SHOSTAK, R. E. 1979. A practical decision procedure for arithmetic with function symbols. JACM 26, 2 (April), 351-360.
57. SHOSTAK, R. E. 1984. Deciding combinations of theories. JACM 31, 1, 1-12.
58. See also [Barrett et al. 2002b; Ruess and Shankar 2001].
59. SILVA, J. M., AND SAKALLAH, K. A. 1999. GRASP: A search algorithm for propositionsal satisfiability. IEEE Transactions on Computers 48, 5 (May), 506-521.
60. STALLMAN, R. M., AND SUSSMAN, G. J. 1977. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence 9, 2 (Oct.), 135-196.
61. STUCKEY, P. J. 1991. Incremental linear constraint solving and detection of implicit equalities. ORSA Journal on Computing 3, 4, 269-274.
62. STUMP, A., BARRETT, C., DILL, D., AND LEVITT, J. 2001. A decision procedure for an extensional theory of arrays. In 16th IEEE Symposium on Logic in Computer Science. IEEE Computer Society, 29-37.
63. TARJAN, R. E. 1975. Efficiency of a good but not linear set union algorithm. JACM 22, 2, 215-225.
64. TINELLI, C., AND HARANDI, M. T. 1996. A new correctness proof of the Nelson-Oppen combination procedure, In Frontiers of Combining Systems: Proceedings of the 1st International Workshop, F. Baader and K. U. Schulz, Eds. Kluwer Academic Publishers, Munich, 103-120.
65. YAO, A. 1976. On the average behavior of set merging algorithms. In 8th ACM Symposium on the Theory of Computation. 192-195.
66. ZHANG, H. 1997. SATO: An efficient propositional prover. In Proceedings of the 14th International Conference on Automated Deduction. 272-275.