From e78785aa2566702fd0c21b8c79b186f2034b225c Mon Sep 17 00:00:00 2001 From: Landon Taylor Date: Tue, 10 Jun 2025 14:13:27 -0600 Subject: [PATCH] rebuild --- 404.html | 16 +- about/index.html | 16 +- applications/constraint-solver/index.html | 104 ++ applications/constraint-solver/index.xml | 19 + applications/index.html | 52 +- applications/index.xml | 28 +- applications/sat-solver/index.html | 138 ++ applications/sat-solver/index.xml | 47 + applications/smt-solver/index.html | 58 +- applications/smt-solver/index.xml | 50 +- applications/theorem-prover/index.html | 28 +- applications/theorem-prover/index.xml | 21 +- contribute/index.html | 16 +- css/styles.css.map | 4 +- ...2529437838673a136797a6a8aaab7759f94ded.css | 560 +++++++ .../albert-ludwigs-universität/index.html | 103 ++ .../albert-ludwigs-universität/index.xml | 19 + .../disi-university-of-trento/index.html | 103 ++ .../disi-university-of-trento/index.xml | 19 + .../index.html | 103 ++ .../index.xml | 19 + .../fondazione-bruno-kessler/index.html | 103 ++ developers/fondazione-bruno-kessler/index.xml | 19 + developers/gilles-audemard/index.html | 104 ++ developers/gilles-audemard/index.xml | 19 + developers/index.html | 96 +- developers/index.xml | 70 +- .../index.html | 103 ++ .../index.xml | 19 + developers/laurent-simon/index.html | 104 ++ developers/laurent-simon/index.xml | 19 + developers/loria/index.html | 18 +- developers/loria/index.xml | 8 +- developers/masaryk-university/index.html | 103 ++ developers/masaryk-university/index.xml | 19 + developers/microsoft-research/index.html | 19 +- developers/microsoft-research/index.xml | 14 +- developers/niklas-eén/index.html | 103 ++ developers/niklas-eén/index.xml | 19 + developers/niklas-sörensson/index.html | 103 ++ developers/niklas-sörensson/index.xml | 19 + developers/norbert-manthey/index.html | 104 ++ developers/norbert-manthey/index.xml | 19 + developers/rwth-aachen/index.html | 104 ++ developers/rwth-aachen/index.xml | 19 + developers/sri-international/index.html | 18 +- developers/sri-international/index.xml | 10 +- developers/stanford-university/index.html | 104 ++ developers/stanford-university/index.xml | 19 + developers/uliege/index.html | 18 +- developers/uliege/index.xml | 8 +- developers/university-of-freiburg/index.html | 112 ++ developers/university-of-freiburg/index.xml | 26 + developers/university-of-illinois/index.html | 104 ++ developers/university-of-illinois/index.xml | 19 + developers/university-of-lugano/index.html | 103 ++ developers/university-of-lugano/index.xml | 19 + domains/index.html | 16 +- domains/index.xml | 4 +- index.html | 159 +- index.xml | 115 +- inputs/cnf/index.html | 104 ++ inputs/cnf/index.xml | 19 + inputs/dimacs/index.html | 21 +- inputs/dimacs/index.xml | 16 +- inputs/index.html | 16 +- inputs/index.xml | 16 +- inputs/smtlib2/index.html | 50 +- inputs/smtlib2/index.xml | 43 +- inputs/yices-2/index.html | 18 +- inputs/yices-2/index.xml | 10 +- interfaces/.net/index.html | 19 +- interfaces/.net/index.xml | 14 +- interfaces/c++/index.html | 28 +- interfaces/c++/index.xml | 21 +- interfaces/c/index.html | 28 +- interfaces/c/index.xml | 21 +- interfaces/cli/index.html | 58 +- interfaces/cli/index.xml | 50 +- interfaces/index.html | 124 +- interfaces/index.xml | 76 +- interfaces/java/index.html | 28 +- interfaces/java/index.xml | 21 +- interfaces/online/index.html | 19 +- interfaces/online/index.xml | 14 +- interfaces/python/index.html | 30 +- interfaces/python/index.xml | 25 +- interfaces/rust/index.html | 21 +- interfaces/rust/index.xml | 18 +- license/index.html | 16 +- licenses/all-rights-reserved/index.html | 103 ++ licenses/all-rights-reserved/index.xml | 19 + licenses/bsd/index.html | 18 +- licenses/bsd/index.xml | 8 +- licenses/gpl3/index.html | 95 ++ licenses/gpl3/index.xml | 11 + licenses/gplv3/index.html | 35 +- licenses/gplv3/index.xml | 24 +- licenses/index.html | 34 +- licenses/index.xml | 25 +- licenses/lgplv2/index.html | 104 ++ licenses/lgplv2/index.xml | 19 + licenses/mit/index.html | 37 +- licenses/mit/index.xml | 28 +- maintenance/actively-maintained/index.html | 50 +- maintenance/actively-maintained/index.xml | 43 +- maintenance/archived/index.html | 104 ++ maintenance/archived/index.xml | 19 + maintenance/deprecated/index.html | 104 ++ maintenance/deprecated/index.xml | 19 + maintenance/inactive/index.html | 104 ++ maintenance/inactive/index.xml | 19 + maintenance/index.html | 34 +- maintenance/index.xml | 15 +- maintenance/no-longer-maintained/index.html | 104 ++ maintenance/no-longer-maintained/index.xml | 19 + maintenance/not-active/index.html | 104 ++ maintenance/not-active/index.xml | 19 + maintenance/not-maintained/index.html | 103 ++ maintenance/not-maintained/index.xml | 19 + privacy/index.html | 16 +- sitemap.xml | 129 +- taxonomies/index.html | 186 ++- taxonomies/index.xml | 4 +- techniques/cdcl/index.html | 103 ++ techniques/cdcl/index.xml | 19 + techniques/gpu/index.html | 103 ++ techniques/gpu/index.xml | 19 + techniques/index.html | 16 +- techniques/index.xml | 4 +- tools/glucose/index.html | 347 ++++ tools/index.html | 1430 ++++++++++++++++- tools/index.xml | 99 +- tools/lingeling-copy/index.html | 300 ++++ tools/lingeling/index.html | 300 ++++ tools/mathsat-copy/index.html | 327 ++++ tools/mathsat/index.html | 327 ++++ tools/minisat-copy/index.html | 337 ++++ tools/minisat/index.html | 337 ++++ tools/opensmt-copy/index.html | 330 ++++ tools/opensmt/index.html | 330 ++++ tools/parafrost/index.html | 472 ++++++ tools/q3b/index.html | 418 +++++ tools/riss-copy/index.html | 318 ++++ tools/riss/index.html | 318 ++++ tools/smt-rat-copy/index.html | 439 +++++ tools/smt-rat/index.html | 444 +++++ tools/smtinerpol/index.html | 439 +++++ tools/smtinterpol-copy/index.html | 413 +++++ tools/smtinterpol/index.html | 423 +++++ tools/stp-copy/index.html | 486 ++++++ tools/stp/index.html | 512 ++++++ tools/verit-copy/index.html | 406 +++++ tools/verit/index.html | 64 +- tools/yices/index.html | 81 +- tools/z3-copy/index.html | 584 +++++++ tools/z3/index.html | 92 +- 157 files changed, 16291 insertions(+), 768 deletions(-) create mode 100644 applications/constraint-solver/index.html create mode 100644 applications/constraint-solver/index.xml create mode 100644 applications/sat-solver/index.html create mode 100644 applications/sat-solver/index.xml create mode 100644 css/styles.e5b470edf89c3e1b9498ce83a3fd0a2e73e9d06958e2c3a1af8d89781f9f2bf612b21d5e45ab8f4aef773661de2529437838673a136797a6a8aaab7759f94ded.css create mode 100644 developers/albert-ludwigs-universität/index.html create mode 100644 developers/albert-ludwigs-universität/index.xml create mode 100644 developers/disi-university-of-trento/index.html create mode 100644 developers/disi-university-of-trento/index.xml create mode 100644 developers/eindhoven-university-of-technology/index.html create mode 100644 developers/eindhoven-university-of-technology/index.xml create mode 100644 developers/fondazione-bruno-kessler/index.html create mode 100644 developers/fondazione-bruno-kessler/index.xml create mode 100644 developers/gilles-audemard/index.html create mode 100644 developers/gilles-audemard/index.xml create mode 100644 developers/johannes-kepler-universität-linz/index.html create mode 100644 developers/johannes-kepler-universität-linz/index.xml create mode 100644 developers/laurent-simon/index.html create mode 100644 developers/laurent-simon/index.xml create mode 100644 developers/masaryk-university/index.html create mode 100644 developers/masaryk-university/index.xml create mode 100644 developers/niklas-eén/index.html create mode 100644 developers/niklas-eén/index.xml create mode 100644 developers/niklas-sörensson/index.html create mode 100644 developers/niklas-sörensson/index.xml create mode 100644 developers/norbert-manthey/index.html create mode 100644 developers/norbert-manthey/index.xml create mode 100644 developers/rwth-aachen/index.html create mode 100644 developers/rwth-aachen/index.xml create mode 100644 developers/stanford-university/index.html create mode 100644 developers/stanford-university/index.xml create mode 100644 developers/university-of-freiburg/index.html create mode 100644 developers/university-of-freiburg/index.xml create mode 100644 developers/university-of-illinois/index.html create mode 100644 developers/university-of-illinois/index.xml create mode 100644 developers/university-of-lugano/index.html create mode 100644 developers/university-of-lugano/index.xml create mode 100644 inputs/cnf/index.html create mode 100644 inputs/cnf/index.xml create mode 100644 licenses/all-rights-reserved/index.html create mode 100644 licenses/all-rights-reserved/index.xml create mode 100644 licenses/gpl3/index.html create mode 100644 licenses/gpl3/index.xml create mode 100644 licenses/lgplv2/index.html create mode 100644 licenses/lgplv2/index.xml create mode 100644 maintenance/archived/index.html create mode 100644 maintenance/archived/index.xml create mode 100644 maintenance/deprecated/index.html create mode 100644 maintenance/deprecated/index.xml create mode 100644 maintenance/inactive/index.html create mode 100644 maintenance/inactive/index.xml create mode 100644 maintenance/no-longer-maintained/index.html create mode 100644 maintenance/no-longer-maintained/index.xml create mode 100644 maintenance/not-active/index.html create mode 100644 maintenance/not-active/index.xml create mode 100644 maintenance/not-maintained/index.html create mode 100644 maintenance/not-maintained/index.xml create mode 100644 techniques/cdcl/index.html create mode 100644 techniques/cdcl/index.xml create mode 100644 techniques/gpu/index.html create mode 100644 techniques/gpu/index.xml create mode 100644 tools/glucose/index.html create mode 100644 tools/lingeling-copy/index.html create mode 100644 tools/lingeling/index.html create mode 100644 tools/mathsat-copy/index.html create mode 100644 tools/mathsat/index.html create mode 100644 tools/minisat-copy/index.html create mode 100644 tools/minisat/index.html create mode 100644 tools/opensmt-copy/index.html create mode 100644 tools/opensmt/index.html create mode 100644 tools/parafrost/index.html create mode 100644 tools/q3b/index.html create mode 100644 tools/riss-copy/index.html create mode 100644 tools/riss/index.html create mode 100644 tools/smt-rat-copy/index.html create mode 100644 tools/smt-rat/index.html create mode 100644 tools/smtinerpol/index.html create mode 100644 tools/smtinterpol-copy/index.html create mode 100644 tools/smtinterpol/index.html create mode 100644 tools/stp-copy/index.html create mode 100644 tools/stp/index.html create mode 100644 tools/verit-copy/index.html create mode 100644 tools/z3-copy/index.html diff --git a/404.html b/404.html index 105eeb4..539cb1d 100644 --- a/404.html +++ b/404.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + diff --git a/about/index.html b/about/index.html index 0cf4fb4..43d0164 100644 --- a/about/index.html +++ b/about/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + diff --git a/applications/constraint-solver/index.html b/applications/constraint-solver/index.html new file mode 100644 index 0000000..7f448f0 --- /dev/null +++ b/applications/constraint-solver/index.html @@ -0,0 +1,104 @@ + + + + + + + + +Constraint Solver | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Constraint Solver + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
STPSTP is a constraint solver for quantifier-free bitvectors. +APIs and Bindings This tool is available …
+ +
+ + + diff --git a/applications/constraint-solver/index.xml b/applications/constraint-solver/index.xml new file mode 100644 index 0000000..cad232f --- /dev/null +++ b/applications/constraint-solver/index.xml @@ -0,0 +1,19 @@ + + + + Constraint Solver on Formal Methods Tools + http://localhost:1313/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/stp/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + diff --git a/applications/index.html b/applications/index.html index 6c9dcf2..4edaff0 100644 --- a/applications/index.html +++ b/applications/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -70,6 +70,42 @@ + + Constraint Solver + + + + + + + + + + + + + + SAT Solver + + + + + + + + + + + + Applications on Formal Methods Tools - https://example.org/applications/ + http://localhost:1313/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/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/applications/constraint-solver/ + + + + SAT Solver + http://localhost:1313/applications/sat-solver/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/applications/sat-solver/ + + SMT Solver - https://example.org/applications/smt-solver/ + http://localhost:1313/applications/smt-solver/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/applications/smt-solver/ + http://localhost:1313/applications/smt-solver/ Theorem Prover - https://example.org/applications/theorem-prover/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/applications/theorem-prover/ + http://localhost:1313/applications/theorem-prover/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/applications/theorem-prover/ diff --git a/applications/sat-solver/index.html b/applications/sat-solver/index.html new file mode 100644 index 0000000..62321d5 --- /dev/null +++ b/applications/sat-solver/index.html @@ -0,0 +1,138 @@ + + + + + + + + +SAT Solver | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + SAT Solver + +

+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
ToolDescription
ParaFROSTParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA …
Riss [ Not Maintained Since 2017 ] Riss is a SAT solving tool collection. +
SMT-RATSMT-RAT is an SMT Real Algebra Toolbox. +APIs and Bindings This tool is available through the …
Yices 2Yices is an SMT solver developed by SRI International. It is widely used for checking the …
Z3Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This …
+ +
+ + + diff --git a/applications/sat-solver/index.xml b/applications/sat-solver/index.xml new file mode 100644 index 0000000..287caf1 --- /dev/null +++ b/applications/sat-solver/index.xml @@ -0,0 +1,47 @@ + + + + SAT Solver on Formal Methods Tools + http://localhost:1313/applications/sat-solver/ + Recent content in SAT Solver on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + ParaFROST + http://localhost:1313/tools/parafrost/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + Riss + http://localhost:1313/tools/riss/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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/smt-rat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + Yices 2 + http://localhost:1313/tools/yices/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + Z3 + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + diff --git a/applications/smt-solver/index.html b/applications/smt-solver/index.html index b817193..3369ae3 100644 --- a/applications/smt-solver/index.html +++ b/applications/smt-solver/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -81,9 +81,44 @@ + + Q3B + [ Not Maintained Since 2023 ] Q3B is an SMT solver for the quantified bit-vector formulas which … + + + + + + + SMT-RAT + SMT-RAT is an SMT Real Algebra Toolbox. +APIs and Bindings This tool is available through the … + + + + + + + SMTInterpol + SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories. +APIs and … + + + + + + + STP + STP is a constraint solver for quantifier-free bitvectors. +APIs and Bindings This tool is available … + + + + + veriT -

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 …

+ veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is … @@ -91,7 +126,7 @@ Yices 2 -

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 …

+ Yices is an SMT solver developed by SRI International. It is widely used for checking the … @@ -99,7 +134,8 @@ Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/applications/smt-solver/index.xml b/applications/smt-solver/index.xml index 53d6bef..9120700 100644 --- a/applications/smt-solver/index.xml +++ b/applications/smt-solver/index.xml @@ -2,32 +2,60 @@ SMT Solver on Formal Methods Tools - https://example.org/applications/smt-solver/ + http://localhost:1313/applications/smt-solver/ Recent content in SMT Solver on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + + + Q3B + http://localhost:1313/tools/q3b/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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/smt-rat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + SMTInterpol + http://localhost:1313/tools/smtinterpol/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + STP + http://localhost:1313/tools/stp/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + veriT - https://example.org/tools/verit/ + http://localhost:1313/tools/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/verit/ + http://localhost:1313/tools/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 - https://example.org/tools/yices/ + http://localhost:1313/tools/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/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>Yices is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/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> Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/applications/theorem-prover/index.html b/applications/theorem-prover/index.html index c4283d6..5342884 100644 --- a/applications/theorem-prover/index.html +++ b/applications/theorem-prover/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -81,9 +81,19 @@ + + STP + STP is a constraint solver for quantifier-free bitvectors. +APIs and Bindings This tool is available … + + + + + Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/applications/theorem-prover/index.xml b/applications/theorem-prover/index.xml index 04f8214..4a3e2e6 100644 --- a/applications/theorem-prover/index.xml +++ b/applications/theorem-prover/index.xml @@ -2,18 +2,25 @@ Theorem Prover on Formal Methods Tools - https://example.org/applications/theorem-prover/ + http://localhost:1313/applications/theorem-prover/ Recent content in Theorem Prover on Formal Methods Tools Hugo en-us - Fri, 02 Feb 2024 04:14:54 -0800 - + Sat, 07 Jun 2025 00:00:00 +0000 + + + STP + http://localhost:1313/tools/stp/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/contribute/index.html b/contribute/index.html index 2444a16..f09d505 100644 --- a/contribute/index.html +++ b/contribute/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + diff --git a/css/styles.css.map b/css/styles.css.map index c71da0c..49fa1a2 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-subtle;\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\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", "\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,EDxIC,OAAO;ECyIb,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;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" } \ No newline at end of file diff --git a/css/styles.e5b470edf89c3e1b9498ce83a3fd0a2e73e9d06958e2c3a1af8d89781f9f2bf612b21d5e45ab8f4aef773661de2529437838673a136797a6a8aaab7759f94ded.css b/css/styles.e5b470edf89c3e1b9498ce83a3fd0a2e73e9d06958e2c3a1af8d89781f9f2bf612b21d5e45ab8f4aef773661de2529437838673a136797a6a8aaab7759f94ded.css new file mode 100644 index 0000000..6b60268 --- /dev/null +++ b/css/styles.e5b470edf89c3e1b9498ce83a3fd0a2e73e9d06958e2c3a1af8d89781f9f2bf612b21d5e45ab8f4aef773661de2529437838673a136797a6a8aaab7759f94ded.css @@ -0,0 +1,560 @@ +@font-face { + font-family: 'Source Sans 3'; + font-style: normal; + font-display: swap; + font-weight: 100; + src: local("Source Sans 3 ExtraLight"), local("SourceSans3-ExtraLight"), url("/fonts/static/SourceSans3-ExtraLight.woff2") format("woff2"), url("/fonts/static/SourceSans3-ExtraLight.ttf") format("truetype"); +} + +@font-face { + font-family: 'Source Sans 3'; + font-style: normal; + font-display: swap; + font-weight: 200; + src: local("Source Sans 3 ExtraLight"), local("SourceSans3-ExtraLight"), url("/fonts/static/SourceSans3-ExtraLight.woff2") format("woff2"), url("/fonts/static/SourceSans3-ExtraLight.ttf") format("truetype"); +} + +@font-face { + font-family: 'Source Sans 3'; + font-style: normal; + font-display: swap; + font-weight: 300; + src: local("Source Sans 3 Light"), local("SourceSans3-Light"), url("/fonts/static/SourceSans3-Light.woff2") format("woff2"), url("/fonts/static/SourceSans3-Light.ttf") format("truetype"); +} + +@font-face { + font-family: 'Source Sans 3'; + font-style: normal; + font-display: swap; + font-weight: 400; + src: local("Source Sans 3 Regular"), local("SourceSans3-Regular"), url("/fonts/static/SourceSans3-Regular.woff2") format("woff2"), url("/fonts/static/SourceSans3-Regular.ttf") format("truetype"); +} + +@font-face { + font-family: 'Source Sans 3'; + font-style: italic; + font-display: swap; + font-weight: 400; + src: local("Source Sans 3 Italic"), local("SourceSans3-Italic"), url("/fonts/static/SourceSans3-Italic.woff2") format("woff2"), url("/fonts/static/SourceSans3-Italic.ttf") format("truetype"); +} + +@font-face { + font-family: 'Source Sans 3'; + font-style: normal; + font-display: swap; + font-weight: 500; + src: local("Source Sans 3 Medium"), local("SourceSans3-Medium"), url("/fonts/static/SourceSans3-Medium.woff2") format("woff2"), url("/fonts/static/SourceSans3-Medium.ttf") format("truetype"); +} + +@font-face { + font-family: 'Source Sans 3'; + font-style: normal; + font-display: swap; + font-weight: 600; + src: local("Source Sans 3 SemiBold"), local("SourceSans3-SemiBold"), url("/fonts/static/SourceSans3-SemiBold.woff2") format("woff2"), url("/fonts/static/SourceSans3-SemiBold.ttf") format("truetype"); +} + +@font-face { + font-family: 'Source Sans 3'; + font-style: normal; + font-display: swap; + font-weight: 700; + src: local("Source Sans 3 Bold"), local("SourceSans3-Bold"), url("/fonts/static/SourceSans3-Bold.woff2") format("woff2"), url("/fonts/static/SourceSans3-Bold.ttf") format("truetype"); +} + +@font-face { + font-family: 'Source Sans 3'; + font-style: italic; + font-display: swap; + font-weight: 700; + src: local("Source Sans 3 Bold Italic"), local("SourceSans3-BoldItalic"), url("/fonts/static/SourceSans3-BoldItalic.woff2") format("woff2"), url("/fonts/static/SourceSans3-BoldItalic.ttf") format("truetype"); +} + +@font-face { + font-family: 'Source Sans 3'; + font-style: normal; + font-display: swap; + font-weight: 800; + src: local("Source Sans 3 ExtraBold"), local("SourceSans3-ExtraBold"), url("/fonts/static/SourceSans3-ExtraBold.woff2") format("woff2"), url("/fonts/static/SourceSans3-ExtraBold.ttf") format("truetype"); +} + +@font-face { + font-family: 'Source Sans 3'; + font-style: normal; + font-display: swap; + font-weight: 900; + src: local("Source Sans 3 Black"), local("SourceSans3-Black"), url("/fonts/static/SourceSans3-Black.woff2") format("woff2"), url("/fonts/static/SourceSans3-Black.ttf") format("truetype"); +} + +@font-face { + font-family: 'Source Code Pro'; + font-style: normal; + font-display: swap; + font-weight: 600; + src: local("Source Code Pro Medium"), local("SourceCodePro-Medium"), url("/fonts/static/SourceCodePro-Medium.woff2") format("woff2"), url("/fonts/static/SourceCodePro-Medium.ttf") format("truetype"); +} + +@font-face { + font-family: 'Source Code Pro'; + font-style: italic; + font-display: swap; + font-weight: 600; + src: local("Source Code Pro Medium Italic"), local("SourceCodePro-MediumItalic"), url("/fonts/static/SourceCodePro-MediumItalic.woff2") format("woff2"), url("/fonts/static/SourceCodePro-MediumItalic.ttf") format("truetype"); +} + +* { + font-family: 'Source Sans 3', sans-serif; +} + +code { + font-family: 'Source Code Pro', monospace; +} + +/* _layout.sass */ +/* Variables */ +html { + background: #0a0c11; +} + +/* Base Layout */ +body { + background: #10131a; + color: #ffffff; + font-family: 'Segoe UI', 'Helvetica Neue', Arial, sans-serif; + width: 100%; + height: 100%; + max-width: 1024px; + margin: 1.5rem auto; + padding: 1.5rem; + box-sizing: border-box; + border-radius: 8px; +} + +header { + background: #1a1e29; + margin: 1.5rem; + padding: 1.5rem; + display: flex; + flex-wrap: wrap; + align-items: center; + justify-content: space-between; + border-radius: 8px; + margin: 0 auto; +} + +header h1, header h1 a { + margin: 0; + font-size: 1.6rem; + font-weight: 900; + color: #ffffff; + text-decoration: none; + padding: 0; + transition: color 0.4s ease-in-out; +} + +header h1:hover, header h1:focus, header h1 a:hover, header h1 a:focus { + color: #6fffd2; +} + +nav { + display: flex; + gap: 1.5rem; + align-items: center; +} + +nav ul { + list-style: none; + margin: 0; + padding: 0; + display: flex; + gap: 0.5rem; + flex-wrap: wrap; +} + +nav ul li { + margin: 0; + padding: 0; +} + +nav ul li a { + padding: 0.4rem 0.6rem; + border-radius: 8px; + background: #1a3e70; + color: #ffffff; + text-decoration: none; + font-weight: 500; + transition: background 0.4s ease-in-out; +} + +nav ul li a:hover, nav ul li a:focus { + background: #00897b; + color: #ffffff; +} + +@media (max-width: 600px) { + header { + flex-direction: column; + align-items: flex-start; + gap: 1.5rem; + } + nav { + width: 100%; + justify-content: flex-start; + margin-top: 1.5rem; + } +} + +main { + margin: 1.5rem 0; + padding: 1.5rem; +} + +footer { + background: #1a1e29; + margin: 1.5rem; + padding: 1.5rem; + border-radius: 8px; + margin: 0 auto; + text-align: center; +} + +footer p { + margin: 0; + font-size: 0.9rem; + color: #bfc9e6; + text-align: center; +} + +section { + border-bottom: 3px solid #1a1e29; + margin: 2rem 0; + padding-bottom: 2rem; +} + +#page-header { + border-bottom: 3px solid #1a1e29; + margin: 2rem 0; + padding-bottom: 2rem; + text-align: center; +} + +#page-header h1 { + margin: 0; + width: 100%; + font-size: 3rem; + word-break: break-word; +} + +#page-header .subtitle { + margin: 0; + width: 100%; + font-size: 1.2rem; + font-weight: 300; + color: #bfc9e6; +} + +.time { + font-size: 0.8rem; + color: #bfc9e6; + text-align: center; +} + +article { + background: #1a1e29; + border-radius: 8px; + padding: 1.5rem; + margin: 1.5rem 0; + position: relative; + transition: background 0.5s ease-in-out; +} + +article:hover, article:focus { + background: #1a3e70; +} + +article h3 { + margin: 0; + font-size: 1.5rem; + font-weight: 700; + color: #ffffff; +} + +article a { + color: #ffffff; + position: absolute; + top: 0; + left: 0; + width: 100%; + height: 100%; + z-index: 1; + text-indent: -9999px; + overflow: hidden; + text-decoration: none; + transition: color 0.3s ease-in-out; +} + +article a:hover, article a:focus { + color: #6fffd2; +} + +article:not(a) { + position: relative; + z-index: 2; +} + +article p { + margin: 0.5rem 0; + font-size: 1rem; + color: #ffffff; + font-weight: 300; +} + +article .subtitle { + margin: 0 0 0 0.5rem; + width: 100%; + font-size: 1.1rem; + font-weight: 300; + color: #bfc9e6; +} + +.term-title { + font-weight: 700; + padding: 0.3rem 0.8rem; + margin-bottom: 0.5rem; + border-radius: 8px; +} + +p code { + background: #102747; + margin: 0 0.2rem; + padding: 0.2rem 0.4rem; + border-radius: 5px; + font-size: 0.8rem; +} + +pre { + padding: 0.5rem; + border-radius: 5px; + overflow-x: auto; +} + +pre code { + font-size: 0.8rem; +} + +table#taxonomy-table { + width: 100%; + border-collapse: collapse; + box-sizing: border-box; + background: #1a1e29; + text-align: left; +} + +table#taxonomy-table tr { + border-bottom: 3px solid #10131a; +} + +table#taxonomy-table tr:nth-child(even) { + background: #161923; + transition: background 0.4s ease-in-out; +} + +table#taxonomy-table tr:nth-child(odd) { + background: #202532; + transition: background 0.4s ease-in-out; +} + +table#taxonomy-table tr:hover, table#taxonomy-table tr:focus { + background: #3a4054; +} + +table#taxonomy-table thead { + text-align: left; + border: none; + border-radius: 8px 8px 0 0; +} + +table#taxonomy-table th { + color: #ffffff; + background: #0a0c11 !important; + padding: 0.6rem 0.6rem; + text-align: left; + font-weight: 600; + border: none; +} + +table#taxonomy-table td { + padding: 0.3rem 0.6rem; + text-align: left; + font-weight: 600; + border: none; +} + +table#taxonomy-table td.description { + font-weight: 300; + color: #bfc9e6; +} + +table#taxonomy-table td.tool { + min-width: 100px; +} + +table#taxonomy-table a.term-link { + padding: 0.2rem 0.6rem; + margin: 0.2rem; + display: inline-block; + border-radius: 8px; + text-decoration: none; + font-weight: 500; + color: #ffffff; + transition: color 0.4s ease-in-out, background 0.4s ease-in-out; +} + +table#taxonomy-table a.term-link:hover, table#taxonomy-table a.term-link:focus { + color: #0a0c11 !important; + background: #bfc9e6 !important; +} + +table#taxonomy-table a.taxonomy-name { + padding: 0; + margin: 0.2rem; + display: inline-block; + border-radius: 8px; + text-decoration: none; + font-weight: 500; + color: #ffffff; + transition: color 0.4s ease-in-out; +} + +table#taxonomy-table a.taxonomy-name:hover, table#taxonomy-table a.taxonomy-name:focus { + color: #6fffd2; +} + +table#taxonomy-table a { + color: #ffffff; + text-decoration: none; +} + +table#taxonomy-table a:hover, table#taxonomy-table a:focus { + color: #1de9b6; +} + +#taxonomy-page a.term-link { + padding: 0.3rem 1.2rem; + margin: 0.2rem; + display: inline-block; + border-radius: 8px; + text-decoration: none; + font-weight: 500; + font-size: 1.2rem; + color: #ffffff; + transition: color 0.4s ease-in-out, background 0.4s ease-in-out; +} + +#taxonomy-page a.term-link:hover, #taxonomy-page a.term-link:focus { + color: #0a0c11 !important; + background: #bfc9e6 !important; +} + +/* _text.sass */ +a { + color: #6fffd2; + text-decoration: underline; + transition: color 0.3s ease-in-out; +} + +a:hover, a:focus { + color: #3380ff; +} + +#quick-links { + text-align: left; +} + +#link-list { + display: flex; + gap: 1.5rem; + align-items: center; + flex-wrap: wrap; + margin: 2rem 0 1.5rem 0; + justify-content: center; +} + +#link-list h2 { + flex: none; +} + +#link-list ul { + list-style: none; + margin: 0; + padding: 0; + display: flex; + gap: 1rem; + flex-wrap: wrap; +} + +#link-list ul li { + margin: 0; + padding: 0; +} + +#link-list ul li a { + padding: 0.3rem 0.6rem; + border-radius: 8px; + background: #8fc6ff; + color: #0a0c11; + text-decoration: none; + font-weight: 500; + transition: background 0.3s ease-in-out; +} + +#link-list ul li a:hover, #link-list ul li a:focus { + background: #6fffd2; +} + +a.button { + padding: 0.3rem 0.6rem; + margin: 0 0.2rem; + border-radius: 8px; + background: #8fc6ff; + color: #0a0c11; + text-decoration: none; + font-weight: 500; + transition: background 0.3s ease-in-out; +} + +a.button:hover, a.button:focus { + background: #6fffd2; +} + +#publications { + font-weight: 300; +} + +#publications ul { + list-style: none; + margin: 0; + padding: 0; + display: flex; + flex-direction: column; + gap: 1em; +} + +#publications ul li { + background: #1a1e29; + border-radius: 8px; + padding: 1em 1.5em; +} + +#publications a { + color: #8fc6ff; + text-decoration: none; + font-weight: 100; + transition: color 0.3s ease-in-out; +} + +#publications a:hover, #publications a:focus { + color: #6fffd2; +} + +/*# sourceMappingURL=styles.css.map */ \ No newline at end of file diff --git a/developers/albert-ludwigs-universität/index.html b/developers/albert-ludwigs-universität/index.html new file mode 100644 index 0000000..1d8a877 --- /dev/null +++ b/developers/albert-ludwigs-universität/index.html @@ -0,0 +1,103 @@ + + + + + + + + +Albert-Ludwigs-Universität | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Albert-Ludwigs-Universität + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
ParaFROSTParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA …
+ +
+ + + diff --git a/developers/albert-ludwigs-universität/index.xml b/developers/albert-ludwigs-universität/index.xml new file mode 100644 index 0000000..72b2c24 --- /dev/null +++ b/developers/albert-ludwigs-universität/index.xml @@ -0,0 +1,19 @@ + + + + Albert-Ludwigs-Universität on Formal Methods Tools + http://localhost:1313/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/z3-copy/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/z3-copy/ + <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> + + + diff --git a/developers/disi-university-of-trento/index.html b/developers/disi-university-of-trento/index.html new file mode 100644 index 0000000..796b30d --- /dev/null +++ b/developers/disi-university-of-trento/index.html @@ -0,0 +1,103 @@ + + + + + + + + +DISI-University of Trento | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + DISI-University of Trento + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
MathSAT [ Not Maintained Since 2013 ] MiniSat is a minimalistic, open-source SAT solver, developed to help …
+ +
+ + + diff --git a/developers/disi-university-of-trento/index.xml b/developers/disi-university-of-trento/index.xml new file mode 100644 index 0000000..c03218f --- /dev/null +++ b/developers/disi-university-of-trento/index.xml @@ -0,0 +1,19 @@ + + + + DISI-University of Trento on Formal Methods Tools + http://localhost:1313/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/mathsat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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(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/eindhoven-university-of-technology/index.html b/developers/eindhoven-university-of-technology/index.html new file mode 100644 index 0000000..64b6749 --- /dev/null +++ b/developers/eindhoven-university-of-technology/index.html @@ -0,0 +1,103 @@ + + + + + + + + +Eindhoven University of Technology | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Eindhoven University of Technology + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
ParaFROSTParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA …
+ +
+ + + diff --git a/developers/eindhoven-university-of-technology/index.xml b/developers/eindhoven-university-of-technology/index.xml new file mode 100644 index 0000000..f32cff0 --- /dev/null +++ b/developers/eindhoven-university-of-technology/index.xml @@ -0,0 +1,19 @@ + + + + Eindhoven University of Technology on Formal Methods Tools + http://localhost:1313/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/z3-copy/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/z3-copy/ + <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> + + + diff --git a/developers/fondazione-bruno-kessler/index.html b/developers/fondazione-bruno-kessler/index.html new file mode 100644 index 0000000..95fcda9 --- /dev/null +++ b/developers/fondazione-bruno-kessler/index.html @@ -0,0 +1,103 @@ + + + + + + + + +Fondazione Bruno Kessler | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Fondazione Bruno Kessler + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
MathSAT [ Not Maintained Since 2013 ] MiniSat is a minimalistic, open-source SAT solver, developed to help …
+ +
+ + + diff --git a/developers/fondazione-bruno-kessler/index.xml b/developers/fondazione-bruno-kessler/index.xml new file mode 100644 index 0000000..380a77a --- /dev/null +++ b/developers/fondazione-bruno-kessler/index.xml @@ -0,0 +1,19 @@ + + + + Fondazione Bruno Kessler on Formal Methods Tools + http://localhost:1313/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/mathsat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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(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/gilles-audemard/index.html b/developers/gilles-audemard/index.html new file mode 100644 index 0000000..8db7642 --- /dev/null +++ b/developers/gilles-audemard/index.html @@ -0,0 +1,104 @@ + + + + + + + + +Gilles Audemard | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Gilles Audemard + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
GlucoseGlucose is a SAT solver. +
+ +
+ + + diff --git a/developers/gilles-audemard/index.xml b/developers/gilles-audemard/index.xml new file mode 100644 index 0000000..ade75d9 --- /dev/null +++ b/developers/gilles-audemard/index.xml @@ -0,0 +1,19 @@ + + + + Gilles Audemard on Formal Methods Tools + http://localhost:1313/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/glucose/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/glucose/ + <p>Glucose is a SAT solver.</p> + + + diff --git a/developers/index.html b/developers/index.html index 15ab2df..ec33a28 100644 --- a/developers/index.html +++ b/developers/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -88,6 +88,42 @@ + + Microsoft Research + + + + + + + + + + + + + + RWTH Aachen + + + + + + + + + + + + + Stanford University + + + + + + + + + + + + - Microsoft Research + id="developers_university-of-freiburg" + style="background:rgba(134,74,190,0.4)" + href="/developers/university-of-freiburg"> + University of Freiburg + + + + + + + + + + + + + + University of Illinois diff --git a/developers/index.xml b/developers/index.xml index d30fd95..1cc2a9a 100644 --- a/developers/index.xml +++ b/developers/index.xml @@ -2,38 +2,66 @@ Developers on Formal Methods Tools - https://example.org/developers/ + http://localhost:1313/developers/ Recent content in Developers on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + LORIA - https://example.org/developers/loria/ + http://localhost:1313/developers/loria/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/developers/loria/ - - - - SRI International - https://example.org/developers/sri-international/ - Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/developers/sri-international/ - - - - ULiege - https://example.org/developers/uliege/ - Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/developers/uliege/ + http://localhost:1313/developers/loria/ Microsoft Research - https://example.org/developers/microsoft-research/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/developers/microsoft-research/ + http://localhost:1313/developers/microsoft-research/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/developers/microsoft-research/ + + + + RWTH Aachen + http://localhost:1313/developers/rwth-aachen/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/developers/rwth-aachen/ + + + + SRI International + http://localhost:1313/developers/sri-international/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/developers/sri-international/ + + + + Stanford University + http://localhost:1313/developers/stanford-university/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/developers/stanford-university/ + + + + ULiege + http://localhost:1313/developers/uliege/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/developers/uliege/ + + + + University of Freiburg + http://localhost:1313/developers/university-of-freiburg/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/developers/university-of-freiburg/ + + + + University of Illinois + http://localhost:1313/developers/university-of-illinois/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/developers/university-of-illinois/ diff --git a/developers/johannes-kepler-universität-linz/index.html b/developers/johannes-kepler-universität-linz/index.html new file mode 100644 index 0000000..c1b4baf --- /dev/null +++ b/developers/johannes-kepler-universität-linz/index.html @@ -0,0 +1,103 @@ + + + + + + + + +Johannes Kepler Universität Linz | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Johannes Kepler Universität Linz + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
MathSAT [ Closed-Source Tool ]  MiniSat is a minimalistic, open-source SAT solver, developed to help …
+ +
+ + + diff --git a/developers/johannes-kepler-universität-linz/index.xml b/developers/johannes-kepler-universität-linz/index.xml new file mode 100644 index 0000000..5416b5b --- /dev/null +++ b/developers/johannes-kepler-universität-linz/index.xml @@ -0,0 +1,19 @@ + + + + Johannes Kepler Universität Linz on Formal Methods Tools + http://localhost:1313/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 + + + MathSAT + http://localhost:1313/tools/mathsat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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/laurent-simon/index.html b/developers/laurent-simon/index.html new file mode 100644 index 0000000..3a4b58e --- /dev/null +++ b/developers/laurent-simon/index.html @@ -0,0 +1,104 @@ + + + + + + + + +Laurent Simon | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Laurent Simon + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
GlucoseGlucose is a SAT solver. +
+ +
+ + + diff --git a/developers/laurent-simon/index.xml b/developers/laurent-simon/index.xml new file mode 100644 index 0000000..b5ca25d --- /dev/null +++ b/developers/laurent-simon/index.xml @@ -0,0 +1,19 @@ + + + + Laurent Simon on Formal Methods Tools + http://localhost:1313/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/glucose/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/glucose/ + <p>Glucose is a SAT solver.</p> + + + diff --git a/developers/loria/index.html b/developers/loria/index.html index fc0b23a..89ae1e1 100644 --- a/developers/loria/index.html +++ b/developers/loria/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -83,7 +83,7 @@ veriT -

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 …

+ veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is … diff --git a/developers/loria/index.xml b/developers/loria/index.xml index b2abb5f..db30ec1 100644 --- a/developers/loria/index.xml +++ b/developers/loria/index.xml @@ -2,17 +2,17 @@ LORIA on Formal Methods Tools - https://example.org/developers/loria/ + http://localhost:1313/developers/loria/ Recent content in LORIA on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + veriT - https://example.org/tools/verit/ + http://localhost:1313/tools/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/verit/ + http://localhost:1313/tools/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 new file mode 100644 index 0000000..6f6d65a --- /dev/null +++ b/developers/masaryk-university/index.html @@ -0,0 +1,103 @@ + + + + + + + + +Masaryk University | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Masaryk University + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
Q3B [ Not Maintained Since 2023 ] Q3B is an SMT solver for the quantified bit-vector formulas which …
+ +
+ + + diff --git a/developers/masaryk-university/index.xml b/developers/masaryk-university/index.xml new file mode 100644 index 0000000..35706b2 --- /dev/null +++ b/developers/masaryk-university/index.xml @@ -0,0 +1,19 @@ + + + + Masaryk University on Formal Methods Tools + http://localhost:1313/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/q3b/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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 0f75521..c51079c 100644 --- a/developers/microsoft-research/index.html +++ b/developers/microsoft-research/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -83,7 +83,8 @@ Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/developers/microsoft-research/index.xml b/developers/microsoft-research/index.xml index 5b3e7c6..b4e9b8b 100644 --- a/developers/microsoft-research/index.xml +++ b/developers/microsoft-research/index.xml @@ -2,18 +2,18 @@ Microsoft Research on Formal Methods Tools - https://example.org/developers/microsoft-research/ + http://localhost:1313/developers/microsoft-research/ Recent content in Microsoft Research on Formal Methods Tools Hugo en-us - Fri, 02 Feb 2024 04:14:54 -0800 - + Sat, 07 Jun 2025 00:00:00 +0000 + Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/developers/niklas-eén/index.html b/developers/niklas-eén/index.html new file mode 100644 index 0000000..e07af04 --- /dev/null +++ b/developers/niklas-eén/index.html @@ -0,0 +1,103 @@ + + + + + + + + +Niklas Eén | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Niklas Eén + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
MiniSatMiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers …
+ +
+ + + diff --git a/developers/niklas-eén/index.xml b/developers/niklas-eén/index.xml new file mode 100644 index 0000000..233b6a1 --- /dev/null +++ b/developers/niklas-eén/index.xml @@ -0,0 +1,19 @@ + + + + Niklas Eén on Formal Methods Tools + http://localhost:1313/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/minisat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/minisat/ + <p>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 new file mode 100644 index 0000000..69c2d13 --- /dev/null +++ b/developers/niklas-sörensson/index.html @@ -0,0 +1,103 @@ + + + + + + + + +Niklas Sörensson | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Niklas Sörensson + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
MiniSatMiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers …
+ +
+ + + diff --git a/developers/niklas-sörensson/index.xml b/developers/niklas-sörensson/index.xml new file mode 100644 index 0000000..9d0236b --- /dev/null +++ b/developers/niklas-sörensson/index.xml @@ -0,0 +1,19 @@ + + + + Niklas Sörensson on Formal Methods Tools + http://localhost:1313/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/minisat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/minisat/ + <p>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 new file mode 100644 index 0000000..5002c3b --- /dev/null +++ b/developers/norbert-manthey/index.html @@ -0,0 +1,104 @@ + + + + + + + + +Norbert Manthey | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Norbert Manthey + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
Riss [ Not Maintained Since 2017 ] Riss is a SAT solving tool collection. +
+ +
+ + + diff --git a/developers/norbert-manthey/index.xml b/developers/norbert-manthey/index.xml new file mode 100644 index 0000000..9c8d757 --- /dev/null +++ b/developers/norbert-manthey/index.xml @@ -0,0 +1,19 @@ + + + + Norbert Manthey on Formal Methods Tools + http://localhost:1313/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/riss/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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/rwth-aachen/index.html b/developers/rwth-aachen/index.html new file mode 100644 index 0000000..0e72f51 --- /dev/null +++ b/developers/rwth-aachen/index.html @@ -0,0 +1,104 @@ + + + + + + + + +RWTH Aachen | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + RWTH Aachen + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
SMT-RATSMT-RAT is an SMT Real Algebra Toolbox. +APIs and Bindings This tool is available through the …
+ +
+ + + diff --git a/developers/rwth-aachen/index.xml b/developers/rwth-aachen/index.xml new file mode 100644 index 0000000..dfcadf0 --- /dev/null +++ b/developers/rwth-aachen/index.xml @@ -0,0 +1,19 @@ + + + + RWTH Aachen on Formal Methods Tools + http://localhost:1313/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/smt-rat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + diff --git a/developers/sri-international/index.html b/developers/sri-international/index.html index fcbf245..df4ad49 100644 --- a/developers/sri-international/index.html +++ b/developers/sri-international/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -83,7 +83,7 @@ Yices 2 -

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 …

+ Yices is an SMT solver developed by SRI International. It is widely used for checking the … diff --git a/developers/sri-international/index.xml b/developers/sri-international/index.xml index a47e9c1..9d32cec 100644 --- a/developers/sri-international/index.xml +++ b/developers/sri-international/index.xml @@ -2,18 +2,18 @@ SRI International on Formal Methods Tools - https://example.org/developers/sri-international/ + http://localhost:1313/developers/sri-international/ Recent content in SRI International on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Yices 2 - https://example.org/tools/yices/ + http://localhost:1313/tools/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/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>Yices is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/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> diff --git a/developers/stanford-university/index.html b/developers/stanford-university/index.html new file mode 100644 index 0000000..7cdb8b2 --- /dev/null +++ b/developers/stanford-university/index.html @@ -0,0 +1,104 @@ + + + + + + + + +Stanford University | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Stanford University + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
STPSTP is a constraint solver for quantifier-free bitvectors. +APIs and Bindings This tool is available …
+ +
+ + + diff --git a/developers/stanford-university/index.xml b/developers/stanford-university/index.xml new file mode 100644 index 0000000..b9e5149 --- /dev/null +++ b/developers/stanford-university/index.xml @@ -0,0 +1,19 @@ + + + + Stanford University on Formal Methods Tools + http://localhost:1313/developers/stanford-university/ + Recent content in Stanford University on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + STP + http://localhost:1313/tools/stp/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + diff --git a/developers/uliege/index.html b/developers/uliege/index.html index 94a97e5..822aa83 100644 --- a/developers/uliege/index.html +++ b/developers/uliege/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -83,7 +83,7 @@ veriT -

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 …

+ veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is … diff --git a/developers/uliege/index.xml b/developers/uliege/index.xml index 8e9d060..9660980 100644 --- a/developers/uliege/index.xml +++ b/developers/uliege/index.xml @@ -2,17 +2,17 @@ ULiege on Formal Methods Tools - https://example.org/developers/uliege/ + http://localhost:1313/developers/uliege/ Recent content in ULiege on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + veriT - https://example.org/tools/verit/ + http://localhost:1313/tools/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/verit/ + http://localhost:1313/tools/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 new file mode 100644 index 0000000..9d92152 --- /dev/null +++ b/developers/university-of-freiburg/index.html @@ -0,0 +1,112 @@ + + + + + + + + +University of Freiburg | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + University of Freiburg + +

+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +
ToolDescription
Riss Not Maintained Since {map[year:2017] /home/landon/gitea/fmtools/content/tools/riss.md <nil> …
SMTInterpolSMTInterpol is an SMT Solver that can compute Craig interpolants for various theories. +APIs and …
+ +
+ + + diff --git a/developers/university-of-freiburg/index.xml b/developers/university-of-freiburg/index.xml new file mode 100644 index 0000000..309612c --- /dev/null +++ b/developers/university-of-freiburg/index.xml @@ -0,0 +1,26 @@ + + + + University of Freiburg on Formal Methods Tools + http://localhost:1313/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 + + + Riss + http://localhost:1313/tools/riss/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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(226, 59, 59);"></span> <span style="color: rgb(226, 59, 59); font-size: 1rem;">Not Maintained Since {map[year:2017] /home/landon/gitea/fmtools/content/tools/riss.md &lt;nil&gt; inactive true 0 {{} {{} 0} {{} {0 0}}} {{} {{} 0} {{} {0 0}}} 615 { 0 0 0} &lt;nil&gt;}</span> </div> Riss is a SAT solving tool collection that was updated until 2017.</p> + + + SMTInterpol + http://localhost:1313/tools/smtinterpol/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + diff --git a/developers/university-of-illinois/index.html b/developers/university-of-illinois/index.html new file mode 100644 index 0000000..ac2f82c --- /dev/null +++ b/developers/university-of-illinois/index.html @@ -0,0 +1,104 @@ + + + + + + + + +University of Illinois | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + University of Illinois + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
STPSTP is a constraint solver for quantifier-free bitvectors. +APIs and Bindings This tool is available …
+ +
+ + + diff --git a/developers/university-of-illinois/index.xml b/developers/university-of-illinois/index.xml new file mode 100644 index 0000000..6e5b0b0 --- /dev/null +++ b/developers/university-of-illinois/index.xml @@ -0,0 +1,19 @@ + + + + University of Illinois on Formal Methods Tools + http://localhost:1313/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/stp/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + diff --git a/developers/university-of-lugano/index.html b/developers/university-of-lugano/index.html new file mode 100644 index 0000000..c64615e --- /dev/null +++ b/developers/university-of-lugano/index.html @@ -0,0 +1,103 @@ + + + + + + + + +University of Lugano | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + University of Lugano + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
OpenSMTOpenSMT is a compact and open-source SMT-solver written in C++, with the main goal of making …
+ +
+ + + diff --git a/developers/university-of-lugano/index.xml b/developers/university-of-lugano/index.xml new file mode 100644 index 0000000..4a5b7a9 --- /dev/null +++ b/developers/university-of-lugano/index.xml @@ -0,0 +1,19 @@ + + + + University of Lugano on Formal Methods Tools + http://localhost:1313/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/opensmt/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + diff --git a/domains/index.html b/domains/index.html index 6f44046..aaaa8b1 100644 --- a/domains/index.html +++ b/domains/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + diff --git a/domains/index.xml b/domains/index.xml index b960c67..b61f720 100644 --- a/domains/index.xml +++ b/domains/index.xml @@ -2,10 +2,10 @@ Domains on Formal Methods Tools - https://example.org/domains/ + http://localhost:1313/domains/ Recent content in Domains on Formal Methods Tools Hugo en-us - + diff --git a/index.html b/index.html index 0bc6392..7bfa8ee 100644 --- a/index.html +++ b/index.html @@ -1,7 +1,7 @@ - + @@ -15,16 +15,16 @@ - + - + - - - - + + + + - + @@ -94,14 +94,14 @@ Contribute

- Z3 + SMTInterpol - Theorem Prover + Interpolating SMT Solver

-

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. -Z3 …

- Z3 +

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

+ SMTInterpol
@@ -111,10 +111,91 @@ Z3 …

SMT Solver -

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 …

+

Yices is an SMT solver developed by SRI International. It is widely used for checking the satisfiability of logical formulas …

Yices 2
+
+

+ 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 +
+ +
+

+ 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 +
+ +
+

+ Riss + + SAT Tool Collection + +

+

[ Not Maintained Since 2017 ] Riss is a SAT solving tool collection. +

+ Riss +
+ +
+

+ 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 +
+ +
+

+ Lingeling + + SMT Solver + +

+

Lingeling is a SAT solver. +

+ Lingeling +
+

veriT @@ -122,10 +203,58 @@ Z3 …

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 verification, automated reasoning, and related research areas. veriT accepts input in SMT-LIB2 and DIMACS formats and …

+

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
+
+

+ SMT-RAT + + SMT Toolbox + +

+

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

+ SMT-RAT +
+ +
+

+ MathSAT + + SMT Solver + +

+

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

+ MathSAT +
+ +
+

+ STP + + Simple Theorem Prover + +

+

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

+ STP +
+ +
+

+ Glucose + + SAT Solver + +

+

Glucose is a SAT solver. +

+ Glucose +
+ diff --git a/index.xml b/index.xml index f4c3ca5..ccf093e 100644 --- a/index.xml +++ b/index.xml @@ -2,59 +2,136 @@ The Ultimate Formal Methods Toolbox on Formal Methods Tools - https://example.org/ + http://localhost:1313/ Recent content in The Ultimate Formal Methods Toolbox on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + + + Glucose + http://localhost:1313/tools/glucose/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/glucose/ + <p>Glucose is a SAT solver.</p> + + + Lingeling + http://localhost:1313/tools/lingeling/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/lingeling/ + <p>Lingeling is a SAT solver.</p> + + + MathSAT + http://localhost:1313/tools/mathsat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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/minisat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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/opensmt/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + ParaFROST + http://localhost:1313/tools/parafrost/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + Q3B + http://localhost:1313/tools/q3b/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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/riss/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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/smt-rat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + SMTInterpol + http://localhost:1313/tools/smtinterpol/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + STP + http://localhost:1313/tools/stp/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + veriT - https://example.org/tools/verit/ + http://localhost:1313/tools/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/verit/ + http://localhost:1313/tools/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 - https://example.org/tools/yices/ + http://localhost:1313/tools/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/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>Yices is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/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> Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> About - https://example.org/about/ + http://localhost:1313/about/ Mon, 01 Jan 0001 00:00:00 +0000 - https://example.org/about/ + http://localhost:1313/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 - https://example.org/contribute/ + http://localhost:1313/contribute/ Mon, 01 Jan 0001 00:00:00 +0000 - https://example.org/contribute/ + 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> MIT License - https://example.org/license/ + http://localhost:1313/license/ Mon, 01 Jan 0001 00:00:00 +0000 - https://example.org/license/ + http://localhost:1313/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 - https://example.org/privacy/ + http://localhost:1313/privacy/ Mon, 01 Jan 0001 00:00:00 +0000 - https://example.org/privacy/ + http://localhost:1313/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</p> <p>If you choose to contribute content (such as submitting an article or comment), any information you voluntarily provide will 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. Any information you voluntarily provide as part of a code contribution becomes public information and may be used by the general public as allowed by respective laws and policies.</p> diff --git a/inputs/cnf/index.html b/inputs/cnf/index.html new file mode 100644 index 0000000..24e6049 --- /dev/null +++ b/inputs/cnf/index.html @@ -0,0 +1,104 @@ + + + + + + + + +CNF | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + CNF + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
GlucoseGlucose is a SAT solver. +
+ +
+ + + diff --git a/inputs/cnf/index.xml b/inputs/cnf/index.xml new file mode 100644 index 0000000..fc87635 --- /dev/null +++ b/inputs/cnf/index.xml @@ -0,0 +1,19 @@ + + + + CNF on Formal Methods Tools + http://localhost:1313/inputs/cnf/ + Recent content in CNF on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + Glucose + http://localhost:1313/tools/glucose/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/glucose/ + <p>Glucose is a SAT solver.</p> + + + diff --git a/inputs/dimacs/index.html b/inputs/dimacs/index.html index f46571a..7b367ef 100644 --- a/inputs/dimacs/index.html +++ b/inputs/dimacs/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -83,7 +83,7 @@ veriT -

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 …

+ veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is … @@ -91,7 +91,8 @@ Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/inputs/dimacs/index.xml b/inputs/dimacs/index.xml index 2df32c0..8fc7f84 100644 --- a/inputs/dimacs/index.xml +++ b/inputs/dimacs/index.xml @@ -2,25 +2,25 @@ DIMACS on Formal Methods Tools - https://example.org/inputs/dimacs/ + http://localhost:1313/inputs/dimacs/ Recent content in DIMACS on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + veriT - https://example.org/tools/verit/ + http://localhost:1313/tools/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/verit/ + http://localhost:1313/tools/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 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/inputs/index.html b/inputs/index.html index 4fa623c..1e30ce3 100644 --- a/inputs/index.html +++ b/inputs/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + diff --git a/inputs/index.xml b/inputs/index.xml index bd2bbce..94f041c 100644 --- a/inputs/index.xml +++ b/inputs/index.xml @@ -2,31 +2,31 @@ Inputs on Formal Methods Tools - https://example.org/inputs/ + http://localhost:1313/inputs/ Recent content in Inputs on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + DIMACS - https://example.org/inputs/dimacs/ + http://localhost:1313/inputs/dimacs/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/inputs/dimacs/ + http://localhost:1313/inputs/dimacs/ SMTLIB2 - https://example.org/inputs/smtlib2/ + http://localhost:1313/inputs/smtlib2/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/inputs/smtlib2/ + http://localhost:1313/inputs/smtlib2/ Yices 2 - https://example.org/inputs/yices-2/ + http://localhost:1313/inputs/yices-2/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/inputs/yices-2/ + http://localhost:1313/inputs/yices-2/ diff --git a/inputs/smtlib2/index.html b/inputs/smtlib2/index.html index 3e7c0d0..7761ccc 100644 --- a/inputs/smtlib2/index.html +++ b/inputs/smtlib2/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -81,9 +81,36 @@ + + SMT-RAT + SMT-RAT is an SMT Real Algebra Toolbox. +APIs and Bindings This tool is available through the … + + + + + + + SMTInterpol + SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories. +APIs and … + + + + + + + STP + STP is a constraint solver for quantifier-free bitvectors. +APIs and Bindings This tool is available … + + + + + veriT -

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 …

+ veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is … @@ -91,7 +118,7 @@ Yices 2 -

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 …

+ Yices is an SMT solver developed by SRI International. It is widely used for checking the … @@ -99,7 +126,8 @@ Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/inputs/smtlib2/index.xml b/inputs/smtlib2/index.xml index 39beae1..3e19112 100644 --- a/inputs/smtlib2/index.xml +++ b/inputs/smtlib2/index.xml @@ -2,32 +2,53 @@ SMTLIB2 on Formal Methods Tools - https://example.org/inputs/smtlib2/ + http://localhost:1313/inputs/smtlib2/ Recent content in SMTLIB2 on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + + + SMT-RAT + http://localhost:1313/tools/smt-rat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + SMTInterpol + http://localhost:1313/tools/smtinterpol/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + STP + http://localhost:1313/tools/stp/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + veriT - https://example.org/tools/verit/ + http://localhost:1313/tools/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/verit/ + http://localhost:1313/tools/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 - https://example.org/tools/yices/ + http://localhost:1313/tools/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/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>Yices is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/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> Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/inputs/yices-2/index.html b/inputs/yices-2/index.html index 56d5f8b..1f45235 100644 --- a/inputs/yices-2/index.html +++ b/inputs/yices-2/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -83,7 +83,7 @@ Yices 2 -

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 …

+ Yices is an SMT solver developed by SRI International. It is widely used for checking the … diff --git a/inputs/yices-2/index.xml b/inputs/yices-2/index.xml index db0f0e4..86c15a3 100644 --- a/inputs/yices-2/index.xml +++ b/inputs/yices-2/index.xml @@ -2,18 +2,18 @@ Yices 2 on Formal Methods Tools - https://example.org/inputs/yices-2/ + http://localhost:1313/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 - https://example.org/tools/yices/ + http://localhost:1313/tools/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/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>Yices is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/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> diff --git a/interfaces/.net/index.html b/interfaces/.net/index.html index a62eb2e..ec56323 100644 --- a/interfaces/.net/index.html +++ b/interfaces/.net/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -83,7 +83,8 @@ Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/interfaces/.net/index.xml b/interfaces/.net/index.xml index ee25e15..040e11d 100644 --- a/interfaces/.net/index.xml +++ b/interfaces/.net/index.xml @@ -2,18 +2,18 @@ .NET on Formal Methods Tools - https://example.org/interfaces/.net/ + http://localhost:1313/interfaces/.net/ Recent content in .NET on Formal Methods Tools Hugo en-us - Fri, 02 Feb 2024 04:14:54 -0800 - + Sat, 07 Jun 2025 00:00:00 +0000 + Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/interfaces/c++/index.html b/interfaces/c++/index.html index 67cc1d4..b7126e4 100644 --- a/interfaces/c++/index.html +++ b/interfaces/c++/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -81,9 +81,19 @@ + + SMT-RAT + SMT-RAT is an SMT Real Algebra Toolbox. +APIs and Bindings This tool is available through the … + + + + + Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/interfaces/c++/index.xml b/interfaces/c++/index.xml index 7f6f9cd..03c18b2 100644 --- a/interfaces/c++/index.xml +++ b/interfaces/c++/index.xml @@ -2,18 +2,25 @@ C++ on Formal Methods Tools - https://example.org/interfaces/c++/ + http://localhost:1313/interfaces/c++/ Recent content in C++ on Formal Methods Tools Hugo en-us - Fri, 02 Feb 2024 04:14:54 -0800 - + Sat, 07 Jun 2025 00:00:00 +0000 + + + SMT-RAT + http://localhost:1313/tools/smt-rat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/interfaces/c/index.html b/interfaces/c/index.html index 19404f0..0dc0b4c 100644 --- a/interfaces/c/index.html +++ b/interfaces/c/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -81,9 +81,19 @@ + + STP + STP is a constraint solver for quantifier-free bitvectors. +APIs and Bindings This tool is available … + + + + + Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/interfaces/c/index.xml b/interfaces/c/index.xml index 57551c1..4f72437 100644 --- a/interfaces/c/index.xml +++ b/interfaces/c/index.xml @@ -2,18 +2,25 @@ C on Formal Methods Tools - https://example.org/interfaces/c/ + http://localhost:1313/interfaces/c/ Recent content in C on Formal Methods Tools Hugo en-us - Fri, 02 Feb 2024 04:14:54 -0800 - + Sat, 07 Jun 2025 00:00:00 +0000 + + + STP + http://localhost:1313/tools/stp/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/interfaces/cli/index.html b/interfaces/cli/index.html index f1f00dd..c528384 100644 --- a/interfaces/cli/index.html +++ b/interfaces/cli/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -81,9 +81,44 @@ + + Riss + Not Maintained Since {map[year:2017] /home/landon/gitea/fmtools/content/tools/riss.md <nil> … + + + + + + + SMT-RAT + SMT-RAT is an SMT Real Algebra Toolbox. +APIs and Bindings This tool is available through the … + + + + + + + SMTInterpol + SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories. +APIs and … + + + + + + + STP + STP is a constraint solver for quantifier-free bitvectors. +APIs and Bindings This tool is available … + + + + + veriT -

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 …

+ veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is … @@ -91,7 +126,7 @@ Yices 2 -

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 …

+ Yices is an SMT solver developed by SRI International. It is widely used for checking the … @@ -99,7 +134,8 @@ Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/interfaces/cli/index.xml b/interfaces/cli/index.xml index 13e829f..0d13662 100644 --- a/interfaces/cli/index.xml +++ b/interfaces/cli/index.xml @@ -2,32 +2,60 @@ CLI on Formal Methods Tools - https://example.org/interfaces/cli/ + http://localhost:1313/interfaces/cli/ Recent content in CLI on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + + + Riss + http://localhost:1313/tools/riss/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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(226, 59, 59);"></span> <span style="color: rgb(226, 59, 59); font-size: 1rem;">Not Maintained Since {map[year:2017] /home/landon/gitea/fmtools/content/tools/riss.md &lt;nil&gt; inactive true 0 {{} {{} 0} {{} {0 0}}} {{} {{} 0} {{} {0 0}}} 615 { 0 0 0} &lt;nil&gt;}</span> </div> Riss is a SAT solving tool collection that was updated until 2017.</p> + + + SMT-RAT + http://localhost:1313/tools/smt-rat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + SMTInterpol + http://localhost:1313/tools/smtinterpol/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + STP + http://localhost:1313/tools/stp/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + veriT - https://example.org/tools/verit/ + http://localhost:1313/tools/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/verit/ + http://localhost:1313/tools/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 - https://example.org/tools/yices/ + http://localhost:1313/tools/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/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>Yices is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/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> Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/interfaces/index.html b/interfaces/index.html index 141a9b8..abf249a 100644 --- a/interfaces/index.html +++ b/interfaces/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -70,60 +70,6 @@ - - CLI - - - - - - - - - - - - - - Python - - - - - - - - - - - - - - Rust - - - - - - - - - - - - + CLI + + + + + + + + + + + + + + + + + + + + + + + Python + + + + + + + + + + + + + + Rust + + + diff --git a/interfaces/index.xml b/interfaces/index.xml index af6c0f6..43838fd 100644 --- a/interfaces/index.xml +++ b/interfaces/index.xml @@ -2,66 +2,66 @@ Interfaces on Formal Methods Tools - https://example.org/interfaces/ + http://localhost:1313/interfaces/ Recent content in Interfaces on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - - - CLI - https://example.org/interfaces/cli/ - Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/interfaces/cli/ - - - - Python - https://example.org/interfaces/python/ - Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/interfaces/python/ - - - - Rust - https://example.org/interfaces/rust/ - Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/interfaces/rust/ - - + .NET - https://example.org/interfaces/.net/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/interfaces/.net/ + http://localhost:1313/interfaces/.net/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/interfaces/.net/ C - https://example.org/interfaces/c/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/interfaces/c/ + http://localhost:1313/interfaces/c/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/interfaces/c/ C++ - https://example.org/interfaces/c++/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/interfaces/c++/ + http://localhost:1313/interfaces/c++/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/interfaces/c++/ + + + + CLI + http://localhost:1313/interfaces/cli/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/interfaces/cli/ Java - https://example.org/interfaces/java/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/interfaces/java/ + http://localhost:1313/interfaces/java/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/interfaces/java/ Online - https://example.org/interfaces/online/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/interfaces/online/ + http://localhost:1313/interfaces/online/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/interfaces/online/ + + + + Python + http://localhost:1313/interfaces/python/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/interfaces/python/ + + + + Rust + http://localhost:1313/interfaces/rust/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/interfaces/rust/ diff --git a/interfaces/java/index.html b/interfaces/java/index.html index f6411eb..3b0f8d4 100644 --- a/interfaces/java/index.html +++ b/interfaces/java/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -81,9 +81,19 @@ + + SMTInterpol + SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories. +APIs and … + + + + + Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/interfaces/java/index.xml b/interfaces/java/index.xml index 03095f8..4de8a79 100644 --- a/interfaces/java/index.xml +++ b/interfaces/java/index.xml @@ -2,18 +2,25 @@ Java on Formal Methods Tools - https://example.org/interfaces/java/ + http://localhost:1313/interfaces/java/ Recent content in Java on Formal Methods Tools Hugo en-us - Fri, 02 Feb 2024 04:14:54 -0800 - + Sat, 07 Jun 2025 00:00:00 +0000 + + + SMTInterpol + http://localhost:1313/tools/smtinterpol/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/interfaces/online/index.html b/interfaces/online/index.html index e377498..643ce0d 100644 --- a/interfaces/online/index.html +++ b/interfaces/online/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -83,7 +83,8 @@ Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/interfaces/online/index.xml b/interfaces/online/index.xml index a18cbd4..f16678f 100644 --- a/interfaces/online/index.xml +++ b/interfaces/online/index.xml @@ -2,18 +2,18 @@ Online on Formal Methods Tools - https://example.org/interfaces/online/ + http://localhost:1313/interfaces/online/ Recent content in Online on Formal Methods Tools Hugo en-us - Fri, 02 Feb 2024 04:14:54 -0800 - + Sat, 07 Jun 2025 00:00:00 +0000 + Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/interfaces/python/index.html b/interfaces/python/index.html index 6be7c53..d941d29 100644 --- a/interfaces/python/index.html +++ b/interfaces/python/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -81,9 +81,18 @@ + + STP + STP is a constraint solver for quantifier-free bitvectors. +APIs and Bindings This tool is available … + + + + + Yices 2 -

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 …

+ Yices is an SMT solver developed by SRI International. It is widely used for checking the … @@ -91,7 +100,8 @@ Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/interfaces/python/index.xml b/interfaces/python/index.xml index 897b0b6..e4afa05 100644 --- a/interfaces/python/index.xml +++ b/interfaces/python/index.xml @@ -2,25 +2,32 @@ Python on Formal Methods Tools - https://example.org/interfaces/python/ + http://localhost:1313/interfaces/python/ Recent content in Python on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + + + STP + http://localhost:1313/tools/stp/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + Yices 2 - https://example.org/tools/yices/ + http://localhost:1313/tools/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/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>Yices is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/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> Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/interfaces/rust/index.html b/interfaces/rust/index.html index d5ff788..8883a97 100644 --- a/interfaces/rust/index.html +++ b/interfaces/rust/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -83,7 +83,7 @@ Yices 2 -

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 …

+ Yices is an SMT solver developed by SRI International. It is widely used for checking the … @@ -91,7 +91,8 @@ Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/interfaces/rust/index.xml b/interfaces/rust/index.xml index 90690eb..bd0284b 100644 --- a/interfaces/rust/index.xml +++ b/interfaces/rust/index.xml @@ -2,25 +2,25 @@ Rust on Formal Methods Tools - https://example.org/interfaces/rust/ + http://localhost:1313/interfaces/rust/ Recent content in Rust on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Yices 2 - https://example.org/tools/yices/ + http://localhost:1313/tools/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/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>Yices is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/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> Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/license/index.html b/license/index.html index 858efae..ad1f6a4 100644 --- a/license/index.html +++ b/license/index.html @@ -1,6 +1,6 @@ - + @@ -16,16 +16,16 @@ - + - + - - - - + + + + - + diff --git a/licenses/all-rights-reserved/index.html b/licenses/all-rights-reserved/index.html new file mode 100644 index 0000000..73db33f --- /dev/null +++ b/licenses/all-rights-reserved/index.html @@ -0,0 +1,103 @@ + + + + + + + + +All Rights Reserved | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + All Rights Reserved + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
MathSAT [ Not Maintained Since 2013 ] MiniSat is a minimalistic, open-source SAT solver, developed to help …
+ +
+ + + diff --git a/licenses/all-rights-reserved/index.xml b/licenses/all-rights-reserved/index.xml new file mode 100644 index 0000000..45879ba --- /dev/null +++ b/licenses/all-rights-reserved/index.xml @@ -0,0 +1,19 @@ + + + + All Rights Reserved on Formal Methods Tools + http://localhost:1313/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/mathsat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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(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/licenses/bsd/index.html b/licenses/bsd/index.html index f841f52..61f3fbd 100644 --- a/licenses/bsd/index.html +++ b/licenses/bsd/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -83,7 +83,7 @@ veriT -

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 …

+ veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is … diff --git a/licenses/bsd/index.xml b/licenses/bsd/index.xml index 3af4ede..c814b17 100644 --- a/licenses/bsd/index.xml +++ b/licenses/bsd/index.xml @@ -2,17 +2,17 @@ BSD on Formal Methods Tools - https://example.org/licenses/bsd/ + http://localhost:1313/licenses/bsd/ Recent content in BSD on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + veriT - https://example.org/tools/verit/ + http://localhost:1313/tools/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/verit/ + http://localhost:1313/tools/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/gpl3/index.html b/licenses/gpl3/index.html new file mode 100644 index 0000000..a01414b --- /dev/null +++ b/licenses/gpl3/index.html @@ -0,0 +1,95 @@ + + + + + + + + +GPL3 | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + GPL3 + +

+ +
+ + + + + + + + + + + + +
ToolDescription
+ +
+ + + diff --git a/licenses/gpl3/index.xml b/licenses/gpl3/index.xml new file mode 100644 index 0000000..2c850a3 --- /dev/null +++ b/licenses/gpl3/index.xml @@ -0,0 +1,11 @@ + + + + GPL3 on Formal Methods Tools + http://localhost:1313/licenses/gpl3/ + Recent content in GPL3 on Formal Methods Tools + Hugo + en-us + + + diff --git a/licenses/gplv3/index.html b/licenses/gplv3/index.html index 25ca19a..1ad2fe5 100644 --- a/licenses/gplv3/index.html +++ b/licenses/gplv3/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -81,9 +81,26 @@ + + ParaFROST + ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA … + + + + + + + SMTInterpol + SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories. +APIs and … + + + + + Yices 2 -

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 …

+ Yices is an SMT solver developed by SRI International. It is widely used for checking the … diff --git a/licenses/gplv3/index.xml b/licenses/gplv3/index.xml index da24534..2d344f5 100644 --- a/licenses/gplv3/index.xml +++ b/licenses/gplv3/index.xml @@ -2,18 +2,32 @@ GPLv3 on Formal Methods Tools - https://example.org/licenses/gplv3/ + http://localhost:1313/licenses/gplv3/ Recent content in GPLv3 on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + + + ParaFROST + http://localhost:1313/tools/parafrost/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + SMTInterpol + http://localhost:1313/tools/smtinterpol/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + Yices 2 - https://example.org/tools/yices/ + http://localhost:1313/tools/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/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>Yices is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/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> diff --git a/licenses/index.html b/licenses/index.html index 9100f71..2f4df9f 100644 --- a/licenses/index.html +++ b/licenses/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -106,6 +106,24 @@ + + LGPLv2 + + + + + + + + + + + + Licenses on Formal Methods Tools - https://example.org/licenses/ + http://localhost:1313/licenses/ Recent content in Licenses on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + BSD - https://example.org/licenses/bsd/ + http://localhost:1313/licenses/bsd/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/licenses/bsd/ + http://localhost:1313/licenses/bsd/ GPLv3 - https://example.org/licenses/gplv3/ + http://localhost:1313/licenses/gplv3/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/licenses/gplv3/ + http://localhost:1313/licenses/gplv3/ + + + + LGPLv2 + http://localhost:1313/licenses/lgplv2/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/licenses/lgplv2/ MIT - https://example.org/licenses/mit/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/licenses/mit/ + http://localhost:1313/licenses/mit/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/licenses/mit/ diff --git a/licenses/lgplv2/index.html b/licenses/lgplv2/index.html new file mode 100644 index 0000000..b5b629c --- /dev/null +++ b/licenses/lgplv2/index.html @@ -0,0 +1,104 @@ + + + + + + + + +LGPLv2 | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + LGPLv2 + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
Riss [ Not Maintained Since 2017 ] Riss is a SAT solving tool collection. +
+ +
+ + + diff --git a/licenses/lgplv2/index.xml b/licenses/lgplv2/index.xml new file mode 100644 index 0000000..610dc40 --- /dev/null +++ b/licenses/lgplv2/index.xml @@ -0,0 +1,19 @@ + + + + LGPLv2 on Formal Methods Tools + http://localhost:1313/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/riss/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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 1f2f0cf..ee2671c 100644 --- a/licenses/mit/index.html +++ b/licenses/mit/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -81,9 +81,28 @@ + + SMT-RAT + SMT-RAT is an SMT Real Algebra Toolbox. +APIs and Bindings This tool is available through the … + + + + + + + STP + STP is a constraint solver for quantifier-free bitvectors. +APIs and Bindings This tool is available … + + + + + Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/licenses/mit/index.xml b/licenses/mit/index.xml index cab9ecf..e02dc89 100644 --- a/licenses/mit/index.xml +++ b/licenses/mit/index.xml @@ -2,18 +2,32 @@ MIT on Formal Methods Tools - https://example.org/licenses/mit/ + http://localhost:1313/licenses/mit/ Recent content in MIT on Formal Methods Tools Hugo en-us - Fri, 02 Feb 2024 04:14:54 -0800 - + Sat, 07 Jun 2025 00:00:00 +0000 + + + SMT-RAT + http://localhost:1313/tools/smt-rat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + STP + http://localhost:1313/tools/stp/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/maintenance/actively-maintained/index.html b/maintenance/actively-maintained/index.html index 05f34ad..1b8aab1 100644 --- a/maintenance/actively-maintained/index.html +++ b/maintenance/actively-maintained/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -81,9 +81,36 @@ + + SMT-RAT + SMT-RAT is an SMT Real Algebra Toolbox. +APIs and Bindings This tool is available through the … + + + + + + + SMTInterpol + SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories. +APIs and … + + + + + + + STP + STP is a constraint solver for quantifier-free bitvectors. +APIs and Bindings This tool is available … + + + + + veriT -

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 …

+ veriT is an SMT solver developed by LORIA and ULiege. It supports a wide range of theories and is … @@ -91,7 +118,7 @@ Yices 2 -

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 …

+ Yices is an SMT solver developed by SRI International. It is widely used for checking the … @@ -99,7 +126,8 @@ Z3 -

Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and …

+ Z3 is a general-purpose theorem prover widely used for SAT & SMT solving. +APIs and Bindings This … diff --git a/maintenance/actively-maintained/index.xml b/maintenance/actively-maintained/index.xml index a8496f0..678ffd4 100644 --- a/maintenance/actively-maintained/index.xml +++ b/maintenance/actively-maintained/index.xml @@ -2,32 +2,53 @@ Actively Maintained on Formal Methods Tools - https://example.org/maintenance/actively-maintained/ + http://localhost:1313/maintenance/actively-maintained/ Recent content in Actively Maintained on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + + + SMT-RAT + http://localhost:1313/tools/smt-rat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + SMTInterpol + http://localhost:1313/tools/smtinterpol/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + STP + http://localhost:1313/tools/stp/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + veriT - https://example.org/tools/verit/ + http://localhost:1313/tools/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/verit/ + http://localhost:1313/tools/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 - https://example.org/tools/yices/ + http://localhost:1313/tools/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/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>Yices is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/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> Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/maintenance/archived/index.html b/maintenance/archived/index.html new file mode 100644 index 0000000..b3a5c14 --- /dev/null +++ b/maintenance/archived/index.html @@ -0,0 +1,104 @@ + + + + + + + + +Archived | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Archived + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
RissRiss is a SAT solving tool collection that was updated until 2017. +
+ +
+ + + diff --git a/maintenance/archived/index.xml b/maintenance/archived/index.xml new file mode 100644 index 0000000..1090225 --- /dev/null +++ b/maintenance/archived/index.xml @@ -0,0 +1,19 @@ + + + + Archived on Formal Methods Tools + http://localhost:1313/maintenance/archived/ + Recent content in Archived on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + Riss + http://localhost:1313/tools/riss/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/riss/ + <p>Riss is a SAT solving tool collection that was updated until 2017.</p> + + + diff --git a/maintenance/deprecated/index.html b/maintenance/deprecated/index.html new file mode 100644 index 0000000..47d5605 --- /dev/null +++ b/maintenance/deprecated/index.html @@ -0,0 +1,104 @@ + + + + + + + + +Deprecated | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Deprecated + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
RissRiss is a SAT solving tool collection that was updated until 2017. +
+ +
+ + + diff --git a/maintenance/deprecated/index.xml b/maintenance/deprecated/index.xml new file mode 100644 index 0000000..5557b7a --- /dev/null +++ b/maintenance/deprecated/index.xml @@ -0,0 +1,19 @@ + + + + Deprecated on Formal Methods Tools + http://localhost:1313/maintenance/deprecated/ + Recent content in Deprecated on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + Riss + http://localhost:1313/tools/riss/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/riss/ + <p>Riss is a SAT solving tool collection that was updated until 2017.</p> + + + diff --git a/maintenance/inactive/index.html b/maintenance/inactive/index.html new file mode 100644 index 0000000..117b6f8 --- /dev/null +++ b/maintenance/inactive/index.html @@ -0,0 +1,104 @@ + + + + + + + + +Inactive | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Inactive + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
SMTInterpolSMTInterpol is an SMT Solver that can compute Craig interpolants for various theories. +APIs and …
+ +
+ + + diff --git a/maintenance/inactive/index.xml b/maintenance/inactive/index.xml new file mode 100644 index 0000000..3e0a5c8 --- /dev/null +++ b/maintenance/inactive/index.xml @@ -0,0 +1,19 @@ + + + + Inactive on Formal Methods Tools + http://localhost:1313/maintenance/inactive/ + Recent content in Inactive on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + SMTInterpol + http://localhost:1313/tools/smtinterpol/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + diff --git a/maintenance/index.html b/maintenance/index.html index c3713d7..d8e6235 100644 --- a/maintenance/index.html +++ b/maintenance/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -79,6 +79,24 @@ + + + + + + + + + + + Not Maintained + + + diff --git a/maintenance/index.xml b/maintenance/index.xml index 04e938f..110dd90 100644 --- a/maintenance/index.xml +++ b/maintenance/index.xml @@ -2,17 +2,24 @@ Maintenance on Formal Methods Tools - https://example.org/maintenance/ + http://localhost:1313/maintenance/ Recent content in Maintenance on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + Actively Maintained - https://example.org/maintenance/actively-maintained/ + http://localhost:1313/maintenance/actively-maintained/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/maintenance/actively-maintained/ + http://localhost:1313/maintenance/actively-maintained/ + + + + Not Maintained + http://localhost:1313/maintenance/not-maintained/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/maintenance/not-maintained/ diff --git a/maintenance/no-longer-maintained/index.html b/maintenance/no-longer-maintained/index.html new file mode 100644 index 0000000..827e4af --- /dev/null +++ b/maintenance/no-longer-maintained/index.html @@ -0,0 +1,104 @@ + + + + + + + + +No Longer Maintained | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + No Longer Maintained + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
Riss No Longer Maintained Riss is a SAT solving tool collection that was updated until 2017. +
+ +
+ + + diff --git a/maintenance/no-longer-maintained/index.xml b/maintenance/no-longer-maintained/index.xml new file mode 100644 index 0000000..b73ccc8 --- /dev/null +++ b/maintenance/no-longer-maintained/index.xml @@ -0,0 +1,19 @@ + + + + No Longer Maintained on Formal Methods Tools + http://localhost:1313/maintenance/no-longer-maintained/ + Recent content in No Longer Maintained on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + Riss + http://localhost:1313/tools/riss/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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(226, 59, 59);"></span> <span style="color: rgb(226, 59, 59); font-size: 1rem;">No Longer Maintained</span> </div> Riss is a SAT solving tool collection that was updated until 2017.</p> + + + diff --git a/maintenance/not-active/index.html b/maintenance/not-active/index.html new file mode 100644 index 0000000..9c13306 --- /dev/null +++ b/maintenance/not-active/index.html @@ -0,0 +1,104 @@ + + + + + + + + +Not Active | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Not Active + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
RissRiss is a SAT solving tool collection that was updated until 2017. +
+ +
+ + + diff --git a/maintenance/not-active/index.xml b/maintenance/not-active/index.xml new file mode 100644 index 0000000..05d0630 --- /dev/null +++ b/maintenance/not-active/index.xml @@ -0,0 +1,19 @@ + + + + Not Active on Formal Methods Tools + http://localhost:1313/maintenance/not-active/ + Recent content in Not Active on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + Riss + http://localhost:1313/tools/riss/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/riss/ + <p>Riss is a SAT solving tool collection that was updated until 2017.</p> + + + diff --git a/maintenance/not-maintained/index.html b/maintenance/not-maintained/index.html new file mode 100644 index 0000000..db89d1a --- /dev/null +++ b/maintenance/not-maintained/index.html @@ -0,0 +1,103 @@ + + + + + + + + +Not Maintained | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + Not Maintained + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
Riss Not Maintained Since {map[year:2017] /home/landon/gitea/fmtools/content/tools/riss.md <nil> …
+ +
+ + + diff --git a/maintenance/not-maintained/index.xml b/maintenance/not-maintained/index.xml new file mode 100644 index 0000000..b9b6e45 --- /dev/null +++ b/maintenance/not-maintained/index.xml @@ -0,0 +1,19 @@ + + + + Not Maintained on Formal Methods Tools + http://localhost:1313/maintenance/not-maintained/ + Recent content in Not Maintained on Formal Methods Tools + Hugo + en-us + Sat, 07 Jun 2025 00:00:00 +0000 + + + Riss + http://localhost:1313/tools/riss/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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(226, 59, 59);"></span> <span style="color: rgb(226, 59, 59); font-size: 1rem;">Not Maintained Since {map[year:2017] /home/landon/gitea/fmtools/content/tools/riss.md &lt;nil&gt; inactive true 0 {{} {{} 0} {{} {0 0}}} {{} {{} 0} {{} {0 0}}} 615 { 0 0 0} &lt;nil&gt;}</span> </div> Riss is a SAT solving tool collection that was updated until 2017.</p> + + + diff --git a/privacy/index.html b/privacy/index.html index 63e8475..978acb3 100644 --- a/privacy/index.html +++ b/privacy/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + diff --git a/sitemap.xml b/sitemap.xml index 6ab2953..177fbf4 100644 --- a/sitemap.xml +++ b/sitemap.xml @@ -2,114 +2,147 @@ - https://example.org/maintenance/actively-maintained/ + http://localhost:1313/interfaces/.net/ 2025-06-07T00:00:00+00:00 - https://example.org/tools/ + http://localhost:1313/maintenance/actively-maintained/ 2025-06-07T00:00:00+00:00 - https://example.org/applications/ + http://localhost:1313/tools/ 2025-06-07T00:00:00+00:00 - https://example.org/licenses/bsd/ + http://localhost:1313/applications/ 2025-06-07T00:00:00+00:00 - https://example.org/interfaces/cli/ + http://localhost:1313/licenses/bsd/ 2025-06-07T00:00:00+00:00 - https://example.org/developers/ + http://localhost:1313/interfaces/c/ 2025-06-07T00:00:00+00:00 - https://example.org/inputs/dimacs/ + http://localhost:1313/interfaces/c++/ 2025-06-07T00:00:00+00:00 - https://example.org/licenses/gplv3/ + http://localhost:1313/interfaces/cli/ 2025-06-07T00:00:00+00:00 - https://example.org/inputs/ + http://localhost:1313/applications/constraint-solver/ 2025-06-07T00:00:00+00:00 - https://example.org/interfaces/ + http://localhost:1313/developers/ 2025-06-07T00:00:00+00:00 - https://example.org/licenses/ + http://localhost:1313/inputs/dimacs/ 2025-06-07T00:00:00+00:00 - https://example.org/developers/loria/ + http://localhost:1313/licenses/gplv3/ 2025-06-07T00:00:00+00:00 - https://example.org/maintenance/ + http://localhost:1313/inputs/ 2025-06-07T00:00:00+00:00 - https://example.org/interfaces/python/ + http://localhost:1313/interfaces/ 2025-06-07T00:00:00+00:00 - https://example.org/interfaces/rust/ + http://localhost:1313/interfaces/java/ 2025-06-07T00:00:00+00:00 - https://example.org/applications/smt-solver/ + http://localhost:1313/licenses/ 2025-06-07T00:00:00+00:00 - https://example.org/inputs/smtlib2/ + http://localhost:1313/developers/loria/ 2025-06-07T00:00:00+00:00 - https://example.org/developers/sri-international/ + http://localhost:1313/maintenance/ 2025-06-07T00:00:00+00:00 - https://example.org/ + http://localhost:1313/developers/microsoft-research/ 2025-06-07T00:00:00+00:00 - https://example.org/developers/uliege/ + http://localhost:1313/licenses/mit/ 2025-06-07T00:00:00+00:00 - https://example.org/tools/verit/ + http://localhost:1313/maintenance/not-maintained/ 2025-06-07T00:00:00+00:00 - https://example.org/inputs/yices-2/ + http://localhost:1313/interfaces/online/ 2025-06-07T00:00:00+00:00 - https://example.org/tools/yices/ + http://localhost:1313/interfaces/python/ 2025-06-07T00:00:00+00:00 - https://example.org/interfaces/.net/ - 2024-02-02T04:14:54-08:00 + http://localhost:1313/tools/riss/ + 2025-06-07T00:00:00+00:00 - https://example.org/interfaces/c/ - 2024-02-02T04:14:54-08:00 + http://localhost:1313/interfaces/rust/ + 2025-06-07T00:00:00+00:00 - https://example.org/interfaces/c++/ - 2024-02-02T04:14:54-08:00 + http://localhost:1313/developers/rwth-aachen/ + 2025-06-07T00:00:00+00:00 - https://example.org/interfaces/java/ - 2024-02-02T04:14:54-08:00 + http://localhost:1313/applications/sat-solver/ + 2025-06-07T00:00:00+00:00 - https://example.org/developers/microsoft-research/ - 2024-02-02T04:14:54-08:00 + http://localhost:1313/applications/smt-solver/ + 2025-06-07T00:00:00+00:00 - https://example.org/licenses/mit/ - 2024-02-02T04:14:54-08:00 + http://localhost:1313/tools/smt-rat/ + 2025-06-07T00:00:00+00:00 - https://example.org/interfaces/online/ - 2024-02-02T04:14:54-08:00 + http://localhost:1313/tools/smtinterpol/ + 2025-06-07T00:00:00+00:00 - https://example.org/applications/theorem-prover/ - 2024-02-02T04:14:54-08:00 + http://localhost:1313/inputs/smtlib2/ + 2025-06-07T00:00:00+00:00 - https://example.org/tools/z3/ - 2024-02-02T04:14:54-08:00 + http://localhost:1313/developers/sri-international/ + 2025-06-07T00:00:00+00:00 - https://example.org/about/ + http://localhost:1313/developers/stanford-university/ + 2025-06-07T00:00:00+00:00 - https://example.org/taxonomies/ + http://localhost:1313/tools/stp/ + 2025-06-07T00:00:00+00:00 - https://example.org/contribute/ + http://localhost:1313/ + 2025-06-07T00:00:00+00:00 - https://example.org/domains/ + http://localhost:1313/applications/theorem-prover/ + 2025-06-07T00:00:00+00:00 - https://example.org/license/ + http://localhost:1313/developers/uliege/ + 2025-06-07T00:00:00+00:00 - https://example.org/privacy/ + http://localhost:1313/developers/university-of-freiburg/ + 2025-06-07T00:00:00+00:00 - https://example.org/techniques/ + http://localhost:1313/developers/university-of-illinois/ + 2025-06-07T00:00:00+00:00 + + http://localhost:1313/tools/verit/ + 2025-06-07T00:00:00+00:00 + + http://localhost:1313/inputs/yices-2/ + 2025-06-07T00:00:00+00:00 + + http://localhost:1313/tools/yices/ + 2025-06-07T00:00:00+00:00 + + http://localhost:1313/tools/z3/ + 2025-06-07T00:00:00+00:00 + + http://localhost:1313/about/ + + http://localhost:1313/taxonomies/ + + http://localhost:1313/contribute/ + + http://localhost:1313/domains/ + + http://localhost:1313/license/ + + http://localhost:1313/privacy/ + + http://localhost:1313/techniques/ diff --git a/taxonomies/index.html b/taxonomies/index.html index 1b1930f..e59316c 100644 --- a/taxonomies/index.html +++ b/taxonomies/index.html @@ -1,6 +1,6 @@ - + @@ -15,16 +15,16 @@ - + - + - - - - + + + + - + @@ -88,6 +88,40 @@ the tools developed at SRI International).

+ + Constraint Solver + + + + + + + + + + + + + SAT Solver + + + + + + + + + + + + + Masaryk University + + + + + + + + + + + + + Norbert Manthey + + + + + + + + + + + + + RWTH Aachen + + + + + + + + + + + + + Stanford University + + + + + + + + + + + + + + + + + + + + + University of Freiburg + + + + + + + + + + + + + University of Illinois + + + @@ -473,6 +609,23 @@ the tools developed at SRI International).

+ + LGPLv2 + + + + + + + + + + + + + + + + + + + + + Not Maintained + + + diff --git a/taxonomies/index.xml b/taxonomies/index.xml index 19d5fe8..02bdae5 100644 --- a/taxonomies/index.xml +++ b/taxonomies/index.xml @@ -2,10 +2,10 @@ All Taxonomy Data on Formal Methods Tools - https://example.org/taxonomies/ + http://localhost:1313/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 new file mode 100644 index 0000000..9bfa3d1 --- /dev/null +++ b/techniques/cdcl/index.html @@ -0,0 +1,103 @@ + + + + + + + + +CDCL | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + CDCL + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
ParaFROSTParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA …
+ +
+ + + diff --git a/techniques/cdcl/index.xml b/techniques/cdcl/index.xml new file mode 100644 index 0000000..b40aff4 --- /dev/null +++ b/techniques/cdcl/index.xml @@ -0,0 +1,19 @@ + + + + CDCL on Formal Methods Tools + http://localhost:1313/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/z3-copy/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/z3-copy/ + <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> + + + diff --git a/techniques/gpu/index.html b/techniques/gpu/index.html new file mode 100644 index 0000000..5f2da6f --- /dev/null +++ b/techniques/gpu/index.html @@ -0,0 +1,103 @@ + + + + + + + + +GPU | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ +

+ + + + + + + GPU + +

+ +
+ + + + + + + + + + + + + + + + + + + + +
ToolDescription
ParaFROSTParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA …
+ +
+ + + diff --git a/techniques/gpu/index.xml b/techniques/gpu/index.xml new file mode 100644 index 0000000..695d32c --- /dev/null +++ b/techniques/gpu/index.xml @@ -0,0 +1,19 @@ + + + + GPU on Formal Methods Tools + http://localhost:1313/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/z3-copy/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/z3-copy/ + <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> + + + diff --git a/techniques/index.html b/techniques/index.html index d426a31..2af0b03 100644 --- a/techniques/index.html +++ b/techniques/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + diff --git a/techniques/index.xml b/techniques/index.xml index 08d2e66..0ec9808 100644 --- a/techniques/index.xml +++ b/techniques/index.xml @@ -2,10 +2,10 @@ Techniques on Formal Methods Tools - https://example.org/techniques/ + http://localhost:1313/techniques/ Recent content in Techniques on Formal Methods Tools Hugo en-us - + diff --git a/tools/glucose/index.html b/tools/glucose/index.html new file mode 100644 index 0000000..45eb507 --- /dev/null +++ b/tools/glucose/index.html @@ -0,0 +1,347 @@ + + + + + + + + +Glucose | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

Glucose

+ + SAT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SAT Solver + + + +
+ + Developers + + + + + + + + + + + + + Gilles Audemard + + + + + + + + + + + + + Laurent Simon + + + +
+ + Inputs + + + + + + + + + + + + + CNF + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + MIT + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

Glucose is a SAT solver.

+ +
+ + + + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/index.html b/tools/index.html index de72174..ea537e4 100644 --- a/tools/index.html +++ b/tools/index.html @@ -1,6 +1,6 @@ - + @@ -13,17 +13,19 @@ - - + + - + - - - - + + + + - + @@ -57,7 +59,12 @@

All Tools

- +

This page lists all of the 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.

+
@@ -70,6 +77,1375 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + @@ -349,7 +366,7 @@

Description

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.

APIs and Bindings

-

Yices is available through several interfaces, making it a convenient option to build into a project.

+

This tool is available through the following interfaces:

  • General API: Yices API Reference
  • Python bindings: yices2 PyPI package
    • @@ -376,6 +393,34 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + +
  • Yices 2.2 @@ -403,11 +448,19 @@ - - - -

    Updated

    - +
    +
    + Help improve this page!
    + Submit an issue or pull request. +
    + +
    + + + Updated +
    + +
    diff --git a/tools/z3-copy/index.html b/tools/z3-copy/index.html new file mode 100644 index 0000000..acf9158 --- /dev/null +++ b/tools/z3-copy/index.html @@ -0,0 +1,584 @@ + + + + + + + + +Z3 | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    +

    Formal Methods Tools

    + + + + +
    +
    + + +
    +

    Z3

    + + Theorem Prover + + + + + + + +
    + + +
    +

    At a Glance

    +
Glucose + + + + + + + + + + + + + + + SAT Solver + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Gilles Audemard + + + + + + + + + + + + + Laurent Simon + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Lingeling + + + + + + + + + + + + + + + SAT Solver + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Johannes Kepler Universität Linz + + + + + + + + + + + + + + + + + + + + + + + + + + +
MathSAT + + + + + + + + + + + + + + + SMT Solver + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Fondazione Bruno Kessler + + + + + + + + + + + + + DISI-University of Trento + + + + + + + + + + + + + + + + + + + + + + + + + + +
MiniSat + + + + + + + + + + + + + + + SAT Solver + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Niklas Eén + + + + + + + + + + + + + Niklas Sörensson + + + + + + + + + + + + + + + + + + + + + + + + + + +
OpenSMT + + + + + + + + + + + + + + + SMT Solver + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + University of Lugano + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
ParaFROST + + + + + + + + + + + + + + + SAT Solver + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Eindhoven University of Technology + + + + + + + + + + + + + Albert-Ludwigs-Universität + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Q3B + + + + + + + + + + + + + + + SMT Solver + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Masaryk University + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Riss + + + + + + + + + + + + + + + SAT Solver + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Norbert Manthey + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
SMT-RAT + + + + + + + + + + + + + + + SMT Solver + + + + + + + + + + + + + SAT Solver + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + RWTH Aachen + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
SMTInterpol + + + + + + + + + + + + + + + SMT Solver + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + University of Freiburg + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
STP + + + + + + + + + + + + + + + Constraint Solver + + + + + + + + + + + + + SMT Solver + + + + + + + + + + + + + Theorem Prover + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + University of Illinois + + + + + + + + + + + + + Stanford University + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
veriT @@ -227,6 +1603,23 @@ + + + + + + + + + + SAT Solver + + + @@ -359,6 +1752,23 @@ + + + + + + + + + + SAT Solver + + + diff --git a/tools/index.xml b/tools/index.xml index b98c1ba..35ed269 100644 --- a/tools/index.xml +++ b/tools/index.xml @@ -2,32 +2,109 @@ All Tools on Formal Methods Tools - https://example.org/tools/ + http://localhost:1313/tools/ Recent content in All Tools on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 - + + + Glucose + http://localhost:1313/tools/glucose/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/glucose/ + <p>Glucose is a SAT solver.</p> + + + Lingeling + http://localhost:1313/tools/lingeling/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/lingeling/ + <p>Lingeling is a SAT solver.</p> + + + MathSAT + http://localhost:1313/tools/mathsat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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/minisat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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/opensmt/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + ParaFROST + http://localhost:1313/tools/parafrost/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + Q3B + http://localhost:1313/tools/q3b/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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/riss/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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/smt-rat/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + SMTInterpol + http://localhost:1313/tools/smtinterpol/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + + + STP + http://localhost:1313/tools/stp/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> + veriT - https://example.org/tools/verit/ + http://localhost:1313/tools/verit/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/verit/ + http://localhost:1313/tools/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 - https://example.org/tools/yices/ + http://localhost:1313/tools/yices/ Sat, 07 Jun 2025 00:00:00 +0000 - https://example.org/tools/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>Yices is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/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> Z3 - https://example.org/tools/z3/ - Fri, 02 Feb 2024 04:14:54 -0800 - https://example.org/tools/z3/ - <p>Z3 is a theorem prover developed by Microsoft Research, widely used for SAT &amp; SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.</p> <h2 id="apis-and-bindings">APIs and Bindings</h2> <p>Z3 is available through several interfaces, making it a convenient option to build into a project.</p> + http://localhost:1313/tools/z3/ + Sat, 07 Jun 2025 00:00:00 +0000 + http://localhost:1313/tools/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> diff --git a/tools/lingeling-copy/index.html b/tools/lingeling-copy/index.html new file mode 100644 index 0000000..290f4cd --- /dev/null +++ b/tools/lingeling-copy/index.html @@ -0,0 +1,300 @@ + + + + + + + + +Lingeling | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

Lingeling

+ + SMT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SAT Solver + + + +
+ + Developers + + + + + + + + + + + + + Johannes Kepler Universität Linz + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + MIT + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

Lingeling is a SAT solver.

+ +
+ + + + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/lingeling/index.html b/tools/lingeling/index.html new file mode 100644 index 0000000..1191de3 --- /dev/null +++ b/tools/lingeling/index.html @@ -0,0 +1,300 @@ + + + + + + + + +Lingeling | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

Lingeling

+ + SMT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SAT Solver + + + +
+ + Developers + + + + + + + + + + + + + Johannes Kepler Universität Linz + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + MIT + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

Lingeling is a SAT solver.

+ +
+ + + + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/mathsat-copy/index.html b/tools/mathsat-copy/index.html new file mode 100644 index 0000000..6212ece --- /dev/null +++ b/tools/mathsat-copy/index.html @@ -0,0 +1,327 @@ + + + + + + + + +MathSAT | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

MathSAT

+ + SMT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SMT Solver + + + +
+ + Developers + + + + + + + + + + + + + Fondazione Bruno Kessler + + + + + + + + + + + + + DISI-University of Trento + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + All rights reserved + + + +
+ + Maintenance + + + + + + + + + + + + + Not Maintained + + + +
+
+ + +
+

Description

+

+ + [ + Closed-Source Tool + ]  +
+MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.

+ +
+ + + + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/mathsat/index.html b/tools/mathsat/index.html new file mode 100644 index 0000000..6b291e1 --- /dev/null +++ b/tools/mathsat/index.html @@ -0,0 +1,327 @@ + + + + + + + + +MathSAT | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

MathSAT

+ + SMT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SMT Solver + + + +
+ + Developers + + + + + + + + + + + + + Fondazione Bruno Kessler + + + + + + + + + + + + + DISI-University of Trento + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + All rights reserved + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

+ + [ + Closed-Source Tool + ]  +
+MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.

+ +
+ + + + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/minisat-copy/index.html b/tools/minisat-copy/index.html new file mode 100644 index 0000000..7dc93db --- /dev/null +++ b/tools/minisat-copy/index.html @@ -0,0 +1,337 @@ + + + + + + + + +MiniSat | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

MiniSat

+ + SAT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SAT Solver + + + +
+ + Developers + + + + + + + + + + + + + Niklas Eén + + + + + + + + + + + + + Niklas Sörensson + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + MIT + + + +
+ + Maintenance + + + + + + + + + + + + + Not Maintained + + + +
+
+ + +
+

Description

+

+ +

+ + [ + + Not Maintained Since 2013 + + ] +
+MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.

+ +
+ + + + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/minisat/index.html b/tools/minisat/index.html new file mode 100644 index 0000000..3ea2a4f --- /dev/null +++ b/tools/minisat/index.html @@ -0,0 +1,337 @@ + + + + + + + + +MiniSat | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

MiniSat

+ + SAT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SAT Solver + + + +
+ + Developers + + + + + + + + + + + + + Niklas Eén + + + + + + + + + + + + + Niklas Sörensson + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + MIT + + + +
+ + Maintenance + + + + + + + + + + + + + Not Maintained + + + +
+
+ + +
+

Description

+

+ +

+ + [ + + Not Maintained Since 2013 + + ] +
+MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.

+ +
+ + + + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/opensmt-copy/index.html b/tools/opensmt-copy/index.html new file mode 100644 index 0000000..23a29ca --- /dev/null +++ b/tools/opensmt-copy/index.html @@ -0,0 +1,330 @@ + + + + + + + + +OpenSMT | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

OpenSMT

+ + SMT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SMT Solver + + + +
+ + Developers + + + + + + + + + + + + + University of Lugano + + + +
+ + Inputs + + + + + + + + + + + + + SMTLIB2 + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + GPLv3 + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

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.

+ +
+ + + + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/opensmt/index.html b/tools/opensmt/index.html new file mode 100644 index 0000000..42758fd --- /dev/null +++ b/tools/opensmt/index.html @@ -0,0 +1,330 @@ + + + + + + + + +OpenSMT | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

OpenSMT

+ + SMT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SMT Solver + + + +
+ + Developers + + + + + + + + + + + + + University of Lugano + + + +
+ + Inputs + + + + + + + + + + + + + SMTLIB2 + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + GPLv3 + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

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.

+ +
+ + + + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/parafrost/index.html b/tools/parafrost/index.html new file mode 100644 index 0000000..096af67 --- /dev/null +++ b/tools/parafrost/index.html @@ -0,0 +1,472 @@ + + + + + + + + +ParaFROST | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

ParaFROST

+ + SMT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SAT Solver + + + +
+ + Developers + + + + + + + + + + + + + Eindhoven University of Technology + + + + + + + + + + + + + Albert-Ludwigs-Universität + + + +
+ + Inputs + + + + + + + + + + + + + SMTLIB2 + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + GPLv3 + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+ + Techniques + + + + + + + + + + + + + CDCL + + + + + + + + + + + + + GPU + + + +
+
+ + +
+

Description

+

ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.

+

APIs and Bindings

+

This tool is available through the following interfaces:

+ + +
+ + + +
+

Publications

+
    + + + + + + + + + + + +
  • + Certified SAT solving with GPU accelerated inprocessing + + + (2024) + + + by Osama, Muhammad et. al. + | Appears in FMSD 2024 + (79-118) + + | Volume 62 + | Published by Springer + | 10.1007/s10703-023-00432-z + +
    • + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+
+ + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/q3b/index.html b/tools/q3b/index.html new file mode 100644 index 0000000..28c5a1a --- /dev/null +++ b/tools/q3b/index.html @@ -0,0 +1,418 @@ + + + + + + + + +Q3B | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

Q3B

+ + SMT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SMT Solver + + + +
+ + Developers + + + + + + + + + + + + + Masaryk University + + + +
+ + Inputs + + + + + + + + + + + + + SMTLIB2 + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + MIT + + + +
+ + Maintenance + + + + + + + + + + + + + Not Maintained + + + +
+
+ + +
+

Description

+

+ +

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

+ +
+ + + +
+

Publications

+
    + + + + + + + + + + + + + + + +
  • + Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams + + + (2016) + + + by Jonáš, Martin et. al. + | Appears in SAT 2016 + (267-283) + + + | Published by Springer + | 10.1007/978-3-319-40970-2_17 + +
    • + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+
+ + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/riss-copy/index.html b/tools/riss-copy/index.html new file mode 100644 index 0000000..825bf5c --- /dev/null +++ b/tools/riss-copy/index.html @@ -0,0 +1,318 @@ + + + + + + + + +Riss | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

Riss

+ + SAT Tool Collection + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SAT Solver + + + +
+ + Developers + + + + + + + + + + + + + University of Freiburg + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + GPLv3 + + + +
+ + Maintenance + + + + + + + + + + + + + Not Maintained + + + +
+
+ + +
+

Description

+

+ +

+ + [ + + Not Maintained Since 2017 + + ] +
+Riss is a SAT solving tool collection.

+ +
+ + + + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/riss/index.html b/tools/riss/index.html new file mode 100644 index 0000000..e047b9b --- /dev/null +++ b/tools/riss/index.html @@ -0,0 +1,318 @@ + + + + + + + + +Riss | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

Riss

+ + SAT Tool Collection + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SAT Solver + + + +
+ + Developers + + + + + + + + + + + + + Norbert Manthey + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + LGPLv2 + + + +
+ + Maintenance + + + + + + + + + + + + + Not Maintained + + + +
+
+ + +
+

Description

+

+ +

+ + [ + + Not Maintained Since 2017 + + ] +
+Riss is a SAT solving tool collection.

+ +
+ + + + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/smt-rat-copy/index.html b/tools/smt-rat-copy/index.html new file mode 100644 index 0000000..3138f3f --- /dev/null +++ b/tools/smt-rat-copy/index.html @@ -0,0 +1,439 @@ + + + + + + + + +SMT-RAT | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

SMT-RAT

+ + SMT Toolbox + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + Constraint Solver + + + + + + + + + + + + + SMT Solver + + + + + + + + + + + + + Theorem Prover + + + +
+ + Developers + + + + + + + + + + + + + RWTH Aachen + + + +
+ + Inputs + + + + + + + + + + + + + SMTLIB2 + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + + + + + + + + + + + C++ + + + +
+ + Licenses + + + + + + + + + + + + + MIT + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

SMT-RAT is an SMT Real Algebra Toolbox.

+

APIs and Bindings

+

This tool is available through the following interfaces:

+ + +
+ + + +
+

Publications

+
    + + + + + + + + + +
  • + SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving + + + (2015) + + + by Corzilius, Florian et. al. + | Appears in SAT 2015 + (360-368) + + + | Published by Springer + | 10.1007/978-3-319-24318-4_26 + +
    • + + + + + + + + + + + + + + + + + + + + + + + + + +
+
+ + + + + +

Updated

+ + + + +
+ + + diff --git a/tools/smt-rat/index.html b/tools/smt-rat/index.html new file mode 100644 index 0000000..614947d --- /dev/null +++ b/tools/smt-rat/index.html @@ -0,0 +1,444 @@ + + + + + + + + +SMT-RAT | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

SMT-RAT

+ + SMT Toolbox + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SMT Solver + + + + + + + + + + + + + SAT Solver + + + +
+ + Developers + + + + + + + + + + + + + RWTH Aachen + + + +
+ + Inputs + + + + + + + + + + + + + SMTLIB2 + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + + + + + + + + + + + C++ + + + +
+ + Licenses + + + + + + + + + + + + + MIT + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

SMT-RAT is an SMT Real Algebra Toolbox.

+

APIs and Bindings

+

This tool is available through the following interfaces:

+ + +
+ + + +
+

Publications

+
    + + + + + + + + + + + + + + + + + + + +
  • + SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving + + + (2015) + + + by Corzilius, Florian et. al. + | Appears in SAT 2015 + (360-368) + + + | Published by Springer + | 10.1007/978-3-319-24318-4_26 + +
    • + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+
+ + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/smtinerpol/index.html b/tools/smtinerpol/index.html new file mode 100644 index 0000000..3f54f8e --- /dev/null +++ b/tools/smtinerpol/index.html @@ -0,0 +1,439 @@ + + + + + + + + +SMT-RAT | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

SMT-RAT

+ + SMT Toolbox + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + Constraint Solver + + + + + + + + + + + + + SMT Solver + + + + + + + + + + + + + Theorem Prover + + + +
+ + Developers + + + + + + + + + + + + + RWTH Aachen + + + +
+ + Inputs + + + + + + + + + + + + + SMTLIB2 + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + + + + + + + + + + + C++ + + + +
+ + Licenses + + + + + + + + + + + + + MIT + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

SMT-RAT is an SMT Real Algebra Toolbox.

+

APIs and Bindings

+

This tool is available through the following interfaces:

+ + +
+ + + +
+

Publications

+
    + + + + + + + + + +
  • + SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving + + + (2015) + + + by Corzilius, Florian et. al. + | Appears in SAT 2015 + (360-368) + + + | Published by Springer + | 10.1007/978-3-319-24318-4_26 + +
    • + + + + + + + + + + + + + + + + + + + + + + + + + +
+
+ + + + + +

Updated

+ + + + +
+ + + diff --git a/tools/smtinterpol-copy/index.html b/tools/smtinterpol-copy/index.html new file mode 100644 index 0000000..7ea5abb --- /dev/null +++ b/tools/smtinterpol-copy/index.html @@ -0,0 +1,413 @@ + + + + + + + + +SMTInterpol | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

SMTInterpol

+ + Interpolating SMT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SMT Solver + + + +
+ + Developers + + + + + + + + + + + + + University of Freiburg + + + +
+ + Inputs + + + + + + + + + + + + + SMTLIB2 + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + + + + + + + + + + + Java + + + +
+ + Licenses + + + + + + + + + + + + + GPLv3 + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.

+

APIs and Bindings

+

This tool is available through the following interfaces:

+ + +
+ + + +
+

Publications

+
    + + + + + + + + + + + + + +
  • + Proof Tree Preserving Sequence Interpolation of Quantified Formulas in the Theory of Equality + + + (2021) + + + by Henkel, Elisabeth et. al. + | Appears in SMT 2021 + + + + + | https://ceur-ws.org/Vol-2908/short12.pdf +
    • + + + + + + + + + + + + + + + + + + + + + + + + + +
+
+ + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/smtinterpol/index.html b/tools/smtinterpol/index.html new file mode 100644 index 0000000..da1fa07 --- /dev/null +++ b/tools/smtinterpol/index.html @@ -0,0 +1,423 @@ + + + + + + + + +SMTInterpol | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

SMTInterpol

+ + Interpolating SMT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SMT Solver + + + +
+ + Developers + + + + + + + + + + + + + University of Freiburg + + + +
+ + Inputs + + + + + + + + + + + + + SMTLIB2 + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + + + + + + + + + + + Java + + + +
+ + Licenses + + + + + + + + + + + + + GPLv3 + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.

+

APIs and Bindings

+

This tool is available through the following interfaces:

+ + +
+ + + +
+

Publications

+
    + + + + + + + + + + + + + + + + + + + + + + + +
  • + Proof Tree Preserving Sequence Interpolation of Quantified Formulas in the Theory of Equality + + + (2021) + + + by Henkel, Elisabeth et. al. + | Appears in SMT 2021 + + + + + | https://ceur-ws.org/Vol-2908/short12.pdf +
    • + + + + + + + + + + + + + + + + + + + + + + + + + +
+
+ + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/stp-copy/index.html b/tools/stp-copy/index.html new file mode 100644 index 0000000..be4e5f0 --- /dev/null +++ b/tools/stp-copy/index.html @@ -0,0 +1,486 @@ + + + + + + + + +STP | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

STP

+ + Simple Theorem Prover + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + Constraint Solver + + + + + + + + + + + + + SMT Solver + + + + + + + + + + + + + Theorem Prover + + + +
+ + Developers + + + + + + + + + + + + + University of Illinois + + + + + + + + + + + + + Stanford University + + + +
+ + Inputs + + + + + + + + + + + + + SMTLIB2 + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + + + + + + + + + + + C + + + + + + + + + + + + + Python + + + +
+ + Licenses + + + + + + + + + + + + + MIT + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

STP is a constraint solver for quantifier-free bitvectors.

+

APIs and Bindings

+

This tool is available through the following interfaces:

+ + +
+ + + +
+

Publications

+
    + + + + + + + + + +
  • + A Decision Procedure for Bit-Vectors and Arrays + + + (July 2007) + + + by Ganesh, Vijay et. al. + | Appears in CAV 2007 + + + + | Published by Springer + | 10.1007/978-3-540-73368-3_52 + +
    • + + + +
  • + EXE: Automatically Generating Inputs of Death + + + (October 2006) + + + by Cadar, Cristian et. al. + | Appears in CCS 2006 + + + + | Published by ACM + | 10.1145/1455518.1455522 + +
    • + + + + + + + + + + + + + + + + + + + +
+
+ + + + + +

Updated

+ + + + +
+ + + diff --git a/tools/stp/index.html b/tools/stp/index.html new file mode 100644 index 0000000..f9f7b2b --- /dev/null +++ b/tools/stp/index.html @@ -0,0 +1,512 @@ + + + + + + + + +STP | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

STP

+ + Simple Theorem Prover + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + Constraint Solver + + + + + + + + + + + + + SMT Solver + + + + + + + + + + + + + Theorem Prover + + + +
+ + Developers + + + + + + + + + + + + + University of Illinois + + + + + + + + + + + + + Stanford University + + + +
+ + Inputs + + + + + + + + + + + + + SMTLIB2 + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + + + + + + + + + + + C + + + + + + + + + + + + + Python + + + +
+ + Licenses + + + + + + + + + + + + + MIT + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

STP is a constraint solver for quantifier-free bitvectors.

+

APIs and Bindings

+

This tool is available through the following interfaces:

+ + +
+ + + +
+

Publications

+
    + + + + + + + + + + + + + + + + + + + + + + + + + + + +
  • + A Decision Procedure for Bit-Vectors and Arrays + + + (July 2007) + + + by Ganesh, Vijay et. al. + | Appears in CAV 2007 + + + + | Published by Springer + | 10.1007/978-3-540-73368-3_52 + +
    • + + + +
  • + EXE: Automatically Generating Inputs of Death + + + (October 2006) + + + by Cadar, Cristian et. al. + | Appears in CCS 2006 + + + + | Published by ACM + | 10.1145/1455518.1455522 + +
    • + + + + + + + + + + + + + + + + + + + +
+
+ + +
+
+ Help improve this page!
+ Submit an issue or pull request. +
+ +
+ + + Updated +
+ +
+ + + +
+ + + diff --git a/tools/verit-copy/index.html b/tools/verit-copy/index.html new file mode 100644 index 0000000..67f7776 --- /dev/null +++ b/tools/verit-copy/index.html @@ -0,0 +1,406 @@ + + + + + + + + +veriT | Formal Methods Tools + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

Formal Methods Tools

+ + + + +
+
+ + +
+

veriT

+ + SMT Solver + + + + + + + +
+ + +
+

At a Glance

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + Applications + + + + + + + + + + + + + SMT Solver + + + +
+ + Developers + + + + + + + + + + + + + LORIA + + + + + + + + + + + + + ULiege + + + +
+ + Inputs + + + + + + + + + + + + + SMTLIB2 + + + + + + + + + + + + + DIMACS + + + +
+ + Interfaces + + + + + + + + + + + + + CLI + + + +
+ + Licenses + + + + + + + + + + + + + BSD + + + +
+ + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
+
+ + +
+

Description

+

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.

+ +
+ + + +
+

Publications

+
    + + + + + + + + + + + + + + + + + +
  • + Reliable Reconstruction of Fine-Grained Proofs in a Proof Assistant + + + (2021) + + + by Schurr, Hans-Jörg et. al. + | Appears in CADE 2021 + + + + | Published by Springer + | 10.1007/978-3-030-79876-5_26 + +
    • + + + + + + + + + + + +
+
+ + + + + +

Updated

+ + + + +
+ + + diff --git a/tools/verit/index.html b/tools/verit/index.html index bc92ac8..488e1cf 100644 --- a/tools/verit/index.html +++ b/tools/verit/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -70,8 +70,6 @@
  •   Homepage
    • -
  •   Source Code
    • - @@ -348,6 +346,34 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + +
  • Reliable Reconstruction of Fine-Grained Proofs in a Proof Assistant @@ -379,11 +405,19 @@ - - - -

    Updated

    - +
    +
    + Help improve this page!
    + Submit an issue or pull request. +
    + +
    + + + Updated +
    + +
    diff --git a/tools/yices/index.html b/tools/yices/index.html index 149c7c9..4c784f0 100644 --- a/tools/yices/index.html +++ b/tools/yices/index.html @@ -1,6 +1,6 @@ - + @@ -14,16 +14,16 @@ - + - + - - - - + + + + - + @@ -114,6 +114,23 @@ + + + + + + + + + + SAT Solver + + +
    • + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + + Applications + + + + + + + + + + + + + SMT Solver + + + + + + + + + + + + + Theorem Prover + + + + + + + + + + + + + SAT Solver + + + +
    + + Developers + + + + + + + + + + + + + Microsoft Research + + + +
    + + Inputs + + + + + + + + + + + + + SMTLIB2 + + + + + + + + + + + + + DIMACS + + + +
    + + Interfaces + + + + + + + + + + + + + CLI + + + + + + + + + + + + + Python + + + + + + + + + + + + + Rust + + + + + + + + + + + + + C + + + + + + + + + + + + + C++ + + + + + + + + + + + + + Java + + + + + + + + + + + + + .NET + + + + + + + + + + + + + Online + + + +
    + + Licenses + + + + + + + + + + + + + MIT + + + +
    + + Maintenance + + + + + + + + + + + + + Actively Maintained + + + +
    +
    + + +
    +

    Description

    +

    Z3 is a general-purpose theorem prover widely used for SAT & SMT solving.

    +

    APIs and Bindings

    +

    This tool is available through the following interfaces:

    + + +
    + + + +
    +

    Publications

    +
      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    • + Z3: An Efficient SMT Solver + + + (March 2008) + + + by de Moura, Leonardo et. al. + | Appears in TACAS 2008 + + + + | Published by Springer, Berlin, Heidelberg + | 10.1007/978-3-540-78800-3_24 + +
      • + + + +
    +
    + + +
    +
    + Help improve this page!
    + Submit an issue or pull request. +
    + +
    + + + Updated +
    + +
    + + + +
    + + + diff --git a/tools/z3/index.html b/tools/z3/index.html index 042f40d..92b2047 100644 --- a/tools/z3/index.html +++ b/tools/z3/index.html @@ -1,6 +1,6 @@ - + @@ -13,17 +13,21 @@ - - + + - + - - - - + + + + - + @@ -133,6 +137,23 @@ + + + + + + + + + + SAT Solver + + + @@ -451,10 +472,9 @@

    Description

    -

    Z3 is a theorem prover developed by Microsoft Research, widely used for SAT & SMT solving and related formal verification tasks. It supports a variety of input languages, including SMT-LIB, and offers APIs for multiple programming languages. -Z3 is open source under the MIT license and is actively maintained, making it a popular choice for research and industrial applications in software and hardware verification.

    +

    Z3 is a general-purpose theorem prover widely used for SAT & SMT solving.

    APIs and Bindings

    -

    Z3 is available through several interfaces, making it a convenient option to build into a project.

    +

    This tool is available through the following interfaces:

    • C API: Z3 C API Reference
    • C++ API: Z3 C++ Namespace Reference
      • @@ -488,6 +508,34 @@ Z3 is open source under the MIT license and is actively maintained, making it a + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    • Z3: An Efficient SMT Solver @@ -496,7 +544,7 @@ Z3 is open source under the MIT license and is actively maintained, making it a by de Moura, Leonardo et. al. - | Appears in TACAS + | Appears in TACAS 2008 @@ -511,11 +559,19 @@ Z3 is open source under the MIT license and is actively maintained, making it a
    - - - -

    Updated

    - +
    +
    + Help improve this page!
    + Submit an issue or pull request. +
    + +
    + + + Updated +
    + +