cvc5 vs TLA+
cvc5
cvc5.github.ioTLA+
lamport.azurewebsites.netSide by side
| Figure | cvc5 | TLA+ |
|---|---|---|
| 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.7 (#1) | 7.5 (#24) |
| Platforms | The project provides source and binary releases for Linux, MacOS, and Windows. | The Toolbox download instructions cover Windows, Mac OS, and Linux. |
| Purpose | cvc5 is an efficient open-source automatic theorem prover for satisfiability modulo theories problems. | TLA+ is a high-level language for modeling software and hardware systems, especially concurrent and distributed systems. |
| Support | The project directs bug reports to its GitHub issue tracker and questions, feature requests, and contributions to GitHub Discussions. | The TLA+ Foundation directs technical questions and issues to the appropriate GitHub issue tracker. |
Plans
In their own words
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.
TLA+
TLA+ has no write-up on Specifiction yet; its figures are above.