I work as a researcher in the software technology group at TU Darmstadt. In my research, I develop techniques that simplify the design and implementation of static analyses. Static analyses are tools that provide information about programs by inspecting the source code without running them. They are used in integrated development environments (IDEs), continuous integration (CI) servers, and compilers. A challenge in the design of such static analyses is to ensure that the analysis results are reliable (sound). However, rigorously proving that a static analysis is sound, is a difficult and laborious task. To this end, I develop techniques that simplify the development and soundness proof of static analyses. The core principle is to develop analyses from modular and reusable building blocks, such that the soundness proof becomes compositional.

If you are looking for interesting bachelor and master thesis topics in the area of static analyses, please contact me.

Publications

2025

Unimocg: Modular call-graph algorithms for consistent handling of language features.
Helm, Roth, Keidel, Reif, Mezini, SE. 10.18420/se2025-15

Total recall? How good are static call graphs really?.
Helm, Keidel, Kampkötter, Düsing, Roth, Hermann, Mezini, SE. 10.18420/se2025-28

AXA: Cross-language analysis through integration of single-language analyses.
Roth, Näumann, Helm, Keidel, Mezini, SE. 10.18420/se2025-29

2024

A modular soundness theory for the blackboard analysis architecture.
Keidel, Helm, Roth, Mezini, ESOP. 10.1007/978-3-031-57267-8_14

Unimocg: Modular call-graph algorithms for consistent handling of language features.
Helm, Roth, Keidel, Reif, Mezini, ISSTA. 10.1145/3650212.3652109

Total recall? How good are static call graphs really?.
Helm, Keidel, Kampkötter, Düsing, Roth, Hermann, Mezini, ISSTA. 10.1145/3650212.3652114

AXA: Cross-language analysis through integration of single-language analyses.
Roth, Näumann, Helm, Keidel, Mezini, KBSE. 10.1145/3691620.3696193

Total recall? How good are static call graphs really? - companion artifact (version 1.0.0).
Helm, Keidel, Kampkötter, Düsing, Roth, Hermann, Mezini, 10. 10.5281/zenodo.10888532

Total recall? How good are static call graphs really? - companion artifact (version 2.0.0).
Helm, Keidel, Kampkötter, Düsing, Roth, Hermann, Mezini, 11. 10.5281/zenodo.13134617

Unimocg: Modular call-graph algorithms for consistent handling of language features - companion artifact (version 1).
Helm, Roth, Keidel, Reif, Mezini, 11. 10.5281/zenodo.10890011

Artifact of the paper "AXA: Cross-language analysis through integration of single-language analyses" (version 1).
Roth, Näumann, Helm, Keidel, Mezini, 11. 10.5281/zenodo.13364691

Artifact of the paper "AXA: Cross-language analysis through integration of single-language analyses" (version 2).
Roth, Näumann, Helm, Keidel, Mezini, 11. 10.5281/zenodo.13374578

2023

Artifact for paper "a modular soundness theory for the blackboard analysis architecture" (version 1.0).
Keidel, Helm, Roth, Mezini, 10. 10.5281/zenodo.10418007

Artifact for paper "a modular soundness theory for the blackboard analysis architecture" (version 1.1).
Keidel, Helm, Roth, Mezini, 10. 10.5281/zenodo.10418484