From ab443f619d207564e4972274c571ef15da70a74c Mon Sep 17 00:00:00 2001
From: Carlo Zancanaro <carlo@pc-4w14-0.cs.usyd.edu.au>
Date: Mon, 26 Nov 2012 20:18:42 +1100
Subject: Thesis thesis thesis.

---
 tex/thesis/litreview/litreview.tex | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

(limited to 'tex/thesis/litreview/litreview.tex')

diff --git a/tex/thesis/litreview/litreview.tex b/tex/thesis/litreview/litreview.tex
index 109864e..38bd9dc 100644
--- a/tex/thesis/litreview/litreview.tex
+++ b/tex/thesis/litreview/litreview.tex
@@ -8,7 +8,7 @@
 \newcommand{\Stmt}{\mathsf{Stmt}}
 \newcommand{\Vars}{\mathsf{Vars}}
 
-\chapter{Preliminaries} \label{chap:litreview}
+\chapter{Background} \label{chap:litreview}
 
 In this chapter we review the relevant literature pertaining to static
 analysis. We briefly cover the semantics of programs generally before
@@ -38,9 +38,9 @@ side-effects, so it is necessary to introduce some notion of ``state''
 into our semantics. By defining $\semantics{\cdot}: \states \to
 \states$ for all statements $x$ we provide a mechanism for statements
 to perform side effects. Elements of $\states$ each represent a
-possible state for the program to be in. For example: for an
-integral assignment statement $I := E$, assigning the value of an
-expression $E$ to a variable $I$, have the following denotation:
+possible state for the program to be in. For example: for an integral
+assignment statement $I := E$, assigning the value of an expression
+$E$ to a variable $I$, we have the following denotation:
 \begin{align*}
   \semantics{I := E} = \lambda \rho . (\rho \oplus \{I \mapsto \semantics{E}(\rho)\})
 \end{align*}
-- 
cgit v1.2.3

