Index: doc/theses/mike_brooks_MMath/uw-ethesis-frontpgs.tex
===================================================================
--- doc/theses/mike_brooks_MMath/uw-ethesis-frontpgs.tex	(revision 6c58850ceae3b910f371a05435f5d01aede1c834)
+++ doc/theses/mike_brooks_MMath/uw-ethesis-frontpgs.tex	(revision 7f995d70a7be151c73af0b99e8431a8e394fd041)
@@ -129,5 +129,28 @@
 \begin{center}\textbf{Abstract}\end{center}
 
-This is the abstract.
+All modern programming languages provide three high-level containers (collections): array, linked-list, and string.
+Often array is part of the programming language, while linked-list is built from (recursive) pointer types, and string from a combination of array and linked-list.
+For all three types, languages and/or their libraries supply varying degrees of high-level mechanisms for manipulating these objects at the bulk and component level, such as copying, slicing, extracting, and iterating among elements.
+Unfortunately, these three aspects of C cause 60\%--70\% of the reported software vulnerabilities involved memory errors, and 70\%-80\% of hacker attack-vectors target these types.
+Therefore, hardening these three C types goes a long way to make the majority of C programs safer.
+
+This work looks at extending these three foundational container types in the programming language \CFA, which is a new dialect of the C programming language.
+The thesis describes improvements made to the \CFA language design, both syntax and semantics, to support the container features, and the source code created within the \CFA compiler, libraries, and runtime system to implement these features.
+This work leverages preexisting work within the compiler's type and runtime systems generated by prior students working on the \CFA project.
+
+Overall, this work has produced significant syntactic and semantic improvements to C's container types.
+\begin{enumerate}[leftmargin=*]
+\item
+Introduce a small number of subtle changes to the typing rules for the C array, while still achieving significant backwards compatibility
+\item
+Create a new polymorphic mechanism in the \CFA @forall@ clause to specify array dimension values, similar to a fixed-typed parameter in a \CC \lstinline[language=C++]{template}.
+The new array type, enabled by prior features, defines an array with guaranteed runtime bound checks (often optimizer-removable) and implicit (guaranteed accurate) inter-function length communication.
+\item
+Create a new polymorphic list type and its runtime library following the established design pattern of intrusive link-fields for performance reasons, especially in concurrent programs.
+\item
+Create a new string type and runtime library comparable to the \CC @string@ type, including analogous coexistence with raw-character pointers, enabling programs to work with strings by value, without incurring excessive copying.
+Substrings are supported, including the ability for overlapping ranges to share edits transparently.
+\end{enumerate}
+The thesis includes a performance evaluation that shows the \CFA containers perform comparably with their C counterparts in many programming cases.
 
 \cleardoublepage