Lecture 14
Milestones in SMT solver development:
- results of Nelson and Oppen, including Nelson's dissertation
- inclusion of SAT solvers and the DPLL(T) algorithm: Solving SAT and SAT Modulo Theories: from an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T)
- The SMT-LIB initiative with standardized format, benchmarks, and competitions
- The provers such as Z3 prover
More on SAT Solvers
Combining Decision Procedures
Introduction from Selected VeriFun slides (Full VeriFun slides are here)
Idea of Quantifier-Free Combination
Summary:
- SAT + theories
- lazy approach and eager approach
- small models and Ackerman encoding
- quantifier instantiation