summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorYann Herklotz <git@yannherklotz.com>2021-09-12 20:23:11 +0100
committerYann Herklotz <git@yannherklotz.com>2021-09-12 20:23:11 +0100
commit23e99ec633e3763eea134a0d3fae7a134b554be9 (patch)
tree09dbb5dfdc1eedad5c35f4be458932dc98c27edb
parent6a2797ace635cddfea3a3835661a19eccc3f4ad2 (diff)
downloadoopsla21_fvhls-23e99ec633e3763eea134a0d3fae7a134b554be9.tar.gz
oopsla21_fvhls-23e99ec633e3763eea134a0d3fae7a134b554be9.zip
Fix variable in proof
-rw-r--r--proof.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/proof.tex b/proof.tex
index 3499b4e..41e01c6 100644
--- a/proof.tex
+++ b/proof.tex
@@ -27,7 +27,7 @@ The main correctness theorem is analogous to that stated in \compcert{}~\cite{le
%The following `backwards simulation' theorem describes the correctness theorem, where $\Downarrow$ stands for simulation and execution respectively.
\begin{theorem}
- Whenever the translation from $C$ succeeds and produces Verilog $V$, and all observable behaviours of $C$ are safe (i.e. $\mathit{Safe} (C)$ is defined as $\forall B,\ S \Downarrow B \implies B \in \texttt{Safe}$) then $V$ has behaviour $B$ only if $C$ has behaviour $B$.
+ Whenever the translation from $C$ succeeds and produces Verilog $V$, and all observable behaviours of $C$ are safe (i.e. $\mathit{Safe} (C)$ is defined as $\forall B,\ C \Downarrow B \implies B \in \texttt{Safe}$) then $V$ has behaviour $B$ only if $C$ has behaviour $B$.
\begin{equation*}
\forall C, V, B,\quad \yhfunction{HLS} (C) = \yhconstant{OK} (V) \land \mathit{Safe}(C) \implies (V \Downarrow B \implies C \Downarrow B).
\end{equation*}