summaryrefslogtreecommitdiff
path: root/tex/thesis/abstract
diff options
context:
space:
mode:
authorCarlo Zancanaro <carlo@pc-4w14-0.cs.usyd.edu.au>2012-11-26 13:59:29 +1100
committerCarlo Zancanaro <carlo@pc-4w14-0.cs.usyd.edu.au>2012-11-26 13:59:29 +1100
commitf823ccc928ae09a63ffef5b6cfe47966e2da1890 (patch)
treef84385f69a51fc43ab37b728ab779f111c552978 /tex/thesis/abstract
parente51b7cbae7cb644a2df2cbc62137f4529aaecef4 (diff)
A bunch more writing. Write write write.
Diffstat (limited to 'tex/thesis/abstract')
-rw-r--r--tex/thesis/abstract/abstract.tex11
1 files changed, 9 insertions, 2 deletions
diff --git a/tex/thesis/abstract/abstract.tex b/tex/thesis/abstract/abstract.tex
index 4333635..2326f61 100644
--- a/tex/thesis/abstract/abstract.tex
+++ b/tex/thesis/abstract/abstract.tex
@@ -1,5 +1,12 @@
\chapter*{Abstract}
-The abstract goes in here.
-
+In today's increasingly technological world, software bugs can have
+significant consequences. In order to limit the effect of these bugs
+software engineers employ a wide variety of tests, but these are
+insufficient to guarantee that software is bug free.
+In this thesis we present an implementation of a game-theoretic static
+analyser described in \cite{EasyChair:117} as a method of finding bugs
+and guaranteeing correctness. We present our own enhancements to
+improve the algorithm's running time and evaluate our improvements on
+a number of benchmarks.