A Survey of Satisfiability Modulo Theory

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01332051
Contributor : David Monniaux <>
Submitted on : Thursday, January 26, 2017 - 9:48:22 AM
Last modification on : Friday, July 6, 2018 - 10:08:02 AM
Long-term archiving on : Friday, April 28, 2017 - 8:26:46 AM

Identifiers

  • HAL Id : hal-01332051, version 1
  • ARXIV : 1606.04786

Collections

Citation

David Monniaux. A Survey of Satisfiability Modulo Theory. Computer Algebra in Scientific Computing, Sep 2016, Bucharest, Romania. ⟨hal-01332051⟩

Share

Metrics

Record views

229

Files downloads

749