Dominik Klumpp
PhD Candidate, University of Freiburg
I work at the Chair for Software Engineering.
My PhD advisor is Prof. Andreas Podelski.
My main research focus is on algorithmic verification of concurrent programs. I investigate how partial order reduction and the underlying notion of commutativity enable verification algorithms to find simpler correctness proofs for concurrent programs, thereby allowing for the verification of more programs, and increasing verification efficiency.
I am a co-developer of the Ultimate program analysis and automata theory framework. To complement my theoretical work on commutativity in program verification, I implement the resulting verification algorithms in the software model checker Ultimate GemCutter, which has scored top rankings in the International Competition on Software Verification (SV-COMP) 2022, 2023 and 2024.
I am also part of the development team for Ultimate Automizer. In 2023 and 2024, our team won 1st place in the Overall ranking of SV-COMP.
Recent & Upcoming Talks
- 14 May 2024: How Commutativity Simplifies Proofs of Concurrent Programs at ISTA (Klosterneuburg, Austria)
- 08 Apr 2024: Ultimate GemCutter at ETAPS (Luxembourg, Luxembourg)
- 17 Jan 2024: Commutativity Simplifies Proofs of Parameterized Programs at POPL (London, UK)
- 17 Jul 2023: Concurrency Correctness Witnesses with Ghosts at CAV (Paris, France)
Selected Publications
-
POPL’24 Commutativity Simplifies Proofs of Parameterized Programs
-
POPL’23 Stratified Commutativity in Verification Algorithms for Concurrent Programs
-
PLDI’22 Sound Sequentialization for Concurrent Program Verification
-
WADT@ETAPS’20 𝕂 and KIV: Towards Deductive Verification for Arbitrary Programming Languages
Alpine Verification Meeting (AVM’24)
In 2024, I was an organizer of the Alpine Verification Meeting (AVM’24), an informal meeting on formal verification. For three days, we welcomed 67 attendees from the verification community in Freiburg to present recent and ongoing work, exchange ideas and get to know each other.
