On a rewriting approach to satisfiability procedures: Extension, combination of theories and an experimental appraisal

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

Volumn 3717 LNAI, Issue , 2005, Pages 65-80

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

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF VERONA   (Italy)

^c INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

INTEGER OFFSETS MODULO; QUANTIFIER-FREE THEORY; REAL-WORLD BENCHMARKS; T-SATISFIABILITY PROBLEMS;

FORMAL LOGIC;

EID: 33646193298     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11559306_4     Document Type: Conference Paper

References (22)

1. K. Arkoudas, K. Zee, V. Kuncak, and M. Rinard. Verifying a File System Implementation. In Proc. ICFEM 2004, volume 3308 of LNCS. Springer, 2004.
2. A. Armando, M. P. Bonacina, S. Ranise, M. Rusinowitch, and A. K. Sehgal. High-Performance Deduction for Verification: a Case Study in the Theory of Arrays. In Notes of the 2nd VERIFY Workshop, 3rd FLoC, number 07/2002 in Technical Reports, pages 103-112. DIKU, U. Copenhagen, 2002.
3. A. Armando, M. P. Bonacina, S. Ranise, and S. Schulz. Big Proof Engines as Little Proof Engines: New Results on Rewrite-Based Satisfiability Procedures. In Notes of the 3rd PDPAR Workshop, CAV-17, Technical Reports. U. Edinburgh, 2005.
4. A. Armando, M. P. Bonacina, S. Ranise, and S. Schulz. On a Rewriting Approach to Satisfiability Procedures: Theories of Data Structures, Combination Framework and Experimental Appraisal. Technical Report 36/2005, Dip. di Informatica, U. Verona, May 2005. http://www.sci.univr.it/~bonacina/verify.html.
5. A. Armando, S. Ranise, and M. Rusinowitch. A Rewriting Approach to Satisfiability Procedures. Information and Computation, 183(2):140-164, 2003.
6. C. W. Barrett and S. Berezin. CVC Lite: A New Implementation of the Cooperating Validity Checker. In Proc. CAV-16, volume 3114 of LNCS, pages 515-518. Springer, 2004.
7. C. W. Barrett, D. L. Dill, and A. Stump. A Generalization of Shostak's Method for Combining Decision Procedures. In Proc. FroCoS-4, volume 2309 of LNCS. Springer, 2002.
8. R. E. Bryant, S. K. Lahiri, and S. A. Seshia. Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions. In Proc. CAV-14, volume 2404 of LNCS. Springer, 2002.
9. L. de Moura, S. Owre, H. Rueß, J. Rushby, and N. Shankar. The ICS Decision Procedures for Embedded Deduction. In Proc. IJCAR-2, volume 3097 of LNAI, pages 218-222. Springer, 2004.
10. D. Déharbe and S. Ranise. Light-Weight Theorem Proving for Debugging and Verifying Units of Code. In Proc. SEFM03. IEEE, 2003.
11. D. L. Detlefs, G. Nelson, and J. B. Saxe. Simplify: a Theorem Prover for Program Checking. Technical Report 148, HP Labs, 2003.
12. H. Ganzinger. Shostak Light. In Proc. CADE-18, volume 2392 of LNAI, pages 332-347. Springer, 2002.
13. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast Decision Procedures. In Proc. CAV-16, volume 3114 of LNCS, pages 175-188. Springer, 2004.
14. G. Nelson and D. C. Oppen. Simplification by Cooperating Decision Procedures. ACM TOPLAS, 1(2):245-257, 1979.
15. R. Nieuwenhuis and A. Rubio. Paramodulation-Based Theorem Proving. In Handbook of Automated Reasoning, volume 1. Elsevier Science, 2001.
16. H. Rueß and N. Shankar. Deconstructing Shostak. In Proc. LICS-16. IEEE, 2001.
17. S. Schulz. E - A Brainiac Theorem Prover. J. of AI Comm., 15(2-3):111-126, 2002.
18. S. Schulz and M. P. Bonacina. On Handling Distinct Objects in the Superposition Calculus. In Notes of the 5th Int. Workshop on Implementation of Logics, LPAR-11, pages 66-77, March 2005.
19. N. Shankar. Little Engines of Proof, 2002. Invited talk, 3rd FLoC, Copenhagen; http://www.csl.sri.com/users/shaakar/LEP.html.
20. R. E. Shostak. Deciding Combinations of Theories. J. ACM, 31(1):1-12, 1984.
21. A. Stump, C. W. Barrett, and D. L. Dill. CVC: a Cooperating Validity Checker. In Proc. CAV-14, LNCS. Springer, 2002.
22. A. Stump, C. W. Barrett, D. L. Dill, and J. Levitt. A Decision Procedure for an Extensional Theory of Arrays. In Proc. LICS-16. IEEE, 2001.