<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>The Ultimate Formal Methods Toolbox on Formal Methods Tools</title>
    <link>http://localhost:1313/</link>
    <description>Recent content in The Ultimate Formal Methods Toolbox 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/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Glucose</title>
      <link>http://localhost:1313/tools/glucose/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/glucose/</guid>
      <description>&lt;p&gt;Glucose is a SAT solver.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Lingeling</title>
      <link>http://localhost:1313/tools/lingeling/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/lingeling/</guid>
      <description>&lt;p&gt;Lingeling is a SAT solver.&lt;/p&gt;</description>
    </item>
    <item>
      <title>MathSAT</title>
      <link>http://localhost:1313/tools/mathsat/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/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;MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.&lt;/p&gt;</description>
    </item>
    <item>
      <title>MiniSat</title>
      <link>http://localhost:1313/tools/minisat/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/minisat/</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 2013&lt;/span&gt;&#xA;    &#xA;    &lt;span style=&#34;display:none&#34;&gt;]&lt;/span&gt;&#xA;&lt;/div&gt;&#xA;MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.&lt;/p&gt;</description>
    </item>
    <item>
      <title>OpenSMT</title>
      <link>http://localhost:1313/tools/opensmt/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/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;http://localhost:1313/tools/minisat&#34;&gt;MiniSAT&lt;/a&gt;.&lt;/p&gt;</description>
    </item>
    <item>
      <title>ParaFROST</title>
      <link>http://localhost:1313/tools/parafrost/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/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;&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>
    <item>
      <title>Q3B</title>
      <link>http://localhost:1313/tools/q3b/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/q3b/</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;Q3B is an SMT solver for the quantified bit-vector formulas which uses BDDs.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Riss</title>
      <link>http://localhost:1313/tools/riss/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/riss/</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 2017&lt;/span&gt;&#xA;    &#xA;    &lt;span style=&#34;display:none&#34;&gt;]&lt;/span&gt;&#xA;&lt;/div&gt;&#xA;Riss is a SAT solving tool collection.&lt;/p&gt;</description>
    </item>
    <item>
      <title>SMT-RAT</title>
      <link>http://localhost:1313/tools/smt-rat/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/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;&gt;C++ API Reference&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
    </item>
    <item>
      <title>SMTInterpol</title>
      <link>http://localhost:1313/tools/smtinterpol/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/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;&gt;Java API Reference&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
    </item>
    <item>
      <title>STP</title>
      <link>http://localhost:1313/tools/stp/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/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>veriT</title>
      <link>http://localhost:1313/tools/verit/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/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>http://localhost:1313/tools/yices/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/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;&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;&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;&gt;yices2 crate on crates.io&lt;/a&gt;&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
    </item>
    <item>
      <title>Z3</title>
      <link>http://localhost:1313/tools/z3/</link>
      <pubDate>Sat, 07 Jun 2025 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/tools/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>
    <item>
      <title>About</title>
      <link>http://localhost:1313/about/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/about/</guid>
      <description>&lt;p&gt;The Formal Methods Tools project is dedicated to developing, maintaining, and promoting tools that support the application of formal methods in software engineering. Our goal is to make formal verification, specification, and analysis techniques accessible and practical for both researchers and practitioners.&lt;/p&gt;&#xA;&lt;h2 id=&#34;key-objectives&#34;&gt;Key Objectives&lt;/h2&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Provide a comprehensive list of tools for formal methods.&lt;/li&gt;&#xA;&lt;li&gt;Group tools by rich metadata to support collaboration and boost tools&amp;rsquo; strengths.&lt;/li&gt;&#xA;&lt;li&gt;Foster a collaborative community for tool development and support.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;h2 id=&#34;whos-behind-this&#34;&gt;Who&amp;rsquo;s Behind This?&lt;/h2&gt;&#xA;&lt;p&gt;Howdy. My name is Landon Taylor. I sometimes go by mossBiscuits.&#xA;This is one of my hobby projects.&#xA;I have a passion for formal methods. When I started learning about verification, there was a sharp barrier to entry due partially to the sprawl of content online.&#xA;I wanted to solve this problem, so I have been chipping away at this website for a while now.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Contribute</title>
      <link>http://localhost:1313/contribute/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/contribute/</guid>
      <description>&lt;p&gt;Instructions coming soon. Please see &lt;a href=&#34;https://gitmoss.fyi/fmtools/content/wiki/Contribute&#34;&gt;https://gitmoss.fyi/fmtools/content/wiki/Contribute&lt;/a&gt; for temporary instructions.&lt;/p&gt;</description>
    </item>
    <item>
      <title>MIT License</title>
      <link>http://localhost:1313/license/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/license/</guid>
      <description>&lt;p&gt;MIT License&lt;/p&gt;&#xA;&lt;p&gt;Copyright (c) 2025 Landon Taylor.&lt;/p&gt;&#xA;&lt;p&gt;Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the &amp;ldquo;Software&amp;rdquo;), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:&lt;/p&gt;</description>
    </item>
    <item>
      <title>Privacy</title>
      <link>http://localhost:1313/privacy/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>http://localhost:1313/privacy/</guid>
      <description>&lt;p&gt;This website does not collect or track any personal data from visitors. No cookies, personalized analytics, or tracking scripts are used. No ads are shown on this website, and&lt;/p&gt;&#xA;&lt;p&gt;If you choose to contribute content (such as submitting an article or comment), any information you voluntarily provide will be stored as part of the website&amp;rsquo;s content and source code. Only the data you explicitly submit will be saved, and data is not sold by the website&amp;rsquo;s owner. Any information you voluntarily provide as part of a code contribution becomes public information and may be used by the general public as allowed by respective laws and policies.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
