summaryrefslogtreecommitdiffstats
path: root/related.tex
diff options
context:
space:
mode:
authorJohn Wickerson <j.wickerson@imperial.ac.uk>2020-09-14 20:08:48 +0000
committeroverleaf <overleaf@localhost>2020-09-14 20:08:51 +0000
commit2fd9d7aaf75905e680a1527d9d2af66593ec126f (patch)
treed3618ba7bd1e88c39b61e03c30f69c20cb82713f /related.tex
parent9139ffb9954fcc07f23dd5f4dd8f41db08548606 (diff)
downloadfccm21_esrhls-2fd9d7aaf75905e680a1527d9d2af66593ec126f.tar.gz
fccm21_esrhls-2fd9d7aaf75905e680a1527d9d2af66593ec126f.zip
Update on Overleaf.
Diffstat (limited to 'related.tex')
-rw-r--r--related.tex6
1 files changed, 4 insertions, 2 deletions
diff --git a/related.tex b/related.tex
index 6595c6b..ef3edc1 100644
--- a/related.tex
+++ b/related.tex
@@ -4,8 +4,10 @@ The only other work of which we are aware on fuzzing HLS tools is that by Lidbur
Other stages of the FPGA toolchain have been subjected to fuzzing. Herklotz et al.~\cite{verismith} tested several FPGA synthesis tools using randomly generated Verilog programs. Where they concentrated on the RTL-to-netlist stage of hardware design, we focus our attention on the earlier C-to-RTL stage.
-Several authors have taken steps toward more rigorously engineered HLS tools that may be more resilient to testing campaigns such as ours. One such example might be the Handel-C compiler by Perna and Woodcock~\cite{perna12_mechan_wire_wise_verif_handel_c_synth} which has been mechanically proven correct, at least in part, using the HOL theorem prover. %
-%However, the Handel-C language relies upon the user to perform the parallelisation that is necessary for good hardware performance, and would require many more checks to avoid data races. in any case, the tool does not support C as input directly.
+Several authors have taken steps toward more rigorously engineered HLS tools that may be more resilient to testing campaigns such as ours. One such example might be the Handel-C compiler by Perna and Woodcock~\cite{perna12_mechan_wire_wise_verif_handel_c_synth} which has been mechanically proven correct, at least in part, using the HOL theorem prover.
+%However, the Handel-C language relies upon the user to perform the parallelisation that is necessary for good hardware performance, and would require many more checks to avoid data races.
+Howev
+in any case, the tool does not support C as input directly.
Another example is an HLS tool called SPARK~\cite{gupta03_spark}, in which some passes, such as scheduling, are mechanically validated during compilation~\cite{chouksey20_verif_sched_condit_behav_high_level_synth}. Unfortunately, this tool is not readily available yet to test properly. Finally, the HLS tool Catapult C~\cite{mentor20_catap_high_level_synth} is designed only to produce an output netlist if it can mechanically prove it equivalent to the input program. It should therefore never produce wrong RTL. Future work will address testing Catapult-C as well, however, as Vivado HLS, LegUp HLS and Intel HLS are more prevalent these were prioritised. \JW{Obvious reader question at this point: why not test that claim by giving our Csmith test cases to Catapult C too? Can we address that here? No worries if not; but shall we try and do that after the deadline anyway?}\YH{Yes, definitely, it would be great to get an idea of how Catapult C performs, and I currently have it installed already. I have added a small sentence for that now, but let me know if I should mention this in the conclusion instead though. }
%%% Local Variables: