From 43d24c25e20afab8b7bc1370ded7f0ebc6c32ff2 Mon Sep 17 00:00:00 2001 From: Yann Herklotz Date: Fri, 10 Sep 2021 19:52:06 +0100 Subject: Fix the content indentation --- content.org | 19 ++++++++++++++----- 1 file changed, 14 insertions(+), 5 deletions(-) (limited to 'content.org') diff --git a/content.org b/content.org index b64392f..aab3a32 100644 --- a/content.org +++ b/content.org @@ -10,11 +10,20 @@ #+HTML: Profile picture #+HTML: H -i! I'm currently a first year PhD student in the Circuits and Systems group at Imperial College London, supervised by [John Wickerson](https://johnwickerson.github.io). - -My research focuses on formalising the process of converting high-level programming language descriptions to correct hardware that is functionally equivalent to the input. This process is called high-level synthesis (HLS), and allows software to be turned into custom accelerators automatically, which can then be placed on field-programmable gate arrays (FPGAs). An implementation in the [Coq](https://coq.inria.fr/) theorem prover called Vericert can be found on [Github](https://github.com/ymherklotz/vericert). - -I have also worked on random testing for FPGA synthesis tools. [Verismith](https://github.com/ymherklotz/verismith) is a fuzzer that will randomly generate a Verilog design, pass it to the synthesis tool, and use an equivalence check to compare the output to the input. If these differ, the design is automatically reduced until the bug is located. +i! I'm currently a first year PhD student in the Circuits and Systems group at Imperial College +London, supervised by [John Wickerson](https://johnwickerson.github.io). + +My research focuses on formalising the process of converting high-level programming language +descriptions to correct hardware that is functionally equivalent to the input. This process is +called high-level synthesis (HLS), and allows software to be turned into custom accelerators +automatically, which can then be placed on field-programmable gate arrays (FPGAs). An +implementation in the [Coq](https://coq.inria.fr/) theorem prover called Vericert can be found on +[Github](https://github.com/ymherklotz/vericert). + +I have also worked on random testing for FPGA synthesis +tools. [Verismith](https://github.com/ymherklotz/verismith) is a fuzzer that will randomly generate +a Verilog design, pass it to the synthesis tool, and use an equivalence check to compare the output +to the input. If these differ, the design is automatically reduced until the bug is located. * Blog ** Blog Index -- cgit