HOL4 vs SPIN
HOL4
hol-theorem-prover.orgSPIN
spinroot.comSide by side
| Figure | HOL4 | SPIN |
|---|---|---|
| Price from | Free | Free |
| Free plan | Yes | Yes |
| Free trial | — | — |
| Open source | — | — |
| Windows | Yes | Yes |
| macOS | Yes | Yes |
| Linux | Yes | Yes |
| Self-hosted | Yes | — |
| Plans published | 1 | 1 |
| Spec score · Formal Verification Tools | 8.1 (#9) | 7.5 (#23) |
| License | HOL is free software released under the Modified (3-clause) BSD licence. | Starting with SPIN version 6.4.5, its code, sources, and executables are available under the BSD 3-Clause license. |
| Purpose | HOL4 is a proof assistant for higher-order logic and a programming environment for proving theorems and implementing proof tools. | SPIN analyzes the logical consistency of asynchronous systems, including distributed software and communication protocols. |
Plans
In their own words
HOL4
HOL4 is a free, interactive proof assistant for higher-order logic, with a programming environment for proving theorems and building proof tools. It supports work that combines deduction, execution, and property checking. Built-in decision procedures and theorem provers can establish many simple theorems, and an oracle mechanism can connect to external programs such as SMT and BDD engines. HOL4 supports higher-order logic and Standard ML, and can produce proof artifacts and counterexamples. It is self-hosted and listed for Linux, macOS, and Windows. A Standard ML compiler is required, with Poly/ML recommended; Moscow ML and MLTon are also supported for building tool executables. Windows installation can use Cygwin or the Windows Linux subsystem with Poly/ML. Moscow ML is another option, but the Windows guide notes that it is slower, lacks some Poly/ML libraries, and cannot run concurrent Holmake builds. HOL includes Emacs modes for syntax display and session interaction, and the installation guide links to Vim plugin documentation. Online materials include a tutorial, quick reference, FAQ, manuals, and generated indexes.
SPIN
SPIN is a free, self-hosted model-checking tool for analyzing the logical consistency of asynchronous systems, including distributed software and communication protocols. Systems are specified in Promela, which represents asynchronous processes, nondeterministic choices, loops, and local or global variables. Models can state correctness requirements, including linear temporal logic. SPIN supports interactive, guided, and random simulations of execution. For verification, it generates a C program for exhaustive or approximate checking of those requirements. Its product description lists detection of deadlocks, race conditions, incomplete specifications, and unjustified assumptions about process speeds. Partial order reduction optimizes verification runs, while the site provides guidance for multicore depth-first and breadth-first algorithms and swarm methods for large state spaces. SPIN runs on Linux, macOS, and Windows, as well as other listed systems. From version 6.4.5, its code, sources, and executables use the BSD 3-Clause license. Verification requires a working C compiler and preprocessor. The optional iSpin graphical interface is written in Tcl/Tk and requires Tcl/Tk.