PhD Thesis Published

My PhD thesis “Abstract Execution: Automatically Proving Infinitely Many Programs” has been published and is available for download (open access).

The abstract and possible errata found after publication are listed on a separate page. REFINITY, the workbench for proving conditional correctness of Java program transformation rules, has its own page on the KeY website. See below for the links to the PDF document.

(2020). Abstract Execution: Automatically Proving Infinitely Many Programs. TUPrints, Technical University of Darmstadt, Department of Computer Science.

PDF DOI

Dominic Steinhöfel
Dominic Steinhöfel
Postdoctoral Researcher in Computer Science

My research interests include software reengineering, safe program transformation, program verification, and symbolic execution.