public/applications/theorem-prover/index.xml

<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Theorem Prover on Formal Methods Tools</title>
    <link>http://localhost:1313/applications/theorem-prover/</link>
    <description>Recent content in Theorem Prover 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/applications/theorem-prover/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Bitwuzla</title>
      <link>http://localhost:1313/tools/sat-smt/bitwuzla/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/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>
      <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>
    </item>
    <item>
      <title>cvc4</title>
      <link>http://localhost:1313/tools/sat-smt/cvc4/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/sat-smt/cvc4/</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 2021&lt;/span&gt;&#xA;    &#xA;    &lt;span style=&#34;display:none&#34;&gt;]&lt;/span&gt;&#xA;&lt;/div&gt;&#xA;cvc4 is an automatic theorem prover for SMT problems. It is succeeded by &lt;a href=&#34;../cvc5&#34;&gt;cvc5&lt;/a&gt;&lt;/p&gt;</description>
    </item>
    <item>
      <title>cvc5</title>
      <link>http://localhost:1313/tools/sat-smt/cvc5/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/sat-smt/cvc5/</guid>
      <description>&lt;p&gt;cvc5 is an automatic theorem prover for SMT problems.&lt;/p&gt;</description>
    </item>
    <item>
      <title>STP</title>
      <link>http://localhost:1313/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>
    </item>
    <item>
      <title>Z3</title>
      <link>http://localhost:1313/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>
    </item>
  </channel>
</rss>