A Survey of Satisfiability Modulo Theory
Logic in Computer Science
2016-06-16 v1
Abstract
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.
Cite
@article{arxiv.1606.04786,
title = {A Survey of Satisfiability Modulo Theory},
author = {David Monniaux},
journal= {arXiv preprint arXiv:1606.04786},
year = {2016}
}
Comments
Computer Algebra in Scientific Computing, Sep 2016, Bucharest, Romania. 2016