aboutsummaryrefslogtreecommitdiff
path: root/thesis/parts/background.tex
diff options
context:
space:
mode:
authorAria <me@aria.rip>2023-11-11 15:57:02 +0000
committerAria <me@aria.rip>2023-11-11 15:57:02 +0000
commit3306d272d66344ce585ea17596c6d67dda1b1039 (patch)
treeea91f9a8a72dd3f115dedfedab32945f8190b413 /thesis/parts/background.tex
parenta9f713e01ef347d0ff1e1062e448b11cc983a7c7 (diff)
chore: background chapter feedback
Diffstat (limited to 'thesis/parts/background.tex')
-rw-r--r--thesis/parts/background.tex1
1 files changed, 1 insertions, 0 deletions
diff --git a/thesis/parts/background.tex b/thesis/parts/background.tex
index 77becd6..b814e92 100644
--- a/thesis/parts/background.tex
+++ b/thesis/parts/background.tex
@@ -90,6 +90,7 @@ This results in selection rules being more restricted than they otherwise could
For instance, a rule cannot suggest a \code{HashSet} instead of a \code{LinkedList} as the two are not semantically identical.
Chameleon has no way of knowing if doing so will break the program's functionality and so it does not make the suggestion.
+%% TODO: Don't use citations as nouns
\cite{hutchison_coco_2013} and \cite{osterlund_dynamically_2013} use similar techniques, but work as the program runs.
This works well for programs with different phases of execution, such as loading and then working on data.
However, the overhead from profiling and from checking rules may not be worth the improvements in other programs, where access patterns are roughly the same throughout.