fmtools/public
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

rebuild

Browse Source
This commit is contained in:
Landon Taylor
2025-06-13 15:05:28 -06:00
parent a43350989a
commit 5cfeefe269
158 changed files with 13647 additions and 339 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
index.xml
View File

@ -29,6 +29,13 @@
<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>
</item>
<item>
<title>CaDiCaL</title>
<link>http://localhost:1313/tools/sat-smt/cadical/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>http://localhost:1313/tools/sat-smt/cadical/</guid>
<description>&lt;p&gt;CaDiCaL is a simplified satisfiability solver.&lt;/p&gt;</description>
</item>
<item>
<title>Colibri</title>
<link>http://localhost:1313/tools/sat-smt/colibri/</link>
@ -36,6 +43,13 @@
<guid>http://localhost:1313/tools/sat-smt/colibri/</guid>
<description>&lt;p&gt;Colibri is an SMT solver.&lt;/p&gt;</description>
</item>
<item>
<title>COMICS</title>
<link>http://localhost:1313/tools/prob/comics/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>http://localhost:1313/tools/prob/comics/</guid>
<description>&lt;p&gt;COMICS is a stand-alone tool which performs model checking and the generation of counterexamples for discrete-time Markov Chains (DTMCs).&lt;/p&gt;</description>
</item>
<item>
<title>CryptoMiniSat</title>
<link>http://localhost:1313/tools/sat-smt/cryptominisat/</link>
@ -64,6 +78,13 @@
<guid>http://localhost:1313/tools/sat-smt/dreal/</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;dReal is an automated reasoning tool. It focuses on solving problems that can be encoded as first-order logic formulas over the real numbers. Its special strength is in handling problems that involve a wide range of nonlinear real functions.&lt;/p&gt;</description>
</item>
<item>
<title>E</title>
<link>http://localhost:1313/tools/sat-smt/e/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>http://localhost:1313/tools/sat-smt/e/</guid>
<description>&lt;p&gt;E is a theorem prover for full first-order logic (and now monomorphic higher-order logic) with equality.&lt;/p&gt;</description>
</item>
<item>
<title>Glucose</title>
<link>http://localhost:1313/tools/sat-smt/glucose/</link>
@ -169,6 +190,13 @@
<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; 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>Vampire</title>
<link>http://localhost:1313/tools/sat-smt/vampire/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>http://localhost:1313/tools/sat-smt/vampire/</guid>
<description>&lt;p&gt;Vampire is a theorem prover.&lt;/p&gt;</description>
</item>
<item>
<title>veriT</title>
<link>http://localhost:1313/tools/sat-smt/verit/</link>
@ -190,6 +218,13 @@
<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; 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>
<item>
<title>Zipperposition</title>
<link>http://localhost:1313/tools/sat-smt/zipperposition/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>http://localhost:1313/tools/sat-smt/zipperposition/</guid>
<description>&lt;p&gt;Zipperposition is an automated theorem prover for first-order logic with equality and theories.&lt;/p&gt;</description>
</item>
<item>
<title>About</title>
<link>http://localhost:1313/about/</link>