118 lines
13 KiB
XML
118 lines
13 KiB
XML
<?xml version="1.0" encoding="utf-8" standalone="yes"?>
|
|
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
|
|
<channel>
|
|
<title>SMT Solver on Formal Methods Tools</title>
|
|
<link>http://localhost:1313/applications/smt-solver/</link>
|
|
<description>Recent content in SMT Solver 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/smt-solver/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><p>Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.</p></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><p>

<div style="display: flex; align-items: center; gap: 8px;">
 <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span>
 <span style="display:none">[</span>
 
 <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2024</span>
 
 <span style="display:none">]</span>
</div>
Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions.
Succeeded by <a href="../bitwuzla">Bitwuzla</a></p></description>
|
|
</item>
|
|
<item>
|
|
<title>Colibri</title>
|
|
<link>http://localhost:1313/tools/sat-smt/colibri/</link>
|
|
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
|
<guid>http://localhost:1313/tools/sat-smt/colibri/</guid>
|
|
<description><p>Colibri is an SMT solver.</p></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><p>

<div style="display: flex; align-items: center; gap: 8px;">
 <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span>
 <span style="display:none">[</span>
 
 <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2021</span>
 
 <span style="display:none">]</span>
</div>
cvc4 is an automatic theorem prover for SMT problems. It is succeeded by <a href="../cvc5">cvc5</a></p></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><p>cvc5 is an automatic theorem prover for SMT problems.</p></description>
|
|
</item>
|
|
<item>
|
|
<title>dReal</title>
|
|
<link>http://localhost:1313/tools/sat-smt/dreal/</link>
|
|
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
|
<guid>http://localhost:1313/tools/sat-smt/dreal/</guid>
|
|
<description><p>

<div style="display: flex; align-items: center; gap: 8px;">
 <span style="display: inline-block; width: 12px; height: 12px; border-radius: 50%; background: rgb(240, 85, 85);"></span>
 <span style="display:none">[</span>
 
 <span style="color: rgb(240, 85, 85); font-size: 1rem;">Not Maintained Since 2023</span>
 
 <span style="display:none">]</span>
</div>
dReal is an automated reasoning tool. It focuses on solving problems that can be encoded as first-order logic formulas over the real numbers. Its special strength is in handling problems that involve a wide range of nonlinear real functions.</p></description>
|
|
</item>
|
|
<item>
|
|
<title>MathSAT</title>
|
|
<link>http://localhost:1313/tools/sat-smt/mathsat/</link>
|
|
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
|
<guid>http://localhost:1313/tools/sat-smt/mathsat/</guid>
|
|
<description><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></description>
|
|
</item>
|
|
<item>
|
|
<title>OpenSMT</title>
|
|
<link>http://localhost:1313/tools/sat-smt/opensmt/</link>
|
|
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
|
<guid>http://localhost:1313/tools/sat-smt/opensmt/</guid>
|
|
<description><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></description>
|
|
</item>
|
|
<item>
|
|
<title>Q3B</title>
|
|
<link>http://localhost:1313/tools/sat-smt/q3b/</link>
|
|
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
|
<guid>http://localhost:1313/tools/sat-smt/q3b/</guid>
|
|
<description><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></description>
|
|
</item>
|
|
<item>
|
|
<title>SMT-RAT</title>
|
|
<link>http://localhost:1313/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><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></description>
|
|
</item>
|
|
<item>
|
|
<title>SMTInterpol</title>
|
|
<link>http://localhost:1313/tools/sat-smt/smtinterpol/</link>
|
|
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
|
<guid>http://localhost:1313/tools/sat-smt/smtinterpol/</guid>
|
|
<description><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></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><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></description>
|
|
</item>
|
|
<item>
|
|
<title>veriT</title>
|
|
<link>http://localhost:1313/tools/sat-smt/verit/</link>
|
|
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
|
<guid>http://localhost:1313/tools/sat-smt/verit/</guid>
|
|
<description><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></description>
|
|
</item>
|
|
<item>
|
|
<title>Yices 2</title>
|
|
<link>http://localhost:1313/tools/sat-smt/yices/</link>
|
|
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
|
|
<guid>http://localhost:1313/tools/sat-smt/yices/</guid>
|
|
<description><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></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><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></description>
|
|
</item>
|
|
</channel>
|
|
</rss>
|