A Survey of Satisfiability Modulo Theory [chapter]

David Monniaux
2016 Lecture Notes in Computer Science  
Satisfiability modulo theory (SMT) consists in testing the satisfiability of first-order formulas over linear integer or real arithmetic, or other theories. In this survey, we explain the combination of propositional satisfiability and decision procedures for conjunctions known as DPLL(T), and the alternative "natural domain" approaches. We also cover quantifiers, Craig interpolants, polynomial arithmetic, and how SMT solvers are used in automated software analysis.
doi:10.1007/978-3-319-45641-6_26 fatcat:iqkvvrxgrnd6xgpqo3kenx6l7u