summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorYann Herklotz <git@yannherklotz.com>2021-09-13 09:56:14 +0100
committerYann Herklotz <git@yannherklotz.com>2021-09-13 09:56:14 +0100
commit099d8e47dfaab5bd1f3995fb663354430e4bd0b7 (patch)
tree7e2179b4a0aa962e22e1a34ea1754ed479ea44e9
parent147f40d0af6f021beed65823cf8d2592efd183d4 (diff)
downloadoopsla21_fvhls-099d8e47dfaab5bd1f3995fb663354430e4bd0b7.tar.gz
oopsla21_fvhls-099d8e47dfaab5bd1f3995fb663354430e4bd0b7.zip
Remove space
-rw-r--r--proof.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/proof.tex b/proof.tex
index 529d229..66197dc 100644
--- a/proof.tex
+++ b/proof.tex
@@ -52,7 +52,7 @@ As HTL is quite far removed from 3AC, this first translation is the most involve
\end{equation*}
\end{lemma}
-\begin{proof}[Proof sketch]
+\begin{proof}[Proof sketch]
We prove this lemma by first establishing a specification of the translation function $\yhfunction{tr\_htl}$ that captures its important properties, and then splitting the proof into two parts: one to show that the translation function does indeed meet its specification, and one to show that the specification implies the desired simulation result. This strategy is in keeping with standard \compcert{} practice. % The forward simulation is then proven by showing that the initial states and final states between the 3AC semantics and HTL semantics match, and then showing that the simulation diagram in Lemma~\ref{lemma:simulation_diagram} holds.
\end{proof}