论文信息 - Boolector 2 . 0 system description

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.

Armin Biere | Aina Niemetz | Mathias Preiner

[1] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.

[2] Armin Biere,et al. Lemmas on demand for the extensional theory of arrays , 2008, SMT '08/BPR '08.

[3] Armin Biere,et al. Fuzzing and delta-debugging SMT solvers , 2009, SMT '09.

[4] Robert Brummayer,et al. Efficient SMT solving for bit vectors and the extensional theory of arrays , 2010 .

[5] Aina Niemetz. ddSMT : A Delta Debugger for the SMT-LIB v 2 Format ∗ , 2013 .

[6] Armin Biere,et al. Efficiently Solving Bit-Vector Problems Using Model Checkers , 2013 .

[7] Armin Biere,et al. Model-Based Testing for Verification Back-Ends , 2013, TAP@STAF.

[8] Armin Biere,et al. Lemmas on Demand for Lambdas , 2013, DIFTS@FMCAD.

[9] Armin Biere. Yet another Local Search Solver and Lingeling and Friends Entering the SAT Competition 2014 , 2014 .

[10] Armin Biere,et al. Turbo-charging Lemmas on demand with don't care reasoning , 2014, 2014 Formal Methods in Computer-Aided Design (FMCAD).