Model-based Theory Combination

Electronic Notes in Theoretical Computer Science

Volumn 198, Issue 2, 2008, Pages 37-49

  de Moura, Leonardo ^a   Bjørner, Nikolaj ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Decision Procedures; SMT; Theory Combination

Indexed keywords

COMPUTER SCIENCE; DECISION THEORY; MATHEMATICAL MODELS;

DECISION PROCEDURES; SEARCH SPACE; THEORY COMBINATION;

PROBLEM SOLVING;

EID: 43749117059     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.04.079     Document Type: Article

References (18)

1. Ackermann, W., Solvable cases of the decision problem, Studies in Logic and the Foundation of Mathematics (1954)
2. Barrett C., and Tinelli C. CVC3. In: Damm W., and Hermanns H. (Eds). CAV'07, Berlin, Germany. LNCS 4590 (2007)
3. Bozzano M., Bruttomesso R., Cimatti A., Junttila T.A., Ranise S., van Rossum P., and Sebastiani R. Efficient theory combination via boolean search. Inf. Comput. 204 (2006) 1493-1525
4. Bozzano M., Bruttomesso R., Cimatti A., Junttila T.A., van Rossum P., Schulz S., and Sebastiani R. The MathSAT 3 System. In: Nieuwenhuis R. (Ed). CADE. LNCS 3632 (2005) 315-321
5. Bruttomesso, R., A. Cimatti, A. Franzén, A. Griggio, A. Santuari and R. Sebastiani, To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in UF(E), in: LPAR, 2006, pp. 557-571
6. Bruttomesso, R., A. Cimatti, A. Franzén, A. Griggio and R. Sebastiani, Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis., in: LPAR, 2006, pp. 527-541
7. Detlefs D., Nelson G., and Saxe J.B. Simplify: a theorem prover for program checking. J. ACM 52 (2005) 365-473
8. Dutertre B., and de Moura L. A Fast Linear-Arithmetic Solver for DPLL(T). CAV'06. LNCS 4144 (2006) 81-94
9. Dutertre B., and de Moura L. The Yices SMT Solver (2006). http://yices.csl.sri.com/tool-paper.pdf
10. Flanagan, C., R. Joshi and J.B. Saxe, An explicating theorem prover for quantified formulas, Technical Report HPL-2004-199, HP Laboratories, Palo Alto (2004)
11. Ganzinger H., Hagen G., Nieuwenhuis R., Oliveras A., and Tinelli C. DPLL(T): Fast decision procedures. CAV'04. LNCS 3144 (2004) 175-188
12. Nelson G., and Oppen D.C. Simplification by cooperating decision procedures. AC Transactions on Programming Languages and Systems 1 (1979) 245-257
13. Nieuwenhuis R., and Oliveras A. Fast Congruence Closure and Extensions. Inf. Comput. 2005 (2007) 557-580
14. Nieuwenhuis R., Oliveras A., and Tinelli C. Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53 (2006) 937-977
15. Oppen D.C. Complexity, convexity and combinations of theories. Theor. Comput. Sci. 12 (1980) 291-302
16. Rueß, H. and N. Shankar, Solving linear arithmetic constraints, Technical Report SRI-CSL-04-01, SRI International (2004)
17. Sheini, H.M. and K.A. Sakallah, SMT(LU): a step toward scalability in system verification., in: S. Hassoun, editor, ICCAD (2006), pp. 844-851
18. Shostak R.E. Deciding combinations of theories. J. ACM 31 (1984) 1-12