At a Glance
| Applications | SMT Solver Theorem Prover SAT Solver |
| Developers | Stanford University Johannes Kepler Universität Linz |
| Inputs | SMTLIB2 |
| Interfaces | CLI |
| Licenses | MIT |
| Maintenance | Not Maintained |
Description
Not Maintained Since 2024
Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions.
Succeeded by Bitwuzla
Publications
- Boolector 2.0 (2014) (53-58) | Appears in J. Satisf. Boolean Model. Comput. | Volume 9 | 10.3233/sat190101