Alloy Analyzer vs cvc5
Alloy Analyzer
alloytools.org
cvc5
cvc5.github.ioSide by side
| Figure | Alloy Analyzer | 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 | Yes |
| Self-hosted | — | Yes |
| Plans published | 1 | 1 |
| Spec score · Formal Verification Tools | 8.1 (#6) | 8.7 (#1) |
| Platforms | The download page identifies Alloy 6.2.0 and says it includes a version for macOS High Sierra; it also describes running the JAR with Java. | The project provides source and binary releases for Linux, MacOS, and Windows. |
| Purpose | Alloy is a language for describing evolving structures, and the Alloy Analyzer explores models by finding structures that satisfy constraints or counterexamples to properties. | cvc5 is an efficient open-source automatic theorem prover for satisfiability modulo theories problems. |
Plans
In their own words
Alloy Analyzer
Alloy Analyzer is a free model-checking tool for describing systems in the Alloy language and exploring the structures those descriptions permit. It searches for structures that satisfy constraints and for counterexamples to properties. Models can represent collections of structures that change over time, including security configurations and switching network topologies. The Analyzer presents results graphically, with appearance options that can be tailored to a domain. Alloy 6 adds mutable state, temporal logic, and temporal model checking; that checking requires NuSMV or nuXmv to be installed and available in PATH. The self-contained executable includes the Pardinus/Kodkod model finder, SAT solvers, the standard Alloy library, tutorial examples, and source code. The same JAR can be used as an API in other applications. Sterling adds a web-based visualizer with graph and table views, customizable and extendable with JavaScript. Alloy is self-hosted, supports Linux, macOS, Windows, and API use, and is maintained by volunteers.
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.