<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Arithmetic on Formal Methods Tools</title>
    <link>http://localhost:1313/formalisms/arithmetic/</link>
    <description>Recent content in Arithmetic on Formal Methods Tools</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Fri, 02 Feb 2024 04:14:54 -0800</lastBuildDate>
    <atom:link href="http://localhost:1313/formalisms/arithmetic/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Yices 2</title>
      <link>http://localhost:1313/tools/yices/</link>
      <pubDate>Fri, 02 Feb 2024 04:14:54 -0800</pubDate>
      <guid>http://localhost:1313/tools/yices/</guid>
      <description>&lt;p&gt;Yices is a high-performance SMT solver and theorem prover developed by SRI International. It is widely used for checking the satisfiability of logical formulas over various theories, including arithmetic, bit-vectors, arrays, and uninterpreted functions. Yices supports the SMT-LIB standard and its own input language, and provides APIs for several programming languages, making it suitable for integration into formal verification, program analysis, and constraint solving tools.&lt;/p&gt;&#xA;&lt;h3 id=&#34;features&#34;&gt;Features&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;SMT Solver:&lt;/strong&gt; Supports a wide range of theories and quantifiers.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Multi-language APIs:&lt;/strong&gt; C, OCaml, Python, and more.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Cross-platform:&lt;/strong&gt; Available on Windows, Linux, and macOS.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Active development:&lt;/strong&gt; Open source and maintained by SRI International.&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
    </item>
    <item>
      <title>Z3</title>
      <link>http://localhost:1313/tools/z3/</link>
      <pubDate>Fri, 02 Feb 2024 04:14:54 -0800</pubDate>
      <guid>http://localhost:1313/tools/z3/</guid>
      <description>&lt;p&gt;Z3 is a high-performance SMT solver and theorem prover developed by Microsoft Research. It is widely used for checking the satisfiability of logical formulas over various theories, including arithmetic, bit-vectors, arrays, and uninterpreted functions. Z3 supports the SMT-LIB standard and provides APIs for several programming languages, making it suitable for integration into formal verification, program analysis, and constraint solving tools.&lt;/p&gt;&#xA;&lt;h3 id=&#34;features&#34;&gt;Features&lt;/h3&gt;&#xA;&lt;ul&gt;&#xA;&lt;li&gt;&lt;strong&gt;SMT Solver:&lt;/strong&gt; Supports a wide range of theories and quantifiers.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Multi-language APIs:&lt;/strong&gt; Python, C++, Java, .NET, and more.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Cross-platform:&lt;/strong&gt; Available on Windows, Linux, and macOS.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Active development:&lt;/strong&gt; Open source and maintained by Microsoft Research.&lt;/li&gt;&#xA;&lt;li&gt;&lt;strong&gt;Web Playground:&lt;/strong&gt; Try Z3 online at &lt;a href=&#34;https://rise4fun.com/z3&#34;&gt;Rise4Fun&lt;/a&gt;.&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
    </item>
  </channel>
</rss>
