Index: doc/theses/colby_parsons_MMAth/text/mutex_stmt.tex
===================================================================
--- doc/theses/colby_parsons_MMAth/text/mutex_stmt.tex	(revision 2d831a1b8696630999d4089e6cd949d11a44ddc7)
+++ doc/theses/colby_parsons_MMAth/text/mutex_stmt.tex	(revision 84018e0cc39d93f27dd029c87859f0a8717d0b83)
@@ -350,5 +350,5 @@
 
 The benchmark used to evaluate the avoidance algorithms repeatedly acquires a fixed number of locks in a random order and then releases them.
-The pseudo code for the deadlock avoidance benchmark is shown in \VRef[Listing]{l:deadlock_avoid_pseudo}.
+The pseudocode for the deadlock avoidance benchmark is shown in \VRef[Listing]{l:deadlock_avoid_pseudo}.
 To ensure the comparison exercises the implementation of each lock avoidance algorithm, an identical spinlock is implemented in each language using a set of builtin atomics available in both \CC and \CFA.
 The benchmarks are run for a fixed duration of 10 seconds and then terminate.
@@ -357,20 +357,20 @@
 The median is calculated and is plotted alongside the 95\% confidence intervals for each point.
 
-\begin{cfa}[caption={Deadlock avoidance bendchmark pseudo code},label={l:deadlock_avoid_pseudo}]
-
-size_t N_LOCKS; $\C{// number of locks}$
-size_t N_THREADS; $\C{// number of threads}$
-size_t N_GENS; $\C{// number of random orderings (default 100)}$
+\begin{cfa}[caption={Deadlock avoidance benchmark pseudocode},label={l:deadlock_avoid_pseudo}]
+
+size_t n_locks; $\C{// number of locks}$
+size_t n_thds; $\C{// number of threads}$
+size_t n_gens; $\C{// number of random orderings (default 100)}$
 size_t total = 0; $\C{// global throughput aggregator}$
 volatile bool done = false; $\C{// termination flag}$
 
-test_spinlock locks[N_LOCKS];
-size_t rands[N_THREADS][N_LOCKS * N_GENS]; $\C{// random ordering per thread}$
+test_spinlock locks[n_locks];
+size_t rands[n_thds][n_locks * n_gens]; $\C{// random ordering per thread}$
 
 void main( worker & w ) with(w) { $\C{// thread main}$
     size_t count = 0, idx = 0;
     while ( !done ) {
-        idx = (count % N_LOCKS * N_GENS) * N_LOCKS; $\C{// get start of next sequence}$
-        mutex(locks[rands[0]], ..., locks[rands[N_LOCKS - 1]]){} $\C{// lock sequence of locks}$
+        idx = (count % n_locks * n_gens) * n_locks; $\C{// get start of next sequence}$
+        mutex(locks[rands[0]], ..., locks[rands[n_locks - 1]]){} $\C{// lock sequence of locks}$
         count++;
     }
@@ -381,5 +381,5 @@
     gen_orders(); $\C{// generate random orderings}$
     {
-        worker w[N_THREADS];
+        worker w[n_thds];
         sleep( 10`s );
         done = true;