Stanford University on Formal Methods Tools https://example.org/developers/stanford-university/ Recent content in Stanford University on Formal Methods Tools Hugo en-us Sat, 07 Jun 2025 00:00:00 +0000 Bitwuzla https://example.org/tools/sat-smt/bitwuzla/ Sat, 07 Jun 2025 00:00:00 +0000 https://example.org/tools/sat-smt/bitwuzla/ <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> Boolector https://example.org/tools/sat-smt/boolector/ Sat, 07 Jun 2025 00:00:00 +0000 https://example.org/tools/sat-smt/boolector/ <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> cvc4 https://example.org/tools/sat-smt/cvc4/ Sat, 07 Jun 2025 00:00:00 +0000 https://example.org/tools/sat-smt/cvc4/ <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> cvc5 https://example.org/tools/sat-smt/cvc5/ Sat, 07 Jun 2025 00:00:00 +0000 https://example.org/tools/sat-smt/cvc5/ <p>cvc5 is an automatic theorem prover for SMT problems.</p> STP https://example.org/tools/sat-smt/stp/ Sat, 07 Jun 2025 00:00:00 +0000 https://example.org/tools/sat-smt/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>