Index: doc/theses/mike_brooks_MMath/array.tex
===================================================================
--- doc/theses/mike_brooks_MMath/array.tex	(revision 6726a3a9cf8ffacc8cccb80819bb2c1d2687cfed)
+++ doc/theses/mike_brooks_MMath/array.tex	(revision 6bf35d116387dd8f93e0e87cc0b224aad4c131e2)
@@ -182,5 +182,5 @@
 \CFA's array is also the first extension of C to use its tracked bounds to generate the pointer arithmetic implied by advanced allocation patterns.  Other bound-tracked extensions of C either forbid certain C patterns entirely, or address the problem of \emph{verifying} that the user's provided pointer arithmetic is self-consistent.  The \CFA array, applied to accordion structures [TOD: cross-reference] \emph{implies} the necessary pointer arithmetic, generated automatically, and not appearing at all in a user's program.
 
-\subsction{Safety in a padded room}
+\subsection{Safety in a padded room}
 
 Java's array [todo:cite] is a straightforward example of assuring safety against undefined behaviour, at a cost of expressiveness for more applied properties.  Consider the array parameter declarations in: