Ready to deploy in beta more
This commit is contained in:
348
index.html
348
index.html
@@ -1,7 +1,7 @@
|
||||
<!DOCTYPE html>
|
||||
<html lang="en-us" dir="ltr">
|
||||
<head>
|
||||
<meta name="generator" content="Hugo 0.147.7"><script src="/livereload.js?mindelay=10&v=2&port=1313&path=livereload" data-no-instant defer></script>
|
||||
<meta name="generator" content="Hugo 0.147.7">
|
||||
<meta charset="utf-8">
|
||||
|
||||
<meta name="viewport" content ="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=no">
|
||||
@@ -15,16 +15,16 @@
|
||||
<meta property="og:type" content="article">
|
||||
<meta property="og:title" content="The Ultimate Formal Methods Toolbox">
|
||||
<meta property="og:description" content="Welcome to this collection of Formal Methods Tools, which aims to be the world’s most comprehensive source for information on tools for formal methods.">
|
||||
<meta property="og:url" content="http://localhost:1313/">
|
||||
<meta property="og:url" content="https://example.org/">
|
||||
<meta property="og:image" content="images/%!s(<nil>)">
|
||||
<link rel="canonical" href="http://localhost:1313/">
|
||||
<link rel="canonical" href="https://example.org/">
|
||||
|
||||
<link rel="apple-touch-icon" sizes="180x180" href='http://localhost:1313/apple-touch-icon.png'>
|
||||
<link rel="icon" type="image/png" sizes="32x32" href='http://localhost:1313/favicon-32x32.png'>
|
||||
<link rel="icon" type="image/png" sizes='16x16' href='http://localhost:1313/favicon-16x16.png'>
|
||||
<link rel="manifest" href='http://localhost:1313/site.webmanifest'>
|
||||
<link rel="apple-touch-icon" sizes="180x180" href='https://example.org/apple-touch-icon.png'>
|
||||
<link rel="icon" type="image/png" sizes="32x32" href='https://example.org/favicon-32x32.png'>
|
||||
<link rel="icon" type="image/png" sizes='16x16' href='https://example.org/favicon-16x16.png'>
|
||||
<link rel="manifest" href='https://example.org/site.webmanifest'>
|
||||
|
||||
<link rel="stylesheet" href="http://localhost:1313/css/styles.e5b470edf89c3e1b9498ce83a3fd0a2e73e9d06958e2c3a1af8d89781f9f2bf612b21d5e45ab8f4aef773661de2529437838673a136797a6a8aaab7759f94ded.css" integrity="sha512-5bRw7ficPhuUmM6Do/0KLnPp0GlY4sOhr42JeB+fK/YSsh1eRauPSu93NmHeJSlDeDhnOhNnl6aoqqt3WflN7Q==">
|
||||
<link rel="stylesheet" href="https://example.org/css/styles.9d797fdbc9887767b3ad88393155cb84288660765fe6e18c89e2e00fd5ecfb0b9f46384188a0ae4e8b63f4c81526872e0ff61d1d5204287a0c3c8b6e8e34b6b9.css" integrity="sha512-nXl/28mId2ezrYg5MVXLhCiGYHZf5uGMieLgD9Xs+wufRjhBiKCuTotj9MgVJocuD/YdHVIEKHoMPItujjS2uQ==">
|
||||
|
||||
<link href="/css/fontawesome.css" rel="stylesheet" />
|
||||
<link href="/css/brands.css" rel="stylesheet" />
|
||||
@@ -36,6 +36,14 @@
|
||||
|
||||
</head>
|
||||
<body>
|
||||
|
||||
<div class="banner">
|
||||
<span class="banner-text">
|
||||
🚧 This site is a work in progress. Don’t be shy to submit an <a href="https://gitmoss.fyi/fmtools/content/issues/new/choose" target="_blank" >issue</a> or <a href="https://gitmoss.fyi/fmtools/content/fork" target="_blank" >pull request</a> 🚧
|
||||
</span>
|
||||
</div>
|
||||
|
||||
|
||||
<header>
|
||||
<h1><a href="/">Formal Methods Tools</a></h1>
|
||||
|
||||
@@ -68,16 +76,16 @@
|
||||
<section>
|
||||
<p>Welcome to this collection of Formal Methods Tools, which aims to be the world’s most comprehensive source for information on tools for formal methods.
|
||||
From decades-old classics to cutting-edge tools, this site aims to put as much information as possible into one convenient place.
|
||||
<a href="/tools">Explore</a> a wide selection of tools, <a href="/contribute">contribute</a> tools you make or love, and help grow the formal methods community.</p>
|
||||
<a href="/tools" >Explore</a> a wide selection of tools, <a href="/contribute" >contribute</a> tools you make or love, and help grow the formal methods community.</p>
|
||||
<p>Below are some quick links that may be helpful, plus a random selection of tools (refreshed every time I push updates to this site).</p>
|
||||
<p><a href="/applications/smt-solver/" class="button">
|
||||
<p><a href="/tools" class="button">
|
||||
|
||||
SMT Solvers
|
||||
List of Tools
|
||||
|
||||
</a>
|
||||
<a href="/applications/model-checker/" class="button">
|
||||
<a href="/taxonomies" class="button">
|
||||
|
||||
Model Checkers
|
||||
Taxonomy Data
|
||||
|
||||
</a>
|
||||
<a href="/contribute" class="button">
|
||||
@@ -95,37 +103,13 @@ Contribute
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
Bitwuzla
|
||||
veriT
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p>Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point …</p>
|
||||
<a href="/tools/sat-smt/bitwuzla/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">Bitwuzla</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
Colibri
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p>Colibri is an SMT solver.
|
||||
</p>
|
||||
<a href="/tools/sat-smt/colibri/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">Colibri</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
cvc5
|
||||
|
||||
<span class="subtitle">Theorem Prover</span>
|
||||
|
||||
</h3>
|
||||
<p>cvc5 is an automatic theorem prover for SMT problems.
|
||||
</p>
|
||||
<a href="/tools/sat-smt/cvc5/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">cvc5</a>
|
||||
<p>veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is designed for use in formal …</p>
|
||||
<a href="/tools/sat-smt/verit/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">veriT</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
@@ -141,129 +125,15 @@ Contribute
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
Q3B
|
||||
SMT-RAT
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
<span class="subtitle">SMT Toolbox</span>
|
||||
|
||||
</h3>
|
||||
<p> [ Not Maintained Since 2023 ] Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.
|
||||
</p>
|
||||
<a href="/tools/sat-smt/q3b/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">Q3B</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
MiniSat
|
||||
|
||||
<span class="subtitle">SAT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p> [ Not Maintained Since 2013 ] MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and …</p>
|
||||
<a href="/tools/sat-smt/minisat/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">MiniSat</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
Boolector
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p> [ Not Maintained Since 2024 ] Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size …</p>
|
||||
<a href="/tools/sat-smt/boolector/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">Boolector</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
MathSAT
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p> [ Closed-Source Tool ] MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers …</p>
|
||||
<a href="/tools/sat-smt/mathsat/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">MathSAT</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
SMTInterpol
|
||||
|
||||
<span class="subtitle">Interpolating SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.
|
||||
APIs and Bindings This tool is …</p>
|
||||
<a href="/tools/sat-smt/smtinterpol/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">SMTInterpol</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
ParaFROST
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in …</p>
|
||||
<a href="/tools/sat-smt/parafrost/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">ParaFROST</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
veriT
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p>veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is designed for use in formal …</p>
|
||||
<a href="/tools/sat-smt/verit/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">veriT</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
Z3
|
||||
|
||||
<span class="subtitle">Theorem Prover</span>
|
||||
|
||||
</h3>
|
||||
<p>Z3 is a general-purpose theorem prover widely used for SAT & SMT solving.
|
||||
APIs and Bindings This tool is available …</p>
|
||||
<a href="/tools/sat-smt/z3/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">Z3</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
cvc4
|
||||
|
||||
<span class="subtitle">Theorem Prover</span>
|
||||
|
||||
</h3>
|
||||
<p> [ Not Maintained Since 2021 ] cvc4 is an automatic theorem prover for SMT problems. It is succeeded by cvc5
|
||||
</p>
|
||||
<a href="/tools/sat-smt/cvc4/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">cvc4</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
Lingeling
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p>Lingeling is a SAT solver.
|
||||
</p>
|
||||
<a href="/tools/sat-smt/lingeling/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">Lingeling</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
STP
|
||||
|
||||
<span class="subtitle">Simple Theorem Prover</span>
|
||||
|
||||
</h3>
|
||||
<p>STP is a constraint solver for quantifier-free bitvectors.
|
||||
APIs and Bindings This tool is available through the following …</p>
|
||||
<a href="/tools/sat-smt/stp/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">STP</a>
|
||||
<p>SMT-RAT is an SMT Real Algebra Toolbox.
|
||||
APIs and Bindings This tool is available through the following interfaces:
|
||||
C++ API: …</p>
|
||||
<a href="/tools/sat-smt/smt-rat/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">SMT-RAT</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
@@ -278,6 +148,18 @@ APIs and Bindings This tool is available through the following …</p>
|
||||
<a href="/tools/sat-smt/glucose/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">Glucose</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
Colibri
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p>Colibri is an SMT solver.
|
||||
</p>
|
||||
<a href="/tools/sat-smt/colibri/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">Colibri</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
Riss
|
||||
@@ -290,6 +172,109 @@ APIs and Bindings This tool is available through the following …</p>
|
||||
<a href="/tools/sat-smt/riss/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">Riss</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
STAMINA
|
||||
|
||||
<span class="subtitle">Probabilistic Model Checker</span>
|
||||
|
||||
</h3>
|
||||
<p>A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces with either Storm or PRISM. …</p>
|
||||
<a href="/tools/prob/stamina/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">STAMINA</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
ParaFROST
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in …</p>
|
||||
<a href="/tools/sat-smt/parafrost/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">ParaFROST</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
MiniSat
|
||||
|
||||
<span class="subtitle">SAT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p> [ Not Maintained Since 2013 ] MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and …</p>
|
||||
<a href="/tools/sat-smt/minisat/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">MiniSat</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
OpenSMT
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand …</p>
|
||||
<a href="/tools/sat-smt/opensmt/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">OpenSMT</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
Z3
|
||||
|
||||
<span class="subtitle">Theorem Prover</span>
|
||||
|
||||
</h3>
|
||||
<p>Z3 is a general-purpose theorem prover widely used for SAT & SMT solving.
|
||||
APIs and Bindings This tool is available …</p>
|
||||
<a href="/tools/sat-smt/z3/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">Z3</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
Q3B
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p> [ Not Maintained Since 2023 ] Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.
|
||||
</p>
|
||||
<a href="/tools/sat-smt/q3b/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">Q3B</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
STP
|
||||
|
||||
<span class="subtitle">Simple Theorem Prover</span>
|
||||
|
||||
</h3>
|
||||
<p>STP is a constraint solver for quantifier-free bitvectors.
|
||||
APIs and Bindings This tool is available through the following …</p>
|
||||
<a href="/tools/sat-smt/stp/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">STP</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
cvc4
|
||||
|
||||
<span class="subtitle">Theorem Prover</span>
|
||||
|
||||
</h3>
|
||||
<p> [ Not Maintained Since 2021 ] cvc4 is an automatic theorem prover for SMT problems. It is succeeded by cvc5
|
||||
</p>
|
||||
<a href="/tools/sat-smt/cvc4/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">cvc4</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
MathSAT
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p> [ Closed-Source Tool ] MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers …</p>
|
||||
<a href="/tools/sat-smt/mathsat/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">MathSAT</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
CryptoMiniSat
|
||||
@@ -305,26 +290,48 @@ C++ Namespace: …</p>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
dReal
|
||||
cvc5
|
||||
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
<span class="subtitle">Theorem Prover</span>
|
||||
|
||||
</h3>
|
||||
<p> [ Not Maintained Since 2023 ] dReal is an automated reasoning tool. It focuses on solving problems that can be encoded as …</p>
|
||||
<a href="/tools/sat-smt/dreal/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">dReal</a>
|
||||
<p>cvc5 is an automatic theorem prover for SMT problems.
|
||||
</p>
|
||||
<a href="/tools/sat-smt/cvc5/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">cvc5</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
SMT-RAT
|
||||
Boolector
|
||||
|
||||
<span class="subtitle">SMT Toolbox</span>
|
||||
<span class="subtitle">SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p>SMT-RAT is an SMT Real Algebra Toolbox.
|
||||
APIs and Bindings This tool is available through the following interfaces:
|
||||
C++ API: …</p>
|
||||
<a href="/tools/sat-smt/smt-rat/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">SMT-RAT</a>
|
||||
<p> [ Not Maintained Since 2024 ] Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size …</p>
|
||||
<a href="/tools/sat-smt/boolector/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">Boolector</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
SMTInterpol
|
||||
|
||||
<span class="subtitle">Interpolating SMT Solver</span>
|
||||
|
||||
</h3>
|
||||
<p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.
|
||||
APIs and Bindings This tool is …</p>
|
||||
<a href="/tools/sat-smt/smtinterpol/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">SMTInterpol</a>
|
||||
</article>
|
||||
|
||||
<article class="tool-card">
|
||||
<h3>
|
||||
PRISM
|
||||
|
||||
<span class="subtitle">Probabilistic Model Checker</span>
|
||||
|
||||
</h3>
|
||||
<p>PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or …</p>
|
||||
<a href="/tools/prob/prism/" style="position:absolute;top:0;left:0;width:100%;height:100%;z-index:1;text-indent:-9999px;overflow:hidden;">PRISM</a>
|
||||
</article>
|
||||
|
||||
</section>
|
||||
@@ -333,6 +340,7 @@ C++ API: …</p>
|
||||
<footer>
|
||||
<p><a href="/contribute">Contribute</a> | <a href="/about">About</a> | <a href="/license">License</a> | <a href="/privacy">Privacy</a> </p>
|
||||
|
||||
|
||||
<p>© Copyright 2025. An open-source project.</p>
|
||||
|
||||
</footer>
|
||||
|
Reference in New Issue
Block a user