Professor (in Swedish: bitr. prof.),
CS,
CSE,
Chalmers (room 6478)
Recent activity
May 2025 — Three recently accepted papers:
ITP 2025: GOL in GOL in HOL: Verified Circuits in Conway's Game of Life;
CP 2025: Practically Feasible Proof Logging for Pseudo-Boolean Optimization;
SAT 2025: Efficient Certified Reasoning for Binarized Neural Networks.
Aug 2022 — attended FLoC 2022 in Israel, where many interesting papers were presented at ITP'22, e.g. this and this.
My research focuses on program verification, interactive theorem
proving and, particularly, the challenges of making interactive proofs
more automatic / scale to real code. This webpage provides a brief
introduction to my research:
My most recent work has focused on CakeML, which
is an ML-style language with a formal semantics and a growing
ecosystem of proofs and tools that support construction of verified applications.
As far as I know, the CakeML compiler is the first verified compiler to have been bootstrapped.