I have been a research assistant and PhD student at Lehr- und Forschungsgebiet Informatik 2 since August 2013. I am one of the main developers of the Automated Program Verification Environment (AProVE) tool. Moreover, the techniques presented in our paper "Lower Runtime Bounds for Integer Programs" are implemented in the freely available Lower Bounds Analysis Tool (LoAT). I am also actively developing CAGE, a toolchain which builds on top of 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 is 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