You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Lazy Satisfiability Modulo Theories

Article type: Research Article

Authors: Sebastiani, Roberto; *

Affiliations: Dipartimento di Ingegneria e Scienza dell’Informazione (DISI), Università di Trento, Italy. E-mail: [email protected]

Note: [*] This survey work has benefited from important discussions with A. Armando, C. Barrett, M. Bozzano, R. Bruttomesso, A. Cimatti, A. Franzen, L. de Moura, S. Ghilardi, A. Griggio, S. Krstic, R. Nieuwenhuis, A. Oliveras, S. Ranise, M. Roveri, O. Strichman, A. Tacchella, C. Tinelli, to whom I am very grateful. A particular thank goes to all past and present members of the KSAT and MathSAT teams. Some material discussed here was presented at the ESSLI’02 course and IJCAI’03 and CADE’03 Tutorials “SAT Beyond Propositional Satisfiability” (disi.unitn.it/~rseba/DIDATTICA/Tutorials/Slides_tutorial_cade03.pdf), at the course “Efficient Boolean Reasoning” at 2003-2005 Int. ICT school of Trento and at 2006 Int. BIT School in Brixen (disi.unitn.it/~rseba/DIDATTICA/SAT_BASED06/), and at my invited talk at FroCoS’07 [154]. This work has been partly supported by ORCHID, a project sponsored by Provincia Autonoma di Trento, and by a grant from Intel Corporation.

Keywords: propositional satisfiability, satisfiability modulo theories, decision procedures

DOI: 10.3233/SAT190034

Journal: Journal on Satisfiability, Boolean Modeling and Computation, vol. 3, no. 3-4, pp. 141-224, 2007

Received 1 April 2007
|
Revision received 1 December 2007
|
Published: 1 December 2007
Get PDF open access

Abstract

Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-order formula with respect to some decidable first-order theory T (SMT(T)). These problems are typically not handled adequately by standard automated theorem provers. SMT is being recognized as increasingly important due to its applications in many domains in different communities, in particular in formal verification. An amount of papers with novel and very efficient techniques for SMT has been published in the last years, and some very efficient SMT tools are now available.

Typical SMT(T) problems require testing the satisfiability of formulas which are Boolean combinations of atomic propositions and atomic expressions in T, so that heavy Boolean reasoning must be efficiently combined with expressive theory-specific reasoning. The dominating approach to SMT(T), called lazy approach, is based on the integration of a SAT solver and of a decision procedure able to handle sets of atomic constraints in T (T-solver), handling respectively the Boolean and the theory-specific components of reasoning.

Unfortunately, neither the problem of building an efficient SMT solver, nor even that of acquiring a comprehensive background knowledge in lazy SMT, is of simple solution.

In this paper we present an extensive survey of SMT, with particular focus on the lazy approach. We survey, classify and analyze from a theory-independent perspective the most effective techniques and optimizations which are of interest for lazy SMT and which have been proposed in various communities; we discuss their relative benefits and drawbacks; we provide some guidelines about their choice and usage; we also analyze the features for SAT solvers and T -solvers which make them more suitable for an integration.

The ultimate goals of this paper are to become a source of a common background knowledge and terminology for students and researchers in different areas, to provide a reference guide for developers of SMT tools, and to stimulate the cross-fertilization of techniques and ideas among different communities.

Show more