FICHA · AUR
boolector
Boolector is an efficient SMT solver for the quantifier-free theory of bit-vectors in combination with the quantifier-free extensional theory of arrays.
- smt-solver
- CLI
- Dev
- FORMAL-METHODS
- Launchable
- Runs in terminal
· official+codex · reviewed · May 30, 2026 description in en
Bit-vector and array logic problems can be solved with an efficient SMT solver. It is useful for formal verification, symbolic execution, hardware analysis, and research tools.
Solver answers depend on the encoded model and assumptions. Treat results as part of a verification workflow and keep formulas reproducible.
How to run
boolector
Commands: boolector
Permissions
Permissions not analysed for this source yet.