Index: doc/theses/mike_brooks_MMath/intro.tex
===================================================================
--- doc/theses/mike_brooks_MMath/intro.tex	(revision b0fff426bfa7afb23f85c3219e44079045177f4f)
+++ doc/theses/mike_brooks_MMath/intro.tex	(revision 3c5fdb54dad1fa0471b7cdafa69972af91c7c550)
@@ -22,5 +22,8 @@
 \end{itemize}
 
-An effort at translating C to safe Rust~\cite{Emre2022} has pointers as the stand-out difficult aspect to analyze.
+An effort at translating C code to the safe subset of the now-famously safe language Rust~\cite{Emre2022} shows pointers as the stand-out difficult aspect to analyze.
+It demonstrates the difficulty of automatically determining pointer-referent lifetimes in that its success claim is to reduce the occurrence rate of unsafe dereference operations to about once per 100 lines of code.
+
+\begin{comment}
 It demonstrates the difficulty of analyzing C pointers for safety.
 It first puts a corpus of C programs through a naive Rust translation, which ``succeeds'' by leaving many uses of Rust's \lstinline{unsafe} marker.
@@ -32,5 +35,5 @@
 % 3.3 = 1398/413,428 * 1000
 % 220 ~= (99,101 [@tab3.5] - 9631 [@tab4.2] ) / 413,428 [@tab 3.1] * 1000
-
+\end{comment}
 
 A tool for analyzing C code's use of linked data structures (including, \eg skip list and binary tree) found variations of the linked-list shape to be present in most of the programs in its corpus~\cite{White2016}.