Boolector: An efficient SMT solver for bit-vectors and arrays
R Brummayer, A Biere - Tools and Algorithms for the Construction and …, 2009 - Springer
R Brummayer, A Biere
Tools and Algorithms for the Construction and Analysis of Systems: 15th …, 2009•SpringerAbstract Satisfiability Modulo Theories (SMT) is the problem of deciding satisfiability of a
logical formula, expressed in a combination of first-order theories. We present the
architecture and selected features of Boolector, which is an efficient SMT solver for the
quantifier-free theories of bit-vectors and arrays. It uses term rewriting, bit-blasting to handle
bit-vectors, and lemmas on demand for arrays.
logical formula, expressed in a combination of first-order theories. We present the
architecture and selected features of Boolector, which is an efficient SMT solver for the
quantifier-free theories of bit-vectors and arrays. It uses term rewriting, bit-blasting to handle
bit-vectors, and lemmas on demand for arrays.
Abstract
Satisfiability Modulo Theories (SMT) is the problem of deciding satisfiability of a logical formula, expressed in a combination of first-order theories. We present the architecture and selected features of Boolector, which is an efficient SMT solver for the quantifier-free theories of bit-vectors and arrays. It uses term rewriting, bit-blasting to handle bit-vectors, and lemmas on demand for arrays.
Springer
Showing the best result for this search. See all results