Boolector at the SMT Competition 2017
نویسندگان
چکیده
This paper serves as solver description for our SMT solver Boolector as entered into the SMT Competition 2017. We only list important differences to the version of Boolector that entered the SMT Competition 2016 [5]. For further and more detailed information, we refer to [3, 4, 7] or source code.
منابع مشابه
Boolector at the SMT Competition 2015
This paper serves as solver description for our SMT solver Boolector, entering the SMT Competition 2015 in three different configurations. We only list important differences to the earlier version of Boolector that participated in the SMT Competition 2014 [2]. For further information we refer to [3] or source code.
متن کاملBoolector at the SMT Competition 2016
This paper serves as solver description for our SMT solver Boolector, entering the SMT Competition 2016 in two different configurations. We only list important differences to earlier version of Boolector in the SMT Competition 2015 [3]. For further information we refer to [2] or source code.
متن کاملBoolector at the SMT Competition 2014
This paper serves as solver description for our SMT solver Boolector entering the SMT Competition 2014 in three different configurations. We only list important differences to the earlier version of Boolector that participated in the SMT Competition 2012 [2]. For further information we refer to [2] or source code.
متن کاملBoolector 2 . 0 system description
In this paper, we discuss the most important changes and new features introduced with version 2.0 of our SMT solver Boolector, which placed first in the QF BV and QF ABV tracks of the SMT competition 2014. We further outline some features and techniques that were not yet described in the context of Boolector.
متن کاملBoolector: An Efficient SMT Solver for Bit-Vectors and Arrays
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 ar...
متن کامل