Changeset 8d752592 for doc/theses/aaron_moss_PhD/phd/resolution-heuristics.tex

Timestamp:

Feb 4, 2019, 10:20:43 PM (6 years ago)

Author:

Aaron Moss <a3moss@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

902b123

Parents:

0e6a0beb

Message:

thesis: discuss design differences between cfa-cc and resolv-proto

File:

• doc/theses/aaron_moss_PhD/phd/resolution-heuristics.tex (modified) (1 diff)

doc/theses/aaron_moss_PhD/phd/resolution-heuristics.tex

@@ -326 +326 @@
 As such, I opted to continue Bilson's approach of designing a bespoke solver for \CFA{} assertion satisfaction, rather than attempting to re-express the problem in some more general formalism. 
 
-\section{Conclusion \& Future Work}
+\section{Conclusion \& Future Work} \label{resn-conclusion-sec}
 
 I have experimented with using expression resolution rather than type unification to choose assertion resolutions; this path should be investigated further in future work.