Boogie vs cvc5
Boogie
github.com
cvc5
cvc5.github.ioSide by side
| Figure | Boogie | cvc5 |
|---|---|---|
| Price from | Free | Free |
| Free plan | Yes | Yes |
| Free trial | — | — |
| Open source | — | — |
| Web | — | Yes |
| Windows | Yes | Yes |
| macOS | Yes | Yes |
| Linux | Yes | Yes |
| API | — | Yes |
| Self-hosted | — | Yes |
| Plans published | 1 | 1 |
| Spec score · Formal Verification Tools | 8.1 (#7) | 8.7 (#1) |
| Integrations | The repository lists VCC and HAVOC for C, and Dafny, Chalice, Spec#, and Move verifiers as projects built on Boogie. | The project lists applications using cvc5, including Kind 2 and QMaxUSE as backend solvers, and TRLC through PyVCG for proving absence of runtime errors. |
| Purpose | Boogie is an intermediate modeling and verification language used as a layer for building program verifiers for other languages. | cvc5 is an efficient open-source automatic theorem prover for satisfiability modulo theories problems. |
| Support | The project directs users to its GitHub issue tracker to ask questions and report issues. | The project directs bug reports to its GitHub issue tracker and questions, feature requests, and contributions to GitHub Discussions. |
Plans
In their own words
Boogie
Boogie is a modeling language and tool for building program verifiers for other languages. It accepts Boogie language input, can optionally infer invariants, and generates verification conditions for an SMT solver. Z3 is the default solver; CVC5 and Yices2 support is experimental. The Civl extension lets users model concurrent and distributed systems. Boogie is self-hosted and distributed as a.NET global tool through NuGet. It requires.NET and a supported SMT solver, and the NuGet listing identifies version 3.5.7 as targeting.NET 8.0 or higher. The project uses the MIT License and is free at free. The repository names VCC and HAVOC for C, along with Dafny, Chalice, Spec#, and Move verifiers, as projects built on Boogie. Yices2 has a stated constraint: it works for unquantified fragments such as arrays, arithmetic, and bitvectors, but not for quantifiers, generalized arrays, or datatypes. Users can ask questions or report issues through the project issue tracker, and contributions are accepted through pull requests.
cvc5
cvc5 is a free, open-source solver for satisfiability modulo theories problems. It determines whether first-order formulas are satisfiable or valid across combinations of background theories, including arrays, bit-vectors, floating-point numbers, arithmetic, and strings. It also has a Syntax-Guided Synthesis engine for synthesizing functions against those theories.
The solver can run as a standalone command-line tool or be used as a library, with C++, C, Java, and Python APIs. Its binary accepts SMT-LIB v2 and SyGuS-IF input, and it can produce proofs and unsatisfiable cores to explain unsatisfiability results. The project links to an online interface for running SMT-LIB scripts and provides source releases and binaries for Linux, macOS, and Windows. cvc5 is led jointly by Stanford University and the University of Iowa. Research and commercial use are described as essentially unrestricted. The default license is modified BSD; using optional GPLv3 dependencies makes the combined work subject to GPLv3.