- benjamin.kaminski at cs.rwth-aachen.de
- Room 4230
- +49 241 80 21208
I am a Lecturer at the Programming Principles, Logic and Verification Group (PPLV) at University College London (UCL). New website is coming up soon(ish). For now, this site is kept up-to-date.
Before moving to UCL, I did my PhD here at the Software Modeling and Verification Group (MOVES) headed by Professor Prof. Joost-Pieter Katoen. I was associated with the DFG Research Training Group (DFG-Graduiertenkolleg) Uncertainty and Randomness in Algorithms, Verification, and Logic (UnRAVeL) and a member of its steering committee.
In February 2019, I have defended my PhD thesis titled Advanced Weakest Precondition Calculi for Probabilistic Programs. Please find more information on my thesis, including a PDF version, by clicking the cover on the right.
The thesis gives a comprehensive introduction to weakest preexpectation reasoning and features (amongst others) calculi for verifying expected runtimes and probabilistic programs with conditioning. A Special focus is put on inductive proof rules for reasoning about loops.
My research interests include
- semantics and formal verification of probabilistic programs,
- quantitative verification techniques,
- verification of non-functional requirements,
- machine learning and verification,
- explainable verification,
- recursion theory, and
- (mathematical) logic.
For a list of publications and a list of selected talks, see the bottom of this page.
Distinguished Paper Award at POPL 2021
Our paper A Pre-expectation Calculus for Probabilistic Sensitivity (joint work with Alejandro Aguirre, Gilles Barthe, Justin Hsu, Joost-Pieter Katoen, and Christoph Matheja) has received the Distinguished Paper Award at POPL 2021. The paper describes a weakest-precondition-style calculus for reasoning about relational properties and sensitivity of probabilistic programs. At most 10% of all accepted papers are designated as distinguished papers.
Best Paper Award at LOPSTR 2020
Our paper Generating Functions for Probabilistic Programs (joint work with Lutz Klinkenberg, Kevin Batz, Joost-Pieter Katoen, Joshua Moerman, and Tobias Winkler) has received the Best Paper Award at LOPSTR 2020. The paper describes how to employ probability generating functions in verification of probabilistic programs.
Ackermann Award 2020
My PhD Dissertation Advanced Weakest Precondition Calculi for Probabilistic Programs has been honored with the Ackermann Award 2020 of the EACSL. The Ackermann Award is awarded for outstanding dissertations in Computer Science Logic.
Nomination for Dissertation Award of the GI
My PhD Dissertation Advanced Weakest Precondition Calculi for Probabilistic Programs was nominated for the Dissertation Award of the German Informatics Society (GI). It was the single nomination out of all computer science dissertations defended in 2019 at RWTH Aachen.
Nomination for Teaching Award 2019
My colleagues Jera Hensel, Tim Quatmann, Matthias Volk, and I were nominated for the Teaching Award 2019 awarded by the student body of the Faculty of Mathematics, Computer Science and Natural Sciences.
I have been awarded the Borchers Badge in 2019 for receiving a Doctoral degree (PhD) with distinction.
Select Attendee of Heidelberg Laureate Forum
I was a selected attendee of the 7th Heidelberg Laureate Forum.
Best Paper Award at SUM 2018
Our paper Rule-based Conditioning of Probabilistic Data (joint work with Maurice van Keulen, Christoph Matheja and Joost-Pieter Katoen) has received the Best Paper Award at SUM 2018. The paper presents how to integrate evidences into a probabilistic database by means of conditioning.
Nomination for EATCS Best Paper Award at ETAPS (ESOP) 2018
Our paper How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times (joint work with Kevin Batz, Joost-Pieter Katoen, and Christoph Matheja) was nominated for the EATCS Best Paper Award at ETAPS 2018. The paper shows how to use deductive program verification to deduce the expected time to obtain a single i.i.d-sample from a Bayesian network when using rejection sampling. The approach has been automated and shows that determining expected sampling times of the order of millions of years for large BNs can be done in a matter of seconds.
LMW 2017 Scholarship
FITweltweit Scholarship by the DAAD
EATCS Best Paper Award at ETAPS (ESOP) 2016
Our paper Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs (joint work with Joost-Pieter Katoen, Christoph Matheja, and Federico Olmedo) has received the EATCS Best Paper Award for the best theory paper presented at ETAPS 2016. The paper presents a wp-style calculus for probabilistic programs to analyze their expected runtimes, together with a set of proof rules for loops, and shows its application to several examples, including the coupon collector’s problem. Find a picture of the four happy award winners here.
Nomination for Teaching Award 2015
My colleague Christian Dehnert and I were nominated for the Teaching Award 2015 awarded by the student body of the Faculty of Mathematics, Computer Science and Natural Sciences. The winner of the award was Wied Pakusa whom I was more than lucky to have as a tutor when I was an undergraduate student.
Springorum Commemorative Coin
I have been awarded the Springorum Commemorative Coin in 2014 for receiving a master’s degree with distinction.
I am currently supervising my student research assistant Lena Verscht. Together with Christoph Matheja I have supervised our student research assistant Kevin Batz. Furthermore, I have supervised the following thesis and internship projects:
- Lena Verscht. Weakest Preexpectation Reasoning for Amortized Expected Runtimes. Bachelor’s Thesis.
- Lutz Klinkenberg. On Probability Generating Functions for Program Analysis. Master’s thesis.
- Kevin Batz. IC3 for Probabilistic Systems. Master’s thesis. (together with Sebastian Junges and Christoph Matheja)
- Sonja Skiba. Towards Completeness of a Proof Rule for Almost-sure Termination. Bacherlor’s thesis.
- David Herzkamp. Hardness of Probabilistic Termination with Nondeterminism. Bachelor’s thesis.
- Joshua Peignier (ENS Rennes). Possibility Distribution Semantics for Probabilistic Programs with Nondeterminism. 2017. Internship project. (together with Christoph Matheja)
- Sven Deserno, Probabilistic Model Checking for Markov Chain Families. 2017. Master’s thesis. (together with Sebastian Junges)
- Kevin Batz. Proof Rules for Expected Run-Times of Probabilistic Programs. 2017. Bachelor’s thesis. (together with Christoph Matheja).
- Simon Feiden. Extending Probability Generating Function Semantics to Negative Variable Valuations. 2016. Bachelor’s thesis.
- Clara Scherbaum. Probability Generating Function Semantics for Probabilistic Programs. 2016. Bachelor’s thesis. (winner of the itestra innovation Award for outstanding bachelor theses)
Editorial Board Memberships
- Frontiers in Computer Science (Review Editor since 2020)
- LICS 2022 – 37th Annual Symposium on Logic in Computer Science
- POPL 2022 – 48th ACM SIGPLAN Symposium on Principles of Programming Languages
- CAV 2021 – 33rd Int’l Conf. on Computer-Aided Verification
- CONCUR 2020 – 31st Int’l Conf. on Concurrency Theory, part of QONFEST 2020
- LPAR23 – 23rd Int’l Conf. on Logic for Programming, Artificial Intelligence and Reasoning (2020)
- QEST 2019 – 16th Int’l Conf. on Quantitative Evaluation of SysTems
- QEST 2018 – 15th Int’l Conf. on Quantitative Evaluation of SysTems, part of CONFESTA 2018
Research Funding Proposals
- Czech Science Foundation (GACR) (2019)
- Mathematical Structures in Computer Science (MSCS) (2020)
- Theoretical Computer Science (TCS) (2020)
- Transactions on Computational Logic (TOCL) (2017)
- Transactions on Modeling and Computer Simulation (TOMACS) (2020)
- Transactions on Programming Languages and Systems (TOPLAS) (2019)
- Formale Systeme, Automaten, Prozesse (SS 19)
- Foundations of Probabilistic Programming (SS 19)
- Static Methods for Quantitative Program Analysis (Seminar)
- Formal Verification Meets Machine Learning (Seminar)
- Datenstrukturen und Algorithmen (SS 18)
- Semantics and Verification of Software
- Foundations of Probabilistic Programming (Seminar)
- Verification and Static Analysis of Software (Seminar) (SS 17)
- Vorkurs Informatik (Diskrete Mathematik) (SS 16, SS 15, SS 14)
- Theoretical Foundations of the UML (SS 16)
- Probabilistic Programming (Seminar) (SS 16)
- Concurrency Theory (WS 15/16, WS 13/14)
- Algorithms and Data Structures (Proseminar) (WS 18/19, WS 15/16, WS 13/14)
- Datenstrukturen und Algorithmen (SS 15)
- Principles of Programming Languages (Seminar) (SS 15)
- Static Program Analysis (WS 14/15)
- Probabilistic Programs (Seminar) (WS 14/15)
- Turing Award Topics (Proseminar) (WS 14/15)
- Modeling and Verification of Probabilistic Systems (SS 14)
- Concurrency Theory (Seminar) (SS 14)
I was a member of the Teaching Committee (Kommission für Lehre) of the Department of Computer Science at RWTH Aachen University from 2014 till 2018.
I was a member of several search committees for full professorships (W2 and W3, including an Alexander von Humboldt professorship) in the fields of Neural Computing, Machine Learning, and Data Science.
I participated in the BeBuddy program of RWTH’s International Office.
I am a founding director of The Weissbord Institute.
|[bibtex] [issue]||Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman, Tobias Winkler. Generating Functions for Probabilistic Programs, 30th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR2020), Volume 12561 of Theoretical Computer Science and General Issues, 231-248, Springer, 2021.|
|[bibtex] [issue]||Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. Verifying Probabilistic Programs, International Conference on Quantitative Evaluation of System (QEST 2020), Volume 12289 of LNCS, 298-298, Springer, 2020.|
|[bibtex] [issue]||Kevin Batz, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer. PrIC3: Property Directed Reachability for MDPs, 32nd International Conference on Computer Aided Verification (CAV 2020), Volume 12225 of LNCS, 512-538, Springer, 2020.|
|[bibtex] [issue]||Joost-Pieter Katoen, Martin Ritzert, Richard Wilke, Katrin M. Dannert, Peter Lindner, Dennis Fischer, Janosch Fuchs, Björn Frederik Tauer, Vipin Ravindran Vijayalakshmi, Laura Vargas Koch, Nadine Friesen, Andreas Gabriel Klinger, Marcel Tobias Hark, Benjamin Lucien Kaminski, Sebastian Junges, Jip Josephine Spel, Anton Pirogov, Stefan Schupp, Till Hofmann, Daxin Liu, Martin Comis, Tabea Claudia Krabs, Stephan Zieger, Rebecca Haehn, Matthias Volk, Norman Weik, Helene-Maria Bolke-Hermanns. UnRAVeL Research Training Group: Uncertainty and Randomness in Algorithms, Verification, and Logic, 85 Seiten, 2020.|
|[bibtex] [issue]||Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman, Tobias Winkler. Generating Functions for Probabilistic Programs, 2020. https://arxiv.org/abs/2007.06327|
|[bibtex] [issue]||Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner. Generative Datalog with Continuous Distributions, 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2020), 347-360, ACM, 2020.|
|[bibtex] [issue]||Kevin Batz, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer. PrIC3: Property Directed Reachability for MDPs, 2020. https://arxiv.org/abs/2004.14835|
|[bibtex] [issue]||Marcel Tobias Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen. Aiming low is harder: induction for lower bounds in probabilistic program verification, Proceedings of the ACM on programming languages 4 (POPL), pages 1-28, ACM, 2020.|