- kevin.batz at cs.rwth-aachen.de
- Room 4203
- +49 241 80 21206
I am a PhD student and member of the FRAPPANT project at the Software Modeling and Verification Group headed by Professor J.-P. Katoen. My research interests include the semantics of (heap-manipulating) probabilistic programs as well as techniques and calculi enabling their (preferably automated) verification. Moreover, I have co-developed Weighted Programming — a programming paradigm for specifying mathematical models.
You can find me on dblp and Google Scholar.
I am currently involved in the following teaching activities:
In the past, I have been involved in the following teaching activities:
- Compiler Construction (WS 22/23)
- Static Program Analysis (SS 22)
- Concurrency Theory (SS 21)
- Semantics and Verification of Software (SS 21)
- Compiler Construction (WS 20/21)
- Seminar: Probabilistic Programming
- Static Program Analysis (SS 20)
- Proseminar: Introduction to Program Analysis (SS 20)
- Concurrency Theory (WS 19/20)
- Semantics and Verification of Software (SS 19)
I have supervised our student research assistants Philipp Schröer, Tom Biskup, and Adrian Gallus.
Moreover, I am supervising or have supervised the following thesis projects:
- Florian Keßler, On the Decidability of Entailment Checking in Quantitative Separation Logics, Bachelor’s Thesis, 2020, winner of the CS Department Award 2020 (with Thomas Noll and Christoph Matheja).
- Adrian Gallus, RPrIC3: PrIC3 for Expected Rewards, Bachelor’s Thesis, 2020
- Marvin Jansen, Decidability and Complexity of Entailment Checking in Quantitative Separation Logic, Master’s Thesis, 2021, winner of the CS Department Award 2021 (with Ira Fesefeldt and Christoph Matheja)
- Philipp Schröer, A Deductive Verifier for Probabilistic Programs, Master’s Thesis, 2022 (with Benjamin Kaminski and Christoph Matheja)
- Ben Sturgis, Bachelor’s Thesis, Automatic Verification of Loop Invariants in Weighted Programs, 2022 (with Tobias Winkler)
- Tom Biskup, TBA, Master’s Thesis, ongoing work (with Tobias Winkler)
- Nora Orhan, TBA, Bachelor’s Thesis, ongoing work
- Our paper Generating Functions for Probabilistic Programs (joint work with Lutz Klinkenberg, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman and Tobias Winkler) has received the best paper award at LOPSTR 2020.
- I was awarded the Springorum Medal in 2019 for receiving a master’s degree with distinction.
- Our paper How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times (joint work with Benjamin Kaminski, Joost-Pieter Katoen, and Christoph Matheja) was nominated for the EATCS Best Paper Award at ETAPS 2018.
- UAI 2023
- POPL 2023
- POPL 2022 (Artifact Evaluation)
- LICS 2022
- LICS 2021
- CAV 2021 (regular paper & member of the artifact evaluation committee)
- TACAS 2021
- QEST 2019
|[bibtex] [issue]||Kevin Batz, , Joost-Pieter Katoen, , Lena Verscht. A Calculus for Amortized Expected Runtimes, Proceedings of the ACM on programming languages 7 (POPL), pages 67, ACM, 2023.|
|[bibtex] [issue]||Kevin Batz, Mingshuai Chen, Sebastian Junges, , Joost-Pieter Katoen, . Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants, Tools and Algorithms for the Construction and Analysis of Systems, Volume 13994 of LNCS, 2023.|
|[bibtex] [issue]||Kevin Batz, Ira Justus Fesefeldt, Marvin Jansen, Joost-Pieter Katoen, Florian Keßler, , Thomas Noll. Foundations for Entailment Checking in Quantitative Separation Logic, 31. European Symposium on Programming (ESOP 2022), Volume 13240 of LNCS, 57-84, Springer, 2022.|
|[bibtex] [issue]||Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Tobias Winkler. Weighted programming: a programming paradigm for specifying mathematical models, Proceedings of the ACM on programming languages, pages 66, ACM, 2022.|