Index: doc/theses/thierry_delisle_PhD/thesis/text/existing.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/thesis/text/existing.tex	(revision 09f34a84d91d0f6c3dcd80079886a3a4dd8e7ec7)
+++ doc/theses/thierry_delisle_PhD/thesis/text/existing.tex	(revision 4407b7ee22a177cb0cd564fd7ea6335606b27dc3)
@@ -22,5 +22,5 @@
 The scheduler then processes this input ahead of time and produces a \newterm{schedule} the system follows during execution.
 This approach is popular in real-time systems since the need for strong guarantees justifies the cost of determining and supplying this information.
-In general, static schedulers are less relevant to this project because they require input from the programmers that the programming language does not have as part of its concurrency semantics.
+In general, static schedulers are less relevant to this project because they require input from the programmers that the \CFA programming language does not have as part of its concurrency semantics.
 Specifying this information explicitly adds a significant burden to the programmer and reduces flexibility.
 For this reason, the \CFA scheduler does not require this information.
@@ -217,5 +217,5 @@
 While the documentation only gives limited insight into the scheduling and load balancing approach, \cite{apple:gcd2} suggests a fairly classic approach.
 Each \proc has a queue of \ats to run, called \newterm{blocks}, which are drained in \glsxtrshort{fifo}.
-GCD also has secondary queues, called \newterm{Dispatch Queues} with clear ordering, where executing a block ends up scheduling more blocks.
+GCD also has secondary queues, called \newterm{Dispatch Queues}, with clear ordering, where executing a block ends up scheduling more blocks.
 In terms of semantics, these Dispatch Queues seem to be very similar to Intel\textregistered ~TBB \lstinline{execute()} and predecessor semantics.
 
Index: doc/theses/thierry_delisle_PhD/thesis/text/front.tex
===================================================================
--- doc/theses/thierry_delisle_PhD/thesis/text/front.tex	(revision 09f34a84d91d0f6c3dcd80079886a3a4dd8e7ec7)
+++ doc/theses/thierry_delisle_PhD/thesis/text/front.tex	(revision 4407b7ee22a177cb0cd564fd7ea6335606b27dc3)
@@ -66,5 +66,5 @@
 	Internal-External Member: \=  \kill % using longest text to define tab length
 	External Examiner: \>  Doug Lea \\
-	\> Professor and Department Chair, Computer Science Department \\
+	\> Professor, Computer Science Department \\
 	\> State University of New York at Oswego \\
 \end{tabbing}