summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorGreg Brown <greg.brown@cl.cam.ac.uk>2022-03-31 18:05:33 +0100
committerGreg Brown <greg.brown@cl.cam.ac.uk>2022-03-31 18:05:33 +0100
commit46b6e400a0cba6852181718907fa8adc227fcf7d (patch)
treea06756c8788d4ee4f38d35b7395283c258e9c484
parent84e503f33bf4d87f506a22a7ada5918d185ad0e9 (diff)
Add abstract and top-level skeleton.
-rw-r--r--thesis.org26
1 files changed, 26 insertions, 0 deletions
diff --git a/thesis.org b/thesis.org
index f7527f2..21a5125 100644
--- a/thesis.org
+++ b/thesis.org
@@ -17,3 +17,29 @@
#+latex_header: \usepackage[hyperref=true,url=true,backend=biber,natbib=true]{biblatex}
#+latex_header: \usepackage{savetrees}
#+latex_compiler: pdflatex
+
+#+begin_abstract
+All good implementations of any algorithm should be correct and fast. To
+maximise performance some algorithms are written in hand-tuned assembly. This
+can introduce subtle bugs that invalidate correctness or other safety
+properties. Whilst tools exists to help formally verify these algorithms, none
+are designed to target the recent M-profile Vector Extension for the Armv8.1-M
+architecture. This work describes a denotational and Hoare logic semantics for
+the language used to specify the instructions, and attempts to use them to
+formally verify the correctness of hand-written assembly for cryptographic
+applications.
+#+end_abstract
+
+* Introduction
+
+* Arm Pseudocode
+
+* Denotational Semantics
+
+* Hoare Semantics
+
+* Mathematical Proofs
+
+* Conclusions
+
+#+print_bibliography: