I am a postdoctoral researcher at the Research Group 1 of the Max Planck Institute for Informatics in Saarbrücken. Before that, I was a research and teaching assistant at Lehr- und Forschungsgebiet Informatik 2 at RWTH Aachen where I successfully defended my PhD thesis in December 2018. I am actively contributing to several software projects:
- I am one of the main developers of the Automated Program Verification Environment (AProVE) tool.
- Our techniques to prove lower runtime-bounds and non-termination of integer programs are implemented in the freely available Loop Acceleration Tool (LoAT).
- I contributed to CAGE, a toolchain which uses AProVE and LoAT to find and prove the absence of denial of service attacks in Java programs. CAGE is joint work of Draper, the University of Innsbruck, and our research group and was developed within the DARPA STAC program.
My fields of interest include (but are not limited to):
- automated termination and complexity analysis of
- heap-manipulating imperative programs with a focus on Java Bytecode
- term rewriting systems
- integer programs
- abstract interpretation and symbolic evaluation
- program verification
Show / Hide
- Extended Version appeared as arXiv:1910.11588 [cs.LO]
Show / Hide
PC-Member of the 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR '20)
PC-Member of the 17th International Workshop on Termination (WST '20)
Member of the Steering-Committee of the Termination and Complexity Competition (TermComp)
Participant of the Dagstuhl-seminar Deduction Beyond Satisfiability
- Slides of my talk