Ready to deploy in beta more

This commit is contained in:
2025-06-13 13:09:07 -06:00
parent ad8d224db4
commit fb51f11cd4
189 changed files with 9460 additions and 3385 deletions

View File

@ -1,6 +1,6 @@
<!DOCTYPE html>
<html lang="en-us" dir="ltr">
<head><script src="/livereload.js?mindelay=10&amp;v=2&amp;port=1313&amp;path=livereload" data-no-instant defer></script>
<head>
<meta charset="utf-8">
<meta name="viewport" content ="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=no">
@ -14,16 +14,16 @@
<meta property="og:type" content="article">
<meta property="og:title" content="MIT">
<meta property="og:description" content="">
<meta property="og:url" content="http://localhost:1313/licenses/mit/">
<meta property="og:url" content="https://example.org/licenses/mit/">
<meta property="og:image" content="images/%!s(&lt;nil&gt;)">
<link rel="canonical" href="http://localhost:1313/licenses/mit/">
<link rel="canonical" href="https://example.org/licenses/mit/">
<link rel="apple-touch-icon" sizes="180x180" href='http://localhost:1313/apple-touch-icon.png'>
<link rel="icon" type="image/png" sizes="32x32" href='http://localhost:1313/favicon-32x32.png'>
<link rel="icon" type="image/png" sizes='16x16' href='http://localhost:1313/favicon-16x16.png'>
<link rel="manifest" href='http://localhost:1313/site.webmanifest'>
<link rel="apple-touch-icon" sizes="180x180" href='https://example.org/apple-touch-icon.png'>
<link rel="icon" type="image/png" sizes="32x32" href='https://example.org/favicon-32x32.png'>
<link rel="icon" type="image/png" sizes='16x16' href='https://example.org/favicon-16x16.png'>
<link rel="manifest" href='https://example.org/site.webmanifest'>
<link rel="stylesheet" href="http://localhost:1313/css/styles.e5b470edf89c3e1b9498ce83a3fd0a2e73e9d06958e2c3a1af8d89781f9f2bf612b21d5e45ab8f4aef773661de2529437838673a136797a6a8aaab7759f94ded.css" integrity="sha512-5bRw7ficPhuUmM6Do/0KLnPp0GlY4sOhr42JeB&#43;fK/YSsh1eRauPSu93NmHeJSlDeDhnOhNnl6aoqqt3WflN7Q==">
<link rel="stylesheet" href="https://example.org/css/styles.9d797fdbc9887767b3ad88393155cb84288660765fe6e18c89e2e00fd5ecfb0b9f46384188a0ae4e8b63f4c81526872e0ff61d1d5204287a0c3c8b6e8e34b6b9.css" integrity="sha512-nXl/28mId2ezrYg5MVXLhCiGYHZf5uGMieLgD9Xs&#43;wufRjhBiKCuTotj9MgVJocuD/YdHVIEKHoMPItujjS2uQ==">
<link href="/css/fontawesome.css" rel="stylesheet" />
<link href="/css/brands.css" rel="stylesheet" />
@ -35,6 +35,14 @@
</head>
<body>
<div class="banner">
<span class="banner-text">
&#x1f6a7; This site is a work in progress. Don&rsquo;t be shy to submit an <a href="https://gitmoss.fyi/fmtools/content/issues/new/choose" target="_blank" >issue</a> or <a href="https://gitmoss.fyi/fmtools/content/fork" target="_blank" >pull request</a> &#x1f6a7;
</span>
</div>
<header>
<h1><a href="/">Formal Methods Tools</a></h1>
@ -156,6 +164,14 @@ APIs and Bindings This tool is available through the …</td>
</tr>
<tr onclick="window.location='\/tools\/prob\/stamina\/'" style="cursor:pointer;">
<td class="tool"><a href="/tools/prob/stamina/">STAMINA</a></td>
<td class="description">A state-space truncation tool for Markov-Chains that can analyze infinite-sized models. Intefaces …</td>
</tr>
<tr onclick="window.location='\/tools\/sat-smt\/stp\/'" style="cursor:pointer;">
@ -183,6 +199,7 @@ APIs and Bindings This …</td>
<footer>
<p><a href="/contribute">Contribute</a> &nbsp;|&nbsp; <a href="/about">About</a> &nbsp;|&nbsp; <a href="/license">License</a> &nbsp;|&nbsp; <a href="/privacy">Privacy</a> </p>
<p>&copy; Copyright 2025. An open-source project.</p>
</footer>

View File

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