@inproceedings{Mon6,
title = {A Survey of Satisfiability Modulo Theory },
author = {Monniaux, David},
month = {sep},
year = {2016},
booktitle = {Computer Algebra in Scientific Computing},
chapter = {26},
eprint = {hal-01332051},
volume = {9890},
team = {PACSS},
entrysubtype = {intc},
eprinttype = {HAL},
pdf = {https://arxiv.org/pdf/1606.04786v1},
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.},
}
