cvc5 vs PRISM
cvc5
cvc5.github.ioPRISM
prismmodelchecker.orgSide by side
| Figure | cvc5 | PRISM |
|---|---|---|
| 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.6 (#19) |
| Purpose | cvc5 is an efficient open-source automatic theorem prover for satisfiability modulo theories problems. | PRISM is a probabilistic model checker for formal modelling and analysis of systems with random or probabilistic behaviour. |
| Support | The project directs bug reports to its GitHub issue tracker and questions, feature requests, and contributions to GitHub Discussions. | The project directs users to its FAQ and manual, and invites other questions, feedback, bug reports, and feature requests through its forum or 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.
PRISM
PRISM is a probabilistic model checker for formal modelling and analysis of systems with random or probabilistic behaviour. It supports discrete-time and continuous-time Markov chains, Markov decision processes, probabilistic automata, probabilistic timed automata, partially observable models, and interval models; costs and rewards can extend supported models. Its property language includes PCTL, CSL, LTL, and PCTL*, with quantitative and costs/rewards extensions. Analysis options include BDD- and MTBDD-based symbolic algorithms, discrete-event simulation for approximate or statistical checking, quantitative abstraction refinement, and symmetry reduction. The tool accepts the PRISM language, PEPA, and SBML, and supports temporal-logic formalisms and counterexamples. Version 4.10.1 supports UMB import and export, POMDP import from explicit files, and optional exchange of initial state information through a .tra file. PRISM is free and open source under GNU General Public License version 2. It runs on Linux, Windows, and macOS and requires Java 11 or later; binary distributions require the Java Runtime Environment.