From fb51f11cd44675e061e494d500ee43d2ded7a76a Mon Sep 17 00:00:00 2001 From: Landon Taylor Date: Fri, 13 Jun 2025 13:09:07 -0600 Subject: [PATCH] Ready to deploy in beta more --- 404.html | 25 +- about/index.html | 29 +- applications/constraint-solver/index.html | 25 +- applications/constraint-solver/index.xml | 10 +- applications/index.html | 61 +- applications/index.xml | 34 +- applications/model-checker/index.html | 113 ++ applications/model-checker/index.xml | 19 + .../probabilistic-model-checker/index.html | 129 ++ .../probabilistic-model-checker/index.xml | 33 + applications/sat-solver/index.html | 25 +- applications/sat-solver/index.xml | 60 +- applications/smt-solver/index.html | 25 +- applications/smt-solver/index.xml | 80 +- applications/theorem-prover/index.html | 25 +- applications/theorem-prover/index.xml | 36 +- contribute/index.html | 31 +- ...6872e0ff61d1d5204287a0c3c8b6e8e34b6b9.css} | 60 + css/styles.css.map | 4 +- .../albert-ludwigs-universität/index.html | 25 +- .../albert-ludwigs-universität/index.xml | 10 +- developers/cea/index.html | 25 +- developers/cea/index.xml | 8 +- .../disi-university-of-trento/index.html | 25 +- .../disi-university-of-trento/index.xml | 8 +- .../index.html | 25 +- .../index.xml | 10 +- .../fondazione-bruno-kessler/index.html | 25 +- developers/fondazione-bruno-kessler/index.xml | 8 +- developers/gilles-audemard/index.html | 25 +- developers/gilles-audemard/index.xml | 8 +- developers/index.html | 61 +- developers/index.xml | 114 +- developers/inria-rhône-alpes/index.html | 25 +- developers/inria-rhône-alpes/index.xml | 10 +- .../index.html | 25 +- .../index.xml | 14 +- developers/laurent-simon/index.html | 25 +- developers/laurent-simon/index.xml | 8 +- developers/loria/index.html | 25 +- developers/loria/index.xml | 8 +- developers/masaryk-university/index.html | 25 +- developers/masaryk-university/index.xml | 8 +- developers/microsoft-research/index.html | 25 +- developers/microsoft-research/index.xml | 10 +- developers/niklas-eén/index.html | 25 +- developers/niklas-eén/index.xml | 8 +- developers/niklas-sörensson/index.html | 25 +- developers/niklas-sörensson/index.xml | 8 +- developers/norbert-manthey/index.html | 25 +- developers/norbert-manthey/index.xml | 8 +- developers/oxford-university/index.html | 112 ++ developers/oxford-university/index.xml | 19 + developers/rwth-aachen/index.html | 34 +- developers/rwth-aachen/index.xml | 17 +- developers/sri-international/index.html | 34 +- developers/sri-international/index.xml | 17 +- developers/stanford-university/index.html | 25 +- developers/stanford-university/index.xml | 30 +- developers/uliege/index.html | 25 +- developers/uliege/index.xml | 8 +- developers/university-of-freiburg/index.html | 25 +- developers/university-of-freiburg/index.xml | 10 +- developers/university-of-illinois/index.html | 25 +- developers/university-of-illinois/index.xml | 10 +- developers/university-of-iowa/index.html | 25 +- developers/university-of-iowa/index.xml | 14 +- developers/university-of-lugano/index.html | 25 +- developers/university-of-lugano/index.xml | 10 +- developers/university-of-virginia/index.html | 25 +- developers/university-of-virginia/index.xml | 10 +- developers/utah-state-university/index.html | 112 ++ developers/utah-state-university/index.xml | 19 + domains/index.html | 25 +- domains/index.xml | 4 +- index.html | 348 ++-- index.xml | 156 +- inputs/cnf/index.html | 25 +- inputs/cnf/index.xml | 14 +- inputs/dimacs/index.html | 25 +- inputs/dimacs/index.xml | 14 +- inputs/galileo/index.html | 113 ++ inputs/galileo/index.xml | 19 + inputs/greatspn/index.html | 113 ++ inputs/greatspn/index.xml | 19 + inputs/index.html | 151 +- inputs/index.xml | 69 +- inputs/jani/index.html | 113 ++ inputs/jani/index.xml | 19 + inputs/mrmc/index.html | 121 ++ inputs/mrmc/index.xml | 26 + inputs/pnml/index.html | 113 ++ inputs/pnml/index.xml | 19 + inputs/prism/index.html | 129 ++ inputs/prism/index.xml | 33 + inputs/sally/index.html | 113 ++ inputs/sally/index.xml | 19 + inputs/smtlib2/index.html | 25 +- inputs/smtlib2/index.xml | 78 +- inputs/yices-2/index.html | 25 +- inputs/yices-2/index.xml | 10 +- interfaces/.net/index.html | 25 +- interfaces/.net/index.xml | 10 +- interfaces/c++/index.html | 34 +- interfaces/c++/index.xml | 29 +- interfaces/c/index.html | 25 +- interfaces/c/index.xml | 16 +- interfaces/cli/index.html | 59 +- interfaces/cli/index.xml | 138 +- interfaces/index.html | 25 +- interfaces/index.xml | 36 +- interfaces/java/index.html | 33 +- interfaces/java/index.xml | 23 +- interfaces/online/index.html | 33 +- interfaces/online/index.xml | 29 +- interfaces/python/index.html | 34 +- interfaces/python/index.xml | 35 +- interfaces/rust/index.html | 25 +- interfaces/rust/index.xml | 16 +- license/index.html | 25 +- licenses/all-rights-reserved/index.html | 25 +- licenses/all-rights-reserved/index.xml | 8 +- licenses/apache-2.0/index.html | 25 +- licenses/apache-2.0/index.xml | 8 +- licenses/bsd/index.html | 25 +- licenses/bsd/index.xml | 18 +- licenses/gplv2/index.html | 42 +- licenses/gplv2/index.xml | 24 +- licenses/gplv3/index.html | 42 +- licenses/gplv3/index.xml | 42 +- licenses/index.html | 25 +- licenses/index.xml | 32 +- licenses/lgplv2/index.html | 25 +- licenses/lgplv2/index.xml | 8 +- licenses/mit/index.html | 33 +- licenses/mit/index.xml | 65 +- maintenance/actively-maintained/index.html | 59 +- maintenance/actively-maintained/index.xml | 108 +- maintenance/index.html | 25 +- maintenance/index.xml | 12 +- maintenance/not-maintained/index.html | 25 +- maintenance/not-maintained/index.xml | 32 +- privacy/index.html | 25 +- sitemap.xml | 228 ++- taxonomies/index.html | 212 ++- taxonomies/index.xml | 4 +- techniques/cdcl/index.html | 25 +- techniques/cdcl/index.xml | 10 +- techniques/gpu/index.html | 25 +- techniques/gpu/index.xml | 10 +- techniques/index.html | 25 +- techniques/index.xml | 12 +- tools/index.html | 1474 +++++++++++------ tools/index.xml | 4 +- tools/mc/index.html | 242 +++ tools/mc/index.xml | 19 + tools/mc/sally/index.html | 341 ++++ tools/pmc/index.html | 114 -- tools/pmc/index.xml | 12 - tools/prob/index.html | 515 ++++++ tools/prob/index.xml | 33 + tools/prob/prism/index.html | 447 +++++ tools/prob/stamina/index.html | 449 +++++ tools/prob/storm/index.html | 532 ++++++ tools/sat-smt/bitwuzla/index.html | 135 +- tools/sat-smt/boolector/index.html | 141 +- tools/sat-smt/colibri/index.html | 29 +- tools/sat-smt/cryptominisat/index.html | 151 +- tools/sat-smt/cvc4/index.html | 51 +- tools/sat-smt/cvc5/index.html | 45 +- tools/sat-smt/dreal/index.html | 29 +- tools/sat-smt/glucose/index.html | 29 +- tools/sat-smt/index.html | 936 ++++++----- tools/sat-smt/index.xml | 112 +- tools/sat-smt/lingeling/index.html | 31 +- tools/sat-smt/mathsat/index.html | 45 +- tools/sat-smt/minisat/index.html | 29 +- tools/sat-smt/opensmt/index.html | 31 +- tools/sat-smt/parafrost/index.html | 93 +- tools/sat-smt/q3b/index.html | 45 +- tools/sat-smt/riss/index.html | 29 +- tools/sat-smt/smt-rat/index.html | 79 +- tools/sat-smt/smtinterpol/index.html | 47 +- tools/sat-smt/stp/index.html | 113 +- tools/sat-smt/verit/index.html | 61 +- tools/sat-smt/yices/index.html | 99 +- tools/sat-smt/z3/index.html | 243 ++- tools/termination/index.html | 41 +- tools/termination/index.xml | 8 +- 189 files changed, 9460 insertions(+), 3385 deletions(-) create mode 100644 applications/model-checker/index.html create mode 100644 applications/model-checker/index.xml create mode 100644 applications/probabilistic-model-checker/index.html create mode 100644 applications/probabilistic-model-checker/index.xml rename css/{styles.e5b470edf89c3e1b9498ce83a3fd0a2e73e9d06958e2c3a1af8d89781f9f2bf612b21d5e45ab8f4aef773661de2529437838673a136797a6a8aaab7759f94ded.css => styles.9d797fdbc9887767b3ad88393155cb84288660765fe6e18c89e2e00fd5ecfb0b9f46384188a0ae4e8b63f4c81526872e0ff61d1d5204287a0c3c8b6e8e34b6b9.css} (91%) create mode 100644 developers/oxford-university/index.html create mode 100644 developers/oxford-university/index.xml create mode 100644 developers/utah-state-university/index.html create mode 100644 developers/utah-state-university/index.xml create mode 100644 inputs/galileo/index.html create mode 100644 inputs/galileo/index.xml create mode 100644 inputs/greatspn/index.html create mode 100644 inputs/greatspn/index.xml create mode 100644 inputs/jani/index.html create mode 100644 inputs/jani/index.xml create mode 100644 inputs/mrmc/index.html create mode 100644 inputs/mrmc/index.xml create mode 100644 inputs/pnml/index.html create mode 100644 inputs/pnml/index.xml create mode 100644 inputs/prism/index.html create mode 100644 inputs/prism/index.xml create mode 100644 inputs/sally/index.html create mode 100644 inputs/sally/index.xml create mode 100644 tools/mc/index.html create mode 100644 tools/mc/index.xml create mode 100644 tools/mc/sally/index.html delete mode 100644 tools/pmc/index.html delete mode 100644 tools/pmc/index.xml create mode 100644 tools/prob/index.html create mode 100644 tools/prob/index.xml create mode 100644 tools/prob/prism/index.html create mode 100644 tools/prob/stamina/index.html create mode 100644 tools/prob/storm/index.html diff --git a/404.html b/404.html index 539cb1d..839b675 100644 --- a/404.html +++ b/404.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -74,6 +82,7 @@ diff --git a/about/index.html b/about/index.html index 43d0164..9c1ce0b 100644 --- a/about/index.html +++ b/about/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -78,9 +86,9 @@ This is one of my hobby projects. I have a passion for formal methods. When I started learning about verification, there was a sharp barrier to entry due partially to the sprawl of content online. I wanted to solve this problem, so I have been chipping away at this website for a while now.

-

I love to collaborate, either on this website or on any of my other formal methods projects. Please feel free to reach out if you want to talk.

+

I love to collaborate, either on this website or on any of my other formal methods projects. Please feel free to reach out if you want to talk.

Get Involved

-

I welcome contributions from anyone interested in formal methods. Add tools you love or maintain, report issues, or fix a typo. Learn more on the Contribute page.

+

I welcome contributions from anyone interested in formal methods. Add tools you love or maintain, report issues, or fix a typo. Learn more on the Contribute page.

@@ -91,6 +99,7 @@ I wanted to solve this problem, so I have been chipping away at this website for diff --git a/applications/constraint-solver/index.html b/applications/constraint-solver/index.html index 5f4733b..b124272 100644 --- a/applications/constraint-solver/index.html +++ b/applications/constraint-solver/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -97,6 +105,7 @@ APIs and Bindings This tool is available … diff --git a/applications/constraint-solver/index.xml b/applications/constraint-solver/index.xml index 7b0a509..e264b7e 100644 --- a/applications/constraint-solver/index.xml +++ b/applications/constraint-solver/index.xml @@ -2,18 +2,18 @@ Constraint Solver on Formal Methods Tools - http://localhost:1313/applications/constraint-solver/ + https://example.org/applications/constraint-solver/ Recent content in Constraint Solver on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + STP - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/stp/ - <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/stp/ + <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage" target="_blank" >stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage" target="_blank" >stp PyPI package</a></li> </ul> diff --git a/applications/index.html b/applications/index.html index 46e44a6..70963da 100644 --- a/applications/index.html +++ b/applications/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -88,6 +96,42 @@ + + Model Checker + + + + + + + + + + + + + + Probabilistic Model Checker + + + + + + + + + + + +

Contribute  |  About  |  License  |  Privacy

+

© Copyright 2025. An open-source project.

diff --git a/applications/index.xml b/applications/index.xml index 56f8230..d08929c 100644 --- a/applications/index.xml +++ b/applications/index.xml @@ -2,38 +2,52 @@ Applications on Formal Methods Tools - http://localhost:1313/applications/ + https://example.org/applications/ Recent content in Applications on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Constraint Solver - http://localhost:1313/applications/constraint-solver/ + https://example.org/applications/constraint-solver/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/applications/constraint-solver/ + https://example.org/applications/constraint-solver/ + + + + Model Checker + https://example.org/applications/model-checker/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/applications/model-checker/ + + + + Probabilistic Model Checker + https://example.org/applications/probabilistic-model-checker/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/applications/probabilistic-model-checker/ SAT Solver - http://localhost:1313/applications/sat-solver/ + https://example.org/applications/sat-solver/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/applications/sat-solver/ + https://example.org/applications/sat-solver/ SMT Solver - http://localhost:1313/applications/smt-solver/ + https://example.org/applications/smt-solver/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/applications/smt-solver/ + https://example.org/applications/smt-solver/ Theorem Prover - http://localhost:1313/applications/theorem-prover/ + https://example.org/applications/theorem-prover/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/applications/theorem-prover/ + https://example.org/applications/theorem-prover/ diff --git a/applications/model-checker/index.html b/applications/model-checker/index.html new file mode 100644 index 0000000..59b5815 --- /dev/null +++ b/applications/model-checker/index.html @@ -0,0 +1,113 @@ + + + + + + + + +Model Checker | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Model Checker + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
SallySally is a model checker for infinite state systems described as transition systems. +
+ +
+ + + diff --git a/applications/model-checker/index.xml b/applications/model-checker/index.xml new file mode 100644 index 0000000..6edf740 --- /dev/null +++ b/applications/model-checker/index.xml @@ -0,0 +1,19 @@ + + + + Model Checker on Formal Methods Tools + https://example.org/applications/model-checker/ + Recent content in Model Checker on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + Sally + https://example.org/tools/mc/sally/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/mc/sally/ + <p>Sally is a model checker for infinite state systems described as transition systems.</p> + + + diff --git a/applications/probabilistic-model-checker/index.html b/applications/probabilistic-model-checker/index.html new file mode 100644 index 0000000..b5a1ebc --- /dev/null +++ b/applications/probabilistic-model-checker/index.html @@ -0,0 +1,129 @@ + + + + + + + + +Probabilistic Model Checker | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Probabilistic Model Checker + +

+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
ToolDescription
PRISMPRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that …
STAMINAA state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces …
StormStorm is a tool for the analysis of systems involving random or probabilistic phenomena. +
+ +
+ + + diff --git a/applications/probabilistic-model-checker/index.xml b/applications/probabilistic-model-checker/index.xml new file mode 100644 index 0000000..22dd233 --- /dev/null +++ b/applications/probabilistic-model-checker/index.xml @@ -0,0 +1,33 @@ + + + + Probabilistic Model Checker on Formal Methods Tools + https://example.org/applications/probabilistic-model-checker/ + Recent content in Probabilistic Model Checker on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + PRISM + https://example.org/tools/prob/prism/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/prism/ + <p>PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or probabilistic behaviour.</p> + + + STAMINA + https://example.org/tools/prob/stamina/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/stamina/ + <p>A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces with either <a href="../storm" >Storm</a> or <a href="../prism" >PRISM</a>.</p> + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> + + + diff --git a/applications/sat-solver/index.html b/applications/sat-solver/index.html index 3963d33..b472579 100644 --- a/applications/sat-solver/index.html +++ b/applications/sat-solver/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -182,6 +190,7 @@ APIs and Bindings This … diff --git a/applications/sat-solver/index.xml b/applications/sat-solver/index.xml index a04eb06..ebad5fd 100644 --- a/applications/sat-solver/index.xml +++ b/applications/sat-solver/index.xml @@ -2,88 +2,88 @@ SAT Solver on Formal Methods Tools - http://localhost:1313/applications/sat-solver/ + https://example.org/applications/sat-solver/ Recent content in SAT Solver on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Bitwuzla - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ <p>Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.</p> Boolector - http://localhost:1313/tools/sat-smt/boolector/ + https://example.org/tools/sat-smt/boolector/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/boolector/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla">Bitwuzla</a></p> + https://example.org/tools/sat-smt/boolector/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla" >Bitwuzla</a></p> CryptoMiniSat - http://localhost:1313/tools/sat-smt/cryptominisat/ + https://example.org/tools/sat-smt/cryptominisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cryptominisat/ - <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/">homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/">PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/cryptominisat/ + <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/" target="_blank" >homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/" target="_blank" >PyPI package</a></li> </ul> Glucose - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ <p>Glucose is a SAT solver.</p> Lingeling - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ <p>Lingeling is a SAT solver.</p> MiniSat - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2013</span> <span style="display:none">]</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> ParaFROST - http://localhost:1313/tools/sat-smt/parafrost/ + https://example.org/tools/sat-smt/parafrost/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/parafrost/ - <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/parafrost/ + <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> Riss - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2017</span> <span style="display:none">]</span> </div> Riss is a SAT solving tool collection.</p> SMT-RAT - http://localhost:1313/tools/sat-smt/smt-rat/ + https://example.org/tools/sat-smt/smt-rat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smt-rat/ - <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25">C++ API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smt-rat/ + <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25" target="_blank" >C++ API Reference</a></li> </ul> Yices 2 - http://localhost:1313/tools/sat-smt/yices/ + https://example.org/tools/sat-smt/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/yices/ - <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html">Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/">yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2">yices2 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/yices/ + <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html" target="_blank" >Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/" target="_blank" >yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2" target="_blank" >yices2 crate on crates.io</a></li> </ul> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/applications/smt-solver/index.html b/applications/smt-solver/index.html index 64630b0..0eaf7b9 100644 --- a/applications/smt-solver/index.html +++ b/applications/smt-solver/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -214,6 +222,7 @@ APIs and Bindings This … diff --git a/applications/smt-solver/index.xml b/applications/smt-solver/index.xml index b4309c0..cdb1ba0 100644 --- a/applications/smt-solver/index.xml +++ b/applications/smt-solver/index.xml @@ -2,116 +2,116 @@ SMT Solver on Formal Methods Tools - http://localhost:1313/applications/smt-solver/ + https://example.org/applications/smt-solver/ Recent content in SMT Solver on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Bitwuzla - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ <p>Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.</p> Boolector - http://localhost:1313/tools/sat-smt/boolector/ + https://example.org/tools/sat-smt/boolector/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/boolector/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla">Bitwuzla</a></p> + https://example.org/tools/sat-smt/boolector/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla" >Bitwuzla</a></p> Colibri - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ <p>Colibri is an SMT solver.</p> cvc4 - http://localhost:1313/tools/sat-smt/cvc4/ + https://example.org/tools/sat-smt/cvc4/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc4/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5">cvc5</a></p> + https://example.org/tools/sat-smt/cvc4/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5" >cvc5</a></p> cvc5 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ <p>cvc5 is an automatic theorem prover for SMT problems.</p> dReal - http://localhost:1313/tools/sat-smt/dreal/ + https://example.org/tools/sat-smt/dreal/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/dreal/ + https://example.org/tools/sat-smt/dreal/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> dReal is an automated reasoning tool. It focuses on solving problems that can be encoded as first-order logic formulas over the real numbers. Its special strength is in handling problems that involve a wide range of nonlinear real functions.</p> MathSAT - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ <p><div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(226, 181, 59);"></span> <span style="display:none">[</span> <span style="color: rgb(226, 181, 59); font-size: 1rem;">Closed-Source Tool</span> <span style="display:none">]&nbsp;</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> OpenSMT - http://localhost:1313/tools/sat-smt/opensmt/ + https://example.org/tools/sat-smt/opensmt/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/opensmt/ - <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="http://localhost:1313/tools/minisat">MiniSAT</a>.</p> + https://example.org/tools/sat-smt/opensmt/ + <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="https://example.org/tools/minisat" >MiniSAT</a>.</p> Q3B - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.</p> SMT-RAT - http://localhost:1313/tools/sat-smt/smt-rat/ + https://example.org/tools/sat-smt/smt-rat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smt-rat/ - <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25">C++ API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smt-rat/ + <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25" target="_blank" >C++ API Reference</a></li> </ul> SMTInterpol - http://localhost:1313/tools/sat-smt/smtinterpol/ + https://example.org/tools/sat-smt/smtinterpol/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smtinterpol/ - <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html">Java API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smtinterpol/ + <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html" target="_blank" >Java API Reference</a></li> </ul> STP - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/stp/ - <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/stp/ + <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage" target="_blank" >stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage" target="_blank" >stp PyPI package</a></li> </ul> veriT - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ <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 verification, automated reasoning, and related research areas. veriT accepts input in SMT-LIB2 and DIMACS formats and provides a command-line interface for ease of integration into verification workflows. The solver is actively maintained and distributed under the BSD license, making it suitable for both academic and industrial applications.</p> Yices 2 - http://localhost:1313/tools/sat-smt/yices/ + https://example.org/tools/sat-smt/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/yices/ - <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html">Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/">yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2">yices2 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/yices/ + <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html" target="_blank" >Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/" target="_blank" >yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2" target="_blank" >yices2 crate on crates.io</a></li> </ul> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/applications/theorem-prover/index.html b/applications/theorem-prover/index.html index f0e5bc4..b235221 100644 --- a/applications/theorem-prover/index.html +++ b/applications/theorem-prover/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -139,6 +147,7 @@ APIs and Bindings This … diff --git a/applications/theorem-prover/index.xml b/applications/theorem-prover/index.xml index b9e7633..d015967 100644 --- a/applications/theorem-prover/index.xml +++ b/applications/theorem-prover/index.xml @@ -2,53 +2,53 @@ Theorem Prover on Formal Methods Tools - http://localhost:1313/applications/theorem-prover/ + https://example.org/applications/theorem-prover/ Recent content in Theorem Prover on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Bitwuzla - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ <p>Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.</p> Boolector - http://localhost:1313/tools/sat-smt/boolector/ + https://example.org/tools/sat-smt/boolector/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/boolector/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla">Bitwuzla</a></p> + https://example.org/tools/sat-smt/boolector/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla" >Bitwuzla</a></p> cvc4 - http://localhost:1313/tools/sat-smt/cvc4/ + https://example.org/tools/sat-smt/cvc4/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc4/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5">cvc5</a></p> + https://example.org/tools/sat-smt/cvc4/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5" >cvc5</a></p> cvc5 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ <p>cvc5 is an automatic theorem prover for SMT problems.</p> STP - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/stp/ - <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/stp/ + <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage" target="_blank" >stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage" target="_blank" >stp PyPI package</a></li> </ul> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/contribute/index.html b/contribute/index.html index d96b158..a656358 100644 --- a/contribute/index.html +++ b/contribute/index.html @@ -1,6 +1,6 @@ - + @@ -17,16 +17,16 @@ Quick Links Request addding a tool: Submit"> - + - + - - - - + + + + - + @@ -38,6 +38,14 @@ Request addding a tool: Submit"> + + + +

Formal Methods Tools

@@ -67,11 +75,11 @@ Request addding a tool: Submit">
-

Instructions coming soon. Please see https://gitmoss.fyi/fmtools/content/wiki/Contribute for temporary instructions.

+

Instructions coming soon. Please see https://gitmoss.fyi/fmtools/content/wiki/Contribute for temporary instructions.

@@ -83,6 +91,7 @@ Request addding a tool: Submit"> diff --git a/css/styles.e5b470edf89c3e1b9498ce83a3fd0a2e73e9d06958e2c3a1af8d89781f9f2bf612b21d5e45ab8f4aef773661de2529437838673a136797a6a8aaab7759f94ded.css b/css/styles.9d797fdbc9887767b3ad88393155cb84288660765fe6e18c89e2e00fd5ecfb0b9f46384188a0ae4e8b63f4c81526872e0ff61d1d5204287a0c3c8b6e8e34b6b9.css similarity index 91% rename from css/styles.e5b470edf89c3e1b9498ce83a3fd0a2e73e9d06958e2c3a1af8d89781f9f2bf612b21d5e45ab8f4aef773661de2529437838673a136797a6a8aaab7759f94ded.css rename to css/styles.9d797fdbc9887767b3ad88393155cb84288660765fe6e18c89e2e00fd5ecfb0b9f46384188a0ae4e8b63f4c81526872e0ff61d1d5204287a0c3c8b6e8e34b6b9.css index 6b60268..5864270 100644 --- a/css/styles.e5b470edf89c3e1b9498ce83a3fd0a2e73e9d06958e2c3a1af8d89781f9f2bf612b21d5e45ab8f4aef773661de2529437838673a136797a6a8aaab7759f94ded.css +++ b/css/styles.9d797fdbc9887767b3ad88393155cb84288660765fe6e18c89e2e00fd5ecfb0b9f46384188a0ae4e8b63f4c81526872e0ff61d1d5204287a0c3c8b6e8e34b6b9.css @@ -342,6 +342,66 @@ pre code { font-size: 0.8rem; } +.banner { + position: fixed; + top: 0; + width: 100%; + max-width: 1024px; + background-color: #1de9b6; + color: #0a0c11; + padding: 5px 0; + font-weight: 400; + text-align: center; + font-size: 1.1em; + border-radius: 0 0 8px 8px; + z-index: 1000; + font-size: 0.9rem; + height: 1.3rem; + margin-left: calc(0% - 1.5rem); +} + +.banner a { + color: #0a0c11; + text-decoration: underline; + font-weight: 700; + transition: color 0.3s ease-in-out; +} + +.banner a:hover, .banner a:focus { + color: #1a3e70; +} + +body:has(.banner) { + margin-top: 2.6rem; +} + +@media (max-width: 600px) { + .banner { + position: absolute; + top: 0; + width: calc(100% - 1.5rem); + max-width: 1024px; + background-color: #1de9b6; + color: #0a0c11; + padding: 5px; + font-weight: 400; + text-align: center; + font-size: 1.1em; + border-radius: 0 0 8px 8px; + z-index: 1000; + font-size: 0.9rem; + height: 4.3rem; + margin-left: calc(0% - 1.5rem); + } + .banner .banner-text { + display: block; + margin: 0 5px; + } + body:has(.banner) { + margin-top: 5.6rem; + } +} + table#taxonomy-table { width: 100%; border-collapse: collapse; diff --git a/css/styles.css.map b/css/styles.css.map index 49fa1a2..0838033 100644 --- a/css/styles.css.map +++ b/css/styles.css.map @@ -15,11 +15,11 @@ "@import \"fonts\";\n@import \"colors\";\n@import \"layout\";\n@import \"taxonomy\";\n@import \"links\";\n@import \"publications\";\n", "$font-path: '/fonts/static/';\n\n@font-face {\n font-family: 'Source Sans 3';\n font-style: normal;\n font-display: swap;\n font-weight: 100;\n src: local('Source Sans 3 ExtraLight'), local('SourceSans3-ExtraLight'), url('#{$font-path}SourceSans3-ExtraLight.woff2') format('woff2'), url('#{$font-path}SourceSans3-ExtraLight.ttf') format('truetype'); }\n@font-face {\n font-family: 'Source Sans 3';\n font-style: normal;\n font-display: swap;\n font-weight: 200;\n src: local('Source Sans 3 ExtraLight'), local('SourceSans3-ExtraLight'), url('#{$font-path}SourceSans3-ExtraLight.woff2') format('woff2'), url('#{$font-path}SourceSans3-ExtraLight.ttf') format('truetype'); }\n\n@font-face {\n font-family: 'Source Sans 3';\n font-style: normal;\n font-display: swap;\n font-weight: 300;\n src: local('Source Sans 3 Light'), local('SourceSans3-Light'), url('#{$font-path}SourceSans3-Light.woff2') format('woff2'), url('#{$font-path}SourceSans3-Light.ttf') format('truetype'); }\n\n@font-face {\n font-family: 'Source Sans 3';\n font-style: normal;\n font-display: swap;\n font-weight: 400;\n src: local('Source Sans 3 Regular'), local('SourceSans3-Regular'), url('#{$font-path}SourceSans3-Regular.woff2') format('woff2'), url('#{$font-path}SourceSans3-Regular.ttf') format('truetype'); }\n\n@font-face {\n font-family: 'Source Sans 3';\n font-style: italic;\n font-display: swap;\n font-weight: 400;\n src: local('Source Sans 3 Italic'), local('SourceSans3-Italic'), url('#{$font-path}SourceSans3-Italic.woff2') format('woff2'), url('#{$font-path}SourceSans3-Italic.ttf') format('truetype'); }\n\n@font-face {\n font-family: 'Source Sans 3';\n font-style: normal;\n font-display: swap;\n font-weight: 500;\n src: local('Source Sans 3 Medium'), local('SourceSans3-Medium'), url('#{$font-path}SourceSans3-Medium.woff2') format('woff2'), url('#{$font-path}SourceSans3-Medium.ttf') format('truetype'); }\n\n@font-face {\n font-family: 'Source Sans 3';\n font-style: normal;\n font-display: swap;\n font-weight: 600;\n src: local('Source Sans 3 SemiBold'), local('SourceSans3-SemiBold'), url('#{$font-path}SourceSans3-SemiBold.woff2') format('woff2'), url('#{$font-path}SourceSans3-SemiBold.ttf') format('truetype'); }\n\n@font-face {\n font-family: 'Source Sans 3';\n font-style: normal;\n font-display: swap;\n font-weight: 700;\n src: local('Source Sans 3 Bold'), local('SourceSans3-Bold'), url('#{$font-path}SourceSans3-Bold.woff2') format('woff2'), url('#{$font-path}SourceSans3-Bold.ttf') format('truetype'); }\n\n@font-face {\n font-family: 'Source Sans 3';\n font-style: italic;\n font-display: swap;\n font-weight: 700;\n src: local('Source Sans 3 Bold Italic'), local('SourceSans3-BoldItalic'), url('#{$font-path}SourceSans3-BoldItalic.woff2') format('woff2'), url('#{$font-path}SourceSans3-BoldItalic.ttf') format('truetype'); }\n\n@font-face {\n font-family: 'Source Sans 3';\n font-style: normal;\n font-display: swap;\n font-weight: 800;\n src: local('Source Sans 3 ExtraBold'), local('SourceSans3-ExtraBold'), url('#{$font-path}SourceSans3-ExtraBold.woff2') format('woff2'), url('#{$font-path}SourceSans3-ExtraBold.ttf') format('truetype'); }\n\n@font-face {\n font-family: 'Source Sans 3';\n font-style: normal;\n font-display: swap;\n font-weight: 900;\n src: local('Source Sans 3 Black'), local('SourceSans3-Black'), url('#{$font-path}SourceSans3-Black.woff2') format('woff2'), url('#{$font-path}SourceSans3-Black.ttf') format('truetype'); }\n\n@font-face {\n font-family: 'Source Code Pro';\n font-style: normal;\n font-display: swap;\n font-weight: 600;\n src: local('Source Code Pro Medium'), local('SourceCodePro-Medium'), url('#{$font-path}SourceCodePro-Medium.woff2') format('woff2'), url('#{$font-path}SourceCodePro-Medium.ttf') format('truetype'); }\n\n@font-face {\n font-family: 'Source Code Pro';\n font-style: italic;\n font-display: swap;\n font-weight: 600;\n src: local('Source Code Pro Medium Italic'), local('SourceCodePro-MediumItalic'), url('#{$font-path}SourceCodePro-MediumItalic.woff2') format('woff2'), url('#{$font-path}SourceCodePro-MediumItalic.ttf') format('truetype'); }\n\n\n\n\n* {\n font-family: 'Source Sans 3', sans-serif; }\ncode {\n font-family: 'Source Code Pro', monospace; }\n", "//\n// _colors.sass\n// Attractive dark mode color scheme for fmtools\n//\n\n// Primary palette\n$primary: #3380ff;\n$primary-dark: #1a3e70;\n$primary-light: #8fc6ff;\n\n// Accent colors\n$accent: #1de9b6;\n$accent-dark: #00897b;\n$accent-light: #6fffd2;\n\n\n// Success, warning, error\n$success: #00e676;\n$warning: #ffd600;\n$error: #ff1744;\n\n// Neutral palette (dark mode)\n$darkest: #0a0c11;\n$background: #10131a;\n$surface: #1a1e29;\n$border: #3a4054;\n$text: #ffffff;\n$text-subtle: #bfc9e6;\n", - "/* _layout.sass */\n\n/* Variables */\n$spacing-unit: 1.5rem;\n$section-spacing: 2rem;\n$border-radius: 8px;\n\nhtml {\n background: darken($background, 3%); }\n\n/* Base Layout */\nbody {\n background: $background;\n color: $text;\n font-family: 'Segoe UI', 'Helvetica Neue', Arial, sans-serif;\n width: 100%;\n height: 100%;\n max-width: 1024px;\n margin: $spacing-unit auto;\n padding: $spacing-unit;\n box-sizing: border-box;\n border-radius: $border-radius; }\n\nheader {\n background: $surface;\n margin: $spacing-unit;\n padding: $spacing-unit;\n display: flex;\n flex-wrap: wrap;\n align-items: center;\n justify-content: space-between;\n border-radius: $border-radius;\n margin: 0 auto; }\n\nheader h1, header h1 a {\n margin: 0;\n font-size: 1.6rem;\n font-weight: 900;\n color: $text;\n text-decoration: none;\n padding: 0;\n transition: color 0.4s ease-in-out;\n &:hover, &:focus {\n color: $accent-light; } }\n\nnav {\n display: flex;\n gap: $spacing-unit;\n align-items: center; }\n\nnav ul {\n list-style: none;\n margin: 0;\n padding: 0;\n display: flex;\n gap: 0.5rem;\n flex-wrap: wrap; }\n\nnav ul li {\n margin: 0;\n padding: 0; }\n\nnav ul li a {\n padding: 0.4rem 0.6rem;\n border-radius: $border-radius;\n background: $primary-dark;\n color: $text;\n text-decoration: none;\n font-weight: 500;\n transition: background 0.4s ease-in-out;\n &:hover, &:focus {\n background: $accent-dark;\n color: $text; } }\n\n@media (max-width: 600px) {\n header {\n flex-direction: column;\n align-items: flex-start;\n gap: $spacing-unit; }\n\n nav {\n width: 100%;\n justify-content: flex-start;\n margin-top: $spacing-unit; } }\n\nmain {\n margin: $spacing-unit 0;\n padding: $spacing-unit; }\n\nfooter {\n background: $surface;\n margin: $spacing-unit;\n padding: $spacing-unit;\n border-radius: $border-radius;\n margin: 0 auto;\n text-align: center; }\n\nfooter p {\n margin: 0;\n font-size: 0.9rem;\n color: $text-subtle;\n text-align: center; }\n\nsection {\n border-bottom: 3px solid $surface;\n margin: $section-spacing 0;\n padding-bottom: $section-spacing; }\n\n#page-header {\n border-bottom: 3px solid $surface;\n margin: $section-spacing 0;\n padding-bottom: $section-spacing;\n text-align: center;\n h1 {\n margin: 0;\n width: 100%;\n font-size: 3rem;\n word-break: break-word; }\n .subtitle {\n margin: 0;\n width: 100%;\n font-size: 1.2rem;\n font-weight: 300;\n color: $text-subtle; } }\n.time {\n font-size: 0.8rem;\n color: $text-subtle;\n text-align: center; }\n\narticle {\n background: $surface;\n border-radius: 8px;\n padding: $spacing-unit;\n margin: $spacing-unit 0;\n position: relative;\n transition: background 0.5s ease-in-out;\n &:hover, &:focus {\n background: $primary-dark; }\n h3 {\n margin: 0;\n font-size: 1.5rem;\n font-weight: 700;\n color: $text; }\n a {\n color: $text;\n position: absolute;\n top: 0;\n left: 0;\n width: 100%;\n height: 100%;\n z-index: 1;\n text-indent: -9999px;\n overflow: hidden;\n text-decoration: none;\n transition: color 0.3s ease-in-out;\n &:hover, &:focus {\n color: $accent-light; } }\n &:not(a) {\n position: relative;\n z-index: 2; }\n p {\n margin: 0.5rem 0;\n font-size: 1rem;\n color: $text;\n font-weight: 300; }\n\n .subtitle {\n margin: 0 0 0 0.5rem;\n width: 100%;\n font-size: 1.1rem;\n font-weight: 300;\n color: $text-subtle; } }\n\n.term-title {\n font-weight: 700;\n padding: 0.3rem 0.8rem;\n margin-bottom: 0.5rem;\n border-radius: $border-radius; }\n\np code {\n background: darken($primary-dark,10%);\n margin: 0 0.2rem;\n padding: 0.2rem 0.4rem;\n border-radius: 5px;\n font-size: 0.8rem; }\n\npre {\n padding: 0.5rem;\n border-radius: 5px;\n overflow-x: auto;\n code {\n font-size: 0.8rem; } }\n", + "/* _layout.sass */\n\n/* Variables */\n$spacing-unit: 1.5rem;\n$section-spacing: 2rem;\n$border-radius: 8px;\n$body-width: 1024px;\n\nhtml {\n background: darken($background, 3%); }\n\n/* Base Layout */\nbody {\n background: $background;\n color: $text;\n font-family: 'Segoe UI', 'Helvetica Neue', Arial, sans-serif;\n width: 100%;\n height: 100%;\n max-width: $body-width;\n margin: $spacing-unit auto;\n padding: $spacing-unit;\n box-sizing: border-box;\n border-radius: $border-radius; }\n\nheader {\n background: $surface;\n margin: $spacing-unit;\n padding: $spacing-unit;\n display: flex;\n flex-wrap: wrap;\n align-items: center;\n justify-content: space-between;\n border-radius: $border-radius;\n margin: 0 auto; }\n\nheader h1, header h1 a {\n margin: 0;\n font-size: 1.6rem;\n font-weight: 900;\n color: $text;\n text-decoration: none;\n padding: 0;\n transition: color 0.4s ease-in-out;\n &:hover, &:focus {\n color: $accent-light; } }\n\nnav {\n display: flex;\n gap: $spacing-unit;\n align-items: center; }\n\nnav ul {\n list-style: none;\n margin: 0;\n padding: 0;\n display: flex;\n gap: 0.5rem;\n flex-wrap: wrap; }\n\nnav ul li {\n margin: 0;\n padding: 0; }\n\nnav ul li a {\n padding: 0.4rem 0.6rem;\n border-radius: $border-radius;\n background: $primary-dark;\n color: $text;\n text-decoration: none;\n font-weight: 500;\n transition: background 0.4s ease-in-out;\n &:hover, &:focus {\n background: $accent-dark;\n color: $text; } }\n\n@media (max-width: 600px) {\n header {\n flex-direction: column;\n align-items: flex-start;\n gap: $spacing-unit; }\n\n nav {\n width: 100%;\n justify-content: flex-start;\n margin-top: $spacing-unit; } }\n\nmain {\n margin: $spacing-unit 0;\n padding: $spacing-unit; }\n\nfooter {\n background: $surface;\n margin: $spacing-unit;\n padding: $spacing-unit;\n border-radius: $border-radius;\n margin: 0 auto;\n text-align: center; }\n\nfooter p {\n margin: 0;\n font-size: 0.9rem;\n color: $text-subtle;\n text-align: center; }\n\nsection {\n border-bottom: 3px solid $surface;\n margin: $section-spacing 0;\n padding-bottom: $section-spacing; }\n\n#page-header {\n border-bottom: 3px solid $surface;\n margin: $section-spacing 0;\n padding-bottom: $section-spacing;\n text-align: center;\n h1 {\n margin: 0;\n width: 100%;\n font-size: 3rem;\n word-break: break-word; }\n .subtitle {\n margin: 0;\n width: 100%;\n font-size: 1.2rem;\n font-weight: 300;\n color: $text-subtle; } }\n.time {\n font-size: 0.8rem;\n color: $text-subtle;\n text-align: center; }\n\narticle {\n background: $surface;\n border-radius: 8px;\n padding: $spacing-unit;\n margin: $spacing-unit 0;\n position: relative;\n transition: background 0.5s ease-in-out;\n &:hover, &:focus {\n background: $primary-dark; }\n h3 {\n margin: 0;\n font-size: 1.5rem;\n font-weight: 700;\n color: $text; }\n a {\n color: $text;\n position: absolute;\n top: 0;\n left: 0;\n width: 100%;\n height: 100%;\n z-index: 1;\n text-indent: -9999px;\n overflow: hidden;\n text-decoration: none;\n transition: color 0.3s ease-in-out;\n &:hover, &:focus {\n color: $accent-light; } }\n &:not(a) {\n position: relative;\n z-index: 2; }\n p {\n margin: 0.5rem 0;\n font-size: 1rem;\n color: $text;\n font-weight: 300; }\n\n .subtitle {\n margin: 0 0 0 0.5rem;\n width: 100%;\n font-size: 1.1rem;\n font-weight: 300;\n color: $text-subtle; } }\n\n.term-title {\n font-weight: 700;\n padding: 0.3rem 0.8rem;\n margin-bottom: 0.5rem;\n border-radius: $border-radius; }\n\np code {\n background: darken($primary-dark,10%);\n margin: 0 0.2rem;\n padding: 0.2rem 0.4rem;\n border-radius: 5px;\n font-size: 0.8rem; }\n\npre {\n padding: 0.5rem;\n border-radius: 5px;\n overflow-x: auto;\n code {\n font-size: 0.8rem; } }\n\n.banner {\n position: fixed;\n top: 0;\n width: 100%;\n max-width: $body-width;\n background-color: $accent;\n color: $darkest;\n padding: 5px 0;\n font-weight: 400;\n text-align: center;\n font-size: 1.1em;\n border-radius: 0 0 8px 8px;\n z-index: 1000;\n font-size: 0.9rem;\n height: 1.3rem;\n margin-left: calc(0% - #{$spacing-unit});\n\n a {\n color: $darkest;\n text-decoration: underline;\n font-weight: 700;\n transition: color 0.3s ease-in-out;\n &:hover, &:focus {\n color: $primary-dark; } } }\n\nbody:has(.banner) {\n margin-top: 2.6rem; }\n\n@media (max-width: 600px) {\n .banner {\n position: absolute;\n top: 0;\n width: calc(100% - #{$spacing-unit});\n max-width: $body-width;\n background-color: $accent;\n color: $darkest;\n padding: 5px;\n font-weight: 400;\n text-align: center;\n font-size: 1.1em;\n border-radius: 0 0 8px 8px;\n z-index: 1000;\n font-size: 0.9rem;\n height: 4.3rem;\n margin-left: calc(0% - #{$spacing-unit});\n\n .banner-text {\n display: block;\n margin: 0 5px; } }\n\n\n body:has(.banner) {\n margin-top: 5.6rem; } }\n", "\ntable#taxonomy-table {\n width: 100%;\n border-collapse: collapse;\n // border: 3px solid $darkest\n box-sizing: border-box;\n background: $surface;\n text-align: left;\n\n tr {\n border-bottom: 3px solid $background;\n &:nth-child(even) {\n background: darken($surface, 2%);\n transition: background 0.4s ease-in-out; }\n &:nth-child(odd) {\n background: lighten($surface, 3%);\n transition: background 0.4s ease-in-out; }\n &:hover, &:focus {\n background: $border; } }\n\n thead {\n text-align: left;\n border: none;\n border-radius: $border-radius $border-radius 0 0; }\n\n th {\n color: $text;\n background: $darkest !important;\n padding: 0.6rem 0.6rem;\n text-align: left;\n font-weight: 600;\n border: none; }\n\n td {\n padding: 0.3rem 0.6rem;\n text-align: left;\n font-weight: 600;\n border: none; }\n\n td.description {\n font-weight: 300;\n color: $text-subtle; }\n td.tool {\n min-width: 100px; }\n\n a.term-link {\n padding: 0.2rem 0.6rem;\n margin: 0.2rem;\n display: inline-block;\n border-radius: $border-radius;\n text-decoration: none;\n font-weight: 500;\n color: $text;\n transition: color 0.4s ease-in-out, background 0.4s ease-in-out;\n &:hover, &:focus {\n color: $darkest !important;\n background: $text-subtle !important; } }\n\n a.taxonomy-name {\n padding: 0;\n margin: 0.2rem;\n display: inline-block;\n border-radius: $border-radius;\n text-decoration: none;\n font-weight: 500;\n color: $text;\n transition: color 0.4s ease-in-out;\n &:hover, &:focus {\n color: $accent-light; } }\n\n a {\n color: $text;\n text-decoration: none;\n &:hover, &:focus {\n color: $accent; } } }\n\n#taxonomy-page a.term-link {\n padding: 0.3rem 1.2rem;\n margin: 0.2rem;\n display: inline-block;\n border-radius: $border-radius;\n text-decoration: none;\n font-weight: 500;\n font-size: 1.2rem;\n color: $text;\n transition: color 0.4s ease-in-out, background 0.4s ease-in-out;\n &:hover, &:focus {\n color: $darkest !important;\n background: $text-subtle !important; } }\n\n", "/* _text.sass */\n\na {\n color: $accent-light;\n text-decoration: underline;\n transition: color 0.3s ease-in-out;\n &:hover, &:focus {\n color: $primary; } }\n\n#quick-links {\n text-align: left; }\n\n#link-list {\n display: flex;\n gap: $spacing-unit;\n align-items: center;\n flex-wrap: wrap;\n margin: 2rem 0 $spacing-unit 0;\n justify-content: center; }\n\n#link-list h2 {\n flex: none; }\n\n#link-list ul {\n list-style: none;\n margin: 0;\n padding: 0;\n display: flex;\n gap: 1rem;\n flex-wrap: wrap; }\n\n#link-list ul li {\n margin: 0;\n padding: 0; }\n\n#link-list ul li a {\n padding: 0.3rem 0.6rem;\n border-radius: $border-radius;\n background: $primary-light;\n color: $darkest;\n text-decoration: none;\n font-weight: 500;\n transition: background 0.3s ease-in-out;\n &:hover, &:focus {\n background: $accent-light; } }\n\na.button {\n padding: 0.3rem 0.6rem;\n margin: 0 0.2rem;\n border-radius: $border-radius;\n background: $primary-light;\n color: $darkest;\n text-decoration: none;\n font-weight: 500;\n transition: background 0.3s ease-in-out;\n &:hover, &:focus {\n background: $accent-light; } }\n", "#publications {\n font-weight: 300;\n ul {\n list-style: none;\n margin: 0;\n padding: 0;\n display: flex;\n flex-direction: column;\n gap: 1em;\n\n li {\n background: $surface;\n border-radius: 8px;\n padding: 1em 1.5em; } }\n a {\n color: $primary-light;\n text-decoration: none;\n font-weight: 100;\n transition: color 0.3s ease-in-out;\n &:hover, &:focus {\n color: $accent-light; } } }\n" ], "names": [], - "mappings": "ACEA,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,iCAAiC,EAAE,+BAA+B,EAAE,iDAA0D,CAAC,eAAe,EAAE,+CAAwD,CAAC,kBAAkB;;;AACpO,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,iCAAiC,EAAE,+BAA+B,EAAE,iDAA0D,CAAC,eAAe,EAAE,+CAAwD,CAAC,kBAAkB;;;AAEpO,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,4BAA4B,EAAE,0BAA0B,EAAE,4CAAqD,CAAC,eAAe,EAAE,0CAAmD,CAAC,kBAAkB;;;AAEhN,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,8BAA8B,EAAE,4BAA4B,EAAE,8CAAuD,CAAC,eAAe,EAAE,4CAAqD,CAAC,kBAAkB;;;AAExN,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,6BAA6B,EAAE,2BAA2B,EAAE,6CAAsD,CAAC,eAAe,EAAE,2CAAoD,CAAC,kBAAkB;;;AAEpN,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,6BAA6B,EAAE,2BAA2B,EAAE,6CAAsD,CAAC,eAAe,EAAE,2CAAoD,CAAC,kBAAkB;;;AAEpN,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,+BAA+B,EAAE,6BAA6B,EAAE,+CAAwD,CAAC,eAAe,EAAE,6CAAsD,CAAC,kBAAkB;;;AAE5N,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,2BAA2B,EAAE,yBAAyB,EAAE,2CAAoD,CAAC,eAAe,EAAE,yCAAkD,CAAC,kBAAkB;;;AAE5M,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,kCAAkC,EAAE,+BAA+B,EAAE,iDAA0D,CAAC,eAAe,EAAE,+CAAwD,CAAC,kBAAkB;;;AAErO,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,gCAAgC,EAAE,8BAA8B,EAAE,gDAAyD,CAAC,eAAe,EAAE,8CAAuD,CAAC,kBAAkB;;;AAEhO,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,4BAA4B,EAAE,0BAA0B,EAAE,4CAAqD,CAAC,eAAe,EAAE,0CAAmD,CAAC,kBAAkB;;;AAEhN,UAAU;EACN,WAAW,EAAE,iBAAiB;EAC9B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,+BAA+B,EAAE,6BAA6B,EAAE,+CAAwD,CAAC,eAAe,EAAE,6CAAsD,CAAC,kBAAkB;;;AAE5N,UAAU;EACN,WAAW,EAAE,iBAAiB;EAC9B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,sCAAsC,EAAE,mCAAmC,EAAE,qDAA8D,CAAC,eAAe,EAAE,mDAA4D,CAAC,kBAAkB;;;AAKrP,AAAA,CAAC,CAAC;EACE,WAAW,EAAE,2BAA2B;CAAG;;AAC/C,AAAA,IAAI,CAAC;EACD,WAAW,EAAE,4BAA4B;CAAG;;AElGhD,kBAAkB;AAElB,eAAe;AAKf,AAAA,IAAI,CAAC;EACD,UAAU,EDeD,OAAO;CCfsB;;AAE1C,iBAAiB;AACjB,AAAA,IAAI,CAAC;EACD,UAAU,EDWD,OAAO;ECVhB,KAAK,EDaF,OAAO;ECZV,WAAW,EAAE,+CAA+C;EAC5D,KAAK,EAAE,IAAI;EACX,MAAM,EAAE,IAAI;EACZ,SAAS,EAAE,MAAM;EACjB,MAAM,EAfK,MAAM,CAeK,IAAI;EAC1B,OAAO,EAhBI,MAAM;EAiBjB,UAAU,EAAE,UAAU;EACtB,aAAa,EAhBD,GAAG;CAgBiB;;AAEpC,AAAA,MAAM,CAAC;EACH,UAAU,EDAJ,OAAO;ECCb,MAAM,EAtBK,MAAM;EAuBjB,OAAO,EAvBI,MAAM;EAwBjB,OAAO,EAAE,IAAI;EACb,SAAS,EAAE,IAAI;EACf,WAAW,EAAE,MAAM;EACnB,eAAe,EAAE,aAAa;EAC9B,aAAa,EA1BD,GAAG;EA2Bf,MAAM,EAAE,MAAM;CAAG;;AAErB,AAAA,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;EACnB,MAAM,EAAE,CAAC;EACT,SAAS,EAAE,MAAM;EACjB,WAAW,EAAE,GAAG;EAChB,KAAK,EDZF,OAAO;ECaV,eAAe,EAAE,IAAI;EACrB,OAAO,EAAE,CAAC;EACV,UAAU,EAAE,sBAAsB;CAEL;;AATjC,AAQI,MARE,CAAC,EAAE,CAQH,KAAK,EARX,MAAM,CAAC,EAAE,CAQM,KAAK,EART,MAAM,CAAC,EAAE,CAAC,CAAC,CAQhB,KAAK,EARA,MAAM,CAAC,EAAE,CAAC,CAAC,CAQP,KAAK,CAAC;EACb,KAAK,ED9BE,OAAO;CC8BS;;AAE/B,AAAA,GAAG,CAAC;EACA,OAAO,EAAE,IAAI;EACb,GAAG,EA5CQ,MAAM;EA6CjB,WAAW,EAAE,MAAM;CAAG;;AAE1B,AAAA,GAAG,CAAC,EAAE,CAAC;EACH,UAAU,EAAE,IAAI;EAChB,MAAM,EAAE,CAAC;EACT,OAAO,EAAE,CAAC;EACV,OAAO,EAAE,IAAI;EACb,GAAG,EAAE,MAAM;EACX,SAAS,EAAE,IAAI;CAAG;;AAEtB,AAAA,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;EACN,MAAM,EAAE,CAAC;EACT,OAAO,EAAE,CAAC;CAAG;;AAEjB,AAAA,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;EACR,OAAO,EAAE,aAAa;EACtB,aAAa,EA3DD,GAAG;EA4Df,UAAU,ED1DC,OAAO;EC2DlB,KAAK,EDxCF,OAAO;ECyCV,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,UAAU,EAAE,2BAA2B;CAGlB;;AAVzB,AAQI,GARD,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAQL,KAAK,EARX,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAQI,KAAK,CAAC;EACb,UAAU,ED3DJ,OAAO;EC4Db,KAAK,ED9CN,OAAO;CC8CS;;AAEvB,MAAM,mBACF;EAAA,AAAA,MAAM,CAAC;IACH,cAAc,EAAE,MAAM;IACtB,WAAW,EAAE,UAAU;IACvB,GAAG,EA3EI,MAAM;GA2EQ;EAEzB,AAAA,GAAG,CAAC;IACA,KAAK,EAAE,IAAI;IACX,eAAe,EAAE,UAAU;IAC3B,UAAU,EAhFH,MAAM;GAgFe;CALP;;AAO7B,AAAA,IAAI,CAAC;EACD,MAAM,EAnFK,MAAM,CAmFK,CAAC;EACvB,OAAO,EApFI,MAAM;CAoFQ;;AAE7B,AAAA,MAAM,CAAC;EACH,UAAU,EDlEJ,OAAO;ECmEb,MAAM,EAxFK,MAAM;EAyFjB,OAAO,EAzFI,MAAM;EA0FjB,aAAa,EAxFD,GAAG;EAyFf,MAAM,EAAE,MAAM;EACd,UAAU,EAAE,MAAM;CAAG;;AAEzB,AAAA,MAAM,CAAC,CAAC,CAAC;EACL,MAAM,EAAE,CAAC;EACT,SAAS,EAAE,MAAM;EACjB,KAAK,EDzEK,OAAO;EC0EjB,UAAU,EAAE,MAAM;CAAG;;AAEzB,AAAA,OAAO,CAAC;EACJ,aAAa,EAAE,GAAG,CAAC,KAAK,CDhFlB,OAAO;ECiFb,MAAM,EArGQ,IAAI,CAqGO,CAAC;EAC1B,cAAc,EAtGA,IAAI;CAsGiB;;AAEvC,AAAA,YAAY,CAAC;EACT,aAAa,EAAE,GAAG,CAAC,KAAK,CDrFlB,OAAO;ECsFb,MAAM,EA1GQ,IAAI,CA0GO,CAAC;EAC1B,cAAc,EA3GA,IAAI;EA4GlB,UAAU,EAAE,MAAM;CAWU;;AAfhC,AAKI,YALQ,CAKR,EAAE,CAAC;EACC,MAAM,EAAE,CAAC;EACT,KAAK,EAAE,IAAI;EACX,SAAS,EAAE,IAAI;EACf,UAAU,EAAE,UAAU;CAAG;;AATjC,AAUI,YAVQ,CAUR,SAAS,CAAC;EACN,MAAM,EAAE,CAAC;EACT,KAAK,EAAE,IAAI;EACX,SAAS,EAAE,MAAM;EACjB,WAAW,EAAE,GAAG;EAChB,KAAK,EDhGC,OAAO;CCgGS;;AAC9B,AAAA,KAAK,CAAC;EACF,SAAS,EAAE,MAAM;EACjB,KAAK,EDnGK,OAAO;ECoGjB,UAAU,EAAE,MAAM;CAAG;;AAEzB,AAAA,OAAO,CAAC;EACJ,UAAU,ED1GJ,OAAO;EC2Gb,aAAa,EAAE,GAAG;EAClB,OAAO,EAjII,MAAM;EAkIjB,MAAM,EAlIK,MAAM,CAkIK,CAAC;EACvB,QAAQ,EAAE,QAAQ;EAClB,UAAU,EAAE,2BAA2B;CAoCX;;AA1ChC,AAOI,OAPG,CAOD,KAAK,EAPX,OAAO,CAOQ,KAAK,CAAC;EACb,UAAU,EDlIH,OAAO;CCkIc;;AARpC,AASI,OATG,CASH,EAAE,CAAC;EACC,MAAM,EAAE,CAAC;EACT,SAAS,EAAE,MAAM;EACjB,WAAW,EAAE,GAAG;EAChB,KAAK,EDpHN,OAAO;CCoHS;;AAbvB,AAcI,OAdG,CAcH,CAAC,CAAC;EACE,KAAK,EDtHN,OAAO;ECuHN,QAAQ,EAAE,QAAQ;EAClB,GAAG,EAAE,CAAC;EACN,IAAI,EAAE,CAAC;EACP,KAAK,EAAE,IAAI;EACX,MAAM,EAAE,IAAI;EACZ,OAAO,EAAE,CAAC;EACV,WAAW,EAAE,OAAO;EACpB,QAAQ,EAAE,MAAM;EAChB,eAAe,EAAE,IAAI;EACrB,UAAU,EAAE,sBAAsB;CAEL;;AA3BrC,AA0BQ,OA1BD,CAcH,CAAC,CAYK,KAAK,EA1Bf,OAAO,CAcH,CAAC,CAYc,KAAK,CAAC;EACb,KAAK,ED/IF,OAAO;CC+Ia;;AA3BnC,AA4BI,OA5BG,CA4BD,GAAI,CAAA,CAAC,EAAE;EACL,QAAQ,EAAE,QAAQ;EAClB,OAAO,EAAE,CAAC;CAAG;;AA9BrB,AA+BI,OA/BG,CA+BH,CAAC,CAAC;EACE,MAAM,EAAE,QAAQ;EAChB,SAAS,EAAE,IAAI;EACf,KAAK,EDzIN,OAAO;EC0IN,WAAW,EAAE,GAAG;CAAG;;AAnC3B,AAqCI,OArCG,CAqCH,SAAS,CAAC;EACN,MAAM,EAAE,YAAY;EACpB,KAAK,EAAE,IAAI;EACX,SAAS,EAAE,MAAM;EACjB,WAAW,EAAE,GAAG;EAChB,KAAK,EDhJC,OAAO;CCgJS;;AAE9B,AAAA,WAAW,CAAC;EACR,WAAW,EAAE,GAAG;EAChB,OAAO,EAAE,aAAa;EACtB,aAAa,EAAE,MAAM;EACrB,aAAa,EA5KD,GAAG;CA4KiB;;AAEpC,AAAA,CAAC,CAAC,IAAI,CAAC;EACH,UAAU,ED7KC,OAAO;EC8KlB,MAAM,EAAE,QAAQ;EAChB,OAAO,EAAE,aAAa;EACtB,aAAa,EAAE,GAAG;EAClB,SAAS,EAAE,MAAM;CAAG;;AAExB,AAAA,GAAG,CAAC;EACA,OAAO,EAAE,MAAM;EACf,aAAa,EAAE,GAAG;EAClB,UAAU,EAAE,IAAI;CAEU;;AAL9B,AAII,GAJD,CAIC,IAAI,CAAC;EACD,SAAS,EAAE,MAAM;CAAG;;AC9L5B,AAAA,KAAK,AAAA,eAAe,CAAC;EACjB,KAAK,EAAE,IAAI;EACX,eAAe,EAAE,QAAQ;EAEzB,UAAU,EAAE,UAAU;EACtB,UAAU,EFkBJ,OAAO;EEjBb,UAAU,EAAE,IAAI;CAmEa;;AAzEjC,AAQI,KARC,AAAA,eAAe,CAQhB,EAAE,CAAC;EACC,aAAa,EAAE,GAAG,CAAC,KAAK,CFanB,OAAO;CELgB;;AAjBpC,AAUQ,KAVH,AAAA,eAAe,CAQhB,EAAE,CAEI,SAAU,CAAA,IAAI,EAAE;EACd,UAAU,EFYZ,OAAO;EEXL,UAAU,EAAE,2BAA2B;CAAG;;AAZtD,AAaQ,KAbH,AAAA,eAAe,CAQhB,EAAE,CAKI,SAAU,CAAA,GAAG,EAAE;EACb,UAAU,EFSZ,OAAO;EERL,UAAU,EAAE,2BAA2B;CAAG;;AAftD,AAgBQ,KAhBH,AAAA,eAAe,CAQhB,EAAE,CAQI,KAAK,EAhBf,KAAK,AAAA,eAAe,CAQhB,EAAE,CAQa,KAAK,CAAC;EACb,UAAU,EFOb,OAAO;CEPkB;;AAjBlC,AAmBI,KAnBC,AAAA,eAAe,CAmBhB,KAAK,CAAC;EACF,UAAU,EAAE,IAAI;EAChB,MAAM,EAAE,IAAI;EACZ,aAAa,EDlBL,GAAG,CAAH,GAAG,CCkBkC,CAAC,CAAC,CAAC;CAAG;;AAtB3D,AAwBI,KAxBC,AAAA,eAAe,CAwBhB,EAAE,CAAC;EACC,KAAK,EFAN,OAAO;EECN,UAAU,EFLR,OAAO,CEKY,UAAU;EAC/B,OAAO,EAAE,aAAa;EACtB,UAAU,EAAE,IAAI;EAChB,WAAW,EAAE,GAAG;EAChB,MAAM,EAAE,IAAI;CAAG;;AA9BvB,AAgCI,KAhCC,AAAA,eAAe,CAgChB,EAAE,CAAC;EACC,OAAO,EAAE,aAAa;EACtB,UAAU,EAAE,IAAI;EAChB,WAAW,EAAE,GAAG;EAChB,MAAM,EAAE,IAAI;CAAG;;AApCvB,AAsCI,KAtCC,AAAA,eAAe,CAsChB,EAAE,AAAA,YAAY,CAAC;EACX,WAAW,EAAE,GAAG;EAChB,KAAK,EFdC,OAAO;CEcS;;AAxC9B,AAyCI,KAzCC,AAAA,eAAe,CAyChB,EAAE,AAAA,KAAK,CAAC;EACJ,SAAS,EAAE,KAAK;CAAG;;AA1C3B,AA4CI,KA5CC,AAAA,eAAe,CA4ChB,CAAC,AAAA,UAAU,CAAC;EACR,OAAO,EAAE,aAAa;EACtB,MAAM,EAAE,MAAM;EACd,OAAO,EAAE,YAAY;EACrB,aAAa,ED5CL,GAAG;EC6CX,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,KAAK,EF1BN,OAAO;EE2BN,UAAU,EAAE,mDAAmD;CAGnB;;AAvDpD,AAqDQ,KArDH,AAAA,eAAe,CA4ChB,CAAC,AAAA,UAAU,CASL,KAAK,EArDf,KAAK,AAAA,eAAe,CA4ChB,CAAC,AAAA,UAAU,CASI,KAAK,CAAC;EACb,KAAK,EFjCP,OAAO,CEiCW,UAAU;EAC1B,UAAU,EF7BR,OAAO,CE6BgB,UAAU;CAAG;;AAvDlD,AAyDI,KAzDC,AAAA,eAAe,CAyDhB,CAAC,AAAA,cAAc,CAAC;EACZ,OAAO,EAAE,CAAC;EACV,MAAM,EAAE,MAAM;EACd,OAAO,EAAE,YAAY;EACrB,aAAa,EDzDL,GAAG;EC0DX,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,KAAK,EFvCN,OAAO;EEwCN,UAAU,EAAE,sBAAsB;CAEL;;AAnErC,AAkEQ,KAlEH,AAAA,eAAe,CAyDhB,CAAC,AAAA,cAAc,CAST,KAAK,EAlEf,KAAK,AAAA,eAAe,CAyDhB,CAAC,AAAA,cAAc,CASA,KAAK,CAAC;EACb,KAAK,EFvDF,OAAO;CEuDa;;AAnEnC,AAqEI,KArEC,AAAA,eAAe,CAqEhB,CAAC,CAAC;EACE,KAAK,EF7CN,OAAO;EE8CN,eAAe,EAAE,IAAI;CAEE;;AAzE/B,AAwEQ,KAxEH,AAAA,eAAe,CAqEhB,CAAC,CAGK,KAAK,EAxEf,KAAK,AAAA,eAAe,CAqEhB,CAAC,CAGc,KAAK,CAAC;EACb,KAAK,EF/DR,OAAO;CE+Da;;AAE7B,AAAA,cAAc,CAAC,CAAC,AAAA,UAAU,CAAC;EACvB,OAAO,EAAE,aAAa;EACtB,MAAM,EAAE,MAAM;EACd,OAAO,EAAE,YAAY;EACrB,aAAa,ED3ED,GAAG;EC4Ef,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,SAAS,EAAE,MAAM;EACjB,KAAK,EF1DF,OAAO;EE2DV,UAAU,EAAE,mDAAmD;CAGnB;;AAZhD,AAUI,cAVU,CAAC,CAAC,AAAA,UAAU,CAUpB,KAAK,EAVX,cAAc,CAAC,CAAC,AAAA,UAAU,CAUX,KAAK,CAAC;EACb,KAAK,EFjEH,OAAO,CEiEO,UAAU;EAC1B,UAAU,EF7DJ,OAAO,CE6DY,UAAU;CAAG;;ACxF9C,gBAAgB;AAEhB,AAAA,CAAC,CAAC;EACE,KAAK,EHUM,OAAO;EGTlB,eAAe,EAAE,SAAS;EAC1B,UAAU,EAAE,sBAAsB;CAEV;;AAL5B,AAII,CAJH,CAIK,KAAK,EAJX,CAAC,CAIc,KAAK,CAAC;EACb,KAAK,EHDH,OAAO;CGCS;;AAE1B,AAAA,YAAY,CAAC;EACT,UAAU,EAAE,IAAI;CAAG;;AAEvB,AAAA,UAAU,CAAC;EACP,OAAO,EAAE,IAAI;EACb,GAAG,EFXQ,MAAM;EEYjB,WAAW,EAAE,MAAM;EACnB,SAAS,EAAE,IAAI;EACf,MAAM,EAAE,IAAI,CAAC,CAAC,CFdH,MAAM,CEcY,CAAC;EAC9B,eAAe,EAAE,MAAM;CAAG;;AAE9B,AAAA,UAAU,CAAC,EAAE,CAAC;EACV,IAAI,EAAE,IAAI;CAAG;;AAEjB,AAAA,UAAU,CAAC,EAAE,CAAC;EACV,UAAU,EAAE,IAAI;EAChB,MAAM,EAAE,CAAC;EACT,OAAO,EAAE,CAAC;EACV,OAAO,EAAE,IAAI;EACb,GAAG,EAAE,IAAI;EACT,SAAS,EAAE,IAAI;CAAG;;AAEtB,AAAA,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;EACb,MAAM,EAAE,CAAC;EACT,OAAO,EAAE,CAAC;CAAG;;AAEjB,AAAA,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;EACf,OAAO,EAAE,aAAa;EACtB,aAAa,EFhCD,GAAG;EEiCf,UAAU,EH9BE,OAAO;EG+BnB,KAAK,EHjBC,OAAO;EGkBb,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,UAAU,EAAE,2BAA2B;CAEL;;AATtC,AAQI,UARM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAQZ,KAAK,EARX,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAQH,KAAK,CAAC;EACb,UAAU,EH/BH,OAAO;CG+Bc;;AAEpC,AAAA,CAAC,AAAA,OAAO,CAAC;EACL,OAAO,EAAE,aAAa;EACtB,MAAM,EAAE,QAAQ;EAChB,aAAa,EF5CD,GAAG;EE6Cf,UAAU,EH1CE,OAAO;EG2CnB,KAAK,EH7BC,OAAO;EG8Bb,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,UAAU,EAAE,2BAA2B;CAEL;;AAVtC,AASI,CATH,AAAA,OAAO,CASF,KAAK,EATX,CAAC,AAAA,OAAO,CASO,KAAK,CAAC;EACb,UAAU,EH3CH,OAAO;CG2Cc;;ACxDpC,AAAA,aAAa,CAAC;EACV,WAAW,EAAE,GAAG;CAmBmB;;AApBvC,AAEI,aAFS,CAET,EAAE,CAAC;EACC,UAAU,EAAE,IAAI;EAChB,MAAM,EAAE,CAAC;EACT,OAAO,EAAE,CAAC;EACV,OAAO,EAAE,IAAI;EACb,cAAc,EAAE,MAAM;EACtB,GAAG,EAAE,GAAG;CAKmB;;AAbnC,AAUQ,aAVK,CAET,EAAE,CAQE,EAAE,CAAC;EACC,UAAU,EJaZ,OAAO;EIZL,aAAa,EAAE,GAAG;EAClB,OAAO,EAAE,SAAS;CAAG;;AAbjC,AAcI,aAdS,CAcT,CAAC,CAAC;EACE,KAAK,EJPG,OAAO;EIQf,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,UAAU,EAAE,sBAAsB;CAEL;;AApBrC,AAmBQ,aAnBK,CAcT,CAAC,CAKK,KAAK,EAnBf,aAAa,CAcT,CAAC,CAKc,KAAK,CAAC;EACb,KAAK,EJPF,OAAO;CIOa" + "mappings": "ACEA,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,iCAAiC,EAAE,+BAA+B,EAAE,iDAA0D,CAAC,eAAe,EAAE,+CAAwD,CAAC,kBAAkB;;;AACpO,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,iCAAiC,EAAE,+BAA+B,EAAE,iDAA0D,CAAC,eAAe,EAAE,+CAAwD,CAAC,kBAAkB;;;AAEpO,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,4BAA4B,EAAE,0BAA0B,EAAE,4CAAqD,CAAC,eAAe,EAAE,0CAAmD,CAAC,kBAAkB;;;AAEhN,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,8BAA8B,EAAE,4BAA4B,EAAE,8CAAuD,CAAC,eAAe,EAAE,4CAAqD,CAAC,kBAAkB;;;AAExN,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,6BAA6B,EAAE,2BAA2B,EAAE,6CAAsD,CAAC,eAAe,EAAE,2CAAoD,CAAC,kBAAkB;;;AAEpN,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,6BAA6B,EAAE,2BAA2B,EAAE,6CAAsD,CAAC,eAAe,EAAE,2CAAoD,CAAC,kBAAkB;;;AAEpN,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,+BAA+B,EAAE,6BAA6B,EAAE,+CAAwD,CAAC,eAAe,EAAE,6CAAsD,CAAC,kBAAkB;;;AAE5N,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,2BAA2B,EAAE,yBAAyB,EAAE,2CAAoD,CAAC,eAAe,EAAE,yCAAkD,CAAC,kBAAkB;;;AAE5M,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,kCAAkC,EAAE,+BAA+B,EAAE,iDAA0D,CAAC,eAAe,EAAE,+CAAwD,CAAC,kBAAkB;;;AAErO,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,gCAAgC,EAAE,8BAA8B,EAAE,gDAAyD,CAAC,eAAe,EAAE,8CAAuD,CAAC,kBAAkB;;;AAEhO,UAAU;EACN,WAAW,EAAE,eAAe;EAC5B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,4BAA4B,EAAE,0BAA0B,EAAE,4CAAqD,CAAC,eAAe,EAAE,0CAAmD,CAAC,kBAAkB;;;AAEhN,UAAU;EACN,WAAW,EAAE,iBAAiB;EAC9B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,+BAA+B,EAAE,6BAA6B,EAAE,+CAAwD,CAAC,eAAe,EAAE,6CAAsD,CAAC,kBAAkB;;;AAE5N,UAAU;EACN,WAAW,EAAE,iBAAiB;EAC9B,UAAU,EAAE,MAAM;EAClB,YAAY,EAAE,IAAI;EAClB,WAAW,EAAE,GAAG;EAChB,GAAG,EAAE,sCAAsC,EAAE,mCAAmC,EAAE,qDAA8D,CAAC,eAAe,EAAE,mDAA4D,CAAC,kBAAkB;;;AAKrP,AAAA,CAAC,CAAC;EACE,WAAW,EAAE,2BAA2B;CAAG;;AAC/C,AAAA,IAAI,CAAC;EACD,WAAW,EAAE,4BAA4B;CAAG;;AElGhD,kBAAkB;AAElB,eAAe;AAMf,AAAA,IAAI,CAAC;EACD,UAAU,EDcD,OAAO;CCdsB;;AAE1C,iBAAiB;AACjB,AAAA,IAAI,CAAC;EACD,UAAU,EDUD,OAAO;ECThB,KAAK,EDYF,OAAO;ECXV,WAAW,EAAE,+CAA+C;EAC5D,KAAK,EAAE,IAAI;EACX,MAAM,EAAE,IAAI;EACZ,SAAS,EAZA,MAAM;EAaf,MAAM,EAhBK,MAAM,CAgBK,IAAI;EAC1B,OAAO,EAjBI,MAAM;EAkBjB,UAAU,EAAE,UAAU;EACtB,aAAa,EAjBD,GAAG;CAiBiB;;AAEpC,AAAA,MAAM,CAAC;EACH,UAAU,EDDJ,OAAO;ECEb,MAAM,EAvBK,MAAM;EAwBjB,OAAO,EAxBI,MAAM;EAyBjB,OAAO,EAAE,IAAI;EACb,SAAS,EAAE,IAAI;EACf,WAAW,EAAE,MAAM;EACnB,eAAe,EAAE,aAAa;EAC9B,aAAa,EA3BD,GAAG;EA4Bf,MAAM,EAAE,MAAM;CAAG;;AAErB,AAAA,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;EACnB,MAAM,EAAE,CAAC;EACT,SAAS,EAAE,MAAM;EACjB,WAAW,EAAE,GAAG;EAChB,KAAK,EDbF,OAAO;ECcV,eAAe,EAAE,IAAI;EACrB,OAAO,EAAE,CAAC;EACV,UAAU,EAAE,sBAAsB;CAEL;;AATjC,AAQI,MARE,CAAC,EAAE,CAQH,KAAK,EARX,MAAM,CAAC,EAAE,CAQM,KAAK,EART,MAAM,CAAC,EAAE,CAAC,CAAC,CAQhB,KAAK,EARA,MAAM,CAAC,EAAE,CAAC,CAAC,CAQP,KAAK,CAAC;EACb,KAAK,ED/BE,OAAO;CC+BS;;AAE/B,AAAA,GAAG,CAAC;EACA,OAAO,EAAE,IAAI;EACb,GAAG,EA7CQ,MAAM;EA8CjB,WAAW,EAAE,MAAM;CAAG;;AAE1B,AAAA,GAAG,CAAC,EAAE,CAAC;EACH,UAAU,EAAE,IAAI;EAChB,MAAM,EAAE,CAAC;EACT,OAAO,EAAE,CAAC;EACV,OAAO,EAAE,IAAI;EACb,GAAG,EAAE,MAAM;EACX,SAAS,EAAE,IAAI;CAAG;;AAEtB,AAAA,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;EACN,MAAM,EAAE,CAAC;EACT,OAAO,EAAE,CAAC;CAAG;;AAEjB,AAAA,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;EACR,OAAO,EAAE,aAAa;EACtB,aAAa,EA5DD,GAAG;EA6Df,UAAU,ED3DC,OAAO;EC4DlB,KAAK,EDzCF,OAAO;EC0CV,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,UAAU,EAAE,2BAA2B;CAGlB;;AAVzB,AAQI,GARD,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAQL,KAAK,EARX,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAQI,KAAK,CAAC;EACb,UAAU,ED5DJ,OAAO;EC6Db,KAAK,ED/CN,OAAO;CC+CS;;AAEvB,MAAM,mBACF;EAAA,AAAA,MAAM,CAAC;IACH,cAAc,EAAE,MAAM;IACtB,WAAW,EAAE,UAAU;IACvB,GAAG,EA5EI,MAAM;GA4EQ;EAEzB,AAAA,GAAG,CAAC;IACA,KAAK,EAAE,IAAI;IACX,eAAe,EAAE,UAAU;IAC3B,UAAU,EAjFH,MAAM;GAiFe;CALP;;AAO7B,AAAA,IAAI,CAAC;EACD,MAAM,EApFK,MAAM,CAoFK,CAAC;EACvB,OAAO,EArFI,MAAM;CAqFQ;;AAE7B,AAAA,MAAM,CAAC;EACH,UAAU,EDnEJ,OAAO;ECoEb,MAAM,EAzFK,MAAM;EA0FjB,OAAO,EA1FI,MAAM;EA2FjB,aAAa,EAzFD,GAAG;EA0Ff,MAAM,EAAE,MAAM;EACd,UAAU,EAAE,MAAM;CAAG;;AAEzB,AAAA,MAAM,CAAC,CAAC,CAAC;EACL,MAAM,EAAE,CAAC;EACT,SAAS,EAAE,MAAM;EACjB,KAAK,ED1EK,OAAO;EC2EjB,UAAU,EAAE,MAAM;CAAG;;AAEzB,AAAA,OAAO,CAAC;EACJ,aAAa,EAAE,GAAG,CAAC,KAAK,CDjFlB,OAAO;ECkFb,MAAM,EAtGQ,IAAI,CAsGO,CAAC;EAC1B,cAAc,EAvGA,IAAI;CAuGiB;;AAEvC,AAAA,YAAY,CAAC;EACT,aAAa,EAAE,GAAG,CAAC,KAAK,CDtFlB,OAAO;ECuFb,MAAM,EA3GQ,IAAI,CA2GO,CAAC;EAC1B,cAAc,EA5GA,IAAI;EA6GlB,UAAU,EAAE,MAAM;CAWU;;AAfhC,AAKI,YALQ,CAKR,EAAE,CAAC;EACC,MAAM,EAAE,CAAC;EACT,KAAK,EAAE,IAAI;EACX,SAAS,EAAE,IAAI;EACf,UAAU,EAAE,UAAU;CAAG;;AATjC,AAUI,YAVQ,CAUR,SAAS,CAAC;EACN,MAAM,EAAE,CAAC;EACT,KAAK,EAAE,IAAI;EACX,SAAS,EAAE,MAAM;EACjB,WAAW,EAAE,GAAG;EAChB,KAAK,EDjGC,OAAO;CCiGS;;AAC9B,AAAA,KAAK,CAAC;EACF,SAAS,EAAE,MAAM;EACjB,KAAK,EDpGK,OAAO;ECqGjB,UAAU,EAAE,MAAM;CAAG;;AAEzB,AAAA,OAAO,CAAC;EACJ,UAAU,ED3GJ,OAAO;EC4Gb,aAAa,EAAE,GAAG;EAClB,OAAO,EAlII,MAAM;EAmIjB,MAAM,EAnIK,MAAM,CAmIK,CAAC;EACvB,QAAQ,EAAE,QAAQ;EAClB,UAAU,EAAE,2BAA2B;CAoCX;;AA1ChC,AAOI,OAPG,CAOD,KAAK,EAPX,OAAO,CAOQ,KAAK,CAAC;EACb,UAAU,EDnIH,OAAO;CCmIc;;AARpC,AASI,OATG,CASH,EAAE,CAAC;EACC,MAAM,EAAE,CAAC;EACT,SAAS,EAAE,MAAM;EACjB,WAAW,EAAE,GAAG;EAChB,KAAK,EDrHN,OAAO;CCqHS;;AAbvB,AAcI,OAdG,CAcH,CAAC,CAAC;EACE,KAAK,EDvHN,OAAO;ECwHN,QAAQ,EAAE,QAAQ;EAClB,GAAG,EAAE,CAAC;EACN,IAAI,EAAE,CAAC;EACP,KAAK,EAAE,IAAI;EACX,MAAM,EAAE,IAAI;EACZ,OAAO,EAAE,CAAC;EACV,WAAW,EAAE,OAAO;EACpB,QAAQ,EAAE,MAAM;EAChB,eAAe,EAAE,IAAI;EACrB,UAAU,EAAE,sBAAsB;CAEL;;AA3BrC,AA0BQ,OA1BD,CAcH,CAAC,CAYK,KAAK,EA1Bf,OAAO,CAcH,CAAC,CAYc,KAAK,CAAC;EACb,KAAK,EDhJF,OAAO;CCgJa;;AA3BnC,AA4BI,OA5BG,CA4BD,GAAI,CAAA,CAAC,EAAE;EACL,QAAQ,EAAE,QAAQ;EAClB,OAAO,EAAE,CAAC;CAAG;;AA9BrB,AA+BI,OA/BG,CA+BH,CAAC,CAAC;EACE,MAAM,EAAE,QAAQ;EAChB,SAAS,EAAE,IAAI;EACf,KAAK,ED1IN,OAAO;EC2IN,WAAW,EAAE,GAAG;CAAG;;AAnC3B,AAqCI,OArCG,CAqCH,SAAS,CAAC;EACN,MAAM,EAAE,YAAY;EACpB,KAAK,EAAE,IAAI;EACX,SAAS,EAAE,MAAM;EACjB,WAAW,EAAE,GAAG;EAChB,KAAK,EDjJC,OAAO;CCiJS;;AAE9B,AAAA,WAAW,CAAC;EACR,WAAW,EAAE,GAAG;EAChB,OAAO,EAAE,aAAa;EACtB,aAAa,EAAE,MAAM;EACrB,aAAa,EA7KD,GAAG;CA6KiB;;AAEpC,AAAA,CAAC,CAAC,IAAI,CAAC;EACH,UAAU,ED9KC,OAAO;EC+KlB,MAAM,EAAE,QAAQ;EAChB,OAAO,EAAE,aAAa;EACtB,aAAa,EAAE,GAAG;EAClB,SAAS,EAAE,MAAM;CAAG;;AAExB,AAAA,GAAG,CAAC;EACA,OAAO,EAAE,MAAM;EACf,aAAa,EAAE,GAAG;EAClB,UAAU,EAAE,IAAI;CAEU;;AAL9B,AAII,GAJD,CAIC,IAAI,CAAC;EACD,SAAS,EAAE,MAAM;CAAG;;AAE5B,AAAA,OAAO,CAAC;EACJ,QAAQ,EAAE,KAAK;EACf,GAAG,EAAE,CAAC;EACN,KAAK,EAAE,IAAI;EACX,SAAS,EAhMA,MAAM;EAiMf,gBAAgB,ED5LX,OAAO;EC6LZ,KAAK,EDlLC,OAAO;ECmLb,OAAO,EAAE,KAAK;EACd,WAAW,EAAE,GAAG;EAChB,UAAU,EAAE,MAAM;EAClB,SAAS,EAAE,KAAK;EAChB,aAAa,EAAE,WAAW;EAC1B,OAAO,EAAE,IAAI;EACb,SAAS,EAAE,MAAM;EACjB,MAAM,EAAE,MAAM;EACd,WAAW,EAAE,iBAAqD;CAQ/B;;AAvBvC,AAiBI,OAjBG,CAiBH,CAAC,CAAC;EACE,KAAK,ED9LH,OAAO;EC+LT,eAAe,EAAE,SAAS;EAC1B,WAAW,EAAE,GAAG;EAChB,UAAU,EAAE,sBAAsB;CAEL;;AAvBrC,AAsBQ,OAtBD,CAiBH,CAAC,CAKK,KAAK,EAtBf,OAAO,CAiBH,CAAC,CAKc,KAAK,CAAC;EACb,KAAK,EDlNF,OAAO;CCkNa;;AAEnC,AAAA,IAAI,CAAC,GAAI,CAAA,OAAO,EAAE;EACd,UAAU,EAAE,MAAM;CAAG;;AAEzB,MAAM,mBACF;EAAA,AAAA,OAAO,CAAC;IACJ,QAAQ,EAAE,QAAQ;IAClB,GAAG,EAAE,CAAC;IACN,KAAK,EAAE,mBAAuD;IAC9D,SAAS,EA7NJ,MAAM;IA8NX,gBAAgB,EDzNf,OAAO;IC0NR,KAAK,ED/MH,OAAO;ICgNT,OAAO,EAAE,GAAG;IACZ,WAAW,EAAE,GAAG;IAChB,UAAU,EAAE,MAAM;IAClB,SAAS,EAAE,KAAK;IAChB,aAAa,EAAE,WAAW;IAC1B,OAAO,EAAE,IAAI;IACb,SAAS,EAAE,MAAM;IACjB,MAAM,EAAE,MAAM;IACd,WAAW,EAAE,iBAAqD;GAI5C;EAnB1B,AAiBI,OAjBG,CAiBH,YAAY,CAAC;IACT,OAAO,EAAE,KAAK;IACd,MAAM,EAAE,KAAK;GAAG;EAGxB,AAAA,IAAI,CAAC,GAAI,CAAA,OAAO,EAAE;IACd,UAAU,EAAE,MAAM;GAAG;CAJC;;ACjP9B,AAAA,KAAK,AAAA,eAAe,CAAC;EACjB,KAAK,EAAE,IAAI;EACX,eAAe,EAAE,QAAQ;EAEzB,UAAU,EAAE,UAAU;EACtB,UAAU,EFkBJ,OAAO;EEjBb,UAAU,EAAE,IAAI;CAmEa;;AAzEjC,AAQI,KARC,AAAA,eAAe,CAQhB,EAAE,CAAC;EACC,aAAa,EAAE,GAAG,CAAC,KAAK,CFanB,OAAO;CELgB;;AAjBpC,AAUQ,KAVH,AAAA,eAAe,CAQhB,EAAE,CAEI,SAAU,CAAA,IAAI,EAAE;EACd,UAAU,EFYZ,OAAO;EEXL,UAAU,EAAE,2BAA2B;CAAG;;AAZtD,AAaQ,KAbH,AAAA,eAAe,CAQhB,EAAE,CAKI,SAAU,CAAA,GAAG,EAAE;EACb,UAAU,EFSZ,OAAO;EERL,UAAU,EAAE,2BAA2B;CAAG;;AAftD,AAgBQ,KAhBH,AAAA,eAAe,CAQhB,EAAE,CAQI,KAAK,EAhBf,KAAK,AAAA,eAAe,CAQhB,EAAE,CAQa,KAAK,CAAC;EACb,UAAU,EFOb,OAAO;CEPkB;;AAjBlC,AAmBI,KAnBC,AAAA,eAAe,CAmBhB,KAAK,CAAC;EACF,UAAU,EAAE,IAAI;EAChB,MAAM,EAAE,IAAI;EACZ,aAAa,EDlBL,GAAG,CAAH,GAAG,CCkBkC,CAAC,CAAC,CAAC;CAAG;;AAtB3D,AAwBI,KAxBC,AAAA,eAAe,CAwBhB,EAAE,CAAC;EACC,KAAK,EFAN,OAAO;EECN,UAAU,EFLR,OAAO,CEKY,UAAU;EAC/B,OAAO,EAAE,aAAa;EACtB,UAAU,EAAE,IAAI;EAChB,WAAW,EAAE,GAAG;EAChB,MAAM,EAAE,IAAI;CAAG;;AA9BvB,AAgCI,KAhCC,AAAA,eAAe,CAgChB,EAAE,CAAC;EACC,OAAO,EAAE,aAAa;EACtB,UAAU,EAAE,IAAI;EAChB,WAAW,EAAE,GAAG;EAChB,MAAM,EAAE,IAAI;CAAG;;AApCvB,AAsCI,KAtCC,AAAA,eAAe,CAsChB,EAAE,AAAA,YAAY,CAAC;EACX,WAAW,EAAE,GAAG;EAChB,KAAK,EFdC,OAAO;CEcS;;AAxC9B,AAyCI,KAzCC,AAAA,eAAe,CAyChB,EAAE,AAAA,KAAK,CAAC;EACJ,SAAS,EAAE,KAAK;CAAG;;AA1C3B,AA4CI,KA5CC,AAAA,eAAe,CA4ChB,CAAC,AAAA,UAAU,CAAC;EACR,OAAO,EAAE,aAAa;EACtB,MAAM,EAAE,MAAM;EACd,OAAO,EAAE,YAAY;EACrB,aAAa,ED5CL,GAAG;EC6CX,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,KAAK,EF1BN,OAAO;EE2BN,UAAU,EAAE,mDAAmD;CAGnB;;AAvDpD,AAqDQ,KArDH,AAAA,eAAe,CA4ChB,CAAC,AAAA,UAAU,CASL,KAAK,EArDf,KAAK,AAAA,eAAe,CA4ChB,CAAC,AAAA,UAAU,CASI,KAAK,CAAC;EACb,KAAK,EFjCP,OAAO,CEiCW,UAAU;EAC1B,UAAU,EF7BR,OAAO,CE6BgB,UAAU;CAAG;;AAvDlD,AAyDI,KAzDC,AAAA,eAAe,CAyDhB,CAAC,AAAA,cAAc,CAAC;EACZ,OAAO,EAAE,CAAC;EACV,MAAM,EAAE,MAAM;EACd,OAAO,EAAE,YAAY;EACrB,aAAa,EDzDL,GAAG;EC0DX,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,KAAK,EFvCN,OAAO;EEwCN,UAAU,EAAE,sBAAsB;CAEL;;AAnErC,AAkEQ,KAlEH,AAAA,eAAe,CAyDhB,CAAC,AAAA,cAAc,CAST,KAAK,EAlEf,KAAK,AAAA,eAAe,CAyDhB,CAAC,AAAA,cAAc,CASA,KAAK,CAAC;EACb,KAAK,EFvDF,OAAO;CEuDa;;AAnEnC,AAqEI,KArEC,AAAA,eAAe,CAqEhB,CAAC,CAAC;EACE,KAAK,EF7CN,OAAO;EE8CN,eAAe,EAAE,IAAI;CAEE;;AAzE/B,AAwEQ,KAxEH,AAAA,eAAe,CAqEhB,CAAC,CAGK,KAAK,EAxEf,KAAK,AAAA,eAAe,CAqEhB,CAAC,CAGc,KAAK,CAAC;EACb,KAAK,EF/DR,OAAO;CE+Da;;AAE7B,AAAA,cAAc,CAAC,CAAC,AAAA,UAAU,CAAC;EACvB,OAAO,EAAE,aAAa;EACtB,MAAM,EAAE,MAAM;EACd,OAAO,EAAE,YAAY;EACrB,aAAa,ED3ED,GAAG;EC4Ef,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,SAAS,EAAE,MAAM;EACjB,KAAK,EF1DF,OAAO;EE2DV,UAAU,EAAE,mDAAmD;CAGnB;;AAZhD,AAUI,cAVU,CAAC,CAAC,AAAA,UAAU,CAUpB,KAAK,EAVX,cAAc,CAAC,CAAC,AAAA,UAAU,CAUX,KAAK,CAAC;EACb,KAAK,EFjEH,OAAO,CEiEO,UAAU;EAC1B,UAAU,EF7DJ,OAAO,CE6DY,UAAU;CAAG;;ACxF9C,gBAAgB;AAEhB,AAAA,CAAC,CAAC;EACE,KAAK,EHUM,OAAO;EGTlB,eAAe,EAAE,SAAS;EAC1B,UAAU,EAAE,sBAAsB;CAEV;;AAL5B,AAII,CAJH,CAIK,KAAK,EAJX,CAAC,CAIc,KAAK,CAAC;EACb,KAAK,EHDH,OAAO;CGCS;;AAE1B,AAAA,YAAY,CAAC;EACT,UAAU,EAAE,IAAI;CAAG;;AAEvB,AAAA,UAAU,CAAC;EACP,OAAO,EAAE,IAAI;EACb,GAAG,EFXQ,MAAM;EEYjB,WAAW,EAAE,MAAM;EACnB,SAAS,EAAE,IAAI;EACf,MAAM,EAAE,IAAI,CAAC,CAAC,CFdH,MAAM,CEcY,CAAC;EAC9B,eAAe,EAAE,MAAM;CAAG;;AAE9B,AAAA,UAAU,CAAC,EAAE,CAAC;EACV,IAAI,EAAE,IAAI;CAAG;;AAEjB,AAAA,UAAU,CAAC,EAAE,CAAC;EACV,UAAU,EAAE,IAAI;EAChB,MAAM,EAAE,CAAC;EACT,OAAO,EAAE,CAAC;EACV,OAAO,EAAE,IAAI;EACb,GAAG,EAAE,IAAI;EACT,SAAS,EAAE,IAAI;CAAG;;AAEtB,AAAA,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;EACb,MAAM,EAAE,CAAC;EACT,OAAO,EAAE,CAAC;CAAG;;AAEjB,AAAA,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;EACf,OAAO,EAAE,aAAa;EACtB,aAAa,EFhCD,GAAG;EEiCf,UAAU,EH9BE,OAAO;EG+BnB,KAAK,EHjBC,OAAO;EGkBb,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,UAAU,EAAE,2BAA2B;CAEL;;AATtC,AAQI,UARM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAQZ,KAAK,EARX,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAQH,KAAK,CAAC;EACb,UAAU,EH/BH,OAAO;CG+Bc;;AAEpC,AAAA,CAAC,AAAA,OAAO,CAAC;EACL,OAAO,EAAE,aAAa;EACtB,MAAM,EAAE,QAAQ;EAChB,aAAa,EF5CD,GAAG;EE6Cf,UAAU,EH1CE,OAAO;EG2CnB,KAAK,EH7BC,OAAO;EG8Bb,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,UAAU,EAAE,2BAA2B;CAEL;;AAVtC,AASI,CATH,AAAA,OAAO,CASF,KAAK,EATX,CAAC,AAAA,OAAO,CASO,KAAK,CAAC;EACb,UAAU,EH3CH,OAAO;CG2Cc;;ACxDpC,AAAA,aAAa,CAAC;EACV,WAAW,EAAE,GAAG;CAmBmB;;AApBvC,AAEI,aAFS,CAET,EAAE,CAAC;EACC,UAAU,EAAE,IAAI;EAChB,MAAM,EAAE,CAAC;EACT,OAAO,EAAE,CAAC;EACV,OAAO,EAAE,IAAI;EACb,cAAc,EAAE,MAAM;EACtB,GAAG,EAAE,GAAG;CAKmB;;AAbnC,AAUQ,aAVK,CAET,EAAE,CAQE,EAAE,CAAC;EACC,UAAU,EJaZ,OAAO;EIZL,aAAa,EAAE,GAAG;EAClB,OAAO,EAAE,SAAS;CAAG;;AAbjC,AAcI,aAdS,CAcT,CAAC,CAAC;EACE,KAAK,EJPG,OAAO;EIQf,eAAe,EAAE,IAAI;EACrB,WAAW,EAAE,GAAG;EAChB,UAAU,EAAE,sBAAsB;CAEL;;AApBrC,AAmBQ,aAnBK,CAcT,CAAC,CAKK,KAAK,EAnBf,aAAa,CAcT,CAAC,CAKc,KAAK,CAAC;EACb,KAAK,EJPF,OAAO;CIOa" } \ No newline at end of file diff --git a/developers/albert-ludwigs-universität/index.html b/developers/albert-ludwigs-universität/index.html index aa7f901..e0eb14a 100644 --- a/developers/albert-ludwigs-universität/index.html +++ b/developers/albert-ludwigs-universität/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/developers/albert-ludwigs-universität/index.xml b/developers/albert-ludwigs-universität/index.xml index 1483011..96446f6 100644 --- a/developers/albert-ludwigs-universität/index.xml +++ b/developers/albert-ludwigs-universität/index.xml @@ -2,18 +2,18 @@ Albert-Ludwigs-Universität on Formal Methods Tools - http://localhost:1313/developers/albert-ludwigs-universit%C3%A4t/ + https://example.org/developers/albert-ludwigs-universit%C3%A4t/ Recent content in Albert-Ludwigs-Universität on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + ParaFROST - http://localhost:1313/tools/sat-smt/parafrost/ + https://example.org/tools/sat-smt/parafrost/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/parafrost/ - <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/parafrost/ + <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/developers/cea/index.html b/developers/cea/index.html index dd06f83..131244a 100644 --- a/developers/cea/index.html +++ b/developers/cea/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -97,6 +105,7 @@ diff --git a/developers/cea/index.xml b/developers/cea/index.xml index ca89d51..06e663b 100644 --- a/developers/cea/index.xml +++ b/developers/cea/index.xml @@ -2,17 +2,17 @@ CEA on Formal Methods Tools - http://localhost:1313/developers/cea/ + https://example.org/developers/cea/ Recent content in CEA on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Colibri - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ <p>Colibri is an SMT solver.</p> diff --git a/developers/disi-university-of-trento/index.html b/developers/disi-university-of-trento/index.html index 779f4b3..0ae9017 100644 --- a/developers/disi-university-of-trento/index.html +++ b/developers/disi-university-of-trento/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/developers/disi-university-of-trento/index.xml b/developers/disi-university-of-trento/index.xml index 55d26af..05790f9 100644 --- a/developers/disi-university-of-trento/index.xml +++ b/developers/disi-university-of-trento/index.xml @@ -2,17 +2,17 @@ DISI-University of Trento on Formal Methods Tools - http://localhost:1313/developers/disi-university-of-trento/ + https://example.org/developers/disi-university-of-trento/ Recent content in DISI-University of Trento on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + MathSAT - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ <p><div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(226, 181, 59);"></span> <span style="display:none">[</span> <span style="color: rgb(226, 181, 59); font-size: 1rem;">Closed-Source Tool</span> <span style="display:none">]&nbsp;</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> diff --git a/developers/eindhoven-university-of-technology/index.html b/developers/eindhoven-university-of-technology/index.html index 5d5ef0f..2bba910 100644 --- a/developers/eindhoven-university-of-technology/index.html +++ b/developers/eindhoven-university-of-technology/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/developers/eindhoven-university-of-technology/index.xml b/developers/eindhoven-university-of-technology/index.xml index 96f23e7..48a871d 100644 --- a/developers/eindhoven-university-of-technology/index.xml +++ b/developers/eindhoven-university-of-technology/index.xml @@ -2,18 +2,18 @@ Eindhoven University of Technology on Formal Methods Tools - http://localhost:1313/developers/eindhoven-university-of-technology/ + https://example.org/developers/eindhoven-university-of-technology/ Recent content in Eindhoven University of Technology on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + ParaFROST - http://localhost:1313/tools/sat-smt/parafrost/ + https://example.org/tools/sat-smt/parafrost/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/parafrost/ - <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/parafrost/ + <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/developers/fondazione-bruno-kessler/index.html b/developers/fondazione-bruno-kessler/index.html index 58b1e43..9fdd8a8 100644 --- a/developers/fondazione-bruno-kessler/index.html +++ b/developers/fondazione-bruno-kessler/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/developers/fondazione-bruno-kessler/index.xml b/developers/fondazione-bruno-kessler/index.xml index 984bcd0..c7231af 100644 --- a/developers/fondazione-bruno-kessler/index.xml +++ b/developers/fondazione-bruno-kessler/index.xml @@ -2,17 +2,17 @@ Fondazione Bruno Kessler on Formal Methods Tools - http://localhost:1313/developers/fondazione-bruno-kessler/ + https://example.org/developers/fondazione-bruno-kessler/ Recent content in Fondazione Bruno Kessler on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + MathSAT - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ <p><div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(226, 181, 59);"></span> <span style="display:none">[</span> <span style="color: rgb(226, 181, 59); font-size: 1rem;">Closed-Source Tool</span> <span style="display:none">]&nbsp;</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> diff --git a/developers/gilles-audemard/index.html b/developers/gilles-audemard/index.html index 037e43c..9824986 100644 --- a/developers/gilles-audemard/index.html +++ b/developers/gilles-audemard/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -97,6 +105,7 @@ diff --git a/developers/gilles-audemard/index.xml b/developers/gilles-audemard/index.xml index 88b5611..3c9b927 100644 --- a/developers/gilles-audemard/index.xml +++ b/developers/gilles-audemard/index.xml @@ -2,17 +2,17 @@ Gilles Audemard on Formal Methods Tools - http://localhost:1313/developers/gilles-audemard/ + https://example.org/developers/gilles-audemard/ Recent content in Gilles Audemard on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Glucose - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ <p>Glucose is a SAT solver.</p> diff --git a/developers/index.html b/developers/index.html index 1d4a13a..e47a024 100644 --- a/developers/index.html +++ b/developers/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -340,6 +348,24 @@ + + Oxford University + + + + + + + + + + + + + + + + + + + + + + + Utah State University + + + diff --git a/developers/index.xml b/developers/index.xml index 5a148e2..0ddccb1 100644 --- a/developers/index.xml +++ b/developers/index.xml @@ -2,178 +2,192 @@ Developers on Formal Methods Tools - http://localhost:1313/developers/ + https://example.org/developers/ Recent content in Developers on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Albert-Ludwigs-Universität - http://localhost:1313/developers/albert-ludwigs-universit%C3%A4t/ + https://example.org/developers/albert-ludwigs-universit%C3%A4t/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/albert-ludwigs-universit%C3%A4t/ + https://example.org/developers/albert-ludwigs-universit%C3%A4t/ CEA - http://localhost:1313/developers/cea/ + https://example.org/developers/cea/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/cea/ + https://example.org/developers/cea/ DISI-University of Trento - http://localhost:1313/developers/disi-university-of-trento/ + https://example.org/developers/disi-university-of-trento/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/disi-university-of-trento/ + https://example.org/developers/disi-university-of-trento/ Eindhoven University of Technology - http://localhost:1313/developers/eindhoven-university-of-technology/ + https://example.org/developers/eindhoven-university-of-technology/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/eindhoven-university-of-technology/ + https://example.org/developers/eindhoven-university-of-technology/ Fondazione Bruno Kessler - http://localhost:1313/developers/fondazione-bruno-kessler/ + https://example.org/developers/fondazione-bruno-kessler/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/fondazione-bruno-kessler/ + https://example.org/developers/fondazione-bruno-kessler/ Gilles Audemard - http://localhost:1313/developers/gilles-audemard/ + https://example.org/developers/gilles-audemard/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/gilles-audemard/ + https://example.org/developers/gilles-audemard/ INRIA Rhône-Alpes - http://localhost:1313/developers/inria-rh%C3%B4ne-alpes/ + https://example.org/developers/inria-rh%C3%B4ne-alpes/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/inria-rh%C3%B4ne-alpes/ + https://example.org/developers/inria-rh%C3%B4ne-alpes/ Johannes Kepler Universität Linz - http://localhost:1313/developers/johannes-kepler-universit%C3%A4t-linz/ + https://example.org/developers/johannes-kepler-universit%C3%A4t-linz/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/johannes-kepler-universit%C3%A4t-linz/ + https://example.org/developers/johannes-kepler-universit%C3%A4t-linz/ Laurent Simon - http://localhost:1313/developers/laurent-simon/ + https://example.org/developers/laurent-simon/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/laurent-simon/ + https://example.org/developers/laurent-simon/ LORIA - http://localhost:1313/developers/loria/ + https://example.org/developers/loria/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/loria/ + https://example.org/developers/loria/ Masaryk University - http://localhost:1313/developers/masaryk-university/ + https://example.org/developers/masaryk-university/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/masaryk-university/ + https://example.org/developers/masaryk-university/ Microsoft Research - http://localhost:1313/developers/microsoft-research/ + https://example.org/developers/microsoft-research/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/microsoft-research/ + https://example.org/developers/microsoft-research/ Niklas Eén - http://localhost:1313/developers/niklas-e%C3%A9n/ + https://example.org/developers/niklas-e%C3%A9n/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/niklas-e%C3%A9n/ + https://example.org/developers/niklas-e%C3%A9n/ Niklas Sörensson - http://localhost:1313/developers/niklas-s%C3%B6rensson/ + https://example.org/developers/niklas-s%C3%B6rensson/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/niklas-s%C3%B6rensson/ + https://example.org/developers/niklas-s%C3%B6rensson/ Norbert Manthey - http://localhost:1313/developers/norbert-manthey/ + https://example.org/developers/norbert-manthey/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/norbert-manthey/ + https://example.org/developers/norbert-manthey/ + + + + Oxford University + https://example.org/developers/oxford-university/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/developers/oxford-university/ RWTH Aachen - http://localhost:1313/developers/rwth-aachen/ + https://example.org/developers/rwth-aachen/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/rwth-aachen/ + https://example.org/developers/rwth-aachen/ SRI International - http://localhost:1313/developers/sri-international/ + https://example.org/developers/sri-international/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/sri-international/ + https://example.org/developers/sri-international/ Stanford University - http://localhost:1313/developers/stanford-university/ + https://example.org/developers/stanford-university/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/stanford-university/ + https://example.org/developers/stanford-university/ ULiege - http://localhost:1313/developers/uliege/ + https://example.org/developers/uliege/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/uliege/ + https://example.org/developers/uliege/ University of Freiburg - http://localhost:1313/developers/university-of-freiburg/ + https://example.org/developers/university-of-freiburg/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/university-of-freiburg/ + https://example.org/developers/university-of-freiburg/ University of Illinois - http://localhost:1313/developers/university-of-illinois/ + https://example.org/developers/university-of-illinois/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/university-of-illinois/ + https://example.org/developers/university-of-illinois/ University of Iowa - http://localhost:1313/developers/university-of-iowa/ + https://example.org/developers/university-of-iowa/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/university-of-iowa/ + https://example.org/developers/university-of-iowa/ University of Lugano - http://localhost:1313/developers/university-of-lugano/ + https://example.org/developers/university-of-lugano/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/university-of-lugano/ + https://example.org/developers/university-of-lugano/ University of Virginia - http://localhost:1313/developers/university-of-virginia/ + https://example.org/developers/university-of-virginia/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/developers/university-of-virginia/ + https://example.org/developers/university-of-virginia/ + + + + Utah State University + https://example.org/developers/utah-state-university/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/developers/utah-state-university/ diff --git a/developers/inria-rhône-alpes/index.html b/developers/inria-rhône-alpes/index.html index 0683ead..f203eb3 100644 --- a/developers/inria-rhône-alpes/index.html +++ b/developers/inria-rhône-alpes/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -97,6 +105,7 @@ APIs and Bindings This tool is available through the following … diff --git a/developers/inria-rhône-alpes/index.xml b/developers/inria-rhône-alpes/index.xml index c9ab4b1..ad6533f 100644 --- a/developers/inria-rhône-alpes/index.xml +++ b/developers/inria-rhône-alpes/index.xml @@ -2,18 +2,18 @@ INRIA Rhône-Alpes on Formal Methods Tools - http://localhost:1313/developers/inria-rh%C3%B4ne-alpes/ + https://example.org/developers/inria-rh%C3%B4ne-alpes/ Recent content in INRIA Rhône-Alpes on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + CryptoMiniSat - http://localhost:1313/tools/sat-smt/cryptominisat/ + https://example.org/tools/sat-smt/cryptominisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cryptominisat/ - <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/">homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/">PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/cryptominisat/ + <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/" target="_blank" >homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/" target="_blank" >PyPI package</a></li> </ul> diff --git a/developers/johannes-kepler-universität-linz/index.html b/developers/johannes-kepler-universität-linz/index.html index 908b40f..2929daa 100644 --- a/developers/johannes-kepler-universität-linz/index.html +++ b/developers/johannes-kepler-universität-linz/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -105,6 +113,7 @@ diff --git a/developers/johannes-kepler-universität-linz/index.xml b/developers/johannes-kepler-universität-linz/index.xml index 29f890c..85d9f15 100644 --- a/developers/johannes-kepler-universität-linz/index.xml +++ b/developers/johannes-kepler-universität-linz/index.xml @@ -2,24 +2,24 @@ Johannes Kepler Universität Linz on Formal Methods Tools - http://localhost:1313/developers/johannes-kepler-universit%C3%A4t-linz/ + https://example.org/developers/johannes-kepler-universit%C3%A4t-linz/ Recent content in Johannes Kepler Universität Linz on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Boolector - http://localhost:1313/tools/sat-smt/boolector/ + https://example.org/tools/sat-smt/boolector/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/boolector/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla">Bitwuzla</a></p> + https://example.org/tools/sat-smt/boolector/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla" >Bitwuzla</a></p> Lingeling - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ <p>Lingeling is a SAT solver.</p> diff --git a/developers/laurent-simon/index.html b/developers/laurent-simon/index.html index 1e658ef..405be5f 100644 --- a/developers/laurent-simon/index.html +++ b/developers/laurent-simon/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -97,6 +105,7 @@ diff --git a/developers/laurent-simon/index.xml b/developers/laurent-simon/index.xml index e48763d..f9314b9 100644 --- a/developers/laurent-simon/index.xml +++ b/developers/laurent-simon/index.xml @@ -2,17 +2,17 @@ Laurent Simon on Formal Methods Tools - http://localhost:1313/developers/laurent-simon/ + https://example.org/developers/laurent-simon/ Recent content in Laurent Simon on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Glucose - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ <p>Glucose is a SAT solver.</p> diff --git a/developers/loria/index.html b/developers/loria/index.html index b4b0377..a69b196 100644 --- a/developers/loria/index.html +++ b/developers/loria/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/developers/loria/index.xml b/developers/loria/index.xml index 4698554..8aa6973 100644 --- a/developers/loria/index.xml +++ b/developers/loria/index.xml @@ -2,17 +2,17 @@ LORIA on Formal Methods Tools - http://localhost:1313/developers/loria/ + https://example.org/developers/loria/ Recent content in LORIA on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + veriT - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ <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 verification, automated reasoning, and related research areas. veriT accepts input in SMT-LIB2 and DIMACS formats and provides a command-line interface for ease of integration into verification workflows. The solver is actively maintained and distributed under the BSD license, making it suitable for both academic and industrial applications.</p> diff --git a/developers/masaryk-university/index.html b/developers/masaryk-university/index.html index cdaca46..bf5f235 100644 --- a/developers/masaryk-university/index.html +++ b/developers/masaryk-university/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/developers/masaryk-university/index.xml b/developers/masaryk-university/index.xml index 1f3632f..2f36b3b 100644 --- a/developers/masaryk-university/index.xml +++ b/developers/masaryk-university/index.xml @@ -2,17 +2,17 @@ Masaryk University on Formal Methods Tools - http://localhost:1313/developers/masaryk-university/ + https://example.org/developers/masaryk-university/ Recent content in Masaryk University on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Q3B - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.</p> diff --git a/developers/microsoft-research/index.html b/developers/microsoft-research/index.html index 8360e17..de77307 100644 --- a/developers/microsoft-research/index.html +++ b/developers/microsoft-research/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -97,6 +105,7 @@ APIs and Bindings This … diff --git a/developers/microsoft-research/index.xml b/developers/microsoft-research/index.xml index 12071fd..185f3df 100644 --- a/developers/microsoft-research/index.xml +++ b/developers/microsoft-research/index.xml @@ -2,18 +2,18 @@ Microsoft Research on Formal Methods Tools - http://localhost:1313/developers/microsoft-research/ + https://example.org/developers/microsoft-research/ Recent content in Microsoft Research on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/developers/niklas-eén/index.html b/developers/niklas-eén/index.html index 018623c..4060a5d 100644 --- a/developers/niklas-eén/index.html +++ b/developers/niklas-eén/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/developers/niklas-eén/index.xml b/developers/niklas-eén/index.xml index d94811d..8cfe3df 100644 --- a/developers/niklas-eén/index.xml +++ b/developers/niklas-eén/index.xml @@ -2,17 +2,17 @@ Niklas Eén on Formal Methods Tools - http://localhost:1313/developers/niklas-e%C3%A9n/ + https://example.org/developers/niklas-e%C3%A9n/ Recent content in Niklas Eén on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + MiniSat - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2013</span> <span style="display:none">]</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> diff --git a/developers/niklas-sörensson/index.html b/developers/niklas-sörensson/index.html index a4e5e20..2f66500 100644 --- a/developers/niklas-sörensson/index.html +++ b/developers/niklas-sörensson/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/developers/niklas-sörensson/index.xml b/developers/niklas-sörensson/index.xml index 6cb206f..e387246 100644 --- a/developers/niklas-sörensson/index.xml +++ b/developers/niklas-sörensson/index.xml @@ -2,17 +2,17 @@ Niklas Sörensson on Formal Methods Tools - http://localhost:1313/developers/niklas-s%C3%B6rensson/ + https://example.org/developers/niklas-s%C3%B6rensson/ Recent content in Niklas Sörensson on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + MiniSat - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2013</span> <span style="display:none">]</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> diff --git a/developers/norbert-manthey/index.html b/developers/norbert-manthey/index.html index 787b7b0..eb30520 100644 --- a/developers/norbert-manthey/index.html +++ b/developers/norbert-manthey/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -97,6 +105,7 @@ diff --git a/developers/norbert-manthey/index.xml b/developers/norbert-manthey/index.xml index ba886b5..ab73409 100644 --- a/developers/norbert-manthey/index.xml +++ b/developers/norbert-manthey/index.xml @@ -2,17 +2,17 @@ Norbert Manthey on Formal Methods Tools - http://localhost:1313/developers/norbert-manthey/ + https://example.org/developers/norbert-manthey/ Recent content in Norbert Manthey on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Riss - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2017</span> <span style="display:none">]</span> </div> Riss is a SAT solving tool collection.</p> diff --git a/developers/oxford-university/index.html b/developers/oxford-university/index.html new file mode 100644 index 0000000..0457f91 --- /dev/null +++ b/developers/oxford-university/index.html @@ -0,0 +1,112 @@ + + + + + + + + +Oxford University | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Oxford University + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
PRISMPRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that …
+ +
+ + + diff --git a/developers/oxford-university/index.xml b/developers/oxford-university/index.xml new file mode 100644 index 0000000..0dd71c0 --- /dev/null +++ b/developers/oxford-university/index.xml @@ -0,0 +1,19 @@ + + + + Oxford University on Formal Methods Tools + https://example.org/developers/oxford-university/ + Recent content in Oxford University on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + PRISM + https://example.org/tools/prob/prism/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/prism/ + <p>PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or probabilistic behaviour.</p> + + + diff --git a/developers/rwth-aachen/index.html b/developers/rwth-aachen/index.html index 92489e6..e43ee24 100644 --- a/developers/rwth-aachen/index.html +++ b/developers/rwth-aachen/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -88,6 +96,15 @@ APIs and Bindings This tool is available through the … + + + + Storm + Storm is a tool for the analysis of systems involving random or probabilistic phenomena. + + + + @@ -97,6 +114,7 @@ APIs and Bindings This tool is available through the … diff --git a/developers/rwth-aachen/index.xml b/developers/rwth-aachen/index.xml index aaea8cf..78de16f 100644 --- a/developers/rwth-aachen/index.xml +++ b/developers/rwth-aachen/index.xml @@ -2,18 +2,25 @@ RWTH Aachen on Formal Methods Tools - http://localhost:1313/developers/rwth-aachen/ + https://example.org/developers/rwth-aachen/ Recent content in RWTH Aachen on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + SMT-RAT - http://localhost:1313/tools/sat-smt/smt-rat/ + https://example.org/tools/sat-smt/smt-rat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smt-rat/ - <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25">C++ API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smt-rat/ + <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25" target="_blank" >C++ API Reference</a></li> </ul> + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> diff --git a/developers/sri-international/index.html b/developers/sri-international/index.html index f9cac0f..938e783 100644 --- a/developers/sri-international/index.html +++ b/developers/sri-international/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -81,6 +89,15 @@ + + Sally + Sally is a model checker for infinite state systems described as transition systems. + + + + + + Yices 2 Yices is an SMT solver developed by SRI International. It is widely used for checking the … @@ -96,6 +113,7 @@ diff --git a/developers/sri-international/index.xml b/developers/sri-international/index.xml index 5afe66a..e4ec35f 100644 --- a/developers/sri-international/index.xml +++ b/developers/sri-international/index.xml @@ -2,18 +2,25 @@ SRI International on Formal Methods Tools - http://localhost:1313/developers/sri-international/ + https://example.org/developers/sri-international/ Recent content in SRI International on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + + + Sally + https://example.org/tools/mc/sally/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/mc/sally/ + <p>Sally is a model checker for infinite state systems described as transition systems.</p> + Yices 2 - http://localhost:1313/tools/sat-smt/yices/ + https://example.org/tools/sat-smt/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/yices/ - <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html">Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/">yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2">yices2 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/yices/ + <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html" target="_blank" >Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/" target="_blank" >yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2" target="_blank" >yices2 crate on crates.io</a></li> </ul> diff --git a/developers/stanford-university/index.html b/developers/stanford-university/index.html index 8b3dd11..1767303 100644 --- a/developers/stanford-university/index.html +++ b/developers/stanford-university/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -130,6 +138,7 @@ APIs and Bindings This tool is available … diff --git a/developers/stanford-university/index.xml b/developers/stanford-university/index.xml index b20a48d..39b5df4 100644 --- a/developers/stanford-university/index.xml +++ b/developers/stanford-university/index.xml @@ -2,46 +2,46 @@ Stanford University on Formal Methods Tools - http://localhost:1313/developers/stanford-university/ + https://example.org/developers/stanford-university/ Recent content in Stanford University on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Bitwuzla - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ <p>Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.</p> Boolector - http://localhost:1313/tools/sat-smt/boolector/ + https://example.org/tools/sat-smt/boolector/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/boolector/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla">Bitwuzla</a></p> + https://example.org/tools/sat-smt/boolector/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla" >Bitwuzla</a></p> cvc4 - http://localhost:1313/tools/sat-smt/cvc4/ + https://example.org/tools/sat-smt/cvc4/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc4/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5">cvc5</a></p> + https://example.org/tools/sat-smt/cvc4/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5" >cvc5</a></p> cvc5 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ <p>cvc5 is an automatic theorem prover for SMT problems.</p> STP - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/stp/ - <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/stp/ + <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage" target="_blank" >stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage" target="_blank" >stp PyPI package</a></li> </ul> diff --git a/developers/uliege/index.html b/developers/uliege/index.html index 7fe3b82..c4c6dab 100644 --- a/developers/uliege/index.html +++ b/developers/uliege/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/developers/uliege/index.xml b/developers/uliege/index.xml index 3d157e8..cd3ac19 100644 --- a/developers/uliege/index.xml +++ b/developers/uliege/index.xml @@ -2,17 +2,17 @@ ULiege on Formal Methods Tools - http://localhost:1313/developers/uliege/ + https://example.org/developers/uliege/ Recent content in ULiege on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + veriT - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ <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 verification, automated reasoning, and related research areas. veriT accepts input in SMT-LIB2 and DIMACS formats and provides a command-line interface for ease of integration into verification workflows. The solver is actively maintained and distributed under the BSD license, making it suitable for both academic and industrial applications.</p> diff --git a/developers/university-of-freiburg/index.html b/developers/university-of-freiburg/index.html index 8675e1e..7f29691 100644 --- a/developers/university-of-freiburg/index.html +++ b/developers/university-of-freiburg/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -97,6 +105,7 @@ APIs and … diff --git a/developers/university-of-freiburg/index.xml b/developers/university-of-freiburg/index.xml index 353d980..8e4db55 100644 --- a/developers/university-of-freiburg/index.xml +++ b/developers/university-of-freiburg/index.xml @@ -2,18 +2,18 @@ University of Freiburg on Formal Methods Tools - http://localhost:1313/developers/university-of-freiburg/ + https://example.org/developers/university-of-freiburg/ Recent content in University of Freiburg on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + SMTInterpol - http://localhost:1313/tools/sat-smt/smtinterpol/ + https://example.org/tools/sat-smt/smtinterpol/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smtinterpol/ - <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html">Java API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smtinterpol/ + <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html" target="_blank" >Java API Reference</a></li> </ul> diff --git a/developers/university-of-illinois/index.html b/developers/university-of-illinois/index.html index 0a83837..123d5b0 100644 --- a/developers/university-of-illinois/index.html +++ b/developers/university-of-illinois/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -97,6 +105,7 @@ APIs and Bindings This tool is available … diff --git a/developers/university-of-illinois/index.xml b/developers/university-of-illinois/index.xml index f750089..54d16f7 100644 --- a/developers/university-of-illinois/index.xml +++ b/developers/university-of-illinois/index.xml @@ -2,18 +2,18 @@ University of Illinois on Formal Methods Tools - http://localhost:1313/developers/university-of-illinois/ + https://example.org/developers/university-of-illinois/ Recent content in University of Illinois on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + STP - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/stp/ - <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/stp/ + <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage" target="_blank" >stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage" target="_blank" >stp PyPI package</a></li> </ul> diff --git a/developers/university-of-iowa/index.html b/developers/university-of-iowa/index.html index 154df16..6b1eec8 100644 --- a/developers/university-of-iowa/index.html +++ b/developers/university-of-iowa/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -105,6 +113,7 @@ diff --git a/developers/university-of-iowa/index.xml b/developers/university-of-iowa/index.xml index 6ee7af5..f80565b 100644 --- a/developers/university-of-iowa/index.xml +++ b/developers/university-of-iowa/index.xml @@ -2,24 +2,24 @@ University of Iowa on Formal Methods Tools - http://localhost:1313/developers/university-of-iowa/ + https://example.org/developers/university-of-iowa/ Recent content in University of Iowa on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + cvc4 - http://localhost:1313/tools/sat-smt/cvc4/ + https://example.org/tools/sat-smt/cvc4/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc4/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5">cvc5</a></p> + https://example.org/tools/sat-smt/cvc4/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5" >cvc5</a></p> cvc5 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ <p>cvc5 is an automatic theorem prover for SMT problems.</p> diff --git a/developers/university-of-lugano/index.html b/developers/university-of-lugano/index.html index c9d8562..0201311 100644 --- a/developers/university-of-lugano/index.html +++ b/developers/university-of-lugano/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/developers/university-of-lugano/index.xml b/developers/university-of-lugano/index.xml index 4201854..a2af1a1 100644 --- a/developers/university-of-lugano/index.xml +++ b/developers/university-of-lugano/index.xml @@ -2,18 +2,18 @@ University of Lugano on Formal Methods Tools - http://localhost:1313/developers/university-of-lugano/ + https://example.org/developers/university-of-lugano/ Recent content in University of Lugano on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + OpenSMT - http://localhost:1313/tools/sat-smt/opensmt/ + https://example.org/tools/sat-smt/opensmt/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/opensmt/ - <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="http://localhost:1313/tools/minisat">MiniSAT</a>.</p> + https://example.org/tools/sat-smt/opensmt/ + <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="https://example.org/tools/minisat" >MiniSAT</a>.</p> diff --git a/developers/university-of-virginia/index.html b/developers/university-of-virginia/index.html index c9f53a2..3abd5d9 100644 --- a/developers/university-of-virginia/index.html +++ b/developers/university-of-virginia/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -97,6 +105,7 @@ APIs and Bindings This tool is available through the following … diff --git a/developers/university-of-virginia/index.xml b/developers/university-of-virginia/index.xml index 93300c2..3778902 100644 --- a/developers/university-of-virginia/index.xml +++ b/developers/university-of-virginia/index.xml @@ -2,18 +2,18 @@ University of Virginia on Formal Methods Tools - http://localhost:1313/developers/university-of-virginia/ + https://example.org/developers/university-of-virginia/ Recent content in University of Virginia on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + CryptoMiniSat - http://localhost:1313/tools/sat-smt/cryptominisat/ + https://example.org/tools/sat-smt/cryptominisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cryptominisat/ - <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/">homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/">PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/cryptominisat/ + <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/" target="_blank" >homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/" target="_blank" >PyPI package</a></li> </ul> diff --git a/developers/utah-state-university/index.html b/developers/utah-state-university/index.html new file mode 100644 index 0000000..72c042d --- /dev/null +++ b/developers/utah-state-university/index.html @@ -0,0 +1,112 @@ + + + + + + + + +Utah State University | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Utah State University + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
STAMINAA state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces …
+ +
+ + + diff --git a/developers/utah-state-university/index.xml b/developers/utah-state-university/index.xml new file mode 100644 index 0000000..67a0e82 --- /dev/null +++ b/developers/utah-state-university/index.xml @@ -0,0 +1,19 @@ + + + + Utah State University on Formal Methods Tools + https://example.org/developers/utah-state-university/ + Recent content in Utah State University on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + STAMINA + https://example.org/tools/prob/stamina/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/stamina/ + <p>A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces with either <a href="../storm" >Storm</a> or <a href="../prism" >PRISM</a>.</p> + + + diff --git a/domains/index.html b/domains/index.html index 5facfa7..89fdf01 100644 --- a/domains/index.html +++ b/domains/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -67,6 +75,7 @@ diff --git a/domains/index.xml b/domains/index.xml index b61f720..b960c67 100644 --- a/domains/index.xml +++ b/domains/index.xml @@ -2,10 +2,10 @@ Domains on Formal Methods Tools - http://localhost:1313/domains/ + https://example.org/domains/ Recent content in Domains on Formal Methods Tools Hugo en-us - + diff --git a/index.html b/index.html index d885295..c332665 100644 --- a/index.html +++ b/index.html @@ -1,7 +1,7 @@ - + @@ -15,16 +15,16 @@ - + - + - - - - + + + + - + @@ -36,6 +36,14 @@ + + + +

Formal Methods Tools

@@ -68,16 +76,16 @@

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. -Explore a wide selection of tools, contribute tools you make or love, and help grow the formal methods community.

+Explore a wide selection of tools, contribute tools you make or love, and help grow the formal methods community.

Below are some quick links that may be helpful, plus a random selection of tools (refreshed every time I push updates to this site).

-

+

-SMT Solvers +List of Tools - + -Model Checkers +Taxonomy Data @@ -95,37 +103,13 @@ Contribute

- -
-

- Colibri - - SMT Solver - -

-

Colibri is an SMT solver. -

- Colibri -
- -
-

- cvc5 - - Theorem Prover - -

-

cvc5 is an automatic theorem prover for SMT problems. -

- cvc5 +

veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is designed for use in formal …

+ veriT
@@ -141,129 +125,15 @@ Contribute

- Q3B + SMT-RAT - SMT Solver + SMT Toolbox

-

[ Not Maintained Since 2023 ] Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs. -

- Q3B -
- -
-

- MiniSat - - SAT Solver - -

-

[ Not Maintained Since 2013 ] MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and …

- MiniSat -
- -
-

- Boolector - - SMT Solver - -

-

[ Not Maintained Since 2024 ] Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size …

- Boolector -
- -
-

- MathSAT - - SMT Solver - -

-

[ Closed-Source Tool ]  MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers …

- MathSAT -
- -
-

- SMTInterpol - - Interpolating SMT Solver - -

-

SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories. -APIs and Bindings This tool is …

- SMTInterpol -
- -
-

- ParaFROST - - SMT Solver - -

-

ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in …

- ParaFROST -
- -
-

- veriT - - SMT Solver - -

-

veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is designed for use in formal …

- veriT -
- -
-

- Z3 - - Theorem Prover - -

-

Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. -APIs and Bindings This tool is available …

- Z3 -
- -
-

- cvc4 - - Theorem Prover - -

-

[ Not Maintained Since 2021 ] cvc4 is an automatic theorem prover for SMT problems. It is succeeded by cvc5 -

- cvc4 -
- -
-

- Lingeling - - SMT Solver - -

-

Lingeling is a SAT solver. -

- Lingeling -
- -
-

- STP - - Simple Theorem Prover - -

-

STP is a constraint solver for quantifier-free bitvectors. -APIs and Bindings This tool is available through the following …

- STP +

SMT-RAT is an SMT Real Algebra Toolbox. +APIs and Bindings This tool is available through the following interfaces: +C++ API: …

+ SMT-RAT
@@ -278,6 +148,18 @@ APIs and Bindings This tool is available through the following …

Glucose
+
+

+ Colibri + + SMT Solver + +

+

Colibri is an SMT solver. +

+ Colibri +
+

Riss @@ -290,6 +172,109 @@ APIs and Bindings This tool is available through the following …

Riss

+
+

+ STAMINA + + Probabilistic Model Checker + +

+

A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces with either Storm or PRISM. …

+ STAMINA +
+ +
+

+ ParaFROST + + SMT Solver + +

+

ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in …

+ ParaFROST +
+ +
+

+ MiniSat + + SAT Solver + +

+

[ Not Maintained Since 2013 ] MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and …

+ MiniSat +
+ +
+

+ OpenSMT + + SMT Solver + +

+

OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand …

+ OpenSMT +
+ +
+

+ Z3 + + Theorem Prover + +

+

Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This tool is available …

+ Z3 +
+ +
+

+ Q3B + + SMT Solver + +

+

[ Not Maintained Since 2023 ] Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs. +

+ Q3B +
+ +
+

+ STP + + Simple Theorem Prover + +

+

STP is a constraint solver for quantifier-free bitvectors. +APIs and Bindings This tool is available through the following …

+ STP +
+ +
+

+ cvc4 + + Theorem Prover + +

+

[ Not Maintained Since 2021 ] cvc4 is an automatic theorem prover for SMT problems. It is succeeded by cvc5 +

+ cvc4 +
+ +
+

+ MathSAT + + SMT Solver + +

+

[ Closed-Source Tool ]  MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers …

+ MathSAT +
+

CryptoMiniSat @@ -305,26 +290,48 @@ C++ Namespace: …

- dReal + cvc5 - SMT Solver + Theorem Prover

-

[ Not Maintained Since 2023 ] dReal is an automated reasoning tool. It focuses on solving problems that can be encoded as …

- dReal +

cvc5 is an automatic theorem prover for SMT problems. +

+ cvc5

- SMT-RAT + Boolector - SMT Toolbox + SMT Solver

-

SMT-RAT is an SMT Real Algebra Toolbox. -APIs and Bindings This tool is available through the following interfaces: -C++ API: …

- SMT-RAT +

[ Not Maintained Since 2024 ] Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size …

+ Boolector +
+ +
+

+ SMTInterpol + + Interpolating SMT Solver + +

+

SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories. +APIs and Bindings This tool is …

+ SMTInterpol +
+ +
+

+ PRISM + + Probabilistic Model Checker + +

+

PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or …

+ PRISM

@@ -333,6 +340,7 @@ C++ API: …

diff --git a/index.xml b/index.xml index ea3c610..40b4b16 100644 --- a/index.xml +++ b/index.xml @@ -2,185 +2,213 @@ The Ultimate Formal Methods Toolbox on Formal Methods Tools - http://localhost:1313/ + https://example.org/ Recent content in The Ultimate Formal Methods Toolbox on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Bitwuzla - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ <p>Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.</p> Boolector - http://localhost:1313/tools/sat-smt/boolector/ + https://example.org/tools/sat-smt/boolector/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/boolector/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla">Bitwuzla</a></p> + https://example.org/tools/sat-smt/boolector/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla" >Bitwuzla</a></p> Colibri - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ <p>Colibri is an SMT solver.</p> CryptoMiniSat - http://localhost:1313/tools/sat-smt/cryptominisat/ + https://example.org/tools/sat-smt/cryptominisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cryptominisat/ - <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/">homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/">PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/cryptominisat/ + <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/" target="_blank" >homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/" target="_blank" >PyPI package</a></li> </ul> cvc4 - http://localhost:1313/tools/sat-smt/cvc4/ + https://example.org/tools/sat-smt/cvc4/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc4/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5">cvc5</a></p> + https://example.org/tools/sat-smt/cvc4/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5" >cvc5</a></p> cvc5 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ <p>cvc5 is an automatic theorem prover for SMT problems.</p> dReal - http://localhost:1313/tools/sat-smt/dreal/ + https://example.org/tools/sat-smt/dreal/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/dreal/ + https://example.org/tools/sat-smt/dreal/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> dReal is an automated reasoning tool. It focuses on solving problems that can be encoded as first-order logic formulas over the real numbers. Its special strength is in handling problems that involve a wide range of nonlinear real functions.</p> Glucose - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ <p>Glucose is a SAT solver.</p> Lingeling - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ <p>Lingeling is a SAT solver.</p> MathSAT - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ <p><div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(226, 181, 59);"></span> <span style="display:none">[</span> <span style="color: rgb(226, 181, 59); font-size: 1rem;">Closed-Source Tool</span> <span style="display:none">]&nbsp;</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> MiniSat - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2013</span> <span style="display:none">]</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> OpenSMT - http://localhost:1313/tools/sat-smt/opensmt/ + https://example.org/tools/sat-smt/opensmt/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/opensmt/ - <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="http://localhost:1313/tools/minisat">MiniSAT</a>.</p> + https://example.org/tools/sat-smt/opensmt/ + <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="https://example.org/tools/minisat" >MiniSAT</a>.</p> ParaFROST - http://localhost:1313/tools/sat-smt/parafrost/ + https://example.org/tools/sat-smt/parafrost/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/parafrost/ - <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/parafrost/ + <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> + + + PRISM + https://example.org/tools/prob/prism/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/prism/ + <p>PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or probabilistic behaviour.</p> Q3B - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.</p> Riss - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2017</span> <span style="display:none">]</span> </div> Riss is a SAT solving tool collection.</p> - SMT-RAT - http://localhost:1313/tools/sat-smt/smt-rat/ + Sally + https://example.org/tools/mc/sally/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smt-rat/ - <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25">C++ API Reference</a></li> </ul> + https://example.org/tools/mc/sally/ + <p>Sally is a model checker for infinite state systems described as transition systems.</p> + + + SMT-RAT + https://example.org/tools/sat-smt/smt-rat/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/sat-smt/smt-rat/ + <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25" target="_blank" >C++ API Reference</a></li> </ul> SMTInterpol - http://localhost:1313/tools/sat-smt/smtinterpol/ + https://example.org/tools/sat-smt/smtinterpol/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smtinterpol/ - <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html">Java API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smtinterpol/ + <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html" target="_blank" >Java API Reference</a></li> </ul> + + + STAMINA + https://example.org/tools/prob/stamina/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/stamina/ + <p>A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces with either <a href="../storm" >Storm</a> or <a href="../prism" >PRISM</a>.</p> + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> STP - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/stp/ - <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/stp/ + <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage" target="_blank" >stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage" target="_blank" >stp PyPI package</a></li> </ul> veriT - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ <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 verification, automated reasoning, and related research areas. veriT accepts input in SMT-LIB2 and DIMACS formats and provides a command-line interface for ease of integration into verification workflows. The solver is actively maintained and distributed under the BSD license, making it suitable for both academic and industrial applications.</p> Yices 2 - http://localhost:1313/tools/sat-smt/yices/ + https://example.org/tools/sat-smt/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/yices/ - <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html">Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/">yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2">yices2 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/yices/ + <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html" target="_blank" >Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/" target="_blank" >yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2" target="_blank" >yices2 crate on crates.io</a></li> </ul> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> About - http://localhost:1313/about/ + https://example.org/about/ Mon, 01 Jan 0001 00:00:00 +0000 - http://localhost:1313/about/ + https://example.org/about/ <p>The Formal Methods Tools project is dedicated to developing, maintaining, and promoting tools that support the application of formal methods in software engineering. Our goal is to make formal verification, specification, and analysis techniques accessible and practical for both researchers and practitioners.</p> <h2 id="key-objectives">Key Objectives</h2> <ul> <li>Provide a comprehensive list of tools for formal methods.</li> <li>Group tools by rich metadata to support collaboration and boost tools&rsquo; strengths.</li> <li>Foster a collaborative community for tool development and support.</li> </ul> <h2 id="whos-behind-this">Who&rsquo;s Behind This?</h2> <p>Howdy. My name is Landon Taylor. I sometimes go by mossBiscuits. This is one of my hobby projects. I have a passion for formal methods. When I started learning about verification, there was a sharp barrier to entry due partially to the sprawl of content online. I wanted to solve this problem, so I have been chipping away at this website for a while now.</p> Contribute - http://localhost:1313/contribute/ + https://example.org/contribute/ Mon, 01 Jan 0001 00:00:00 +0000 - http://localhost:1313/contribute/ - <p>Instructions coming soon. Please see <a href="https://gitmoss.fyi/fmtools/content/wiki/Contribute">https://gitmoss.fyi/fmtools/content/wiki/Contribute</a> for temporary instructions.</p> <h2 id="quick-links">Quick Links</h2> <ul> <li>Request addding a tool: <a href="https://gitmoss.fyi/fmtools/content/issues/new?template=.gitea%2fissue_template%2fadd_tool.md">Submit Git Issue</a></li> <li>Request fixing a tool: <a href="https://gitmoss.fyi/fmtools/content/issues/new?template=.gitea%2fissue_template%2ffix_tool.md">Submit Git Issue</a></li> </ul> + https://example.org/contribute/ + <p>Instructions coming soon. Please see <a href="https://gitmoss.fyi/fmtools/content/wiki/Contribute" target="_blank" >https://gitmoss.fyi/fmtools/content/wiki/Contribute</a> for temporary instructions.</p> <h2 id="quick-links">Quick Links</h2> <ul> <li>Request addding a tool: <a href="https://gitmoss.fyi/fmtools/content/issues/new?template=.gitea%2fissue_template%2fadd_tool.md" target="_blank" >Submit Git Issue</a></li> <li>Request fixing a tool: <a href="https://gitmoss.fyi/fmtools/content/issues/new?template=.gitea%2fissue_template%2ffix_tool.md" target="_blank" >Submit Git Issue</a></li> </ul> MIT License - http://localhost:1313/license/ + https://example.org/license/ Mon, 01 Jan 0001 00:00:00 +0000 - http://localhost:1313/license/ + https://example.org/license/ <p>MIT License</p> <p>Copyright (c) 2025 Landon Taylor.</p> <p>Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the &ldquo;Software&rdquo;), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:</p> Privacy - http://localhost:1313/privacy/ + https://example.org/privacy/ Mon, 01 Jan 0001 00:00:00 +0000 - http://localhost:1313/privacy/ + https://example.org/privacy/ <p>This website does not collect or track any personal data from visitors. No cookies, personalized analytics, or tracking scripts are used. No ads are shown on this website, and there is no money to be made from this project.</p> <p>If you choose to contribute content (including emails, issues, and pull requests), any information you voluntarily provide may be stored as part of the website&rsquo;s content and source code. Only the data you explicitly submit will be saved, and data is not sold by the website&rsquo;s owner. Due to the public nature of its disclosure, this information is not considered private and may be used by the general public as allowed by respective laws and policies. Your privacy is respected, and no unnecessary data is collected or shared.</p> diff --git a/inputs/cnf/index.html b/inputs/cnf/index.html index 864fba7..bb18d37 100644 --- a/inputs/cnf/index.html +++ b/inputs/cnf/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -106,6 +114,7 @@ APIs and Bindings This tool is available through the following … diff --git a/inputs/cnf/index.xml b/inputs/cnf/index.xml index 770689f..705f38f 100644 --- a/inputs/cnf/index.xml +++ b/inputs/cnf/index.xml @@ -2,24 +2,24 @@ CNF on Formal Methods Tools - http://localhost:1313/inputs/cnf/ + https://example.org/inputs/cnf/ Recent content in CNF on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + CryptoMiniSat - http://localhost:1313/tools/sat-smt/cryptominisat/ + https://example.org/tools/sat-smt/cryptominisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cryptominisat/ - <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/">homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/">PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/cryptominisat/ + <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/" target="_blank" >homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/" target="_blank" >PyPI package</a></li> </ul> Glucose - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ <p>Glucose is a SAT solver.</p> diff --git a/inputs/dimacs/index.html b/inputs/dimacs/index.html index cb1b20e..121be04 100644 --- a/inputs/dimacs/index.html +++ b/inputs/dimacs/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -105,6 +113,7 @@ APIs and Bindings This … diff --git a/inputs/dimacs/index.xml b/inputs/dimacs/index.xml index 953a91d..1df53ce 100644 --- a/inputs/dimacs/index.xml +++ b/inputs/dimacs/index.xml @@ -2,25 +2,25 @@ DIMACS on Formal Methods Tools - http://localhost:1313/inputs/dimacs/ + https://example.org/inputs/dimacs/ Recent content in DIMACS on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + veriT - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ <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 verification, automated reasoning, and related research areas. veriT accepts input in SMT-LIB2 and DIMACS formats and provides a command-line interface for ease of integration into verification workflows. The solver is actively maintained and distributed under the BSD license, making it suitable for both academic and industrial applications.</p> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/inputs/galileo/index.html b/inputs/galileo/index.html new file mode 100644 index 0000000..230a64d --- /dev/null +++ b/inputs/galileo/index.html @@ -0,0 +1,113 @@ + + + + + + + + +Galileo | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Galileo + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
StormStorm is a tool for the analysis of systems involving random or probabilistic phenomena. +
+ +
+ + + diff --git a/inputs/galileo/index.xml b/inputs/galileo/index.xml new file mode 100644 index 0000000..583e365 --- /dev/null +++ b/inputs/galileo/index.xml @@ -0,0 +1,19 @@ + + + + Galileo on Formal Methods Tools + https://example.org/inputs/galileo/ + Recent content in Galileo on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> + + + diff --git a/inputs/greatspn/index.html b/inputs/greatspn/index.html new file mode 100644 index 0000000..5f0f4f5 --- /dev/null +++ b/inputs/greatspn/index.html @@ -0,0 +1,113 @@ + + + + + + + + +GreatSPN | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + GreatSPN + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
StormStorm is a tool for the analysis of systems involving random or probabilistic phenomena. +
+ +
+ + + diff --git a/inputs/greatspn/index.xml b/inputs/greatspn/index.xml new file mode 100644 index 0000000..7d52a60 --- /dev/null +++ b/inputs/greatspn/index.xml @@ -0,0 +1,19 @@ + + + + GreatSPN on Formal Methods Tools + https://example.org/inputs/greatspn/ + Recent content in GreatSPN on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> + + + diff --git a/inputs/index.html b/inputs/index.html index a6ec1b6..4106095 100644 --- a/inputs/index.html +++ b/inputs/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -106,6 +114,132 @@ + + Galileo + + + + + + + + + + + + + + GreatSPN + + + + + + + + + + + + + + JANI + + + + + + + + + + + + + + MRMC + + + + + + + + + + + + + + PNML + + + + + + + + + + + + + + PRISM + + + + + + + + + + + + + + Sally + + + + + + + + + + + +

Contribute  |  About  |  License  |  Privacy

+

© Copyright 2025. An open-source project.

diff --git a/inputs/index.xml b/inputs/index.xml index d5f9346..d5b0723 100644 --- a/inputs/index.xml +++ b/inputs/index.xml @@ -2,38 +2,87 @@ Inputs on Formal Methods Tools - http://localhost:1313/inputs/ + https://example.org/inputs/ Recent content in Inputs on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + CNF - http://localhost:1313/inputs/cnf/ + https://example.org/inputs/cnf/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/inputs/cnf/ + https://example.org/inputs/cnf/ DIMACS - http://localhost:1313/inputs/dimacs/ + https://example.org/inputs/dimacs/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/inputs/dimacs/ + https://example.org/inputs/dimacs/ + + + + Galileo + https://example.org/inputs/galileo/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/inputs/galileo/ + + + + GreatSPN + https://example.org/inputs/greatspn/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/inputs/greatspn/ + + + + JANI + https://example.org/inputs/jani/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/inputs/jani/ + + + + MRMC + https://example.org/inputs/mrmc/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/inputs/mrmc/ + + + + PNML + https://example.org/inputs/pnml/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/inputs/pnml/ + + + + PRISM + https://example.org/inputs/prism/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/inputs/prism/ + + + + Sally + https://example.org/inputs/sally/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/inputs/sally/ SMTLIB2 - http://localhost:1313/inputs/smtlib2/ + https://example.org/inputs/smtlib2/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/inputs/smtlib2/ + https://example.org/inputs/smtlib2/ Yices 2 - http://localhost:1313/inputs/yices-2/ + https://example.org/inputs/yices-2/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/inputs/yices-2/ + https://example.org/inputs/yices-2/ diff --git a/inputs/jani/index.html b/inputs/jani/index.html new file mode 100644 index 0000000..f9907f8 --- /dev/null +++ b/inputs/jani/index.html @@ -0,0 +1,113 @@ + + + + + + + + +JANI | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + JANI + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
StormStorm is a tool for the analysis of systems involving random or probabilistic phenomena. +
+ +
+ + + diff --git a/inputs/jani/index.xml b/inputs/jani/index.xml new file mode 100644 index 0000000..2f6aacb --- /dev/null +++ b/inputs/jani/index.xml @@ -0,0 +1,19 @@ + + + + JANI on Formal Methods Tools + https://example.org/inputs/jani/ + Recent content in JANI on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> + + + diff --git a/inputs/mrmc/index.html b/inputs/mrmc/index.html new file mode 100644 index 0000000..650a2ef --- /dev/null +++ b/inputs/mrmc/index.html @@ -0,0 +1,121 @@ + + + + + + + + +MRMC | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + MRMC + +

+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +
ToolDescription
PRISMPRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that …
StormStorm is a tool for the analysis of systems involving random or probabilistic phenomena. +
+ +
+ + + diff --git a/inputs/mrmc/index.xml b/inputs/mrmc/index.xml new file mode 100644 index 0000000..15c2b64 --- /dev/null +++ b/inputs/mrmc/index.xml @@ -0,0 +1,26 @@ + + + + MRMC on Formal Methods Tools + https://example.org/inputs/mrmc/ + Recent content in MRMC on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + PRISM + https://example.org/tools/prob/prism/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/prism/ + <p>PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or probabilistic behaviour.</p> + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> + + + diff --git a/inputs/pnml/index.html b/inputs/pnml/index.html new file mode 100644 index 0000000..1033c33 --- /dev/null +++ b/inputs/pnml/index.html @@ -0,0 +1,113 @@ + + + + + + + + +PNML | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + PNML + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
StormStorm is a tool for the analysis of systems involving random or probabilistic phenomena. +
+ +
+ + + diff --git a/inputs/pnml/index.xml b/inputs/pnml/index.xml new file mode 100644 index 0000000..2dbc0ca --- /dev/null +++ b/inputs/pnml/index.xml @@ -0,0 +1,19 @@ + + + + PNML on Formal Methods Tools + https://example.org/inputs/pnml/ + Recent content in PNML on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> + + + diff --git a/inputs/prism/index.html b/inputs/prism/index.html new file mode 100644 index 0000000..a7c72cc --- /dev/null +++ b/inputs/prism/index.html @@ -0,0 +1,129 @@ + + + + + + + + +PRISM | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + PRISM + +

+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
ToolDescription
PRISMPRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that …
STAMINAA state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces …
StormStorm is a tool for the analysis of systems involving random or probabilistic phenomena. +
+ +
+ + + diff --git a/inputs/prism/index.xml b/inputs/prism/index.xml new file mode 100644 index 0000000..0969280 --- /dev/null +++ b/inputs/prism/index.xml @@ -0,0 +1,33 @@ + + + + PRISM on Formal Methods Tools + https://example.org/inputs/prism/ + Recent content in PRISM on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + PRISM + https://example.org/tools/prob/prism/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/prism/ + <p>PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or probabilistic behaviour.</p> + + + STAMINA + https://example.org/tools/prob/stamina/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/stamina/ + <p>A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces with either <a href="../storm" >Storm</a> or <a href="../prism" >PRISM</a>.</p> + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> + + + diff --git a/inputs/sally/index.html b/inputs/sally/index.html new file mode 100644 index 0000000..c7313d4 --- /dev/null +++ b/inputs/sally/index.html @@ -0,0 +1,113 @@ + + + + + + + + +Sally | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Sally + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
SallySally is a model checker for infinite state systems described as transition systems. +
+ +
+ + + diff --git a/inputs/sally/index.xml b/inputs/sally/index.xml new file mode 100644 index 0000000..0258067 --- /dev/null +++ b/inputs/sally/index.xml @@ -0,0 +1,19 @@ + + + + Sally on Formal Methods Tools + https://example.org/inputs/sally/ + Recent content in Sally on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + Sally + https://example.org/tools/mc/sally/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/mc/sally/ + <p>Sally is a model checker for infinite state systems described as transition systems.</p> + + + diff --git a/inputs/smtlib2/index.html b/inputs/smtlib2/index.html index 7aa694c..80e31bd 100644 --- a/inputs/smtlib2/index.html +++ b/inputs/smtlib2/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -206,6 +214,7 @@ APIs and Bindings This … diff --git a/inputs/smtlib2/index.xml b/inputs/smtlib2/index.xml index 146922c..2d7dfe6 100644 --- a/inputs/smtlib2/index.xml +++ b/inputs/smtlib2/index.xml @@ -2,109 +2,109 @@ SMTLIB2 on Formal Methods Tools - http://localhost:1313/inputs/smtlib2/ + https://example.org/inputs/smtlib2/ Recent content in SMTLIB2 on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Bitwuzla - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ <p>Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.</p> Boolector - http://localhost:1313/tools/sat-smt/boolector/ + https://example.org/tools/sat-smt/boolector/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/boolector/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla">Bitwuzla</a></p> + https://example.org/tools/sat-smt/boolector/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla" >Bitwuzla</a></p> Colibri - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ <p>Colibri is an SMT solver.</p> cvc4 - http://localhost:1313/tools/sat-smt/cvc4/ + https://example.org/tools/sat-smt/cvc4/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc4/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5">cvc5</a></p> + https://example.org/tools/sat-smt/cvc4/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5" >cvc5</a></p> cvc5 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ <p>cvc5 is an automatic theorem prover for SMT problems.</p> OpenSMT - http://localhost:1313/tools/sat-smt/opensmt/ + https://example.org/tools/sat-smt/opensmt/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/opensmt/ - <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="http://localhost:1313/tools/minisat">MiniSAT</a>.</p> + https://example.org/tools/sat-smt/opensmt/ + <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="https://example.org/tools/minisat" >MiniSAT</a>.</p> ParaFROST - http://localhost:1313/tools/sat-smt/parafrost/ + https://example.org/tools/sat-smt/parafrost/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/parafrost/ - <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/parafrost/ + <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> Q3B - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.</p> SMT-RAT - http://localhost:1313/tools/sat-smt/smt-rat/ + https://example.org/tools/sat-smt/smt-rat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smt-rat/ - <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25">C++ API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smt-rat/ + <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25" target="_blank" >C++ API Reference</a></li> </ul> SMTInterpol - http://localhost:1313/tools/sat-smt/smtinterpol/ + https://example.org/tools/sat-smt/smtinterpol/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smtinterpol/ - <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html">Java API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smtinterpol/ + <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html" target="_blank" >Java API Reference</a></li> </ul> STP - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/stp/ - <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/stp/ + <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage" target="_blank" >stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage" target="_blank" >stp PyPI package</a></li> </ul> veriT - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ <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 verification, automated reasoning, and related research areas. veriT accepts input in SMT-LIB2 and DIMACS formats and provides a command-line interface for ease of integration into verification workflows. The solver is actively maintained and distributed under the BSD license, making it suitable for both academic and industrial applications.</p> Yices 2 - http://localhost:1313/tools/sat-smt/yices/ + https://example.org/tools/sat-smt/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/yices/ - <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html">Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/">yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2">yices2 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/yices/ + <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html" target="_blank" >Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/" target="_blank" >yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2" target="_blank" >yices2 crate on crates.io</a></li> </ul> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/inputs/yices-2/index.html b/inputs/yices-2/index.html index 6b85c17..ebca481 100644 --- a/inputs/yices-2/index.html +++ b/inputs/yices-2/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/inputs/yices-2/index.xml b/inputs/yices-2/index.xml index 1f2fcc9..3c8c531 100644 --- a/inputs/yices-2/index.xml +++ b/inputs/yices-2/index.xml @@ -2,18 +2,18 @@ Yices 2 on Formal Methods Tools - http://localhost:1313/inputs/yices-2/ + https://example.org/inputs/yices-2/ Recent content in Yices 2 on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Yices 2 - http://localhost:1313/tools/sat-smt/yices/ + https://example.org/tools/sat-smt/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/yices/ - <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html">Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/">yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2">yices2 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/yices/ + <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html" target="_blank" >Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/" target="_blank" >yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2" target="_blank" >yices2 crate on crates.io</a></li> </ul> diff --git a/interfaces/.net/index.html b/interfaces/.net/index.html index 8aec1d9..48c4b6f 100644 --- a/interfaces/.net/index.html +++ b/interfaces/.net/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -97,6 +105,7 @@ APIs and Bindings This … diff --git a/interfaces/.net/index.xml b/interfaces/.net/index.xml index ae91426..d6e0d17 100644 --- a/interfaces/.net/index.xml +++ b/interfaces/.net/index.xml @@ -2,18 +2,18 @@ .NET on Formal Methods Tools - http://localhost:1313/interfaces/.net/ + https://example.org/interfaces/.net/ Recent content in .NET on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/interfaces/c++/index.html b/interfaces/c++/index.html index b70094d..c2f6b6c 100644 --- a/interfaces/c++/index.html +++ b/interfaces/c++/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -97,6 +105,15 @@ APIs and Bindings This tool is available through the … + + + + Storm + Storm is a tool for the analysis of systems involving random or probabilistic phenomena. + + + + @@ -115,6 +132,7 @@ APIs and Bindings This … diff --git a/interfaces/c++/index.xml b/interfaces/c++/index.xml index f0d0bbe..5154c6d 100644 --- a/interfaces/c++/index.xml +++ b/interfaces/c++/index.xml @@ -2,32 +2,39 @@ C++ on Formal Methods Tools - http://localhost:1313/interfaces/c++/ + https://example.org/interfaces/c++/ Recent content in C++ on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + CryptoMiniSat - http://localhost:1313/tools/sat-smt/cryptominisat/ + https://example.org/tools/sat-smt/cryptominisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cryptominisat/ - <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/">homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/">PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/cryptominisat/ + <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/" target="_blank" >homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/" target="_blank" >PyPI package</a></li> </ul> SMT-RAT - http://localhost:1313/tools/sat-smt/smt-rat/ + https://example.org/tools/sat-smt/smt-rat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smt-rat/ - <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25">C++ API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smt-rat/ + <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25" target="_blank" >C++ API Reference</a></li> </ul> + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/interfaces/c/index.html b/interfaces/c/index.html index 5c6f115..8d8a627 100644 --- a/interfaces/c/index.html +++ b/interfaces/c/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -106,6 +114,7 @@ APIs and Bindings This … diff --git a/interfaces/c/index.xml b/interfaces/c/index.xml index 959814a..a464320 100644 --- a/interfaces/c/index.xml +++ b/interfaces/c/index.xml @@ -2,25 +2,25 @@ C on Formal Methods Tools - http://localhost:1313/interfaces/c/ + https://example.org/interfaces/c/ Recent content in C on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + STP - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/stp/ - <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/stp/ + <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage" target="_blank" >stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage" target="_blank" >stp PyPI package</a></li> </ul> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/interfaces/cli/index.html b/interfaces/cli/index.html index 7fdb817..dd43a2b 100644 --- a/interfaces/cli/index.html +++ b/interfaces/cli/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -188,6 +196,14 @@ APIs and Bindings This tool is available through the following … + + + + PRISM + PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that … + + + @@ -205,6 +221,15 @@ APIs and Bindings This tool is available through the following … + + + + Sally + Sally is a model checker for infinite state systems described as transition systems. + + + + @@ -223,6 +248,23 @@ APIs and … + + + + STAMINA + A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces … + + + + + + + Storm + Storm is a tool for the analysis of systems involving random or probabilistic phenomena. + + + + @@ -266,6 +308,7 @@ APIs and Bindings This … diff --git a/interfaces/cli/index.xml b/interfaces/cli/index.xml index fc6f92b..24234a8 100644 --- a/interfaces/cli/index.xml +++ b/interfaces/cli/index.xml @@ -2,158 +2,186 @@ CLI on Formal Methods Tools - http://localhost:1313/interfaces/cli/ + https://example.org/interfaces/cli/ Recent content in CLI on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Bitwuzla - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ <p>Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.</p> Boolector - http://localhost:1313/tools/sat-smt/boolector/ + https://example.org/tools/sat-smt/boolector/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/boolector/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla">Bitwuzla</a></p> + https://example.org/tools/sat-smt/boolector/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla" >Bitwuzla</a></p> Colibri - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ <p>Colibri is an SMT solver.</p> CryptoMiniSat - http://localhost:1313/tools/sat-smt/cryptominisat/ + https://example.org/tools/sat-smt/cryptominisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cryptominisat/ - <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/">homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/">PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/cryptominisat/ + <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/" target="_blank" >homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/" target="_blank" >PyPI package</a></li> </ul> cvc4 - http://localhost:1313/tools/sat-smt/cvc4/ + https://example.org/tools/sat-smt/cvc4/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc4/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5">cvc5</a></p> + https://example.org/tools/sat-smt/cvc4/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5" >cvc5</a></p> cvc5 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ <p>cvc5 is an automatic theorem prover for SMT problems.</p> dReal - http://localhost:1313/tools/sat-smt/dreal/ + https://example.org/tools/sat-smt/dreal/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/dreal/ + https://example.org/tools/sat-smt/dreal/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> dReal is an automated reasoning tool. It focuses on solving problems that can be encoded as first-order logic formulas over the real numbers. Its special strength is in handling problems that involve a wide range of nonlinear real functions.</p> Glucose - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ <p>Glucose is a SAT solver.</p> Lingeling - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ <p>Lingeling is a SAT solver.</p> MathSAT - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ <p><div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(226, 181, 59);"></span> <span style="display:none">[</span> <span style="color: rgb(226, 181, 59); font-size: 1rem;">Closed-Source Tool</span> <span style="display:none">]&nbsp;</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> MiniSat - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2013</span> <span style="display:none">]</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> OpenSMT - http://localhost:1313/tools/sat-smt/opensmt/ + https://example.org/tools/sat-smt/opensmt/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/opensmt/ - <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="http://localhost:1313/tools/minisat">MiniSAT</a>.</p> + https://example.org/tools/sat-smt/opensmt/ + <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="https://example.org/tools/minisat" >MiniSAT</a>.</p> ParaFROST - http://localhost:1313/tools/sat-smt/parafrost/ + https://example.org/tools/sat-smt/parafrost/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/parafrost/ - <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/parafrost/ + <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> + + + PRISM + https://example.org/tools/prob/prism/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/prism/ + <p>PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or probabilistic behaviour.</p> Q3B - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.</p> Riss - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2017</span> <span style="display:none">]</span> </div> Riss is a SAT solving tool collection.</p> - SMT-RAT - http://localhost:1313/tools/sat-smt/smt-rat/ + Sally + https://example.org/tools/mc/sally/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smt-rat/ - <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25">C++ API Reference</a></li> </ul> + https://example.org/tools/mc/sally/ + <p>Sally is a model checker for infinite state systems described as transition systems.</p> + + + SMT-RAT + https://example.org/tools/sat-smt/smt-rat/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/sat-smt/smt-rat/ + <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25" target="_blank" >C++ API Reference</a></li> </ul> SMTInterpol - http://localhost:1313/tools/sat-smt/smtinterpol/ + https://example.org/tools/sat-smt/smtinterpol/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smtinterpol/ - <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html">Java API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smtinterpol/ + <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html" target="_blank" >Java API Reference</a></li> </ul> + + + STAMINA + https://example.org/tools/prob/stamina/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/stamina/ + <p>A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces with either <a href="../storm" >Storm</a> or <a href="../prism" >PRISM</a>.</p> + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> STP - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/stp/ - <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/stp/ + <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage" target="_blank" >stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage" target="_blank" >stp PyPI package</a></li> </ul> veriT - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ <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 verification, automated reasoning, and related research areas. veriT accepts input in SMT-LIB2 and DIMACS formats and provides a command-line interface for ease of integration into verification workflows. The solver is actively maintained and distributed under the BSD license, making it suitable for both academic and industrial applications.</p> Yices 2 - http://localhost:1313/tools/sat-smt/yices/ + https://example.org/tools/sat-smt/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/yices/ - <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html">Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/">yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2">yices2 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/yices/ + <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html" target="_blank" >Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/" target="_blank" >yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2" target="_blank" >yices2 crate on crates.io</a></li> </ul> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/interfaces/index.html b/interfaces/index.html index e5db271..7f34cb7 100644 --- a/interfaces/index.html +++ b/interfaces/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -211,6 +219,7 @@ diff --git a/interfaces/index.xml b/interfaces/index.xml index 43838fd..94d4565 100644 --- a/interfaces/index.xml +++ b/interfaces/index.xml @@ -2,66 +2,66 @@ Interfaces on Formal Methods Tools - http://localhost:1313/interfaces/ + https://example.org/interfaces/ Recent content in Interfaces on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + .NET - http://localhost:1313/interfaces/.net/ + https://example.org/interfaces/.net/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/interfaces/.net/ + https://example.org/interfaces/.net/ C - http://localhost:1313/interfaces/c/ + https://example.org/interfaces/c/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/interfaces/c/ + https://example.org/interfaces/c/ C++ - http://localhost:1313/interfaces/c++/ + https://example.org/interfaces/c++/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/interfaces/c++/ + https://example.org/interfaces/c++/ CLI - http://localhost:1313/interfaces/cli/ + https://example.org/interfaces/cli/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/interfaces/cli/ + https://example.org/interfaces/cli/ Java - http://localhost:1313/interfaces/java/ + https://example.org/interfaces/java/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/interfaces/java/ + https://example.org/interfaces/java/ Online - http://localhost:1313/interfaces/online/ + https://example.org/interfaces/online/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/interfaces/online/ + https://example.org/interfaces/online/ Python - http://localhost:1313/interfaces/python/ + https://example.org/interfaces/python/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/interfaces/python/ + https://example.org/interfaces/python/ Rust - http://localhost:1313/interfaces/rust/ + https://example.org/interfaces/rust/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/interfaces/rust/ + https://example.org/interfaces/rust/ diff --git a/interfaces/java/index.html b/interfaces/java/index.html index 59406b5..17d1cfa 100644 --- a/interfaces/java/index.html +++ b/interfaces/java/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -81,6 +89,14 @@ + + PRISM + PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that … + + + + + SMTInterpol SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories. @@ -106,6 +122,7 @@ APIs and Bindings This … diff --git a/interfaces/java/index.xml b/interfaces/java/index.xml index 9e788b5..59721c9 100644 --- a/interfaces/java/index.xml +++ b/interfaces/java/index.xml @@ -2,25 +2,32 @@ Java on Formal Methods Tools - http://localhost:1313/interfaces/java/ + https://example.org/interfaces/java/ Recent content in Java on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + + + PRISM + https://example.org/tools/prob/prism/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/prism/ + <p>PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or probabilistic behaviour.</p> + SMTInterpol - http://localhost:1313/tools/sat-smt/smtinterpol/ + https://example.org/tools/sat-smt/smtinterpol/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smtinterpol/ - <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html">Java API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smtinterpol/ + <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html" target="_blank" >Java API Reference</a></li> </ul> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/interfaces/online/index.html b/interfaces/online/index.html index e7d0a41..9fbaaf5 100644 --- a/interfaces/online/index.html +++ b/interfaces/online/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,14 @@ + + + + STAMINA + A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces … + + + @@ -114,6 +130,7 @@ APIs and Bindings This … diff --git a/interfaces/online/index.xml b/interfaces/online/index.xml index 05cc60a..88eaf28 100644 --- a/interfaces/online/index.xml +++ b/interfaces/online/index.xml @@ -2,32 +2,39 @@ Online on Formal Methods Tools - http://localhost:1313/interfaces/online/ + https://example.org/interfaces/online/ Recent content in Online on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + cvc4 - http://localhost:1313/tools/sat-smt/cvc4/ + https://example.org/tools/sat-smt/cvc4/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc4/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5">cvc5</a></p> + https://example.org/tools/sat-smt/cvc4/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5" >cvc5</a></p> cvc5 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ <p>cvc5 is an automatic theorem prover for SMT problems.</p> - Z3 - http://localhost:1313/tools/sat-smt/z3/ + STAMINA + https://example.org/tools/prob/stamina/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/prob/stamina/ + <p>A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces with either <a href="../storm" >Storm</a> or <a href="../prism" >PRISM</a>.</p> + + + Z3 + https://example.org/tools/sat-smt/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/interfaces/python/index.html b/interfaces/python/index.html index 2b48c89..a273ace 100644 --- a/interfaces/python/index.html +++ b/interfaces/python/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -88,6 +96,15 @@ APIs and Bindings This tool is available through the following … + + + + Storm + Storm is a tool for the analysis of systems involving random or probabilistic phenomena. + + + + @@ -123,6 +140,7 @@ APIs and Bindings This … diff --git a/interfaces/python/index.xml b/interfaces/python/index.xml index 9eea7e9..2bf6240 100644 --- a/interfaces/python/index.xml +++ b/interfaces/python/index.xml @@ -2,39 +2,46 @@ Python on Formal Methods Tools - http://localhost:1313/interfaces/python/ + https://example.org/interfaces/python/ Recent content in Python on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + CryptoMiniSat - http://localhost:1313/tools/sat-smt/cryptominisat/ + https://example.org/tools/sat-smt/cryptominisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cryptominisat/ - <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/">homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/">PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/cryptominisat/ + <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/" target="_blank" >homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/" target="_blank" >PyPI package</a></li> </ul> + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> STP - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/stp/ - <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/stp/ + <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage" target="_blank" >stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage" target="_blank" >stp PyPI package</a></li> </ul> Yices 2 - http://localhost:1313/tools/sat-smt/yices/ + https://example.org/tools/sat-smt/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/yices/ - <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html">Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/">yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2">yices2 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/yices/ + <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html" target="_blank" >Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/" target="_blank" >yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2" target="_blank" >yices2 crate on crates.io</a></li> </ul> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/interfaces/rust/index.html b/interfaces/rust/index.html index 1e37db4..0b576c6 100644 --- a/interfaces/rust/index.html +++ b/interfaces/rust/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -105,6 +113,7 @@ APIs and Bindings This … diff --git a/interfaces/rust/index.xml b/interfaces/rust/index.xml index 4900c38..691b9f9 100644 --- a/interfaces/rust/index.xml +++ b/interfaces/rust/index.xml @@ -2,25 +2,25 @@ Rust on Formal Methods Tools - http://localhost:1313/interfaces/rust/ + https://example.org/interfaces/rust/ Recent content in Rust on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Yices 2 - http://localhost:1313/tools/sat-smt/yices/ + https://example.org/tools/sat-smt/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/yices/ - <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html">Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/">yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2">yices2 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/yices/ + <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html" target="_blank" >Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/" target="_blank" >yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2" target="_blank" >yices2 crate on crates.io</a></li> </ul> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/license/index.html b/license/index.html index ad1f6a4..980762b 100644 --- a/license/index.html +++ b/license/index.html @@ -1,6 +1,6 @@ - + @@ -16,16 +16,16 @@ - + - + - - - - + + + + - + @@ -37,6 +37,14 @@ Permission is hereby granted, free of charge, to any person obtaining a copy of + + + +

Formal Methods Tools

@@ -83,6 +91,7 @@ Permission is hereby granted, free of charge, to any person obtaining a copy of diff --git a/licenses/all-rights-reserved/index.html b/licenses/all-rights-reserved/index.html index cee9b57..0243fb2 100644 --- a/licenses/all-rights-reserved/index.html +++ b/licenses/all-rights-reserved/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/licenses/all-rights-reserved/index.xml b/licenses/all-rights-reserved/index.xml index 6b4727e..ef314b9 100644 --- a/licenses/all-rights-reserved/index.xml +++ b/licenses/all-rights-reserved/index.xml @@ -2,17 +2,17 @@ All Rights Reserved on Formal Methods Tools - http://localhost:1313/licenses/all-rights-reserved/ + https://example.org/licenses/all-rights-reserved/ Recent content in All Rights Reserved on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + MathSAT - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ <p><div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(226, 181, 59);"></span> <span style="display:none">[</span> <span style="color: rgb(226, 181, 59); font-size: 1rem;">Closed-Source Tool</span> <span style="display:none">]&nbsp;</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> diff --git a/licenses/apache-2.0/index.html b/licenses/apache-2.0/index.html index 2d0ca85..e58bac9 100644 --- a/licenses/apache-2.0/index.html +++ b/licenses/apache-2.0/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/licenses/apache-2.0/index.xml b/licenses/apache-2.0/index.xml index 1a3c993..b9ed02c 100644 --- a/licenses/apache-2.0/index.xml +++ b/licenses/apache-2.0/index.xml @@ -2,17 +2,17 @@ Apache-2.0 on Formal Methods Tools - http://localhost:1313/licenses/apache-2.0/ + https://example.org/licenses/apache-2.0/ Recent content in Apache-2.0 on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + dReal - http://localhost:1313/tools/sat-smt/dreal/ + https://example.org/tools/sat-smt/dreal/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/dreal/ + https://example.org/tools/sat-smt/dreal/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> dReal is an automated reasoning tool. It focuses on solving problems that can be encoded as first-order logic formulas over the real numbers. Its special strength is in handling problems that involve a wide range of nonlinear real functions.</p> diff --git a/licenses/bsd/index.html b/licenses/bsd/index.html index 5a42f79..474b3dd 100644 --- a/licenses/bsd/index.html +++ b/licenses/bsd/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -113,6 +121,7 @@ diff --git a/licenses/bsd/index.xml b/licenses/bsd/index.xml index 2f7c887..6ef7472 100644 --- a/licenses/bsd/index.xml +++ b/licenses/bsd/index.xml @@ -2,31 +2,31 @@ BSD on Formal Methods Tools - http://localhost:1313/licenses/bsd/ + https://example.org/licenses/bsd/ Recent content in BSD on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + cvc4 - http://localhost:1313/tools/sat-smt/cvc4/ + https://example.org/tools/sat-smt/cvc4/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc4/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5">cvc5</a></p> + https://example.org/tools/sat-smt/cvc4/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5" >cvc5</a></p> cvc5 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ <p>cvc5 is an automatic theorem prover for SMT problems.</p> veriT - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ <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 verification, automated reasoning, and related research areas. veriT accepts input in SMT-LIB2 and DIMACS formats and provides a command-line interface for ease of integration into verification workflows. The solver is actively maintained and distributed under the BSD license, making it suitable for both academic and industrial applications.</p> diff --git a/licenses/gplv2/index.html b/licenses/gplv2/index.html index 1ef3327..4d2b07a 100644 --- a/licenses/gplv2/index.html +++ b/licenses/gplv2/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -88,6 +96,23 @@ APIs and Bindings This tool is available through the following … + + + + PRISM + PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that … + + + + + + + Sally + Sally is a model checker for infinite state systems described as transition systems. + + + + @@ -97,6 +122,7 @@ APIs and Bindings This tool is available through the following … diff --git a/licenses/gplv2/index.xml b/licenses/gplv2/index.xml index 4792347..d4ac3c6 100644 --- a/licenses/gplv2/index.xml +++ b/licenses/gplv2/index.xml @@ -2,18 +2,32 @@ GPLv2 on Formal Methods Tools - http://localhost:1313/licenses/gplv2/ + https://example.org/licenses/gplv2/ Recent content in GPLv2 on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + CryptoMiniSat - http://localhost:1313/tools/sat-smt/cryptominisat/ + https://example.org/tools/sat-smt/cryptominisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cryptominisat/ - <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/">homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/">PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/cryptominisat/ + <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/" target="_blank" >homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/" target="_blank" >PyPI package</a></li> </ul> + + + PRISM + https://example.org/tools/prob/prism/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/prism/ + <p>PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or probabilistic behaviour.</p> + + + Sally + https://example.org/tools/mc/sally/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/mc/sally/ + <p>Sally is a model checker for infinite state systems described as transition systems.</p> diff --git a/licenses/gplv3/index.html b/licenses/gplv3/index.html index 0b1fb34..ade2682 100644 --- a/licenses/gplv3/index.html +++ b/licenses/gplv3/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -104,6 +112,23 @@ APIs and … + + + + STAMINA + A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces … + + + + + + + Storm + Storm is a tool for the analysis of systems involving random or probabilistic phenomena. + + + + @@ -121,6 +146,7 @@ APIs and … diff --git a/licenses/gplv3/index.xml b/licenses/gplv3/index.xml index bd8233f..b8d2426 100644 --- a/licenses/gplv3/index.xml +++ b/licenses/gplv3/index.xml @@ -2,39 +2,53 @@ GPLv3 on Formal Methods Tools - http://localhost:1313/licenses/gplv3/ + https://example.org/licenses/gplv3/ Recent content in GPLv3 on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + OpenSMT - http://localhost:1313/tools/sat-smt/opensmt/ + https://example.org/tools/sat-smt/opensmt/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/opensmt/ - <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="http://localhost:1313/tools/minisat">MiniSAT</a>.</p> + https://example.org/tools/sat-smt/opensmt/ + <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="https://example.org/tools/minisat" >MiniSAT</a>.</p> ParaFROST - http://localhost:1313/tools/sat-smt/parafrost/ + https://example.org/tools/sat-smt/parafrost/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/parafrost/ - <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/parafrost/ + <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> SMTInterpol - http://localhost:1313/tools/sat-smt/smtinterpol/ + https://example.org/tools/sat-smt/smtinterpol/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smtinterpol/ - <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html">Java API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smtinterpol/ + <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html" target="_blank" >Java API Reference</a></li> </ul> + + + STAMINA + https://example.org/tools/prob/stamina/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/stamina/ + <p>A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces with either <a href="../storm" >Storm</a> or <a href="../prism" >PRISM</a>.</p> + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> Yices 2 - http://localhost:1313/tools/sat-smt/yices/ + https://example.org/tools/sat-smt/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/yices/ - <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html">Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/">yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2">yices2 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/yices/ + <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html" target="_blank" >Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/" target="_blank" >yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2" target="_blank" >yices2 crate on crates.io</a></li> </ul> diff --git a/licenses/index.html b/licenses/index.html index 127094c..ed5f4ea 100644 --- a/licenses/index.html +++ b/licenses/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -193,6 +201,7 @@ diff --git a/licenses/index.xml b/licenses/index.xml index caa8fad..b5a643e 100644 --- a/licenses/index.xml +++ b/licenses/index.xml @@ -2,59 +2,59 @@ Licenses on Formal Methods Tools - http://localhost:1313/licenses/ + https://example.org/licenses/ Recent content in Licenses on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + All Rights Reserved - http://localhost:1313/licenses/all-rights-reserved/ + https://example.org/licenses/all-rights-reserved/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/licenses/all-rights-reserved/ + https://example.org/licenses/all-rights-reserved/ Apache-2.0 - http://localhost:1313/licenses/apache-2.0/ + https://example.org/licenses/apache-2.0/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/licenses/apache-2.0/ + https://example.org/licenses/apache-2.0/ BSD - http://localhost:1313/licenses/bsd/ + https://example.org/licenses/bsd/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/licenses/bsd/ + https://example.org/licenses/bsd/ GPLv2 - http://localhost:1313/licenses/gplv2/ + https://example.org/licenses/gplv2/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/licenses/gplv2/ + https://example.org/licenses/gplv2/ GPLv3 - http://localhost:1313/licenses/gplv3/ + https://example.org/licenses/gplv3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/licenses/gplv3/ + https://example.org/licenses/gplv3/ LGPLv2 - http://localhost:1313/licenses/lgplv2/ + https://example.org/licenses/lgplv2/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/licenses/lgplv2/ + https://example.org/licenses/lgplv2/ MIT - http://localhost:1313/licenses/mit/ + https://example.org/licenses/mit/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/licenses/mit/ + https://example.org/licenses/mit/ diff --git a/licenses/lgplv2/index.html b/licenses/lgplv2/index.html index 39623a6..103c84f 100644 --- a/licenses/lgplv2/index.html +++ b/licenses/lgplv2/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -97,6 +105,7 @@ diff --git a/licenses/lgplv2/index.xml b/licenses/lgplv2/index.xml index 9663160..8991086 100644 --- a/licenses/lgplv2/index.xml +++ b/licenses/lgplv2/index.xml @@ -2,17 +2,17 @@ LGPLv2 on Formal Methods Tools - http://localhost:1313/licenses/lgplv2/ + https://example.org/licenses/lgplv2/ Recent content in LGPLv2 on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Riss - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2017</span> <span style="display:none">]</span> </div> Riss is a SAT solving tool collection.</p> diff --git a/licenses/mit/index.html b/licenses/mit/index.html index ba546dc..287def3 100644 --- a/licenses/mit/index.html +++ b/licenses/mit/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -156,6 +164,14 @@ APIs and Bindings This tool is available through the … + + + + STAMINA + A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces … + + + @@ -183,6 +199,7 @@ APIs and Bindings This … diff --git a/licenses/mit/index.xml b/licenses/mit/index.xml index 38a477f..27f50c0 100644 --- a/licenses/mit/index.xml +++ b/licenses/mit/index.xml @@ -2,88 +2,95 @@ MIT on Formal Methods Tools - http://localhost:1313/licenses/mit/ + https://example.org/licenses/mit/ Recent content in MIT on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Bitwuzla - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ <p>Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.</p> Boolector - http://localhost:1313/tools/sat-smt/boolector/ + https://example.org/tools/sat-smt/boolector/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/boolector/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla">Bitwuzla</a></p> + https://example.org/tools/sat-smt/boolector/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla" >Bitwuzla</a></p> Colibri - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ <p>Colibri is an SMT solver.</p> CryptoMiniSat - http://localhost:1313/tools/sat-smt/cryptominisat/ + https://example.org/tools/sat-smt/cryptominisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cryptominisat/ - <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/">homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/">PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/cryptominisat/ + <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/" target="_blank" >homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/" target="_blank" >PyPI package</a></li> </ul> Glucose - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ <p>Glucose is a SAT solver.</p> Lingeling - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ <p>Lingeling is a SAT solver.</p> MiniSat - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2013</span> <span style="display:none">]</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> Q3B - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.</p> SMT-RAT - http://localhost:1313/tools/sat-smt/smt-rat/ + https://example.org/tools/sat-smt/smt-rat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smt-rat/ - <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25">C++ API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smt-rat/ + <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25" target="_blank" >C++ API Reference</a></li> </ul> + + + STAMINA + https://example.org/tools/prob/stamina/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/stamina/ + <p>A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces with either <a href="../storm" >Storm</a> or <a href="../prism" >PRISM</a>.</p> STP - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/stp/ - <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/stp/ + <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage" target="_blank" >stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage" target="_blank" >stp PyPI package</a></li> </ul> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/maintenance/actively-maintained/index.html b/maintenance/actively-maintained/index.html index da2508a..2532944 100644 --- a/maintenance/actively-maintained/index.html +++ b/maintenance/actively-maintained/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -156,6 +164,23 @@ APIs and Bindings This tool is available through the following … + + + + PRISM + PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that … + + + + + + + Sally + Sally is a model checker for infinite state systems described as transition systems. + + + + @@ -174,6 +199,23 @@ APIs and … + + + + STAMINA + A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces … + + + + + + + Storm + Storm is a tool for the analysis of systems involving random or probabilistic phenomena. + + + + @@ -217,6 +259,7 @@ APIs and Bindings This … diff --git a/maintenance/actively-maintained/index.xml b/maintenance/actively-maintained/index.xml index 95fc23b..a67a441 100644 --- a/maintenance/actively-maintained/index.xml +++ b/maintenance/actively-maintained/index.xml @@ -2,116 +2,144 @@ Actively Maintained on Formal Methods Tools - http://localhost:1313/maintenance/actively-maintained/ + https://example.org/maintenance/actively-maintained/ Recent content in Actively Maintained on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Bitwuzla - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ <p>Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.</p> Colibri - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ <p>Colibri is an SMT solver.</p> CryptoMiniSat - http://localhost:1313/tools/sat-smt/cryptominisat/ + https://example.org/tools/sat-smt/cryptominisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cryptominisat/ - <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/">homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/">PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/cryptominisat/ + <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/" target="_blank" >homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/" target="_blank" >PyPI package</a></li> </ul> cvc5 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ <p>cvc5 is an automatic theorem prover for SMT problems.</p> Glucose - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ <p>Glucose is a SAT solver.</p> Lingeling - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ <p>Lingeling is a SAT solver.</p> MathSAT - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ <p><div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(226, 181, 59);"></span> <span style="display:none">[</span> <span style="color: rgb(226, 181, 59); font-size: 1rem;">Closed-Source Tool</span> <span style="display:none">]&nbsp;</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> OpenSMT - http://localhost:1313/tools/sat-smt/opensmt/ + https://example.org/tools/sat-smt/opensmt/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/opensmt/ - <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="http://localhost:1313/tools/minisat">MiniSAT</a>.</p> + https://example.org/tools/sat-smt/opensmt/ + <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="https://example.org/tools/minisat" >MiniSAT</a>.</p> ParaFROST - http://localhost:1313/tools/sat-smt/parafrost/ + https://example.org/tools/sat-smt/parafrost/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/parafrost/ - <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/parafrost/ + <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> + + + PRISM + https://example.org/tools/prob/prism/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/prism/ + <p>PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or probabilistic behaviour.</p> + + + Sally + https://example.org/tools/mc/sally/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/mc/sally/ + <p>Sally is a model checker for infinite state systems described as transition systems.</p> SMT-RAT - http://localhost:1313/tools/sat-smt/smt-rat/ + https://example.org/tools/sat-smt/smt-rat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smt-rat/ - <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25">C++ API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smt-rat/ + <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25" target="_blank" >C++ API Reference</a></li> </ul> SMTInterpol - http://localhost:1313/tools/sat-smt/smtinterpol/ + https://example.org/tools/sat-smt/smtinterpol/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smtinterpol/ - <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html">Java API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smtinterpol/ + <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html" target="_blank" >Java API Reference</a></li> </ul> + + + STAMINA + https://example.org/tools/prob/stamina/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/stamina/ + <p>A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces with either <a href="../storm" >Storm</a> or <a href="../prism" >PRISM</a>.</p> + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> STP - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/stp/ - <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/stp/ + <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage" target="_blank" >stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage" target="_blank" >stp PyPI package</a></li> </ul> veriT - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ <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 verification, automated reasoning, and related research areas. veriT accepts input in SMT-LIB2 and DIMACS formats and provides a command-line interface for ease of integration into verification workflows. The solver is actively maintained and distributed under the BSD license, making it suitable for both academic and industrial applications.</p> Yices 2 - http://localhost:1313/tools/sat-smt/yices/ + https://example.org/tools/sat-smt/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/yices/ - <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html">Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/">yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2">yices2 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/yices/ + <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html" target="_blank" >Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/" target="_blank" >yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2" target="_blank" >yices2 crate on crates.io</a></li> </ul> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/maintenance/index.html b/maintenance/index.html index 9526c94..ed158f8 100644 --- a/maintenance/index.html +++ b/maintenance/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -103,6 +111,7 @@ diff --git a/maintenance/index.xml b/maintenance/index.xml index 110dd90..b99557d 100644 --- a/maintenance/index.xml +++ b/maintenance/index.xml @@ -2,24 +2,24 @@ Maintenance on Formal Methods Tools - http://localhost:1313/maintenance/ + https://example.org/maintenance/ Recent content in Maintenance on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Actively Maintained - http://localhost:1313/maintenance/actively-maintained/ + https://example.org/maintenance/actively-maintained/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/maintenance/actively-maintained/ + https://example.org/maintenance/actively-maintained/ Not Maintained - http://localhost:1313/maintenance/not-maintained/ + https://example.org/maintenance/not-maintained/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/maintenance/not-maintained/ + https://example.org/maintenance/not-maintained/ diff --git a/maintenance/not-maintained/index.html b/maintenance/not-maintained/index.html index eb27346..eea71fe 100644 --- a/maintenance/not-maintained/index.html +++ b/maintenance/not-maintained/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -137,6 +145,7 @@ diff --git a/maintenance/not-maintained/index.xml b/maintenance/not-maintained/index.xml index 01535bc..5504f82 100644 --- a/maintenance/not-maintained/index.xml +++ b/maintenance/not-maintained/index.xml @@ -2,52 +2,52 @@ Not Maintained on Formal Methods Tools - http://localhost:1313/maintenance/not-maintained/ + https://example.org/maintenance/not-maintained/ Recent content in Not Maintained on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Boolector - http://localhost:1313/tools/sat-smt/boolector/ + https://example.org/tools/sat-smt/boolector/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/boolector/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla">Bitwuzla</a></p> + https://example.org/tools/sat-smt/boolector/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla" >Bitwuzla</a></p> cvc4 - http://localhost:1313/tools/sat-smt/cvc4/ + https://example.org/tools/sat-smt/cvc4/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc4/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5">cvc5</a></p> + https://example.org/tools/sat-smt/cvc4/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5" >cvc5</a></p> dReal - http://localhost:1313/tools/sat-smt/dreal/ + https://example.org/tools/sat-smt/dreal/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/dreal/ + https://example.org/tools/sat-smt/dreal/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> dReal is an automated reasoning tool. It focuses on solving problems that can be encoded as first-order logic formulas over the real numbers. Its special strength is in handling problems that involve a wide range of nonlinear real functions.</p> MiniSat - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2013</span> <span style="display:none">]</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> Q3B - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.</p> Riss - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2017</span> <span style="display:none">]</span> </div> Riss is a SAT solving tool collection.</p> diff --git a/privacy/index.html b/privacy/index.html index 8e39e5e..86a5538 100644 --- a/privacy/index.html +++ b/privacy/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -80,6 +88,7 @@ diff --git a/sitemap.xml b/sitemap.xml index ee764f7..5676bc8 100644 --- a/sitemap.xml +++ b/sitemap.xml @@ -2,268 +2,316 @@ - http://localhost:1313/interfaces/.net/ + https://example.org/interfaces/.net/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/maintenance/actively-maintained/ + https://example.org/maintenance/actively-maintained/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/albert-ludwigs-universit%C3%A4t/ + https://example.org/developers/albert-ludwigs-universit%C3%A4t/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/pmc/ + https://example.org/licenses/all-rights-reserved/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/licenses/all-rights-reserved/ + https://example.org/tools/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/ + https://example.org/licenses/apache-2.0/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/termination/ + https://example.org/applications/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/ + https://example.org/tools/sat-smt/bitwuzla/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/licenses/apache-2.0/ + https://example.org/tools/sat-smt/boolector/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/applications/ + https://example.org/licenses/bsd/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/interfaces/c/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/boolector/ + https://example.org/interfaces/c++/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/licenses/bsd/ + https://example.org/techniques/cdcl/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/interfaces/c/ + https://example.org/developers/cea/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/interfaces/c++/ + https://example.org/interfaces/cli/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/techniques/cdcl/ + https://example.org/inputs/cnf/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/cea/ + https://example.org/tools/sat-smt/colibri/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/interfaces/cli/ + https://example.org/applications/constraint-solver/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/inputs/cnf/ + https://example.org/tools/sat-smt/cryptominisat/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/cvc4/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/applications/constraint-solver/ + https://example.org/tools/sat-smt/cvc5/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/cryptominisat/ + https://example.org/developers/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/cvc4/ + https://example.org/inputs/dimacs/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/developers/disi-university-of-trento/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/ + https://example.org/tools/sat-smt/dreal/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/inputs/dimacs/ + https://example.org/developers/eindhoven-university-of-technology/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/disi-university-of-trento/ + https://example.org/developers/fondazione-bruno-kessler/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/dreal/ + https://example.org/inputs/galileo/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/eindhoven-university-of-technology/ + https://example.org/developers/gilles-audemard/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/fondazione-bruno-kessler/ + https://example.org/tools/sat-smt/glucose/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/gilles-audemard/ + https://example.org/licenses/gplv2/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/licenses/gplv3/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/licenses/gplv2/ + https://example.org/techniques/gpu/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/licenses/gplv3/ + https://example.org/inputs/greatspn/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/techniques/gpu/ + https://example.org/inputs/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/inputs/ + https://example.org/developers/inria-rh%C3%B4ne-alpes/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/inria-rh%C3%B4ne-alpes/ + https://example.org/interfaces/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/interfaces/ + https://example.org/inputs/jani/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/interfaces/java/ + https://example.org/interfaces/java/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/johannes-kepler-universit%C3%A4t-linz/ + https://example.org/developers/johannes-kepler-universit%C3%A4t-linz/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/laurent-simon/ + https://example.org/developers/laurent-simon/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/licenses/lgplv2/ + https://example.org/licenses/lgplv2/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/licenses/ + https://example.org/licenses/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/loria/ + https://example.org/developers/loria/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/maintenance/ + https://example.org/maintenance/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/masaryk-university/ + https://example.org/developers/masaryk-university/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/microsoft-research/ + https://example.org/developers/microsoft-research/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/licenses/mit/ + https://example.org/licenses/mit/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/niklas-e%C3%A9n/ + https://example.org/applications/model-checker/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/niklas-s%C3%B6rensson/ + https://example.org/tools/mc/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/norbert-manthey/ + https://example.org/inputs/mrmc/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/maintenance/not-maintained/ + https://example.org/developers/niklas-e%C3%A9n/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/interfaces/online/ + https://example.org/developers/niklas-s%C3%B6rensson/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/opensmt/ + https://example.org/developers/norbert-manthey/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/parafrost/ + https://example.org/maintenance/not-maintained/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/interfaces/python/ + https://example.org/interfaces/online/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/opensmt/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/developers/oxford-university/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/interfaces/rust/ + https://example.org/tools/sat-smt/parafrost/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/rwth-aachen/ + https://example.org/inputs/pnml/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/applications/sat-solver/ + https://example.org/inputs/prism/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/applications/smt-solver/ + https://example.org/tools/prob/prism/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/smt-rat/ + https://example.org/applications/probabilistic-model-checker/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/smtinterpol/ + https://example.org/tools/prob/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/inputs/smtlib2/ + https://example.org/interfaces/python/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/sri-international/ + https://example.org/tools/sat-smt/q3b/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/stanford-university/ + https://example.org/tools/sat-smt/riss/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/interfaces/rust/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/techniques/ + https://example.org/developers/rwth-aachen/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/ + https://example.org/inputs/sally/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/applications/theorem-prover/ + https://example.org/tools/mc/sally/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/uliege/ + https://example.org/tools/sat-smt/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/university-of-freiburg/ + https://example.org/applications/sat-solver/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/university-of-illinois/ + https://example.org/applications/smt-solver/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/university-of-iowa/ + https://example.org/tools/sat-smt/smt-rat/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/university-of-lugano/ + https://example.org/tools/sat-smt/smtinterpol/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/developers/university-of-virginia/ + https://example.org/inputs/smtlib2/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/developers/sri-international/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/inputs/yices-2/ + https://example.org/tools/prob/stamina/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/yices/ + https://example.org/developers/stanford-university/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/prob/storm/ 2025-06-07T00:00:00+00:00 - http://localhost:1313/about/ + https://example.org/tools/sat-smt/stp/ + 2025-06-07T00:00:00+00:00 + + https://example.org/techniques/ + 2025-06-07T00:00:00+00:00 + + https://example.org/tools/termination/ + 2025-06-07T00:00:00+00:00 + + https://example.org/ + 2025-06-07T00:00:00+00:00 + + https://example.org/applications/theorem-prover/ + 2025-06-07T00:00:00+00:00 + + https://example.org/developers/uliege/ + 2025-06-07T00:00:00+00:00 + + https://example.org/developers/university-of-freiburg/ + 2025-06-07T00:00:00+00:00 + + https://example.org/developers/university-of-illinois/ + 2025-06-07T00:00:00+00:00 + + https://example.org/developers/university-of-iowa/ + 2025-06-07T00:00:00+00:00 + + https://example.org/developers/university-of-lugano/ + 2025-06-07T00:00:00+00:00 + + https://example.org/developers/university-of-virginia/ + 2025-06-07T00:00:00+00:00 + + https://example.org/developers/utah-state-university/ + 2025-06-07T00:00:00+00:00 + + https://example.org/tools/sat-smt/verit/ + 2025-06-07T00:00:00+00:00 + + https://example.org/inputs/yices-2/ + 2025-06-07T00:00:00+00:00 + + https://example.org/tools/sat-smt/yices/ + 2025-06-07T00:00:00+00:00 + + https://example.org/tools/sat-smt/z3/ + 2025-06-07T00:00:00+00:00 + + https://example.org/about/ - http://localhost:1313/taxonomies/ + https://example.org/taxonomies/ - http://localhost:1313/contribute/ + https://example.org/contribute/ - http://localhost:1313/domains/ + https://example.org/domains/ - http://localhost:1313/license/ + https://example.org/license/ - http://localhost:1313/privacy/ + https://example.org/privacy/ diff --git a/taxonomies/index.html b/taxonomies/index.html index 700c9c3..ed3a4c1 100644 --- a/taxonomies/index.html +++ b/taxonomies/index.html @@ -1,6 +1,6 @@ - + @@ -15,16 +15,16 @@ - + - + - - - - + + + + - + @@ -36,6 +36,14 @@ Click on an item in the first column to focus"> + + + +

Formal Methods Tools

@@ -105,6 +113,40 @@ the tools developed at SRI International).

+ + Model Checker + + + + + + + + + + + + + Probabilistic Model Checker + + + + + + + + + + + + + Oxford University + + + + + + + + + + + + + + + + + + + + + Utah State University + + + @@ -630,6 +706,125 @@ the tools developed at SRI International).

+ + Galileo + + + + + + + + + + + + + GreatSPN + + + + + + + + + + + + + JANI + + + + + + + + + + + + + MRMC + + + + + + + + + + + + + PNML + + + + + + + + + + + + + PRISM + + + + + + + + + + + + + Sally + + + + + + + + + + + diff --git a/taxonomies/index.xml b/taxonomies/index.xml index 02bdae5..19d5fe8 100644 --- a/taxonomies/index.xml +++ b/taxonomies/index.xml @@ -2,10 +2,10 @@ All Taxonomy Data on Formal Methods Tools - http://localhost:1313/taxonomies/ + https://example.org/taxonomies/ Recent content in All Taxonomy Data on Formal Methods Tools Hugo en-us - + diff --git a/techniques/cdcl/index.html b/techniques/cdcl/index.html index cc1cb94..05c7ada 100644 --- a/techniques/cdcl/index.html +++ b/techniques/cdcl/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/techniques/cdcl/index.xml b/techniques/cdcl/index.xml index 04d5c19..ad58d3c 100644 --- a/techniques/cdcl/index.xml +++ b/techniques/cdcl/index.xml @@ -2,18 +2,18 @@ CDCL on Formal Methods Tools - http://localhost:1313/techniques/cdcl/ + https://example.org/techniques/cdcl/ Recent content in CDCL on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + ParaFROST - http://localhost:1313/tools/sat-smt/parafrost/ + https://example.org/tools/sat-smt/parafrost/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/parafrost/ - <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/parafrost/ + <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/techniques/gpu/index.html b/techniques/gpu/index.html index 0746062..22cba3a 100644 --- a/techniques/gpu/index.html +++ b/techniques/gpu/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -96,6 +104,7 @@ diff --git a/techniques/gpu/index.xml b/techniques/gpu/index.xml index 4b8744f..d71124a 100644 --- a/techniques/gpu/index.xml +++ b/techniques/gpu/index.xml @@ -2,18 +2,18 @@ GPU on Formal Methods Tools - http://localhost:1313/techniques/gpu/ + https://example.org/techniques/gpu/ Recent content in GPU on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + ParaFROST - http://localhost:1313/tools/sat-smt/parafrost/ + https://example.org/tools/sat-smt/parafrost/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/parafrost/ - <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/parafrost/ + <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/techniques/index.html b/techniques/index.html index ca1b363..5f138eb 100644 --- a/techniques/index.html +++ b/techniques/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -103,6 +111,7 @@ diff --git a/techniques/index.xml b/techniques/index.xml index 393379d..92394f1 100644 --- a/techniques/index.xml +++ b/techniques/index.xml @@ -2,24 +2,24 @@ Techniques on Formal Methods Tools - http://localhost:1313/techniques/ + https://example.org/techniques/ Recent content in Techniques on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + CDCL - http://localhost:1313/techniques/cdcl/ + https://example.org/techniques/cdcl/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/techniques/cdcl/ + https://example.org/techniques/cdcl/ GPU - http://localhost:1313/techniques/gpu/ + https://example.org/techniques/gpu/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/techniques/gpu/ + https://example.org/techniques/gpu/ diff --git a/tools/index.html b/tools/index.html index 8941098..7c993bd 100644 --- a/tools/index.html +++ b/tools/index.html @@ -1,6 +1,6 @@ - + @@ -16,16 +16,16 @@ - + - + - - - - + + + + - + @@ -37,6 +37,14 @@ Click a colorful item in the"> + + + +

Formal Methods Tools

@@ -67,39 +75,10 @@ Click a colorful item in the"> - + + + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - @@ -111,6 +90,48 @@ Click a colorful item in the"> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + @@ -136,11 +157,13 @@ Colors are generated by hashing each term’s name and converting it to RGB @@ -153,7 +176,8 @@ Colors are generated by hashing each term’s name and converting it to RGB Tool Applications - License + Licenses + @@ -259,26 +283,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -294,24 +318,25 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - - + + + + + + + + + + @@ -320,7 +345,7 @@ Colors are generated by hashing each term’s name and converting it to RGB
Boolector - +
@@ -417,26 +442,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -452,24 +477,25 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - - + + + + + + + + + + @@ -536,26 +562,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -571,22 +597,23 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - + + + + + + + + + @@ -655,26 +682,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -690,8 +717,8 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - + + @@ -707,24 +734,25 @@ Colors are generated by hashing each term’s name and converting it to RGB GPLv2 - - - - - - - - - + + + + + + + + + + @@ -733,7 +761,7 @@ Colors are generated by hashing each term’s name and converting it to RGB
cvc4 - +
@@ -813,26 +841,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -848,24 +876,25 @@ Colors are generated by hashing each term’s name and converting it to RGB BSD - - - - - - - - - + + + + + + + + + + @@ -951,26 +980,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -986,24 +1015,25 @@ Colors are generated by hashing each term’s name and converting it to RGB BSD - - - - - - - - - + + + + + + + + + + @@ -1012,7 +1042,7 @@ Colors are generated by hashing each term’s name and converting it to RGB
dReal - +
@@ -1069,22 +1099,22 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - + + + + + + + + + + @@ -1100,22 +1130,23 @@ Colors are generated by hashing each term’s name and converting it to RGB Apache-2.0 - - - - - - - - + + + + + + + + + @@ -1182,26 +1213,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -1217,22 +1248,23 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - + + + + + + + + + @@ -1297,24 +1329,24 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - + + + + + + + + + + + @@ -1330,22 +1362,23 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - + + + + + + + + + @@ -1410,24 +1443,24 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - + + + + + + + + + + + @@ -1443,22 +1476,23 @@ Colors are generated by hashing each term’s name and converting it to RGB All Rights Reserved - - - - - - - - + + + + + + + + + @@ -1467,7 +1501,7 @@ Colors are generated by hashing each term’s name and converting it to RGB
MiniSat - +
@@ -1526,24 +1560,24 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - + + + + + + + + + + + @@ -1559,22 +1593,23 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - + + + + + + + + + @@ -1641,26 +1676,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -1676,22 +1711,23 @@ Colors are generated by hashing each term’s name and converting it to RGB GPLv3 - - - - - - - - + + + + + + + + + @@ -1762,21 +1798,74 @@ Colors are generated by hashing each term’s name and converting it to RGB - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + GPLv3 + + + + + + + + + + + + + + + + + + + + + + + + + + + - + PRISM - + + - - - - - - - @@ -1791,10 +1880,10 @@ Colors are generated by hashing each term’s name and converting it to RGB - GPLv3 + id="applications_probabilistic-model-checker" + style="background:rgba(232,228,128,0.4)" + href="/applications/probabilistic-model-checker"> + Probabilistic Model Checker @@ -1808,6 +1897,20 @@ Colors are generated by hashing each term’s name and converting it to RGB + + + + + + + + + + + + + + @@ -1816,6 +1919,62 @@ Colors are generated by hashing each term’s name and converting it to RGB + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + GPLv2 + + + + + + + + + + + + + + + + + + + + @@ -1825,7 +1984,7 @@ Colors are generated by hashing each term’s name and converting it to RGB
Q3B - +
@@ -1888,26 +2047,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -1923,24 +2082,25 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - - + + + + + + + + + + @@ -1949,7 +2109,7 @@ Colors are generated by hashing each term’s name and converting it to RGB
Riss - +
@@ -2010,21 +2170,70 @@ Colors are generated by hashing each term’s name and converting it to RGB - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + LGPLv2 + + + + + + + + + + + + + + + + + + + + + + + - + Sally - + + - - - - - - - @@ -2039,10 +2248,10 @@ Colors are generated by hashing each term’s name and converting it to RGB - LGPLv2 + id="applications_model-checker" + style="background:rgba(74,58,26,0.4)" + href="/applications/model-checker"> + Model Checker @@ -2054,12 +2263,82 @@ Colors are generated by hashing each term’s name and converting it to RGB + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + GPLv2 + + + + + + + + + + + + + + + + + + @@ -2146,26 +2425,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -2181,24 +2460,25 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - - + + + + + + + + + + @@ -2267,21 +2547,72 @@ Colors are generated by hashing each term’s name and converting it to RGB - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + GPLv3 + + + + + + + + + + + + + + + + + + + + + + + + + - + STAMINA - + + - - - - - - - @@ -2296,10 +2627,10 @@ Colors are generated by hashing each term’s name and converting it to RGB - GPLv3 + id="applications_probabilistic-model-checker" + style="background:rgba(232,228,128,0.4)" + href="/applications/probabilistic-model-checker"> + Probabilistic Model Checker @@ -2313,12 +2644,223 @@ Colors are generated by hashing each term’s name and converting it to RGB + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + MIT + + + + + + + + + + + + + GPLv3 + + + + + + + + + + + + + + + + + + + + + + + + + + + + Storm + + + + + + + + + + + + + + + + + + + Probabilistic Model Checker + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + GPLv3 + + + + + + + + + + + + + + + + + + + + @@ -2422,26 +2964,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -2457,24 +2999,25 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - - + + + + + + + + + + @@ -2543,26 +3086,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -2578,24 +3121,25 @@ Colors are generated by hashing each term’s name and converting it to RGB BSD - - - - - - - - - + + + + + + + + + + @@ -2681,26 +3225,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -2716,24 +3260,25 @@ Colors are generated by hashing each term’s name and converting it to RGB GPLv3 - - - - - - - - - + + + + + + + + + + @@ -2836,26 +3381,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -2871,40 +3416,43 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - - + + + + + + + + + + -
- - Black dot indicates tool has not been maintained recently +
+ + Red dot indicates tool has not been updated or maintained recently
+ diff --git a/tools/index.xml b/tools/index.xml index b91a5bd..8c61c25 100644 --- a/tools/index.xml +++ b/tools/index.xml @@ -2,11 +2,11 @@ All Tools on Formal Methods Tools - http://localhost:1313/tools/ + https://example.org/tools/ Recent content in All Tools on Formal Methods Tools Hugo en-us - + diff --git a/tools/mc/index.html b/tools/mc/index.html new file mode 100644 index 0000000..ab9cb5d --- /dev/null +++ b/tools/mc/index.html @@ -0,0 +1,242 @@ + + + + + + + + +Model Checking Tools | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + + + + + + + + + + + +

Model Checking Tools

+

This page lists all of the model checking tools on this site in alphabetical order. +Click a tool name in the first column to view tool details. +Click a colorful item in the second column to view all the tools for which that term applies. +Item colors mean nothing and are intended to make it easy to skim the page. +Colors are generated by hashing each term’s name and converting it to RGB color values.

+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
ToolApplicationsLicenses
+ + + Sally + + + + + + + + + + + + + + + + + + Model Checker + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + GPLv2 + + + + + + + + + + + + + + + + +
+ +
+ + Red dot indicates tool has not been updated or maintained recently +
+ + + +
+ + + diff --git a/tools/mc/index.xml b/tools/mc/index.xml new file mode 100644 index 0000000..9d8b32f --- /dev/null +++ b/tools/mc/index.xml @@ -0,0 +1,19 @@ + + + + Model Checking Tools on Formal Methods Tools + https://example.org/tools/mc/ + Recent content in Model Checking Tools on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + Sally + https://example.org/tools/mc/sally/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/mc/sally/ + <p>Sally is a model checker for infinite state systems described as transition systems.</p> + + + diff --git a/tools/mc/sally/index.html b/tools/mc/sally/index.html new file mode 100644 index 0000000..f4e4344 --- /dev/null +++ b/tools/mc/sally/index.html @@ -0,0 +1,341 @@ + + + + + + + + +Sally | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

Sally

+ + Probabilistic Model Checker + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + Model Checker + + + +
+ + Developers + + + + + + + + + + + + + SRI International + + + +
+ + Inputs + + + + + + + + + + + + + Sally + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + GPLv2 + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

Sally is a model checker for infinite state systems described as transition systems.

+ +
+ + + + +
+
+ Help improve this page!
+ Submit an + issue or + pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/pmc/index.html b/tools/pmc/index.html deleted file mode 100644 index d076a50..0000000 --- a/tools/pmc/index.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - -All PMC Tools | Formal Methods Tools - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
-

Formal Methods Tools

- - - - -
-
- - - - - - - - -

All PMC Tools

-

This page lists all of the SAT & SMT tools on this site in alphabetical order. -Click a tool name in the first column to view tool details. -Click a colorful item in the second column to view all the tools for which that term applies. -Item colors mean nothing and are intended to make it easy to skim the page. -Colors are generated by hashing each term’s name and converting it to RGB color values.

- -
- - - -
- - No Tools Found -
- - - - - - - - - - - - - - - -
ToolApplicationsLicense
- -
- - Black dot indicates tool has not been maintained recently -
- - -
- - - diff --git a/tools/pmc/index.xml b/tools/pmc/index.xml deleted file mode 100644 index 13d30ce..0000000 --- a/tools/pmc/index.xml +++ /dev/null @@ -1,12 +0,0 @@ - - - - All PMC Tools on Formal Methods Tools - http://localhost:1313/tools/pmc/ - Recent content in All PMC Tools on Formal Methods Tools - Hugo - en-us - - - - diff --git a/tools/prob/index.html b/tools/prob/index.html new file mode 100644 index 0000000..b52a47f --- /dev/null +++ b/tools/prob/index.html @@ -0,0 +1,515 @@ + + + + + + + + +Probabilistic Tools | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + + + + + + + + + + + + + + + + + + + +

Probabilistic Tools

+

This page lists all of the probabilistic tools on this site in alphabetical order. +Click a tool name in the first column to view tool details. +Click a colorful item in the second column to view all the tools for which that term applies. +Item colors mean nothing and are intended to make it easy to skim the page. +Colors are generated by hashing each term’s name and converting it to RGB color values.

+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
ToolApplicationsLicenses
+ + + PRISM + + + + + + + + + + + + + + + + + + Probabilistic Model Checker + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + GPLv2 + + + + + + + + + + + + + + + + + + +
+ + + STAMINA + + + + + + + + + + + + + + + + + + Probabilistic Model Checker + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + MIT + + + + + + + + + + + + + GPLv3 + + + + + + + + + + + + + + + + + + +
+ + + Storm + + + + + + + + + + + + + + + + + + Probabilistic Model Checker + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + GPLv3 + + + + + + + + + + + + + + + + + + +
+ +
+ + Red dot indicates tool has not been updated or maintained recently +
+ + + +
+ + + diff --git a/tools/prob/index.xml b/tools/prob/index.xml new file mode 100644 index 0000000..479b002 --- /dev/null +++ b/tools/prob/index.xml @@ -0,0 +1,33 @@ + + + + Probabilistic Tools on Formal Methods Tools + https://example.org/tools/prob/ + Recent content in Probabilistic Tools on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + PRISM + https://example.org/tools/prob/prism/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/prism/ + <p>PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or probabilistic behaviour.</p> + + + STAMINA + https://example.org/tools/prob/stamina/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/stamina/ + <p>A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces with either <a href="../storm" >Storm</a> or <a href="../prism" >PRISM</a>.</p> + + + Storm + https://example.org/tools/prob/storm/ + Sat, 07 Jun 2025 00:00:00 +0000 + https://example.org/tools/prob/storm/ + <p>Storm is a tool for the analysis of systems involving random or probabilistic phenomena.</p> + + + diff --git a/tools/prob/prism/index.html b/tools/prob/prism/index.html new file mode 100644 index 0000000..ccb14f7 --- /dev/null +++ b/tools/prob/prism/index.html @@ -0,0 +1,447 @@ + + + + + + + + +PRISM | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

PRISM

+ + Probabilistic Model Checker + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + Probabilistic Model Checker + + + +
+ + Developers + + + + + + + + + + + + + Oxford University + + + +
+ + Inputs + + + + + + + + + + + + + MRMC + + + + + + + + + + + + + PRISM + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + + + + + + + + + + + Java + + + +
+ + Licenses + + + + + + + + + + + + + GPLv2 + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or probabilistic behaviour.

+ +
+ + + +
+

Publications

+
    + + + + + + + + + + + + + +
  • + PRISM 4.0: Verification of Probabilistic Real-time Systems + + + (2011) + + + by Kwiatkowska, Marta et. al. + | Appears in CAV 2011 + (585-591) + + | Volume 6806 + | Published by Springer + | 10.1007/978-3-642-22110-1_47 + +
    • + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+
+ + +
+
+ Help improve this page!
+ Submit an + issue or + pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/prob/stamina/index.html b/tools/prob/stamina/index.html new file mode 100644 index 0000000..46f8455 --- /dev/null +++ b/tools/prob/stamina/index.html @@ -0,0 +1,449 @@ + + + + + + + + +STAMINA | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

STAMINA

+ + Probabilistic Model Checker + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + Probabilistic Model Checker + + + +
+ + Developers + + + + + + + + + + + + + Utah State University + + + +
+ + Inputs + + + + + + + + + + + + + PRISM + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + + + + + + + + + + + Online + + + +
+ + Licenses + + + + + + + + + + + + + GPLv3 + + + + + + + + + + + + + MIT + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces with either Storm or PRISM.

+ +
+ + + +
+

Publications

+
    + + + + + + + + + + + +
  • + STAMINA in C++: Modernizing an Infinite-State Probabilistic Model Checker + + + (2023) + + + by Jeppson, Joshua et. al. + | Appears in QEST 2023 + (101-109) + + + | Published by Springer + | 10.1007/978-3-031-43835-6_7 + +
    • + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+
+ + +
+
+ Help improve this page!
+ Submit an + issue or + pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/prob/storm/index.html b/tools/prob/storm/index.html new file mode 100644 index 0000000..75fa459 --- /dev/null +++ b/tools/prob/storm/index.html @@ -0,0 +1,532 @@ + + + + + + + + +Storm | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

Storm

+ + Probabilistic Model Checker + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + Probabilistic Model Checker + + + +
+ + Developers + + + + + + + + + + + + + RWTH Aachen + + + +
+ + Inputs + + + + + + + + + + + + + Galileo + + + + + + + + + + + + + GreatSPN + + + + + + + + + + + + + JANI + + + + + + + + + + + + + MRMC + + + + + + + + + + + + + PNML + + + + + + + + + + + + + PRISM + + + +
+ + Interfaces + + + + + + + + + + + + + C++ + + + + + + + + + + + + + CLI + + + + + + + + + + + + + Python + + + +
+ + Licenses + + + + + + + + + + + + + GPLv3 + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

Storm is a tool for the analysis of systems involving random or probabilistic phenomena.

+ +
+ + + +
+

Publications

+
    + + + + + + + + + +
  • + The probabilistic model checker Storm + + + (2022) + + + by Hensel, Christian et. al. + + (589-610) + | Appears in International Journal on Software Tools for Technology Transfer + | Volume 24 + | Published by Springer + | 10.1007/s10009-021-00633-z + +
    • + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+
+ + +
+
+ Help improve this page!
+ Submit an + issue or + pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/sat-smt/bitwuzla/index.html b/tools/sat-smt/bitwuzla/index.html index 5a83b04..7cc23be 100644 --- a/tools/sat-smt/bitwuzla/index.html +++ b/tools/sat-smt/bitwuzla/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

Formal Methods Tools

@@ -105,6 +113,23 @@ + + SAT Solver + + + + + + + + + + + - - - - - - - - - - SAT Solver - - - @@ -348,6 +356,34 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + +
  • Bitwuzla @@ -377,50 +413,6 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - @@ -429,8 +421,8 @@
    Help improve this page!
    Submit an - issue or - pull request. + issue or + pull request.
    @@ -447,6 +439,7 @@ diff --git a/tools/sat-smt/boolector/index.html b/tools/sat-smt/boolector/index.html index e9d2e7c..f395ced 100644 --- a/tools/sat-smt/boolector/index.html +++ b/tools/sat-smt/boolector/index.html @@ -1,6 +1,6 @@ - + @@ -24,16 +24,16 @@ ] Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size"> - + - + - - - - + + + + - + @@ -45,6 +45,14 @@ Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of f + + + +

    Formal Methods Tools

    @@ -115,6 +123,23 @@ Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of f + + SAT Solver + + + + + + + + + + + - - - - - - - - - - SAT Solver - - - @@ -184,10 +192,10 @@ Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of f - Stanford University + id="developers_johannes-kepler-universit%C3%A4t-linz" + style="background:rgba(78,0,50,0.4)" + href="/developers/johannes-kepler-universit%C3%A4t-linz"> + Johannes Kepler Universität Linz @@ -201,10 +209,10 @@ Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of f - Johannes Kepler Universität Linz + id="developers_stanford-university" + style="background:rgba(38,159,198,0.4)" + href="/developers/stanford-university"> + Stanford University @@ -368,7 +376,7 @@ Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of f ]
    Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. -Succeeded by Bitwuzla

    +Succeeded by Bitwuzla

    @@ -390,6 +398,28 @@ Succeeded by Bitwuzla

    + + + + + + + + + + + + + + + + + + + + + +
  • Boolector 2.0 @@ -421,44 +451,6 @@ Succeeded by Bitwuzla

    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - @@ -466,7 +458,9 @@ Succeeded by Bitwuzla

    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -483,6 +477,7 @@ Succeeded by Bitwuzla

    diff --git a/tools/sat-smt/colibri/index.html b/tools/sat-smt/colibri/index.html index 954e25d..e8be45a 100644 --- a/tools/sat-smt/colibri/index.html +++ b/tools/sat-smt/colibri/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

    Formal Methods Tools

    @@ -306,7 +314,9 @@
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -323,6 +333,7 @@ diff --git a/tools/sat-smt/cryptominisat/index.html b/tools/sat-smt/cryptominisat/index.html index bc652af..76566a3 100644 --- a/tools/sat-smt/cryptominisat/index.html +++ b/tools/sat-smt/cryptominisat/index.html @@ -1,6 +1,6 @@ - + @@ -19,16 +19,16 @@ This tool is available through the following interfaces: C++ Namespace: Documentation on homepage Python"> - + - + - - - - + + + + - + @@ -40,6 +40,14 @@ Python"> + + + +

    Formal Methods Tools

    @@ -229,6 +237,23 @@ Python"> + + C++ + + + + + + + + + + + - - - - - - - - - - C++ - - - @@ -298,10 +306,10 @@ Python"> - MIT + id="licenses_gplv2" + style="background:rgba(220,234,19,0.4)" + href="/licenses/gplv2"> + GPLv2 @@ -315,10 +323,10 @@ Python"> - GPLv2 + id="licenses_mit" + style="background:rgba(122,188,26,0.4)" + href="/licenses/mit"> + MIT @@ -373,8 +381,8 @@ Python">

    APIs and Bindings

    This tool is available through the following interfaces:

    @@ -401,6 +409,32 @@ Python"> + + + + + + + + + + + + + + + + + + + + + + + + + +
  • Extending SAT Solvers to Cryptographic Problems @@ -424,48 +458,6 @@ Python"> - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - @@ -473,7 +465,9 @@ Python">
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -490,6 +484,7 @@ Python"> diff --git a/tools/sat-smt/cvc4/index.html b/tools/sat-smt/cvc4/index.html index 279e20e..415cc17 100644 --- a/tools/sat-smt/cvc4/index.html +++ b/tools/sat-smt/cvc4/index.html @@ -1,6 +1,6 @@ - + @@ -24,16 +24,16 @@ ] cvc4 is an automatic theorem prover for SMT problems. It is succeeded by cvc5"> - + - + - - - - + + + + - + @@ -45,6 +45,14 @@ cvc4 is an automatic theorem prover for SMT problems. It is succeeded by cvc5"> + + + +

    Formal Methods Tools

    @@ -369,7 +377,7 @@ cvc4 is an automatic theorem prover for SMT problems. It is succeeded by cvc5"> ]
    -cvc4 is an automatic theorem prover for SMT problems. It is succeeded by cvc5

    +cvc4 is an automatic theorem prover for SMT problems. It is succeeded by cvc5

    @@ -392,12 +400,6 @@ cvc4 is an automatic theorem prover for SMT problems. It is succeeded by CVC4 - (2011) + (July 2011) by Barrett, Clark W. et. al. - | Appears in Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings + | Appears in CAV 2011 (171-177) | Volume 6806 @@ -439,16 +441,6 @@ cvc4 is an automatic theorem prover for SMT problems. It is succeeded by
    Help improve this page!
    - Submit an     issue or pull request. + Submit an + issue or + pull request.
    @@ -484,6 +478,7 @@ cvc4 is an automatic theorem prover for SMT problems. It is succeeded by

    Contribute  |  About  |  License  |  Privacy

    +

    © Copyright 2025. An open-source project.

    diff --git a/tools/sat-smt/cvc5/index.html b/tools/sat-smt/cvc5/index.html index 5eec4bd..f21fb90 100644 --- a/tools/sat-smt/cvc5/index.html +++ b/tools/sat-smt/cvc5/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

    Formal Methods Tools

    @@ -376,8 +384,6 @@ - -
  • cvc5: A Versatile and Industrial-Strength SMT Solver @@ -415,20 +421,6 @@ - - - - - - - - - - - - - - @@ -447,7 +439,9 @@
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -464,6 +458,7 @@ diff --git a/tools/sat-smt/dreal/index.html b/tools/sat-smt/dreal/index.html index 1a175b7..826f41a 100644 --- a/tools/sat-smt/dreal/index.html +++ b/tools/sat-smt/dreal/index.html @@ -1,6 +1,6 @@ - + @@ -24,16 +24,16 @@ ] dReal is an automated reasoning tool. It focuses on solving problems that can be encoded as"> - + - + - - - - + + + + - + @@ -45,6 +45,14 @@ dReal is an automated reasoning tool. It focuses on solving problems that can be + + + +

    Formal Methods Tools

    @@ -266,7 +274,9 @@ dReal is an automated reasoning tool. It focuses on solving problems that can be
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -283,6 +293,7 @@ dReal is an automated reasoning tool. It focuses on solving problems that can be diff --git a/tools/sat-smt/glucose/index.html b/tools/sat-smt/glucose/index.html index 525fc78..5dda277 100644 --- a/tools/sat-smt/glucose/index.html +++ b/tools/sat-smt/glucose/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

    Formal Methods Tools

    @@ -323,7 +331,9 @@
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -340,6 +350,7 @@ diff --git a/tools/sat-smt/index.html b/tools/sat-smt/index.html index 78bd812..6a19a3b 100644 --- a/tools/sat-smt/index.html +++ b/tools/sat-smt/index.html @@ -1,31 +1,31 @@ - + -All SAT & SMT Tools | Formal Methods Tools +SAT & SMT Tools | Formal Methods Tools - + - + - + - - - - + + + + - + @@ -37,6 +37,14 @@ Click a colorful"> + + + +

    Formal Methods Tools

    @@ -149,7 +157,7 @@ Click a colorful"> -

    All SAT & SMT Tools

    +

    SAT & SMT Tools

    This page lists all of the SAT & SMT tools on this site in alphabetical order. Click a tool name in the first column to view tool details. Click a colorful item in the second column to view all the tools for which that term applies. @@ -166,7 +174,8 @@ Colors are generated by hashing each term’s name and converting it to RGB Tool Applications - License + Licenses + @@ -272,26 +281,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -307,24 +316,25 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - - + + + + + + + + + + @@ -333,7 +343,7 @@ Colors are generated by hashing each term’s name and converting it to RGB

    Boolector - +
    @@ -430,26 +440,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -465,24 +475,25 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - - + + + + + + + + + + @@ -549,26 +560,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -584,22 +595,23 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - + + + + + + + + + @@ -668,26 +680,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -703,8 +715,8 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - + + @@ -720,24 +732,25 @@ Colors are generated by hashing each term’s name and converting it to RGB GPLv2 - - - - - - - - - + + + + + + + + + + @@ -746,7 +759,7 @@ Colors are generated by hashing each term’s name and converting it to RGB
    cvc4 - +
    @@ -826,26 +839,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -861,24 +874,25 @@ Colors are generated by hashing each term’s name and converting it to RGB BSD - - - - - - - - - + + + + + + + + + + @@ -964,26 +978,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -999,24 +1013,25 @@ Colors are generated by hashing each term’s name and converting it to RGB BSD - - - - - - - - - + + + + + + + + + + @@ -1025,7 +1040,7 @@ Colors are generated by hashing each term’s name and converting it to RGB
    dReal - +
    @@ -1082,22 +1097,22 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - + + + + + + + + + + @@ -1113,22 +1128,23 @@ Colors are generated by hashing each term’s name and converting it to RGB Apache-2.0 - - - - - - - - + + + + + + + + + @@ -1195,26 +1211,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -1230,22 +1246,23 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - + + + + + + + + + @@ -1310,24 +1327,24 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - + + + + + + + + + + + @@ -1343,22 +1360,23 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - + + + + + + + + + @@ -1423,24 +1441,24 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - + + + + + + + + + + + @@ -1456,22 +1474,23 @@ Colors are generated by hashing each term’s name and converting it to RGB All Rights Reserved - - - - - - - - + + + + + + + + + @@ -1480,7 +1499,7 @@ Colors are generated by hashing each term’s name and converting it to RGB
    MiniSat - +
    @@ -1539,24 +1558,24 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - + + + + + + + + + + + @@ -1572,22 +1591,23 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - + + + + + + + + + @@ -1654,26 +1674,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -1689,22 +1709,23 @@ Colors are generated by hashing each term’s name and converting it to RGB GPLv3 - - - - - - - - + + + + + + + + + @@ -1775,26 +1796,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -1810,26 +1831,27 @@ Colors are generated by hashing each term’s name and converting it to RGB GPLv3 - - - - - - - - - - + + + + + + + + + + + @@ -1838,7 +1860,7 @@ Colors are generated by hashing each term’s name and converting it to RGB
    Q3B - +
    @@ -1901,26 +1923,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -1936,24 +1958,25 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - - + + + + + + + + + + @@ -1962,7 +1985,7 @@ Colors are generated by hashing each term’s name and converting it to RGB
    Riss - +
    @@ -2023,26 +2046,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -2058,22 +2081,23 @@ Colors are generated by hashing each term’s name and converting it to RGB LGPLv2 - - - - - - - - + + + + + + + + + @@ -2159,26 +2183,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -2194,24 +2218,25 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - - + + + + + + + + + + @@ -2280,26 +2305,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -2315,24 +2340,25 @@ Colors are generated by hashing each term’s name and converting it to RGB GPLv3 - - - - - - - - - + + + + + + + + + + @@ -2435,26 +2461,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -2470,24 +2496,25 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - - + + + + + + + + + + @@ -2556,26 +2583,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -2591,24 +2618,25 @@ Colors are generated by hashing each term’s name and converting it to RGB BSD - - - - - - - - - + + + + + + + + + + @@ -2694,26 +2722,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -2729,24 +2757,25 @@ Colors are generated by hashing each term’s name and converting it to RGB GPLv3 - - - - - - - - - + + + + + + + + + + @@ -2849,26 +2878,26 @@ Colors are generated by hashing each term’s name and converting it to RGB - - - - - - - - - - - - + + + + + + + + + + + + @@ -2884,40 +2913,43 @@ Colors are generated by hashing each term’s name and converting it to RGB MIT - - - - - - - - - + + + + + + + + + + -
    - - Black dot indicates tool has not been maintained recently +
    + + Red dot indicates tool has not been updated or maintained recently
    + diff --git a/tools/sat-smt/index.xml b/tools/sat-smt/index.xml index 481b625..386c34f 100644 --- a/tools/sat-smt/index.xml +++ b/tools/sat-smt/index.xml @@ -1,159 +1,159 @@ - All SAT & SMT Tools on Formal Methods Tools - http://localhost:1313/tools/sat-smt/ - Recent content in All SAT & SMT Tools on Formal Methods Tools + SAT & SMT Tools on Formal Methods Tools + https://example.org/tools/sat-smt/ + Recent content in SAT & SMT Tools on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Bitwuzla - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/bitwuzla/ + https://example.org/tools/sat-smt/bitwuzla/ <p>Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.</p> Boolector - http://localhost:1313/tools/sat-smt/boolector/ + https://example.org/tools/sat-smt/boolector/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/boolector/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla">Bitwuzla</a></p> + https://example.org/tools/sat-smt/boolector/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span> <span style="display:none">]</span> </div> Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions. Succeeded by <a href="../bitwuzla" >Bitwuzla</a></p> Colibri - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/colibri/ + https://example.org/tools/sat-smt/colibri/ <p>Colibri is an SMT solver.</p> CryptoMiniSat - http://localhost:1313/tools/sat-smt/cryptominisat/ + https://example.org/tools/sat-smt/cryptominisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cryptominisat/ - <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/">homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/">PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/cryptominisat/ + <p>CryptoMiniSat is a SAT solver.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ Namespace:</strong> Documentation on <a href="https://www.msoos.org/cryptominisat5/" target="_blank" >homepage</a></li> <li><strong>Python package:</strong> <a href="https://pypi.org/project/pycryptosat/" target="_blank" >PyPI package</a></li> </ul> cvc4 - http://localhost:1313/tools/sat-smt/cvc4/ + https://example.org/tools/sat-smt/cvc4/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc4/ - <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5">cvc5</a></p> + https://example.org/tools/sat-smt/cvc4/ + <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span> <span style="display:none">]</span> </div> cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5" >cvc5</a></p> cvc5 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/cvc5/ + https://example.org/tools/sat-smt/cvc5/ <p>cvc5 is an automatic theorem prover for SMT problems.</p> dReal - http://localhost:1313/tools/sat-smt/dreal/ + https://example.org/tools/sat-smt/dreal/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/dreal/ + https://example.org/tools/sat-smt/dreal/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> dReal is an automated reasoning tool. It focuses on solving problems that can be encoded as first-order logic formulas over the real numbers. Its special strength is in handling problems that involve a wide range of nonlinear real functions.</p> Glucose - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/glucose/ + https://example.org/tools/sat-smt/glucose/ <p>Glucose is a SAT solver.</p> Lingeling - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/lingeling/ + https://example.org/tools/sat-smt/lingeling/ <p>Lingeling is a SAT solver.</p> MathSAT - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/mathsat/ + https://example.org/tools/sat-smt/mathsat/ <p><div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(226, 181, 59);"></span> <span style="display:none">[</span> <span style="color: rgb(226, 181, 59); font-size: 1rem;">Closed-Source Tool</span> <span style="display:none">]&nbsp;</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> MiniSat - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/minisat/ + https://example.org/tools/sat-smt/minisat/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2013</span> <span style="display:none">]</span> </div> MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.</p> OpenSMT - http://localhost:1313/tools/sat-smt/opensmt/ + https://example.org/tools/sat-smt/opensmt/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/opensmt/ - <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="http://localhost:1313/tools/minisat">MiniSAT</a>.</p> + https://example.org/tools/sat-smt/opensmt/ + <p>OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of <a href="https://example.org/tools/minisat" >MiniSAT</a>.</p> ParaFROST - http://localhost:1313/tools/sat-smt/parafrost/ + https://example.org/tools/sat-smt/parafrost/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/parafrost/ - <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/parafrost/ + <p>ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> Q3B - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/q3b/ + https://example.org/tools/sat-smt/q3b/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span> <span style="display:none">]</span> </div> Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.</p> Riss - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/riss/ + https://example.org/tools/sat-smt/riss/ <p> <div style="display: flex; align-items: center; gap: 8px;"> <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span> <span style="display:none">[</span> <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2017</span> <span style="display:none">]</span> </div> Riss is a SAT solving tool collection.</p> SMT-RAT - http://localhost:1313/tools/sat-smt/smt-rat/ + https://example.org/tools/sat-smt/smt-rat/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smt-rat/ - <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25">C++ API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smt-rat/ + <p>SMT-RAT is an SMT Real Algebra Toolbox.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C++ API:</strong> <a href="https://ths-rwth.github.io/smtrat/dc/dad/md__builds_ths_smt_smtrat_doc_markdown_07_using_smtrat.html#autotoc_md25" target="_blank" >C++ API Reference</a></li> </ul> SMTInterpol - http://localhost:1313/tools/sat-smt/smtinterpol/ + https://example.org/tools/sat-smt/smtinterpol/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/smtinterpol/ - <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html">Java API Reference</a></li> </ul> + https://example.org/tools/sat-smt/smtinterpol/ + <p>SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>Java API:</strong> <a href="https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html" target="_blank" >Java API Reference</a></li> </ul> STP - http://localhost:1313/tools/sat-smt/stp/ + https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/stp/ - <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage">stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage">stp PyPI package</a></li> </ul> + https://example.org/tools/sat-smt/stp/ + <p>STP is a constraint solver for quantifier-free bitvectors.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://stp.readthedocs.io/en/latest/#c-library-usage" target="_blank" >stp C API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://stp.readthedocs.io/en/latest/#python-usage" target="_blank" >stp PyPI package</a></li> </ul> veriT - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/verit/ + https://example.org/tools/sat-smt/verit/ <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 verification, automated reasoning, and related research areas. veriT accepts input in SMT-LIB2 and DIMACS formats and provides a command-line interface for ease of integration into verification workflows. The solver is actively maintained and distributed under the BSD license, making it suitable for both academic and industrial applications.</p> Yices 2 - http://localhost:1313/tools/sat-smt/yices/ + https://example.org/tools/sat-smt/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/yices/ - <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html">Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/">yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2">yices2 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/yices/ + <p>Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories. It supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>General API:</strong> <a href="https://yices.csl.sri.com/doc/index.html" target="_blank" >Yices API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/yices/" target="_blank" >yices2 PyPI package</a></li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/yices2" target="_blank" >yices2 crate on crates.io</a></li> </ul> Z3 - http://localhost:1313/tools/sat-smt/z3/ + https://example.org/tools/sat-smt/z3/ Sat, 07 Jun 2025 00:00:00 +0000 - http://localhost:1313/tools/sat-smt/z3/ - <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html">Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html">Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html">Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html">Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/">z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html">Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3">z3 crate on crates.io</a></li> </ul> + https://example.org/tools/sat-smt/z3/ + <p>Z3 is a general-purpose theorem prover widely used for SAT &amp; SMT solving.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>This tool is available through the following interfaces:</p> <ul> <li><strong>C API:</strong> <a href="https://z3prover.github.io/api/html/group__capi.html" target="_blank" >Z3 C API Reference</a></li> <li><strong>C++ API:</strong> <a href="https://z3prover.github.io/api/html/namespacez3.html" target="_blank" >Z3 C++ Namespace Reference</a></li> <li><strong>.NET API:</strong> <a href="https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html" target="_blank" >Z3 .NET Namespace Reference</a></li> <li><strong>Java API:</strong> <a href="https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html" target="_blank" >Z3 Java API Reference</a></li> <li><strong>Python bindings:</strong> <a href="https://pypi.org/project/z3-solver/" target="_blank" >z3-solver PyPI package</a> (<a href="https://z3prover.github.io/api/html/z3.html" target="_blank" >Documentation</a>)</li> <li><strong>Rust bindings:</strong> <a href="https://crates.io/crates/z3" target="_blank" >z3 crate on crates.io</a></li> </ul> diff --git a/tools/sat-smt/lingeling/index.html b/tools/sat-smt/lingeling/index.html index 2582979..5d54af6 100644 --- a/tools/sat-smt/lingeling/index.html +++ b/tools/sat-smt/lingeling/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

    Formal Methods Tools

    @@ -60,7 +68,7 @@

    Lingeling

    - SMT Solver + SAT Solver @@ -276,7 +284,9 @@
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -293,6 +303,7 @@ diff --git a/tools/sat-smt/mathsat/index.html b/tools/sat-smt/mathsat/index.html index 6f07045..dccaa70 100644 --- a/tools/sat-smt/mathsat/index.html +++ b/tools/sat-smt/mathsat/index.html @@ -1,6 +1,6 @@ - + @@ -20,16 +20,16 @@ ]  MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get"> - + - + - - - - + + + + - + @@ -41,6 +41,14 @@ MiniSat is a minimalistic, open-source SAT solver, developed to help researchers + + + +

    Formal Methods Tools

    @@ -144,10 +152,10 @@ MiniSat is a minimalistic, open-source SAT solver, developed to help researchers - Fondazione Bruno Kessler + id="developers_disi-university-of-trento" + style="background:rgba(225,19,233,0.4)" + href="/developers/disi-university-of-trento"> + DISI-University of Trento @@ -161,10 +169,10 @@ MiniSat is a minimalistic, open-source SAT solver, developed to help researchers - DISI-University of Trento + id="developers_fondazione-bruno-kessler" + style="background:rgba(8,170,192,0.4)" + href="/developers/fondazione-bruno-kessler"> + Fondazione Bruno Kessler @@ -303,7 +311,9 @@ MiniSat is a minimalistic, open-source SAT solver, developed to help researchers
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -320,6 +330,7 @@ MiniSat is a minimalistic, open-source SAT solver, developed to help researchers diff --git a/tools/sat-smt/minisat/index.html b/tools/sat-smt/minisat/index.html index 0994631..6bb7133 100644 --- a/tools/sat-smt/minisat/index.html +++ b/tools/sat-smt/minisat/index.html @@ -1,6 +1,6 @@ - + @@ -24,16 +24,16 @@ ] MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers"> - + - + - - - - + + + + - + @@ -45,6 +45,14 @@ MiniSat is a minimalistic, open-source SAT solver, developed to help researchers + + + +

    Formal Methods Tools

    @@ -313,7 +321,9 @@ MiniSat is a minimalistic, open-source SAT solver, developed to help researchers
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -330,6 +340,7 @@ MiniSat is a minimalistic, open-source SAT solver, developed to help researchers diff --git a/tools/sat-smt/opensmt/index.html b/tools/sat-smt/opensmt/index.html index ffd27a3..af8c1ae 100644 --- a/tools/sat-smt/opensmt/index.html +++ b/tools/sat-smt/opensmt/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

    Formal Methods Tools

    @@ -296,7 +304,7 @@

    Description

    -

    OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of MiniSAT.

    +

    OpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making SMT-Solvers easy to understand and use as a computational engine for formal verification. OpenSMT is built on top of MiniSAT.

    @@ -306,7 +314,9 @@
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -323,6 +333,7 @@ diff --git a/tools/sat-smt/parafrost/index.html b/tools/sat-smt/parafrost/index.html index 98439b6..2a38c86 100644 --- a/tools/sat-smt/parafrost/index.html +++ b/tools/sat-smt/parafrost/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

    Formal Methods Tools

    @@ -138,10 +146,10 @@ - Eindhoven University of Technology + id="developers_albert-ludwigs-universit%C3%A4t" + style="background:rgba(15,60,110,0.4)" + href="/developers/albert-ludwigs-universit%C3%A4t"> + Albert-Ludwigs-Universität @@ -155,10 +163,10 @@ - Albert-Ludwigs-Universität + id="developers_eindhoven-university-of-technology" + style="background:rgba(171,15,81,0.4)" + href="/developers/eindhoven-university-of-technology"> + Eindhoven University of Technology @@ -362,12 +370,12 @@

    APIs and Bindings

    This tool is available through the following interfaces:

    @@ -395,6 +403,16 @@ + + + + + + + + + + @@ -433,32 +451,6 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - @@ -466,7 +458,9 @@
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -483,6 +477,7 @@ diff --git a/tools/sat-smt/q3b/index.html b/tools/sat-smt/q3b/index.html index 8f7491c..8939783 100644 --- a/tools/sat-smt/q3b/index.html +++ b/tools/sat-smt/q3b/index.html @@ -1,6 +1,6 @@ - + @@ -24,16 +24,16 @@ ] Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs."> - + - + - - - - + + + + - + @@ -45,6 +45,14 @@ Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs."> + + + +

    Formal Methods Tools

    @@ -384,22 +392,6 @@ Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.

    - - - - - - - - - - - - - - - - @@ -412,7 +404,9 @@ Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.

    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -429,6 +423,7 @@ Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.

    diff --git a/tools/sat-smt/riss/index.html b/tools/sat-smt/riss/index.html index e5ef9e9..4b33fbc 100644 --- a/tools/sat-smt/riss/index.html +++ b/tools/sat-smt/riss/index.html @@ -1,6 +1,6 @@ - + @@ -24,16 +24,16 @@ ] Riss is a SAT solving tool collection."> - + - + - - - - + + + + - + @@ -45,6 +45,14 @@ Riss is a SAT solving tool collection."> + + + +

    Formal Methods Tools

    @@ -294,7 +302,9 @@ Riss is a SAT solving tool collection.

    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -311,6 +321,7 @@ Riss is a SAT solving tool collection.

    diff --git a/tools/sat-smt/smt-rat/index.html b/tools/sat-smt/smt-rat/index.html index 9c00e8e..84e1ed8 100644 --- a/tools/sat-smt/smt-rat/index.html +++ b/tools/sat-smt/smt-rat/index.html @@ -1,6 +1,6 @@ - + @@ -19,16 +19,16 @@ This tool is available through the following interfaces: C++ API: C++ API Reference "> - + - + - - - - + + + + - + @@ -40,6 +40,14 @@ C++ API: C++ API Reference + + + +

    Formal Methods Tools

    @@ -112,10 +120,10 @@ C++ API: C++ API Reference - SMT Solver + id="applications_sat-solver" + style="background:rgba(197,220,18,0.4)" + href="/applications/sat-solver"> + SAT Solver @@ -129,10 +137,10 @@ C++ API: C++ API Reference - SAT Solver + id="applications_smt-solver" + style="background:rgba(190,107,118,0.4)" + href="/applications/smt-solver"> + SMT Solver @@ -231,10 +239,10 @@ C++ API: C++ API Reference - CLI + id="interfaces_c++" + style="background:rgba(246,248,124,0.4)" + href="/interfaces/c++"> + C++ @@ -248,10 +256,10 @@ C++ API: C++ API Reference - C++ + id="interfaces_cli" + style="background:rgba(145,175,87,0.4)" + href="/interfaces/cli"> + CLI @@ -339,7 +347,7 @@ C++ API: C++ API Reference

    APIs and Bindings

    This tool is available through the following interfaces:

    @@ -365,20 +373,6 @@ C++ API: C++ API Reference - - - - - - - - - - - - - - @@ -426,8 +420,6 @@ C++ API: C++ API Reference - - @@ -438,7 +430,9 @@ C++ API: C++ API Reference
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -455,6 +449,7 @@ C++ API: C++ API Reference diff --git a/tools/sat-smt/smtinterpol/index.html b/tools/sat-smt/smtinterpol/index.html index a73e20f..fb0dd8a 100644 --- a/tools/sat-smt/smtinterpol/index.html +++ b/tools/sat-smt/smtinterpol/index.html @@ -1,6 +1,6 @@ - + @@ -16,16 +16,16 @@ - + - + - - - - + + + + - + @@ -37,6 +37,14 @@ This tool is available through the following"> + + + +

    Formal Methods Tools

    @@ -319,7 +327,7 @@ This tool is available through the following">

    APIs and Bindings

    This tool is available through the following interfaces:

    @@ -349,16 +357,6 @@ This tool is available through the following"> - - - - - - - - - - @@ -399,12 +397,6 @@ This tool is available through the following"> - - - - - - @@ -417,7 +409,9 @@ This tool is available through the following">
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -434,6 +428,7 @@ This tool is available through the following"> diff --git a/tools/sat-smt/stp/index.html b/tools/sat-smt/stp/index.html index 3f089c9..21d4658 100644 --- a/tools/sat-smt/stp/index.html +++ b/tools/sat-smt/stp/index.html @@ -1,6 +1,6 @@ - + @@ -18,16 +18,16 @@ APIs and Bindings This tool is available through the following interfaces: C API: stp C API"> - + - + - - - - + + + + - + @@ -39,6 +39,14 @@ C API: stp C API"> + + + +

    Formal Methods Tools

    @@ -178,10 +186,10 @@ C API: stp C API"> - University of Illinois + id="developers_stanford-university" + style="background:rgba(38,159,198,0.4)" + href="/developers/stanford-university"> + Stanford University @@ -195,10 +203,10 @@ C API: stp C API"> - Stanford University + id="developers_university-of-illinois" + style="background:rgba(92,216,117,0.4)" + href="/developers/university-of-illinois"> + University of Illinois @@ -264,10 +272,10 @@ C API: stp C API"> - CLI + id="interfaces_c" + style="background:rgba(13,97,248,0.4)" + href="/interfaces/c"> + C @@ -281,10 +289,10 @@ C API: stp C API"> - C + id="interfaces_cli" + style="background:rgba(145,175,87,0.4)" + href="/interfaces/cli"> + CLI @@ -389,8 +397,8 @@ C API: stp C API">

    APIs and Bindings

    This tool is available through the following interfaces:

    @@ -421,21 +429,22 @@ C API: stp C API"> - - - - - - - - - - - - - - - +
  • + EXE: Automatically Generating Inputs of Death + + + (October 2006) + + + by Cadar, Cristian et. al. + | Appears in CCS 2006 + + + + | Published by ACM + | 10.1145/1455518.1455522 + +
    • @@ -464,23 +473,6 @@ C API: stp C API"> -
  • - EXE: Automatically Generating Inputs of Death - - - (October 2006) - - - by Cadar, Cristian et. al. - | Appears in CCS 2006 - - - - | Published by ACM - | 10.1145/1455518.1455522 - -
    • - @@ -506,7 +498,9 @@ C API: stp C API">
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -523,6 +517,7 @@ C API: stp C API"> diff --git a/tools/sat-smt/verit/index.html b/tools/sat-smt/verit/index.html index f04b3a9..8a19359 100644 --- a/tools/sat-smt/verit/index.html +++ b/tools/sat-smt/verit/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

    Formal Methods Tools

    @@ -191,10 +199,10 @@ - SMTLIB2 + id="inputs_dimacs" + style="background:rgba(190,57,177,0.4)" + href="/inputs/dimacs"> + DIMACS @@ -208,10 +216,10 @@ - DIMACS + id="inputs_smtlib2" + style="background:rgba(108,44,180,0.4)" + href="/inputs/smtlib2"> + SMTLIB2 @@ -363,20 +371,6 @@ - - - - - - - - - - - - - - @@ -417,8 +411,6 @@ - - @@ -426,7 +418,9 @@
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -443,6 +437,7 @@ diff --git a/tools/sat-smt/yices/index.html b/tools/sat-smt/yices/index.html index a487d14..18503c5 100644 --- a/tools/sat-smt/yices/index.html +++ b/tools/sat-smt/yices/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -35,6 +35,14 @@ + + + +

    Formal Methods Tools

    @@ -107,10 +115,10 @@ - SMT Solver + id="applications_sat-solver" + style="background:rgba(197,220,18,0.4)" + href="/applications/sat-solver"> + SAT Solver @@ -124,10 +132,10 @@ - SAT Solver + id="applications_smt-solver" + style="background:rgba(190,107,118,0.4)" + href="/applications/smt-solver"> + SMT Solver @@ -368,9 +376,9 @@

    APIs and Bindings

    This tool is available through the following interfaces:

    @@ -400,38 +408,6 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - @@ -457,6 +433,22 @@
    • + + + + + + + + + + + + + + + + @@ -469,7 +461,9 @@
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -486,6 +480,7 @@ diff --git a/tools/sat-smt/z3/index.html b/tools/sat-smt/z3/index.html index abeb762..7e215d8 100644 --- a/tools/sat-smt/z3/index.html +++ b/tools/sat-smt/z3/index.html @@ -1,6 +1,6 @@ - + @@ -18,16 +18,16 @@ APIs and Bindings This tool is available through the following interfaces: C API:"> - + - + - - - - + + + + - + @@ -39,6 +39,14 @@ C API:"> + + + +

    Formal Methods Tools

    @@ -111,6 +119,23 @@ C API:"> + + SAT Solver + + + + + + + + + + + - - - - - - - - - - SAT Solver - - - @@ -216,10 +224,10 @@ C API:"> - SMTLIB2 + id="inputs_dimacs" + style="background:rgba(190,57,177,0.4)" + href="/inputs/dimacs"> + DIMACS @@ -233,10 +241,10 @@ C API:"> - DIMACS + id="inputs_smtlib2" + style="background:rgba(108,44,180,0.4)" + href="/inputs/smtlib2"> + SMTLIB2 @@ -266,44 +274,10 @@ C API:"> - CLI - - - - - - - - - - - - - Python - - - - - - - - - - - - - Rust + id="interfaces_.net" + style="background:rgba(48,60,176,0.4)" + href="/interfaces/.net"> + .NET @@ -349,6 +323,23 @@ C API:"> + + CLI + + + + + + + + + + + - .NET + id="interfaces_online" + style="background:rgba(84,246,100,0.4)" + href="/interfaces/online"> + Online @@ -385,10 +376,27 @@ C API:"> - Online + id="interfaces_python" + style="background:rgba(167,245,243,0.4)" + href="/interfaces/python"> + Python + + + + + + + + + + + + + Rust @@ -476,12 +484,12 @@ C API:">

    APIs and Bindings

    This tool is available through the following interfaces:

    @@ -511,44 +519,6 @@ C API:"> - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - @@ -573,6 +543,28 @@ C API:"> + + + + + + + + + + + + + + + + + + + + + + @@ -580,7 +572,9 @@ C API:">
    Help improve this page!
    - Submit an issue or pull request. + Submit an + issue or + pull request.
    @@ -597,6 +591,7 @@ C API:"> diff --git a/tools/termination/index.html b/tools/termination/index.html index 37df75c..7c5343e 100644 --- a/tools/termination/index.html +++ b/tools/termination/index.html @@ -1,31 +1,31 @@ - + -All Termination Tools | Formal Methods Tools +Termination Tools | Formal Methods Tools - + - + - + - - - - + + + + - + @@ -37,6 +37,14 @@ Click a colorful"> + + + +

    Formal Methods Tools

    @@ -65,7 +73,7 @@ Click a colorful"> -

    All Termination Tools

    +

    Termination Tools

    This page lists all of the termination tools on this site in alphabetical order. Click a tool name in the first column to view tool details. Click a colorful item in the second column to view all the tools for which that term applies. @@ -87,7 +95,8 @@ Colors are generated by hashing each term’s name and converting it to RGB Tool Applications - License + Licenses + @@ -97,16 +106,18 @@ Colors are generated by hashing each term’s name and converting it to RGB -

    - - Black dot indicates tool has not been maintained recently +
    + + Red dot indicates tool has not been updated or maintained recently
    + diff --git a/tools/termination/index.xml b/tools/termination/index.xml index b41735c..f1fc399 100644 --- a/tools/termination/index.xml +++ b/tools/termination/index.xml @@ -1,12 +1,12 @@ - All Termination Tools on Formal Methods Tools - http://localhost:1313/tools/termination/ - Recent content in All Termination Tools on Formal Methods Tools + Termination Tools on Formal Methods Tools + https://example.org/tools/termination/ + Recent content in Termination Tools on Formal Methods Tools Hugo en-us - +