Boolector 2.0
Open Access
- 1 June 2015
- journal article
- Published by SAGE Publications in Journal on Satisfiability, Boolean Modeling and Computation
- Vol. 9 (1) , 53-58
Abstract
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 techniqKeywords
This publication has 2 references indexed in Scilit:
- Turbo-charging Lemmas on demand with don't care reasoning2014
- Lemmas on Demand for the Extensional Theory of ArraysJournal on Satisfiability, Boolean Modeling and Computation, 2009