Boogie vs PRISM
Boogie
github.comPRISM
prismmodelchecker.orgSide by side
| Figure | Boogie | PRISM |
|---|---|---|
| Price from | Free | Free |
| Free plan | Yes | Yes |
| Free trial | — | — |
| Open source | — | — |
| Windows | Yes | Yes |
| macOS | Yes | Yes |
| Linux | Yes | Yes |
| Plans published | 1 | 1 |
| Spec score · Formal Verification Tools | 8.1 (#7) | 7.6 (#19) |
| Purpose | Boogie is an intermediate modeling and verification language used as a layer for building program verifiers for other languages. | PRISM is a probabilistic model checker for formal modelling and analysis of systems with random or probabilistic behaviour. |
| Support | The project directs users to its GitHub issue tracker to ask questions and report issues. | 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
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.
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.