Strategies for combining decision procedures

Theoretical Computer Science

Volumn 354, Issue 2, 2006, Pages 187-210

  Conchon, Sylvain ^a   Krstić, Sava ^b,c  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b INTEL CORPORATION   (United States)

^c Mailstop JF4 211 ^*  (United States)

Author keywords

Decision procedures; Inference systems; Nelson Oppen combination; Shostak's algorithm

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; INFERENCE ENGINES; OPTIMIZATION;

DECISION PROCEDURES; INFERENCE SYSTEMS; SHOSTAK'S ALGORITHMS;

DECISION THEORY;

EID: 33644664443     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.11.025     Document Type: Conference Paper

References (35)

1. L. Bachmair, N. Dershowitz, Commutation, transformation, and termination, in: J. Siekmann (Ed.), Proc. Eighth Internat. Conf. Automated Deduction (CADE), Lecture Notes in Computer Science, vol. 230, Springer, Berlin, 1986, pp. 5-20.
2. L. Bachmair, A. Tiwari, and L. Vigneron Abstract congruence closure J. Automated Reasoning 31 2 2003 129 168
3. T. Ball, B. Cook, S.K. Lahiri, S.K. Rajamani, Zapato: automatic theorem proving for predicate abstraction refinement, in: Proc. 16th Internat. Conf. Computer Aided Verification (CAV), Lecture Notes in Computer Science, Springer, Berlin, 2004.
4. C. Barrett, Checking validity of quantifier-free formulas in combinations of first-order theories, Ph.D. Thesis, Stanford University, 2002.
5. C. Barrett, S. Berezin, CVC Lite. 〈 http://verify.stanford.edu/CVCL/〉
6. C. Barrett, D. Dill, A. Stump, Checking satisfiability of first-order formulas by incremental translation to SAT, in: Proc. 14th Internat. Conf. Computer Aided Verification (CAV), Lecture Notes in Computer Science, vol. 2404, Copenhagen, Denmark, 2002, Springer, Berlin, pp. 236-249.
7. C. Barrett, D. Dill, A. Stump, A generalization of Shostak's method for combining decision procedures, in: Proc. Fourth Internat. Workshop on Frontiers of Combining Systems (FROCOS), Lecture Notes in Artificial Intelligence, vol. 2309, Santa Margherita Ligure, Italy, 2002, Springer, Berlin, pp. 132-147.
8. N. Bjørner, Integrating decision procedures for temporal verification, Ph.D. Thesis, Stanford University, 1998.
9. P. Borovansky, C. Kirchner, H. Kirchner, P.E. Moreau, C. Ringeissen, An overview of ELAN, in: C. Kirchner, H. Kirchner (Eds.), Proc. Internat. Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, vol. 15, Elsevier Science Publishers, 1998.
10. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, C. Talcott, The Maude 2.0 system. in: R. Nieuwenhuis (Ed.), Rewriting Techniques and Applications (RTA 2003), Lecture Notes in Computer Science, vol. 2706, Springer, Berlin, June 2003, pp. 76-87.
11. L. de Moura, and H. Rueß Lemmas on demand for satisfiability solvers Proc. Fifth Internat. Symp. the Theory and Application of Satisfiability Testing (SAT) Cincinnati, Ohio 2002
12. D. Déharbe, S. Ranise, haRVey. 〈 http://www.loria.fr/~ranise/haRVey/ 〉
13. D. Déharbe, S. Ranise, BDD-driven first-order satisfiability procedures, Technical Report 4630, INRIA, 2002.
14. J.-C. Filliâtre, S. Owre, H. Rueß, N. Shankar, ICS: integrated canonization and solving, in: Proc. 13th Internat. Conf. Computer Aided Verification (CAV), Lecture Notes in Computer Science, vol. 2102, Paris, France, 2001, Springer, Berlin, pp. 246-249.
15. P. Fontaine, E.P. Gribomont, Using BDDs with combinations of theories, in: Proc. Ninth Internat. Conf. Logic for Programming and Automated Reasoning (LPAR), Lecture Notes in Computer Science, vol. 2514, Tbilisi, Georgia, 2002, Springer, Berlin, pp. 190-201.
16. H. Ganzinger, Shostak light, in: Proc. 18th Internat. Conf. Automated Deduction (CADE), Lecture Notes in Artificial Intelligence, vol. 2392, Copenhagen, Denmark, 2002, Springer, Berlin, pp. 332-347.
17. D. Kapur, A rewrite rule based framework for combining decision procedures, in: Proc. Fourth Internat. Workshop on Frontiers of Combining Systems (FROCOS), Lecture Notes in Artificial Intelligence, vol. 2309, Santa Margherita Ligure, Italy, 2002, Springer, Berlin, pp. 87-103.
18. S. Krstić, S. Conchon, Canonization for disjoint unions of theories, in: Proceedings of the 19th International Conference on Automated Deduction (CADE-19), Lecture Notes in Computer Science, vol. 2741, Miami, Florida, Springer, Berlin, 2003.
19. Z. Manna, C.G. Zarba, Combining decision procedures, in: Formal Methods at the Cross Roads: From Panacea to Foundational Support, Lecture Notes in Computer Science, vol. 2757, Springer, Berlin, 2004, pp. 381-422.
20. G. Nelson, Techniques for program verification, Technical Report CSL-80-10, Xerox PARC Computer Science Laboratory, 1981.
21. G. Nelson, and D.C. Oppen Simplification by cooperating decision procedures ACM Trans. Programming Languages and Systems 1 2 1979 245 257
22. G. Nelson, and D.C. Oppen Fast decision procedures based on congruence closure JACM 27 2 1980 356 364
23. The Objective Caml language. 〈 http://www.ocaml.org/ 〉
24. S. Ranise, C. Tinelli, SMT-LIB. 〈 http://goedel.cs.uiowa.edu/smtlib/〉
25. C. Ringeissen, Cooperation of decision procedures for the satisfiability problem, in: Proceedings of the First International Workshop on Frontiers of Combining Systems (FROCOS), Applied Logic, vol. 3, Munich, Germany, Kluwer Academic Publishers, Dordrecht, 1996, pp. 121-140.
26. H. Rueß, N. Shankar, Deconstructing Shostak, in: Proc. 16th Annual IEEE Symp. Logic in Computer Science (LICS), Copenhagen, Denmark, IEEE Computer Society, Silver Spring, MD, 2001, pp. 19-28.
27. N. Shankar, Little engines of proof, in: Proc. 11th Internat. Symp. Formal Methods Europe (FME), Lecture Notes in Computer Science, vol. 2391, Copenhagen, Denmark, Springer, Berlin, 2002, pp. 1-20.
28. N. Shankar, H. Rueß, Combining Shostak theories, in: Proc. 13th Internat. Conf. Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, vol. 2378, Copenhagen, Denmark, Springer, Berlin, 2002, pp. 1-19.
29. R.E. Shostak Deciding combinations of theories JACM 31 1 1984 1 12
30. A. Stump, C. Barrett, D. Dill, CVC: a cooperating validity checker, in: Proc. 14th Internat. Conf. Computer Aided Verification (CAV), Lecture Notes in Computer Science, vol. 2404, Copenhagen, Denmark, Springer, Berlin, 2002, pp. 500-504.
31. C. Tinelli, A DPLL-based calculus for ground satisfiability modulo theories, in: Proc. Eighth European Conf. Logics in Artificial Intelligence (JELIA), Lecture Notes in Artificial Intelligence, vol. 2424, Cosenza, Italy, Springer, Berlin, 2002, pp. 308-319.
32. C. Tinelli, M.T. Harandi, A new correctness proof of the Nelson-Oppen combination procedure, in: Proc. First Internat. Workshop on Frontiers of Combining Systems (FROCOS), Applied Logic, Kluwer Academic Publishers, Dordrecht, 1996, pp. 103-120.
33. A. Tiwari, Decision procedures in automated deduction, Ph.D. Thesis, University of Stony Brook, 2000.
34. D. van Dalen Logic and Structure third ed. 1997 Springer Berlin
35. E. Visser, Stratego: a language for program transformation based on rewriting strategies, in: A. Middeldorp (Ed.), Rewriting Techniques and Applications (RTA'01), Lecture Notes in Computer Science, vol. 2051, Springer, Berlin, 2001, pp. 357-361.