# Changeset 0e6a0be for doc

Ignore:
Timestamp:
Jan 31, 2019, 9:58:34 PM (3 years ago)
Branches:
aaron-thesis, arm-eh, cleanup-dtors, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr
Children:
8d752592
Parents:
21cf101
Message:

thesis: Started Experiments chapter

Location:
doc/theses/aaron_moss_PhD/phd
Files:
5 edited

Unmodified
Removed
• ## doc/theses/aaron_moss_PhD/phd/Makefile

 r21cf101 background \ generic-types \ resolution-heuristics \ type-environment \ resolution-heuristics \ experiments \ conclusion \ }
• ## doc/theses/aaron_moss_PhD/phd/background.tex

 r21cf101 \chapter{\CFA{}} \label{cfa-chap} \CFA{} adds a number of features to C, some of them providing significant increases to the expressive power of the language, but all designed to maintain the existing procedural programming paradigm of C and to be as orthogonal as possible to each other.
• ## doc/theses/aaron_moss_PhD/phd/resolution-heuristics.tex

 r21cf101 If the assertions of the minimal-cost top-level interpretation cannot be satisfied then the next-most-minimal-cost interpretation's assertions are checked, and so forth until a minimal-cost satisfiable interpretation (or ambiguous set thereof) is found, or no top-level interpretations are found to have satisfiable assertions. In the common case where the code actually does compile this saves the work of checking assertions for ultimately-rejected interpretations, though it does rule out some pruning opportunities for subinterpretations with unsatisfiable assertions or which are more expensive than a minimal-cost polymorphic function with the same return type. The experimental results in Section~\ref{resn-expr-sec} indicate that this is a worthwhile trade-off. The experimental results in Chapter~\ref{expr-chap} indicate that this is a worthwhile trade-off. Optimizing assertion satisfaction for common idioms has also proved effective in \CFA{}; the code below is an unexceptional print statement derived from the \CFA{} test suite that nonetheless is a very difficult instance of expression resolution: 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{Experimental Results} \label{resn-expr-sec} % use Jenkins daily build logs to rebuild speedup graph with more data % look back at Resolution Algorithms section for threads to tie up "does the algorithm look like this?" \section{Conclusion \& Future Work}
• ## doc/theses/aaron_moss_PhD/phd/thesis.tex

 r21cf101 \input{resolution-heuristics} \input{type-environment} \input{experiments} \input{conclusion}
• ## doc/theses/aaron_moss_PhD/phd/type-environment.tex

 r21cf101 Persistent union-find, as the name suggests, is more optimized, with $O(1)$ cost to $save$ a backtrack-capable reference to the current environment state, and $O(p)$ cost to revert to that state (possibly destroying no-longer-used edit nodes along the path). \section{Experiments} % Future work: design multi-threaded version of C&F persistent map --- core idea is some sort of thread-boundary edit node
Note: See TracChangeset for help on using the changeset viewer.