summaryrefslogtreecommitdiffstats
path: root/main.tex
diff options
context:
space:
mode:
authorYann Herklotz <git@yannherklotz.com>2020-06-05 17:22:06 +0100
committerYann Herklotz <git@yannherklotz.com>2020-06-05 17:22:06 +0100
commit656fcda759904b7d48fa07fd7a3106350962f0e2 (patch)
tree09c80adb1862789f34cde1aff5732f2cfa6df361 /main.tex
parentc3f04aee8d41069aded014f3e47e50037e03d4ce (diff)
downloadoopsla21_fvhls-656fcda759904b7d48fa07fd7a3106350962f0e2.tar.gz
oopsla21_fvhls-656fcda759904b7d48fa07fd7a3106350962f0e2.zip
Add sections and beginning of abstract
Diffstat (limited to 'main.tex')
-rw-r--r--main.tex14
1 files changed, 13 insertions, 1 deletions
diff --git a/main.tex b/main.tex
index 4e4675e..f701d8e 100644
--- a/main.tex
+++ b/main.tex
@@ -153,7 +153,7 @@
%% Note: \begin{abstract}...\end{abstract} environment must come
%% before \maketitle command
\begin{abstract}
- We propose a formally verified HLS flow based on CompCert~\cite{leroy09_formal_verif_realis_compil}, by adding a Verilog backend which is a language used to describe hardware.
+ High-level synthesis (HLS) is the process of converting an algorithmic description, often written in C, to specialised hardware with the same behaviour, expressed in a hardware description language. HLS is becoming increasingly popular, as it allows for faster prototyping as well as simpler behavioural verification, as all the software tools can be used. The HLS process has to be trusted though to be sure that . C constructs are also often not supported in various combinations, which make existing tools quite brittle. Our work focuses on formally verifying the high-level synthesis process from C to Verilog by proving that the behaviour remains the same according to the C and Verilog semantics.
\end{abstract}
@@ -193,6 +193,14 @@
\section{Introduction}
+\section{Background}
+
+\subsection{Verilog}
+
+\subsection{CompCert / Coq / Proof by simulation}
+
+\subsection{HLS}
+
\section{Verilog Semantics}
Definition of state.
@@ -262,6 +270,10 @@ based on what they evaluate to. For case I think that would end up being a three
\inferrule[Nonblocking]{\text{name}\ \mathit{lhs} = \mathtt{OK}\ n \\ \text{exprrun}\ f\ \Gamma\ \mathit{rhs}\ v_{\mathit{rhs}}}{\text{stmntrun}\ f\ (\Gamma, \Delta)\ (\mathtt{Vnonblock}\ \mathit{lhs}\ \mathit{rhs}) = (\Gamma, \Delta ! n \rightarrow v_{\mathit{rhs}})}
\end{equation}
+\section{Proof}
+
+\section{Conclusion}
+
%% Acknowledgments
\begin{acks} %% acks environment is optional
%% contents suppressed with 'anonymous'