A Survey of Satisfiability Modulo TheoryReportar como inadecuado

A Survey of Satisfiability Modulo Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.


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 DPLLT, and the alternative -natural domain- approaches. We also cover quantifiers, Craig interpolants, polynomial arithmetic, and how SMT solvers are used in automated software analysis.

Keywords : linear programming propositional satisfiability SMT SAT satisfiability modulo theory cylindrical algebraic decomposition quantifiers

Autor: David Monniaux -

Fuente: https://hal.archives-ouvertes.fr/


Documentos relacionados