Stanford University
| Tool | Description |
|---|---|
| Bitwuzla | Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size … |
| Boolector | [ Not Maintained Since 2024 ] Boolector is a Satisfiability Modulo Theories (SMT) solver for the … |
| cvc4 | [ Not Maintained Since 2021 ] cvc4 is an automatic theorem prover for SMT problems. It is succeeded … |
| cvc5 | cvc5 is an automatic theorem prover for SMT problems. |
| STP | STP is a constraint solver for quantifier-free bitvectors. APIs and Bindings This tool is available … |