<?xml version="1.0" encoding="utf-8"?>
<feed version="0.3" xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="https://gamma.unpythonic.net/"/>

<title>Jeff Epler's blog</title>
<modified>2015-08-05T13:13:49Z</modified>
<tagline>Photos, electronics, cnc, and more</tagline>
<author><name>Jeff Epler</name><email>jepler@unpythonic.net</email></author>
<entry>
<title>Proven Delights (and what are proofs anyway)</title>
<issued>2015-08-05T13:13:49Z</issued>
<modified>2015-08-05T13:13:49Z</modified>
<id>https://gamma.unpythonic.net/01438780429</id>
<link rel="alternate" type="text/html" href="https://gamma.unpythonic.net/01438780429"/>
<content type="text/html" mode="escaped">
I won a copy of the book &lt;a href=&quot;http://hackersdelight.org/&quot;&gt;Hacker's
Delight&lt;/a&gt; from &lt;a href=&quot;http://blog.regehr.org/&quot;&gt;John Regehr&lt;/a&gt; for my entry in
his &lt;a href=&quot;http://blog.regehr.org/archives/1213&quot;&gt;nibble sort contest&lt;/a&gt;
earlier this year.

&lt;p&gt;In that thread I had heard about the &lt;a href=&quot;http://www.cprover.org/cbmc/&quot;&gt;CBMC Bounded Model Checking software&lt;/a&gt;, and it gave me the idea to combine
the two: a project to take implementations of the algorithms from Hacker's
Delight and prove the algorithms' properties with CBMC.

&lt;p&gt;I have a modest start on github, which I am calling &amp;quot;Proven Delights&amp;quot;:</content>
</entry>
</feed>
