Files
public/maintenance/actively-maintained/index.xml

391 lines
30 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>Actively Maintained on Formal Methods Tools</title>
<link>https://fmtools.fyi/maintenance/actively-maintained/</link>
<description>Recent content in Actively Maintained 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="https://fmtools.fyi/maintenance/actively-maintained/index.xml" rel="self" type="application/rss+xml" />
<item>
<title>Alt-Ergo</title>
<link>https://fmtools.fyi/tools/sat-smt/alt-ergo/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/sat-smt/alt-ergo/</guid>
<description>&lt;p&gt;Alt-Ergo is an automatic prover of mathematical formulas used behind software verification tools such as Frama-C, SPARK, Why3, Atelier-B and Caveat.&lt;/p&gt;</description>
</item>
<item>
<title>Bitwuzla</title>
<link>https://fmtools.fyi/tools/sat-smt/bitwuzla/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/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>CaDiCaL</title>
<link>https://fmtools.fyi/tools/sat-smt/cadical/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/sat-smt/cadical/</guid>
<description>&lt;p&gt;CaDiCaL is a simplified satisfiability solver.&lt;/p&gt;</description>
</item>
<item>
<title>CADP</title>
<link>https://fmtools.fyi/tools/mc/cadp/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/cadp/</guid>
<description>&lt;p&gt;&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(226, 181, 59);&#34;&gt;&lt;/span&gt;&#xA; &lt;span style=&#34;display:none&#34;&gt;[&lt;/span&gt;&#xA; &lt;span style=&#34;color: rgb(226, 181, 59); font-size: 1rem;&#34;&gt;Closed-Source Tool&lt;/span&gt;&#xA; &lt;span style=&#34;display:none&#34;&gt;]&amp;nbsp;&lt;/span&gt;&#xA;&lt;/div&gt;&#xA;CADP (&amp;ldquo;Construction and Analysis of Distributed Processes&amp;rdquo;, formerly known as &amp;ldquo;CAESAR/ALDEBARAN Development Package&amp;rdquo;) is a toolbox for the design of asynchronous concurrent systems, such as communication protocols, distributed systems, asynchronous circuits, multiprocessor architectures, web services, etc.&lt;/p&gt;</description>
</item>
<item>
<title>Caesar</title>
<link>https://fmtools.fyi/tools/prob/caesar/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/prob/caesar/</guid>
<description>&lt;p&gt;Storm is a tool for the analysis of systems involving random or probabilistic phenomena.&lt;/p&gt;</description>
</item>
<item>
<title>CGAAL</title>
<link>https://fmtools.fyi/tools/mc/cgaal/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/cgaal/</guid>
<description>&lt;p&gt;CGAAL is a model checker of alternating-time temporal logic (ATL) properties on concurrent game structures (CGSs).&lt;/p&gt;</description>
</item>
<item>
<title>Colibri</title>
<link>https://fmtools.fyi/tools/sat-smt/colibri/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/sat-smt/colibri/</guid>
<description>&lt;p&gt;Colibri is an SMT solver.&lt;/p&gt;</description>
</item>
<item>
<title>Concuerror</title>
<link>https://fmtools.fyi/tools/mc/concuerror/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/concuerror/</guid>
<description>&lt;p&gt;Concuerror is a stateless model checking tool for Erlang programs.&lt;/p&gt;</description>
</item>
<item>
<title>CPAchecker</title>
<link>https://fmtools.fyi/tools/mc/cpachecker/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/cpachecker/</guid>
<description>&lt;p&gt;&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(226, 181, 59);&#34;&gt;&lt;/span&gt;&#xA; &lt;span style=&#34;display:none&#34;&gt;[&lt;/span&gt;&#xA; &lt;span style=&#34;color: rgb(226, 181, 59); font-size: 1rem;&#34;&gt;Closed-Source Tool&lt;/span&gt;&#xA; &lt;span style=&#34;display:none&#34;&gt;]&amp;nbsp;&lt;/span&gt;&#xA;&lt;/div&gt;&#xA;CPAchecker is a tool for configurable software verification.&lt;/p&gt;</description>
</item>
<item>
<title>CryptoMiniSat</title>
<link>https://fmtools.fyi/tools/sat-smt/cryptominisat/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/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>cvc5</title>
<link>https://fmtools.fyi/tools/sat-smt/cvc5/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/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>DSCheck</title>
<link>https://fmtools.fyi/tools/mc/dscheck/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/dscheck/</guid>
<description>&lt;p&gt;DSCheck is an experimental model checker for testing concurrent OCaml programs.&lt;/p&gt;</description>
</item>
<item>
<title>E</title>
<link>https://fmtools.fyi/tools/sat-smt/e/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/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>Eldarica</title>
<link>https://fmtools.fyi/tools/mc/eldarica/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/eldarica/</guid>
<description>&lt;p&gt;Eldarica is a model checker for Horn clauses, Numerical Transition Systems, and software programs.&lt;/p&gt;</description>
</item>
<item>
<title>ESBMC</title>
<link>https://fmtools.fyi/tools/mc/esbmc/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/esbmc/</guid>
<description>&lt;p&gt;ESBMC is a context-bounded model checker based on satisfiability modulo theories for verifying single- and multi-threaded C/C++ programs.&lt;/p&gt;</description>
</item>
<item>
<title>Geyser</title>
<link>https://fmtools.fyi/tools/mc/geyser/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/geyser/</guid>
<description>&lt;p&gt;Geyser is a simple symbolic model checker for propositional transition system systems.&lt;/p&gt;</description>
</item>
<item>
<title>Glucose</title>
<link>https://fmtools.fyi/tools/sat-smt/glucose/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/sat-smt/glucose/</guid>
<description>&lt;p&gt;Glucose is a SAT solver.&lt;/p&gt;</description>
</item>
<item>
<title>IMITATOR</title>
<link>https://fmtools.fyi/tools/mc/imitator/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/imitator/</guid>
<description>&lt;p&gt;IMITATOR is a parametric timed model checker taking as input extensions of parametric timed automata, and synthesizing parameter valuations for safety properties and more.&lt;/p&gt;</description>
</item>
<item>
<title>ImSpin</title>
<link>https://fmtools.fyi/tools/mc/imspin/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/imspin/</guid>
<description>&lt;p&gt;ImSpin is a frontend for the &lt;a href=&#34;../spin&#34; &gt;SPIN&lt;/a&gt; model checker, providing an environment for users engaged in model checking tasks.&lt;/p&gt;</description>
</item>
<item>
<title>JANI</title>
<link>https://fmtools.fyi/tools/mod/jani/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mod/jani/</guid>
<description>&lt;p&gt;The JANI specification defines the jani-model model interchange format and the jani-interaction tool interaction and automation protocol.&lt;/p&gt;</description>
</item>
<item>
<title>Kind 2</title>
<link>https://fmtools.fyi/tools/mc/kind2/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/kind2/</guid>
<description>&lt;p&gt;Kind 2 is a multi-engine SMT-based automatic model checker for synchronous reactive systems.&lt;/p&gt;</description>
</item>
<item>
<title>LEAN</title>
<link>https://fmtools.fyi/tools/sat-smt/lean/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/sat-smt/lean/</guid>
<description>&lt;p&gt;cvc5 is an automatic theorem prover for SMT problems.&lt;/p&gt;</description>
</item>
<item>
<title>Lingeling</title>
<link>https://fmtools.fyi/tools/sat-smt/lingeling/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/sat-smt/lingeling/</guid>
<description>&lt;p&gt;Lingeling is a SAT solver.&lt;/p&gt;</description>
</item>
<item>
<title>LTSmin</title>
<link>https://fmtools.fyi/tools/mc/ltsmin/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/ltsmin/</guid>
<description>&lt;p&gt;LTSmin started out as a generic toolset for manipulating labelled transition systems. Meanwhile the toolset was extended to a a full (LTL/CTL/μ-calculus) model checker, while maintaining its language-independent characteristics.&lt;/p&gt;</description>
</item>
<item>
<title>MathSAT</title>
<link>https://fmtools.fyi/tools/sat-smt/mathsat/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/sat-smt/mathsat/</guid>
<description>&lt;p&gt;&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(226, 181, 59);&#34;&gt;&lt;/span&gt;&#xA; &lt;span style=&#34;display:none&#34;&gt;[&lt;/span&gt;&#xA; &lt;span style=&#34;color: rgb(226, 181, 59); font-size: 1rem;&#34;&gt;Closed-Source Tool&lt;/span&gt;&#xA; &lt;span style=&#34;display:none&#34;&gt;]&amp;nbsp;&lt;/span&gt;&#xA;&lt;/div&gt;&#xA;MathSAT is an SMT solver supporting a wide range of theories (including e.g. equality and uninterpreted functions, linear arithmetic, bit-vectors, and arrays) and functionalities (including e.g. computation of Craig interpolants, extraction of unsatisfiable cores, generation of models and proofs, and the ability of working incrementally).&lt;/p&gt;</description>
</item>
<item>
<title>mCRL2</title>
<link>https://fmtools.fyi/tools/mc/mcrl2/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/mcrl2/</guid>
<description>&lt;p&gt;mCRL2 is a formal specification language with an associated toolset. The toolset can be used for modelling, validation and verification of concurrent systems and protocols.&lt;/p&gt;</description>
</item>
<item>
<title>Momba</title>
<link>https://fmtools.fyi/tools/mod/momba/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mod/momba/</guid>
<description>&lt;p&gt;Momba is a Python framework for dealing with quantitative models centered around the &lt;a href=&#34;../jani&#34; &gt;JANI-model&lt;/a&gt; interchange format.&lt;/p&gt;</description>
</item>
<item>
<title>NuSMV</title>
<link>https://fmtools.fyi/tools/mc/nusmv/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/nusmv/</guid>
<description>&lt;p&gt;NuSMV is a symbolic model checker.&lt;/p&gt;</description>
</item>
<item>
<title>NuXMV</title>
<link>https://fmtools.fyi/tools/mc/nuxmv/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/nuxmv/</guid>
<description>&lt;p&gt;&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(226, 181, 59);&#34;&gt;&lt;/span&gt;&#xA; &lt;span style=&#34;display:none&#34;&gt;[&lt;/span&gt;&#xA; &lt;span style=&#34;color: rgb(226, 181, 59); font-size: 1rem;&#34;&gt;Closed-Source Tool&lt;/span&gt;&#xA; &lt;span style=&#34;display:none&#34;&gt;]&amp;nbsp;&lt;/span&gt;&#xA;&lt;/div&gt;&#xA;nuXmv is a symbolic model checker for the analysis of synchronous finite-state and infinite-state systems.&lt;/p&gt;</description>
</item>
<item>
<title>OpenSMT</title>
<link>https://fmtools.fyi/tools/sat-smt/opensmt/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/sat-smt/opensmt/</guid>
<description>&lt;p&gt;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 &lt;a href=&#34;https://fmtools.fyi/tools/minisat&#34; &gt;MiniSAT&lt;/a&gt;.&lt;/p&gt;</description>
</item>
<item>
<title>ParaFROST</title>
<link>https://fmtools.fyi/tools/sat-smt/parafrost/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/sat-smt/parafrost/</guid>
<description>&lt;p&gt;ParaFROST is a parallel SAT solver with GPU-accelerated inprocessing capable of harnessing NVIDIA CUDA-enabled GPUs in applying modern inprocessing tecnhiques in parallel.&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>Pnmc</title>
<link>https://fmtools.fyi/tools/mc/pnmc/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/pnmc/</guid>
<description>&lt;p&gt;Pnmc is a symbolic model checker for Petri nets.&lt;/p&gt;</description>
</item>
<item>
<title>PRISM</title>
<link>https://fmtools.fyi/tools/prob/prism/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/prob/prism/</guid>
<description>&lt;p&gt;PRISM is a probabilistic model checker, a tool for formal modelling and analysis of systems that exhibit random or probabilistic behaviour.&lt;/p&gt;</description>
</item>
<item>
<title>pyPL</title>
<link>https://fmtools.fyi/tools/mc/pypl/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/pypl/</guid>
<description>&lt;p&gt;pyPL is a naive model generator, model checker and theorem prover.&lt;/p&gt;</description>
</item>
<item>
<title>Roméo</title>
<link>https://fmtools.fyi/tools/mc/romeo/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/romeo/</guid>
<description>&lt;p&gt;Romeo allows the modelling of complex systems using extensions of time Petri nets.&lt;/p&gt;</description>
</item>
<item>
<title>Rumur</title>
<link>https://fmtools.fyi/tools/mc/rumur/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/rumur/</guid>
<description>&lt;p&gt;Rumur is a model checker.&lt;/p&gt;</description>
</item>
<item>
<title>Sally</title>
<link>https://fmtools.fyi/tools/mc/sally/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/sally/</guid>
<description>&lt;p&gt;Sally is a model checker for infinite state systems described as transition systems.&lt;/p&gt;</description>
</item>
<item>
<title>SM(P/)T</title>
<link>https://fmtools.fyi/tools/mc/smpt/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/smpt/</guid>
<description>&lt;p&gt;SMPT is a SMT-based model checker for Petri nets focused on reachability problems that takes advantage of net reductions (polyhedral reductions).&lt;/p&gt;</description>
</item>
<item>
<title>SMT-RAT</title>
<link>https://fmtools.fyi/tools/sat-smt/smt-rat/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/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>SMTInterpol</title>
<link>https://fmtools.fyi/tools/sat-smt/smtinterpol/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/sat-smt/smtinterpol/</guid>
<description>&lt;p&gt;SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories.&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;Java API:&lt;/strong&gt; &lt;a href=&#34;https://ultimate.informatik.uni-freiburg.de/smtinterpol/doc/index.html&#34; target=&#34;_blank&#34; &gt;Java API Reference&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
</item>
<item>
<title>SpaceEx</title>
<link>https://fmtools.fyi/tools/mc/spaceex/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/spaceex/</guid>
<description>&lt;p&gt;The SpaceEx tool platform is designed to facilitate the implementation of algorithms related to reachability and safety verification in continuous and hybrid systems.&lt;/p&gt;</description>
</item>
<item>
<title>Spin</title>
<link>https://fmtools.fyi/tools/mc/spin/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/spin/</guid>
<description>&lt;p&gt;Spin is a model checker for multi-threaded software.&lt;/p&gt;</description>
</item>
<item>
<title>STAMINA</title>
<link>https://fmtools.fyi/tools/prob/stamina/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/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>stateright</title>
<link>https://fmtools.fyi/tools/mc/stateright/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/stateright/</guid>
<description>&lt;p&gt;&lt;code&gt;stateright&lt;/code&gt; is a Rust library for model checking systems, with an emphasis on distributed systems.&lt;/p&gt;</description>
</item>
<item>
<title>Storm</title>
<link>https://fmtools.fyi/tools/prob/storm/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/prob/storm/</guid>
<description>&lt;p&gt;Storm is a tool for the analysis of systems involving random or probabilistic phenomena.&lt;/p&gt;</description>
</item>
<item>
<title>STP</title>
<link>https://fmtools.fyi/tools/sat-smt/stp/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/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>TAPAAL</title>
<link>https://fmtools.fyi/tools/mc/tapaal/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/tapaal/</guid>
<description>&lt;p&gt;TAPAAL is a tool for verification of timed-arc petri nets&lt;/p&gt;</description>
</item>
<item>
<title>TLA&#43;</title>
<link>https://fmtools.fyi/tools/mod/tlaplus/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mod/tlaplus/</guid>
<description>&lt;p&gt;TLA+ is a high-level language for modeling programs and systems&amp;ndash;especially concurrent and distributed ones.&lt;/p&gt;</description>
</item>
<item>
<title>Uppaal</title>
<link>https://fmtools.fyi/tools/mc/uppaal/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/mc/uppaal/</guid>
<description>&lt;p&gt;&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(226, 181, 59);&#34;&gt;&lt;/span&gt;&#xA; &lt;span style=&#34;display:none&#34;&gt;[&lt;/span&gt;&#xA; &lt;span style=&#34;color: rgb(226, 181, 59); font-size: 1rem;&#34;&gt;Closed-Source Tool&lt;/span&gt;&#xA; &lt;span style=&#34;display:none&#34;&gt;]&amp;nbsp;&lt;/span&gt;&#xA;&lt;/div&gt;&#xA;Uppaal is an integrated tool environment for modeling, validation and verification of real-time systems modeled as networks of timed automata, extended with data types (bounded integers, arrays, etc.).&lt;/p&gt;</description>
</item>
<item>
<title>Vampire</title>
<link>https://fmtools.fyi/tools/sat-smt/vampire/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/sat-smt/vampire/</guid>
<description>&lt;p&gt;Vampire is a theorem prover.&lt;/p&gt;</description>
</item>
<item>
<title>veriT</title>
<link>https://fmtools.fyi/tools/sat-smt/verit/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/sat-smt/verit/</guid>
<description>&lt;p&gt;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.&lt;/p&gt;</description>
</item>
<item>
<title>Yices 2</title>
<link>https://fmtools.fyi/tools/sat-smt/yices/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/tools/sat-smt/yices/</guid>
<description>&lt;p&gt;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.&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;General API:&lt;/strong&gt; &lt;a href=&#34;https://yices.csl.sri.com/doc/index.html&#34; target=&#34;_blank&#34; &gt;Yices 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/yices/&#34; target=&#34;_blank&#34; &gt;yices2 PyPI package&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/yices2&#34; target=&#34;_blank&#34; &gt;yices2 crate on crates.io&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
</item>
<item>
<title>Z3</title>
<link>https://fmtools.fyi/tools/sat-smt/z3/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/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>https://fmtools.fyi/tools/sat-smt/zipperposition/</link>
<pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
<guid>https://fmtools.fyi/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>
</channel>
</rss>