Satisfiability modulo theories: An appetizer

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

Volumn 5902 LNCS, Issue , 2009, Pages 23-36

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

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS AND MODELS; BOOLEAN SATISFIABILITY; COMPLEXITY THEORY; DECISION PROBLEMS; LOGICAL FORMULAS; LOGICAL THEORIES; ORDERS OF MAGNITUDE; SATISFIABILITY; SATISFIABILITY MODULO THEORIES; SOFTWARE SYSTEMS; SYMBOLIC LOGIC; SYMBOLIC SYSTEMS;

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; CONVEX OPTIMIZATION; DECISION THEORY; FORMAL LOGIC;

FORMAL METHODS;

EID: 70649083043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10452-7_3     Document Type: Conference Paper

References (26)

1. 10: Applications, Enablers, Challenges and Directions. In: CFV (2009)
2. Barrett, C., de Moura, L., Stump, A.: Design and Results of the 1st Satisfiability Modulo Theories Competition. JAR (2005)
3. McCarthy, J.: Towards a mathematical science of computation. In: IFIP Congress, pp. 21-28 (1962)
4. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM (1962)
5. Marques-Silva, J.P., Sakallah, K.A.: GRASP - A New Search Algorithm for Satisfiability. In: ICCAD (1996)
6. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: DAC (2001)
7. Ge, Y., de Moura, L.: Complete instantiation for quantified SMT formulas. In: CAV (2009)
8. Dutertre, B., de Moura, L.: A Fast Linear-Arithmetic Solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006)
9. Tarski, A.: A decision method for elementary algebra and geometry. Technical report, 2nd edn. University of California Press, Berkeley (1951)
10. Buchberger, B.: Ein algorithmus zum auffinden der basiselemente des restklassen-ringes nach einem nulldimensionalen polynomideal. Technical report, Mathematical Institute, University of Innsbruck, Austria (1965)
11. Downey, P.J., Sethi, R., Tarjan, R.E.: Variations on the common subexpression problem. J. ACM 27, 758-771 (1980)
12. Stump, A., Barrett, C.W., Dill, D.L., Levitt, J.R.: A decision procedure for an extensional theory of arrays. In: LICS, pp. 29-37 (2001)
13. Bradley, A.R., Manna, Z., Sipma, H.B.: What's decidable about arrays? In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 427-442. Springer, Heidelberg (2005)
14. de Moura, L., Rueß, H.: Lemmas on Demand for Satisfiability Solvers. In: SAT (2002)
15. Flanagan, C., Joshi, R., Ou, X., Saxe, J.B.: Theorem Proving Using Lazy Proof Explication. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 355-367. Springer, Heidelberg (2003)
16. Barrett, C., Dill, D., Stump, A.: Checking satisfiability of first-order formulas by incremental translation to SAT. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, p. 236. Springer, Heidelberg (2002)
17. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53 (2006)
18. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1, 245-257 (1979)
19. Bruttomesso, R., Cimatti, A., Franzén, A., Griggio, A., Sebastiani, R.: Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 527-541. Springer, Heidelberg (2006)
20. de Moura, L., Bjørner, N.: Model-based theory combination. In: Proc. 5th SMT Workshop, CAV 2007 (2007)
21. Jovanović, D., Barrett, C.: Polite Theories Revisited (to appear, 2009)
22. de Moura, L., Bjørner, N.: Generalized, Efficient Array Decision Procedures (to appear, 2009)
23. Tinelli, C., Ringeissen, C.: Unions of Non-Disjoint Theories and Combinations of Satisfiability Procedures. Theoretical Computer Science (2003)
24. Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. Computational Problems in Abstract Algebra (1970)
25. de Moura, L., Bjørner, N.: Engineering DPLL(T) + saturation. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 475-490. Springer, Heidelberg (2008)
26. Armando, A., Bonacina, M.P., Ranise, S., Schulz, S.: New results on rewrite-based satisfiability procedures. ACM TOCL 10, 129-179 (2009)