summaryrefslogtreecommitdiffstats
path: root/main.tex
diff options
context:
space:
mode:
authorYann Herklotz <git@yannherklotz.com>2021-04-14 09:58:38 +0100
committerYann Herklotz <git@yannherklotz.com>2021-04-14 09:58:49 +0100
commite71a4bec612aea262fd1b3b20c02be55be183012 (patch)
treea82b08c367efab86de84147cda21642b446a29c0 /main.tex
parent6a31bac17b7f74d8b07a85db57786de5a906b62d (diff)
downloadoopsla21_fvhls-e71a4bec612aea262fd1b3b20c02be55be183012.tar.gz
oopsla21_fvhls-e71a4bec612aea262fd1b3b20c02be55be183012.zip
Add abstract suggestions
Diffstat (limited to 'main.tex')
-rw-r--r--main.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/main.tex b/main.tex
index af04c14..04ce858 100644
--- a/main.tex
+++ b/main.tex
@@ -140,7 +140,7 @@
\begin{abstract}
High-level synthesis (HLS), which refers to the automatic compilation of software into hardware, is rapidly gaining popularity. In a world increasingly reliant on application-specific hardware accelerators, HLS promises hardware designs of comparable performance and energy efficiency to those coded by hand in a hardware description language like Verilog, while maintaining the convenience and the rich ecosystem of software development. However, current HLS tools cannot always guarantee that the hardware designs they produce are equivalent to the software they were given, thus undermining any reasoning conducted at the software level. Worse, there is mounting evidence that existing HLS tools are quite unreliable, sometimes generating wrong hardware or crashing when given valid inputs.
- To address this problem, we present the first HLS tool that is mechanically verified to preserve the behaviour of its input software. Our tool, called \vericert{}, extends the \compcert{} verified C compiler with a new hardware-oriented intermediate language and a Verilog back end, and has been proven correct in Coq. \JW{Could maybe drop the following sentence from the abstract?}\YH{Hmm, I don't know actually, I feel like as we don't support all of the C features one might want to know what features are supported.} \JW{What would the list look like if you phrased it has the features that \emph{are} supported? (Following Ally's suggestion.)} \vericert{} supports all C constructs except for case statements, function pointers, recursive function calls, integers larger than 32 bits, floats, and global variables. An evaluation on the PolyBench/C benchmark suite indicates that \vericert{} generates hardware that is around an order of magnitude slower but about the same size as hardware generated by an existing, optimising (but unverified) HLS tool.\YH{Technically this is right, but we might want to add the division values.} \JW{What would it look like if you add those?}
+ To address this problem, we present the first HLS tool that is mechanically verified to preserve the behaviour of its input software. Our tool, called \vericert{}, extends the \compcert{} verified C compiler with a new hardware-oriented intermediate language and a Verilog back end, and has been proven correct in Coq. \JW{Could maybe drop the following sentence from the abstract?}\YH{Hmm, I don't know actually, I feel like as we don't support all of the C features one might want to know what features are supported.} \JW{What would the list look like if you phrased it has the features that \emph{are} supported? (Following Ally's suggestion.)}\YH{``\vericert{} supports most C constructs, including all integer operations, function calls, local arrays, structs and unions and general control-flow statements.''} \vericert{} supports all C constructs except for case statements, function pointers, recursive function calls, integers larger than 32 bits, floats, and global variables. An evaluation on the PolyBench/C benchmark suite indicates that \vericert{} generates hardware that is around an order of magnitude slower but about the same size as hardware generated by an existing, optimising (but unverified) HLS tool.\YH{Technically this is right, but we might want to add the division values.} \JW{What would it look like if you add those?}\YH{``If divisions are replaced by an iterative algorithm, then \vericert{} is only $2\times$ slower.''}
\end{abstract}
%% 2012 ACM Computing Classification System (CSS) concepts