About me
I’m a PhD candidate at DistriNet at KU Leuven, working on verification techniques for heap-manipulating programs and supervised by Bart Jacobs. My overall goal is to simplify program verification. My current research focuses on completeness thresholds for memory safety proofs. The goal of this work is to turn bounded memory safety proofs into unbounded ones. My general research interests are:
| Program Verification | Automated Reasoning |
| Separation Logic | Bounded & Unbounded Proofs |
| Programming Languages | Type Systems |
| Static Analysis | Natural Language Processing |
Liveness
During my previous research project, I developed a separation logic to verify liveness properties of concurrent programs:
Ghost Signals: Verifying Termination of Busy Waiting, CAV 2021
[Paper] [Extended Version] [TR] [Bibtex]A Separation Logic to Verify Termination of Busy-Waiting for Abrupt Program Exit, FTfJP 2020
[Paper] [TR] [Bibtex] [Slides]
AWS
In summer 2021, I worked as applied scientist intern with Mark Tuttle in the Automated Reasoning Group at Amazon Web Services. During this internship I explored ways to progress from bounded to unbounded verification. My research focused on (automatic) memory safety proofs for heap-manipulating programs that involve inductive data structures. I am happy to return in summer 2022.
Before my PhD
Before I joined DistriNet, I obtained my Master’s degree from TU Darmstadt. During my Master’s I worked as student research assistant at the Software Technology Group on type systems for multitier-languages such as ScalaLoci.