New results on rewrite-based satisfiability procedures

ACM Transactions on Computational Logic

Volumn 10, Issue 1, 2008, Pages

  Armando, Alessandro ^a   Bonacina, Maria Paola ^b   Ranise, Silvio ^c   Schulz, Stephan ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF VERONA   (Italy)

^c LORIA   (France)

Author keywords

Automated reasoning; Combination of theories; Decision procedures; Inference; Rewriting; Satisfiability modulo a theory; Scalability; Superposition; Termination

Indexed keywords

AUTOMATED REASONING; COMBINATION OF THEORIES; DECISION PROCEDURES; INFERENCE; REWRITING; SATISFIABILITY MODULO A THEORY; SUPERPOSITION; TERMINATION;

AUTOMATA THEORY; DATA STRUCTURES; FORMAL LOGIC; PROBLEM SOLVING; PROGRAMMING THEORY; SCALABILITY; THEOREM PROVING;

DECISION THEORY;

EID: 59449090380     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1459010.1459014     Document Type: Article

References (91)

1. ARKOUDAS, K., ZEE, K., KUNCAK, V., AND RINARD, M. 2004. Verifying a file system implementation. In Proceedings of the 6th International Conference on Formal Engineering Methods. J. Davies, W. Schulte, and M. Barnett, Eds. Lecture Notes in Computer Science, vol. 3308. Springer-Verlag, Berlin, Germany, 373-390.
2. ARMANDO, A., BONACINA, M. P., RANISE, S., RUSINOWITCH, M., AND SEHGAL, A. K. 2002. High-performance deduction for verification: A case study in the theory of arrays. InNotes 2nd VERIFY Workshop, FLoC. Tech. rep. 07/2002 DIKU, University of Copenhagen, Copenhagen, Denmark, 103-112.
3. ARMANDO, A., BONACINA, M. P., RANISE, S., AND SCHULZ, S. 2005a. Big proof engines as little proof engines: New results on rewrite-based satisfiability procedures. In Notes 3rd PDPAR Workshop, CAV-17. 33-41.
4. ARMANDO, A., BONACINA, M. P., RANISE, S., AND SCHULZ, S. 2005b. On a rewriting approach to satisfiability procedures: extension, combination of theories and an experimental appraisal. In Proceedings of the 5th International Workshop on Frontiers of Combining Systems. B. Gramlich, Ed. Lecture Notes in Artificial Intelligence, vol. 3717. Springer-Verlag, Berlin, Germany, 65-80.
5. ARMANDO, A., RANISE, S., AND RUSINOWITCH, M. 2003. A rewriting approach to satisfiability procedures. Inform. Computat. 183, 2, 140-164.
6. BAADER, F. AND GHILARDI, S. 2005. Connecting many-sorted structures and theories through adjoint functions. In Proceedings of the 5th International Workshop on Frontiers of Combining Systems. B. Gramlich, Ed. Lecture Notes in Artificial Intelligence, vol. 3717. Springer-Verlag, Berlin, Germany, 31-47.
7. BACHMAIR, L., TIWARI, A., AND VIGNERON, L. 2003. Abstract congruence closure. J. Automat. Rea,son. 31, 2, 129-168.
8. BARRETT, C. W. AND BEREZIN, S. 2004. CVC lite: A new implementation of the cooperating validity checker. In Proceedings of the 16th International Conference on Computer-Aided Verification. R. Alur and D. A. Peled, Eds. Lecture Notes in Computer Science, vol. 3114. Springer-Verlag, Berlin, Germany, 515-518.
9. BARRETT, C. W., DILL, D. L., AND STUMP, A. 2000. A framework for cooperating decision procedures. In Proceedings of the CADE-17, D. McAllester, Ed. Lecture Notes in Artificial Intelligence, vol. 1831. Springer-Verlag, Berlin, Germany, 79-97.
10. 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, K. G. Larsen and E. Brinksma, Eds. Lecture Notes in Computer Science, vol. 2404. Springer-Verlag, Berlin, Germany, 236-249.
11. BARRETT, C. W., DILL, D. L., AND STUMP, A. 2002b. A generalization of Shostak's method for combining decision procedures. In Proceedings of the 4th International Workshop on Frontiers of Combining Systems, A. Armando, Ed. Lecture Notes in Computer Science, vol. 2309. Springer-Verlag, Berlin, Germany.
12. BONACINA, M. R 1999. A taxonomy of theorem-proving strategies. In Artificial Intelligence Today-Recent Trends and, Developments, M. J. Wooldridge and M. Veloso, Eds. Lecture Notes in Artificial Intelligence, vol. 1600. Springer-Verlag, Berlin, Germany, 43-84.
13. BONACINA, M. P. AND DERSHOWITZ, N. 2007. Abstract canonical inference. ACM Trans. Computat. Logic 8, 1 (January), 180-208.
14. BONACINA, M. R AND ECHENIM, M. 2007a. Rewrite-based decision procedures. In Proceedings of the 6th STRATEGIES Workshop, FLoC 2006, M. Archer, T Boy de la Tour, and C. Munoz, Eds. ENTCS, vol. 174(11). Elsevier, Amsterdam, The Netherlands, 27-45.
15. BONACINA, M. P. AND ECHENIM, M. 2007b. Rewrite-based satisfiability procedures for recursive data structures. In Proceedings of the 4th PDPAR Workshop, 4th FLoC, August 2006, B. Cook and R. Sebastiani, Eds. ENTCS, vol. 174(8). Elsevier, Amsterdam, The Netherlands, 55-70.
16. BONACINA, M. P., GHILARDI, S., NICOLINI, E., RANISE, S., AND ZUCCHELLI, D. 2006. Decidability and un decidability results for Nelson-Oppen and rewrite-based decision procedures. In Proceedings of the IJCAR-3, U. Furbach and N. Shankar, Eds. Lecture Notes in Artificial Intelligence, vol. 4130. Springer-Verlag, Berlin, Germany, 513-527.
17. BONACINA, M. P. AND HSIANG, J. 1995. Towards a foundation of completion procedures as semidecision procedures. Theoret. Comput. Sci. 146, 199-242.
18. BOZZANO, M., BRUTTOMESSO, R., CIMATTI, A., JUNTTILA, T., RANISE, S., SEBASTIANI, R., AND VAN ROSSUM, P. 2005a. Efficient satisfiability modulo theories via delayed theory combination. In Proceedings of the 17th International Conference in Computer-Aided Verification, K. Etessami and S. Rajamani, Eds. Lecture Notes in Computer Science, vol. 3576. Springer-Verlag, Berlin, Germany, 335-349.
19. BOZZANO, M., BRUTTOMESSO, R., CIMATTI, A., JUNTTILA, T., VAN ROSSUM, P., SCHULZ, S., AND SEBASTIANI, R. 2005b. MathSAT: Tight integration of SAT and mathematical decision procedures. J. Automat. Reason. 35, 1-3 (Oct.), 265-293.
20. BRYANT, R. E., LAHIRI, S. K., AND SESHIA, S. A. 2002. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In Proceedings of the 14th International, Conference in, Computer-Aided, Verification, K. G. Larsen and E. Brinksma, Eds. Lecture Notes in Computer Science, vol. 2404. Springer-Verlag, Berlin, Germany, 78-92.
21. BRYANT, R. E. AND VELEV, M. N. 2001. Processor verification using efficient reductions of the logic of uninterpreted functions to prepositional logic. ACM Trans. Computat. Logic 2, 1, 93-134.
22. CAFERRA, R., LEITSCH, A., AND PELTIER, N. 2004. Automated Model Building. Kluwer Academic Publishers.
23. CHANG, C.-L. AND LEE, R. C.-T. 1973. Symbolic Logic and Mechanical Theorem Proving. Academic Press.
24. CONCHON, S. AND KRSTIĆ, S. 2003. Strategies for combining decision procedures. In Proceedings of the International Conference on Tools and Algorithms for Constitution and Analysis of Systems, H. Garavel and J. Hatcliff, Eds. Lecture Notes in Computer Science, vol. 2619. Springer-Verlag, Berlin, Germany, 537-553.
25. CYRLUK, D., LINCOLN, P., AND SHANKAR, N. 1996. On Shostak's decision procedure for combination of theories. In Proceedings of the 13th International Conference on Automated Deduction, M. A. McRobbie and J. K. Slaney, Eds. Lecture Notes in Artificial Intelligence, vol. 1104. Springer-Verlag, Berlin, Germany, 463-477.
26. CYRLUK, D., MÖLLER, O., AND RUESS, H. 1996. An efficient decision procedure for a theory of fixedsized bitvectors with composition and extraction. Tech. Rep. UIB96-08, Fakultät für Informatik, Universität Ulm, Ulm, Germany.
27. DE MOURA, L., OWRE, S., RUESS, H., RUSHBY, J., AND SHANKAR, N. 2004. The ICS decision procedures for embedded deduction. In Proceedings of the 2nd International Joint Conference on Automated Reasoning, D. Basin and M. Rusinowitch, Eds. Lecture Notes in Artificial Intelligence, vol. 3097. Springer-Verlag, Berlin, Germany, 218-222.
28. DE MOURA, L., RUESS, H., AND SOREA, M. 2002. Lazy theorem proving for bounded model checking over infinite domains. In Proceedings of the 18th International Conference on Automated Deduction, A. Voronkov, Ed. Lecture Notes in Artificial Intelligence, vol. 2392. Springer-Verlag, Berlin, Germany, 438-455.
29. DÉHARBE, D. AND RANISE, S. 2003. Light-weight theorem proving for debugging and verifying units of code. In Proceedings SEFM03. IEEE Computer Society Press, Los Alamitos, CA.
30. DERSHOWITZ, N. 1991. A maximal-literal unit strategy for Horn clauses. In Proceedings CTRS-90, S. Kaplan and M. Okada, Eds. Lecture Notes in Computer Science, vol. 516. Springer-Verlag, Berlin, Germany, 14-25.
31. DERSHOWITZ, N. AND PLAISTED, D. A. 2001. Rewriting. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Vol. 1. Elsevier, Amsterdam, The Netherlands, 535-610.
32. DETLEFS, D. L., NELSON, G., AND SAXE, J. B. 2005. Simplify: A theorem prover for program checking. J. ACM S2, 3, 365-473.
33. DOWNEY, P. J., SAMET, H., AND SETHI, R. 1978. Off-line and on-line algorithms for deducing equalities. In Proceedings of the Symposium on Principles of Programming Languages. ACM, New York, 158-170.
34. DOWNEY, R J., SETHI, R., AND TARJAN, R. E. 1980. Variations on the common subexpression problem. J. ACM 27, 4, 758-771.
35. DUTERTRE, B. AND DE MOURA, L. 2006. A fast linear-arithmetic solver for DPLL(T). In Proceedings of the International Conference on Computer-Aided Verification, T. Ball and R. B. Jones, Eds. Lecture Notes in Computer Science, vol. 4144. Springer-Verlag, Berlin, Germany, 81-94.
36. FERMÜLLER, C., LEITSCH, A., HUSTADT, U., AND TAMMET, T. 2001. Resolution decision procedures. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Vol. 2. Elsevier, Amsterdam, The Netherlands, Chapter 25, 1793-1849.
37. FLANAGAN, C., JOSHI, R., OU, X., AND SAXE, J. B. 2003. Theorem proving using lazy proof explication. In Proceedings of the International Conference on Computer-Aided Verification, J. Warren, W. A. Hunt, Jr., and F Somenzi, Eds. Lecture Notes in Computer Science, vol. 2725. Springer-Verlag, Berlin, Germany, 355-367.
38. GALLIER, J., NARENDRAN, P., PLAISTED, D. A., RAATZ, S., AND SNYDER, W 1993. Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time. J. ACM 40, 1, 1-16.
39. GANZINGER, H. 2002. Shostak light. In Proceedings of the International Conference on Automated Verification, A. Voronkov, Ed. Lecture Notes in Artificial Intelligence, vol. 2392. Springer-Verlag, Berlin, Germany, 332-347.
40. GANZINGER, H., HAGEN, G., NIEUWENHUIS, R., OLIVERAS, A., AND TINELLI, C 2004a. DPLL(T): Fast decision procedures. In Proceedings of the 16th International Conference on Computer-Aided Verification (CAV04), R. Alur and D. A. Peled, Eds. Lecture Notes in Computer Science, vol. 3114. Springer-Verlag, Berlin, Germany, 175-188.
41. GANZINGER, H., RUESS, H., AND SHANKAR, N. 2004b. Modularity and refinement in inference systems. Tech. Rep. CSL-SRI-04-02, SRI International, Menlo Park, CA.
42. GANZINGER, H., SOFRONIE, V., AND WALDMANN, U 2006. Modular proof systems for partial functions with Evans equality. Inform. Computat. 240, 10, 1453-1492.
43. GHILARDI, S. 2004. Model-theoretic methods in combined constraint satisfiability. J. Automat. Reason. 33, 3-4, 221-249.
44. GHILARDI, S., NICOLINI, E., AND ZUCCHELLI, D. 2005. A comprehensive framework for combined decision procedures. InProceedings of the Bth International Worshop on Frontiers of Combining Systems. B. Gramlich, Ed. Lecture Notes in Artificial Intelligence, vol. 3717. Springer-Verlag, Berlin, Germany, 1-30.
45. HORN, A. 1951. On sentences which are true of direct unions of algebras. J. Symbol. Logic 16, 14-21.
46. JACKSON, D. AND VAZIRI, M. 2000. Finding bugs with a constraint solver. In Proceedings of ISSTA 2000, M. J. Harrold, Ed. ACM, New York.
47. KAUFMANN, M., MANOLIOS, P., AND MOORE, J. S. EDS. 2000. Computer Aided Reasoning: ACL2 Case Studies. Kluwer.
48. KIRCHNER, H., RANISE, S., RINGEISSEN, C., AND TRAN, D. K. 2005. On superposition-based satisfiability procedures and their combination. In Proceedings of 2nd ICTAC, D. Hung and M. Wirsing, Eds. Lecture Notes in Computer Science, vol. 3722. Springer-Verlag, Berlin, Germany, 594-608.
49. KNUTH, D. E., AND BENDIX, R B. 1970. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra, J. Leech, Ed. Pergamon Press, Oxford, UK, 263-297.
50. KRSTIC, S. AND CONCHON, S. 2003. Canonization for disjoint unions of theories. In Proc. CADE-19, F Baader, Ed. Lecture Notes in Computer Science, vol. 2741. Springer-Verlag, Berlin, Germany.
51. LAHIRI, S. K. AND MUSUVATHI, M. 2005a. An efficient decision procedure for UTVPI constraints. In Proceedings of the Bth FroCoS, B. Grämlich, Ed. Lecture Notes in Artificial Intelligence, vol. 3717. Springer-Verlag, Berlin, Germany, 168-183.
52. LAHIRI, S. K. AND MUSUVATHI, M. 2005b. An efficient Nelson-Oppen decision procedure for difference constraints over rationals. In Notes 3rdPDPAR Workshop, CAV-17. 2-9.
53. LAHIRI, S. K. AND SESHIA, S. A. 2004. The UCLID decision procedure. In Proceedings of CAV-16, R. Alur and D. A. Peled, Eds. Lecture Notes in Computer Science, vol. 3114. Springer-Verlag, Berlin, Germany, 475-378.
54. LANKFORD, D. S. 1975. Canonical inference. Memo ATP-32, Automatic Theorem Proving Project, University of Texas, Austin, TX.
55. LYNCH, C. AND MORAWSKA, B. 2002. Automatic decidability. In Proceedings ofLICS-17, G. Plotkin, Ed. IEEE Computer Society Press, Los Alamitos, CA.
56. LYNCH, C. AND TRAN, D.-K. 2007. Automatic decidability and combinability revisited. In Proceedings ofthe 21st International on Automated Deduction. F Pfenning, Ed. Lecture Notes in Artificial Intelligence, vol. 4603. Springer-Verlag, Berlin, Germany, 328-344.
57. MANNA, Z. AND ZARBA, C G. 2003. Combining decision procedures. In Formal Methods at the Crossroads: From Panacea to Foundational Support. Lecture Notes in Computer Science, vol. 2757. Springer-Verlag, Berlin, Germany, 381-422.
58. MCCUNE, W W. 2003. Otter 3.3 reference manual. Tech. Rep. ANL/MCS-TM-263, MCS Division, Argonne National Laboratory, Argonne, IL, U.S.A.
59. MEIR, O. AND STRICHMAN, O. 2005. Yet another decision procedure for equality logic. In Proceedings of the CAV-17, K. Etessami and S. Rajamani, Eds. Lecture Notes in Computer Science, vol. 3576. Springer-Verlag, Berlin, Germany, 307-320.
60. 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 DAC, D. Blaauw and L. Lavagno, Eds.
61. NECULA, G. AND LEE, P. 1998. Efficient representation and validation of proofs. In Proceedings of the LICS-13, V. Pratt, Ed. IEEE Computer Society Press, Los Alamitos, CA, 93-104.
62. NELSON, G. AND OPPEN, D. C. 1979. Simplification by cooperating decision procedures. ACM Trans. Prog. Lang. Systs. 1, 2, 245-257.
63. NELSON, G. AND OPPEN, D. C. 1980. Fast decision procedures based on congruence closure. J. ACM 27, 2, 356-364.
64. NIEUWENHUIS, R. AND OLIVERAS, A. 2007. Fast congruence closure and extensions. Inform. Computat. 206, 4, 557-580.
65. NIEUWENHUIS, R. AND RUBIO, A. 2001. Paramodulation-based theorem proving. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Vol. 1. Elsevier, Amsterdam, The Netherlands, 371-443.
66. OPPEN, D. C. 1980. Reasoning about recursively defined data structures. J. ACM 27, 3.
67. OWRE, S., RUSHBY, J. M., AND SHANKAR, N. 1992. PVS: A prototype verification system. In Proceedings of the International Conference on Automated Dedication, D. Kapur, Ed. Lecture Notes in Artificial Intelligence, vol. 607. Springer-Verlag, Berlin, Germany, 748-752.
68. PLAISTED, D. A. 1993. Equational reasoning and term rewriting systems. In Handbook of Logic in Artificial Intelligence and Logic Programming, D.M. Gabbay, C J. Hogger, and J. A. Robinson, Eds. Vol. I: Logical Foundations. Oxford University Press, Oxford, UK, 273-364.
69. PLAISTED, D. A. AND SATTLER-KLEIN, A. 1996. Proof lengths for equational completion. Inform. Computat. 126, 2, 154-170.
70. RANISE, S. AND DÉHARBE, D. 2003. Light-weight theorem proving for debugging and verifying pointer manipulating programs. In Proceedings of FTP-2003, I. Dahn and L. Vigneron, Eds. Number DSCI-II710/03 in Technical Reports. Universidad Politécnica de Valencia, 119-132.
71. RANISE, S., RINGEISSEN, C., AND TRAN, D. K. 2004. Nelson-Oppen, Shostak and the extended canonizer: A family picture with a newborn. In Proceedings of the 1st ICTAC, K. Araki and Z. Liu, Eds. Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany.
72. RANISE, S., RINGEISSEN, C., AND ZARBA, C. G. 2005. Combining data structures with nonstably infinite theories using many-sorted logic. In Proceedings of the 5th International Workshop on Frontiers of Combining Systems. B. Gramlich, Ed. Lecture Notes in Artificial Intelligence, vol. 3717. Springer-Verlag, Berlin, Germany, 48-64.
73. RIAZANOV, A. AND VORONKOV, A. 2002. The design and implementation of VAMPIRE. J. AI Commun. 15, 2/3, 91-110.
74. RUESS, H. 2004. Personal communication on ICS 2.0 (e-mail message to Alessandro Armando).
75. RUESS, H. AND SHANKAR, N. 2001. Deconstructing Shostak. In Proceedings of the IEEE Symposium on Logic in Computer Science. J. Halpern, Ed. IEEE Computer Society Press, Los Alamitos, CA.
76. RUESS, H. AND SHANKAR, N. 2004. Solving linear arithmetic constraints. Tech. Rep. CSL-SRI-04-01, SRI International, Menlo Park, CA.
77. SCHULZ, S. 2002. E - A brainiac theorem prover. J. AI Commun. 15, 2-3, 111-126.
78. SCHULZ, S. 2004. System description: E 0.81. In Proceedings of the 2nd International Joint Conference on Automated Reasoning. D. Basin and M. Rusinowitch, Eds. Lecture Notes in Artificial Intelligence, vol. 3097. Springer-Verlag, Berlin, Germany, 2223-2228.
79. SCHULZ, S. AND BONACINA, M. R 2005. On handling distinct objects in the superposition calculus. In Notes 5th IWIL Workshop, LPAR-11. 66-77.
80. SESHIA, S. A., LAHIRI, S. K., AND BRYANT, R. E. 2003. A hybrid SAT-based decision procedure for separation logic with uninterpreted functions. In Proceedings of the 40th DAC, L. Fix and L. Lavagno, Eds. 425-430.
81. SHANKAR, N. 2002. Little engines of proof. Invited talk, 3rd FLoC, Copenhagen, Denmark; and course notes of Fall 2003, http://www.csl.sri. com/users/shankar/LEP.html.
82. SHOSTAK, R. E. 1978. An algorithm for reasoning about equality. Comm. ACM 21, 7, 583-585.
83. SHOSTAK, R. E. 1984. Deciding combinations of theories. J. ACM 31, 1, 1-12.
84. STICKEL, M. E. 2002. Herbrand Award speech. 3rd FLoC, Copenhagen, Denmark.
85. STUMP, A. 2005. Personal communication on CVC 1.0a (e-mail message to Alessandro Armando).
86. STUMP, A., BARRETT, C. W., AND DILL, D. L. 2002. CVC: A Cooperating Validity Checker. In Proc. CAV-14, K. G. Larsen and E. Brinksma, Eds. Lecture Notes in Computer Science, vol. 2404. Springer-Verlag, Berlin, Germany, 500-504.
87. STUMP, A., BARRETT, C. W., DILL, D. L., AND LEVITT, J. 2001. A decision procedure for an extensional theory of arrays. In Proceedings ofLICS-16, J. Halpern, Ed. IEEE Computer Society Press, Los Alamitos, CA.
88. STUMP, A. AND DILL, D. L. 2002. Faster proof checking in the Edinburgh Logical Framework. In Proceedings of CADE-18, A. Voronkov, Ed. Lecture Notes in Artificial Intelligence, vol. 2392. Springer-Verlag, Berlin, Germany, 392-407.
89. TINELLI, C. AND HARANDI, M. 1996. A new correctness proof of the Nelson-Oppen combination procedure. In Proceedings of the 1st FroCoS, F Baader and K. Schulz, Eds. Applied Logic Series, vol. 3. Kluwer Academic Publishers.
90. VAN DALEN, D. 1989. Logic and Structure. Springer-Verlag, Berlin, Germany. Second edition.
91. WEIDENBACH, C., AFSHORDEL, B., BRAHM, U., COHRS, C., ENGEL, T., KEEN, E., THEOBALT, C., AND TOPIĆ, D. 1999. System description: Spass version 1.0.0. In Proceedings of the 16th International Conference on Automated Dedication. H. Ganzinger, Ed. Lecture Notes in Artificial Intelligence, vol. 1632. Springer-Verlag, Berlin, Germany, 378-382.