From 48a0f205310e9489de8560af89304d95dbec5f80 Mon Sep 17 00:00:00 2001
From: Patrick Melanson <pj2melan@uwaterloo.ca>
Date: Tue, 24 Feb 2015 16:31:07 -0500
Subject: [PATCH] I accidentally a word

---
 events.xml | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/events.xml b/events.xml
index d86861e..0db0958 100644
--- a/events.xml
+++ b/events.xml
@@ -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>