Index: doc/theses/aaron_moss_PhD/phd/experiments.tex
===================================================================
--- doc/theses/aaron_moss_PhD/phd/experiments.tex	(revision 01300c4062612e992b882a0ad2dd830fd0e6d5ed)
+++ doc/theses/aaron_moss_PhD/phd/experiments.tex	(revision 6a787f8ebcb21cc4b36937e663469bb274bd61c7)
@@ -3,5 +3,5 @@
 
 I have implemented a prototype system to test the practical effectiveness of the various algorithms described in Chapters~\ref{resolution-chap} and~\ref{env-chap}. 
-This prototype system implements the expression resolution pass of the \CFA{} compiler, \CFACC{}, with a simplified version of the \CFA{} type system and a parser to read in problem instances. 
+This prototype system implements the expression resolution pass of the \CFA{} compiler, \CFACC{}, with a simplified version of the \CFA{} type system and a parser to read in problem instances, and is published online under a permissive licence\footnote{\url{https://github.com/cforall/resolv-proto}}. 
 The resolver prototype allows for quicker iteration on algorithms due to its simpler language model and lack of a requirement to generate runnable code, yet captures enough of the nuances of \CFA{} to have some predictive power for the runtime performance of algorithmic variants in \CFACC{} itself. 
 I have implemented an optional \CFACC{} pass which generates test inputs for the resolver prototype from \CFA{} translation units; since at this juncture all development in \CFA{} is done by our research team, I have tested the prototype system on all \CFA{} code currently extant, primarily the standard library and compiler test suite.
Index: doc/theses/aaron_moss_PhD/phd/frontpgs.tex
===================================================================
--- doc/theses/aaron_moss_PhD/phd/frontpgs.tex	(revision 01300c4062612e992b882a0ad2dd830fd0e6d5ed)
+++ doc/theses/aaron_moss_PhD/phd/frontpgs.tex	(revision 6a787f8ebcb21cc4b36937e663469bb274bd61c7)
@@ -145,5 +145,5 @@
 This thesis would not exist in the form it does without the mentorship of my advisor, Peter Buhr, who has ably led the \CFA{} team while giving me both the advantage of his decades of experience and the freedom to follow my own interests. 
 My work on \CFA{} does not exist in a vaccuum, and it has been a pleasure and a privilege to collaborate with the members of the \CFA{} team: Andrew Beach, Richard Bilson, Michael Brooks, Bryan Chan, Thierry Delisle, Glen Ditchfield, Brice Dobry, Rob Schluntz, and others.
-I gratefully acknowledge the financial support of the National Science and Engineering Council of Canada and the Waterloo-Huawei Joint Innovation Lab for this project.
+I gratefully acknowledge the financial support of the National Science and Engineering Council of Canada and Huawei Ltd.\ for this project.
 I would also like to thank of my thesis committee, Ond\v{r}ej Lhot\a'ak, Gregor Richards, and Doug Lea, for the time and effort they have invested in providing constructive feedback to refine this work.
 I am indebted to Peter van Beek and Ian Munro for their algorithmic expertise and willingness to share their time with me.