www
/
www
8
0
Fork 0
Code Issues Pull Requests 1 Projects Releases Wiki Activity

I accidentally a word

This commit is contained in:
Patrick Melanson 2015-02-24 16:31:07 -05:00
parent b9d503364b
commit 48a0f20531
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
events.xml
View File

@ -54,10 +54,10 @@
title="SAT and SMT solvers">
<short>
<p>
Murphy Berzish out how to programmatically determine if a program is satisfiable,
Murphy Berzish explains how to programmatically determine if a program is satisfiable,
and how to find a concrete counterexample if it is unsatisfiable. At the core
are SAT/SMT solvers. SAT theory deals with Boolean Satisfiability solvers,
and SMT theory, Satisfiability Modulo a Theory, allows SMT to be extended
while SMT theory--Satisfiability Modulo a Theory--allows SMT to be extended
to common data structures. Free food!
</p>
</short>