<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://community.research.microsoft.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Z3: Theorem Prover</title><link>http://community.research.microsoft.com/blogs/z3theorem_prover/default.aspx</link><description>Z3 is a new high-performance theorem prover being developed at Microsoft Research. Z3 supports linear real and integer arithmetic, fixed-size bit-vectors, extensional arrays, uninterpreted functions, and quantifiers. Z3 has already been integrated with Spec#/Boogie, and HAVOC. We are currently integrating Z3 with Pex, SAGE, Yogi, Vigilante, and SLAM. It can read problems in SMT-LIB and Simplify formats.</description><dc:language>en</dc:language><generator>CommunityServer 2007.1 (Build: 20917.1142)</generator><item><title>Documentation</title><link>http://community.research.microsoft.com/blogs/z3theorem_prover/archive/2008/01/08/documentation.aspx</link><pubDate>Tue, 08 Jan 2008 19:44:00 GMT</pubDate><guid isPermaLink="false">eaca9afb-5ccf-4c08-b3f3-369c7e6f1a06:298</guid><dc:creator>Leonardo de Moura</dc:creator><slash:comments>1</slash:comments><wfw:commentRss xmlns:wfw="http://wellformedweb.org/CommentAPI/">http://community.research.microsoft.com/blogs/z3theorem_prover/rsscomments.aspx?PostID=298</wfw:commentRss><comments>http://community.research.microsoft.com/blogs/z3theorem_prover/archive/2008/01/08/documentation.aspx#comments</comments><description>Online documentation: http://research.microsoft.com/projects/z3/documentation.html FAQ: http://research.microsoft.com/projects/z3/faq.html...(&lt;a href="http://community.research.microsoft.com/blogs/z3theorem_prover/archive/2008/01/08/documentation.aspx"&gt;read more&lt;/a&gt;)&lt;img src="http://community.research.microsoft.com/aggbug.aspx?PostID=298" width="1" height="1"&gt;</description></item><item><title>SMT-COMP 2007</title><link>http://community.research.microsoft.com/blogs/z3theorem_prover/archive/2008/01/08/smt-comp-2007.aspx</link><pubDate>Tue, 08 Jan 2008 19:21:00 GMT</pubDate><guid isPermaLink="false">eaca9afb-5ccf-4c08-b3f3-369c7e6f1a06:295</guid><dc:creator>Leonardo de Moura</dc:creator><slash:comments>0</slash:comments><wfw:commentRss xmlns:wfw="http://wellformedweb.org/CommentAPI/">http://community.research.microsoft.com/blogs/z3theorem_prover/rsscomments.aspx?PostID=295</wfw:commentRss><comments>http://community.research.microsoft.com/blogs/z3theorem_prover/archive/2008/01/08/smt-comp-2007.aspx#comments</comments><description>&lt;p&gt;Z3 did very well in the recent &lt;a class="external text" title="http://www.smt-comp.org" href="http://www.smt-comp.org/" rel="nofollow"&gt;2007 SMT Competition&lt;/a&gt;: it won&amp;nbsp;4 divisions and took 7 second places.&lt;/p&gt;&lt;img src="http://community.research.microsoft.com/aggbug.aspx?PostID=295" width="1" height="1"&gt;</description></item></channel></rss>