A Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions.
Documentation
BibTex
Publications
Slides
SMT competitions
People
Download Archive
Third Party Contributions
Boolector version 3.2.0 released.
Boolector version 3.1.0 released.
In the SMT competition 2019, Boolector won in divisions QF_ABV (Single Query and Challenge track), QF_BV (Single Query, Challenge and Model Validation track) and QF_AUFBV (Challenge track). Boolector further won 3 silver trophies for 2nd place in Biggest Lead in the Challenge track, and Largest Contribution in the Challenge and Incremental track.
In the SMT competition 2018, Boolector won in divisions QF_ABV (Main and Application track), QF_BV (Main track) and QF_UFBV (Main and Application track). Boolector further won one medal in the FLOC olympic games 2018.
Boolector version 3.0.0 released.
Boolector is now hosted on GitHub and licensed under the MIT License.
Get the latest release from GitHub.
Find the documentation of Boolector’s public C and Python APIs here.
If you cite Boolector >= version 2.0, please use the system description in JSAT volum 9 (BibTex) as listed below:
@article{DBLP:journals/jsat/NiemetzPB14,
author = {Aina Niemetz and
Mathias Preiner and
Armin Biere},
title = {Boolector 2.0},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {9},
number = {1},
pages = {53--58},
year = {2014},
url = {https://doi.org/10.3233/sat190101},
doi = {10.3233/sat190101},
biburl = {https://dblp.org/rec/journals/jsat/NiemetzPB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Boolector is hosted on GitHub and licensed under the MIT License.
Please use the Boolector issue tracker for bug reports. For questions, comments or information on new releases, please use our Google group.