Benjamin Kaminski

kaminski2
Email
benjamin.kaminski at cs.rwth-aachen.de
Address
Room 4230
Ahornstraße 55
D-52074 Aachen
Phone
+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.

Thesis

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.

Research

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.

You can also find me on dblp and Google Scholar.

Students

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 KlinkenbergOn 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 BatzProof 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 ScherbaumProbability Generating Function Semantics for Probabilistic Programs. 2016. Bachelor’s thesis. (winner of the itestra innovation Award for outstanding bachelor theses)

Peer Review

Program Committees

External Reviewer

Research Funding Proposals

Edited Volumes

Journals

Conferences

Teaching

Awards

Other Activities

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 gave several popular scientific talks for interested high school students, e.g. at Aachener Informatiktage 2014Erstinfotag 2014, or Beratungstage 2018.

I participated in the BeBuddy program of RWTH’s International Office.

2019
DOI fulltext PDF [bibtex] Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll. Quantitative separation logic: a logic for reasoning about probabilistic pointer programs, Proceedings of the ACM on programming languages 3 (POPL), pages 34, 2019.
DOI fulltext PDF [bibtex] Benjamin Lucien Kaminski. Advanced weakest precondition calculi for probabilistic programs, PhD Thesis, RWTH Aachen University, 363 pages, 2019.
2018
DOI [bibtex] Maurice van Keulen, Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen. Rule-Based Conditioning of Probabilistic Data, 12th International Conference on Scalable Uncertainty Management (SUM 2018), Volume 11142 of Lecture Notes in Artificial Intelligence, pages 290-305, Springer, 2018.
DOI [bibtex] Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. On the hardness of analyzing probabilistic programs, Acta informatica , 2018.
DOI [bibtex] Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo. Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms, Journal of the ACM : JACM 65 (5), pages 30:1-30:68, 2018.
arXiv:1802.10467 fulltext PDF [bibtex] Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll. Quantitative Separation Logic : A Logic for Reasoning about Probabilistic Programs, 2018. arXiv:1802.10467
DOI [bibtex] Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. How long, O Bayesian network, will I sample thee? : A program analysis perspective on expected sampling times, 27th European Symposium on Programming (ESOP 2018), LNCS, pages 186-213, Springer, 2018.
DOI [bibtex] Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, Joost-Pieter Katoen. A new proof rule for almost-sure termination, Proceedings of the ACM on Programming Languages 2, pages 33:1-33:28, 2018.
DOI [bibtex] Federico Olmedo, Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Annabelle Mciver. Conditioning in Probabilistic Programming, ACM transactions on programming languages and systems : ACM TOPLAS 40 (1), pages 4, 2018.
2017
[bibtex] Benjamin Lucien Kaminski, Joost-Pieter Katoen. A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations, Symposium on Logic in Computer Science (LICS), pages 1-12, IEEE, 2017.
2016
DOI [bibtex] Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. Inferring Covariances for Probabilistic Programs, 13th International Conference on Quantitative Evaluation of Systems (QEST 2016), Volume 9826 of LNCS, pages 191-206, Springer, 2016.
DOI [bibtex] Federico Olmedo Beron, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. Reasoning about Recursive Probabilistic Programs, The 31st Annual ACM/IEEE Symposium, pages 672-681, ACM Press, 2016.
DOI [bibtex] Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo Beron. Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs, 25th European Symposium on Programming (ESOP 2016), Volume 9632 of LNCS, pages 364-389, Springer, 2016.
DOI [bibtex] Nils Jansen, Hans Christian Dehnert, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Lukas Westhofen. Bounded Model Checking for Probabilistic Programs, 14th International Symposium on Automated Technology for Verification and Analysis (ATVA), Volume 9938 of LNCS, pages 68-85, Springer, 2016.
fulltext PDF [bibtex] Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Federico Olmedo Beron. On the Semantic Intricacies of Conditioning, 1st Workshop on Probabilistic Programming Semantics (PPS 2016), 2 pages, 2016.
2015
[bibtex] Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo. Probabilistic Programs - A Natural Model for Approximate Computations, Workshop on Approximate Computing (AC15), 2015.
DOI [bibtex] Joost-Pieter Katoen, Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Federico Olmedo Beron. Understanding Probabilistic Programs, Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, Volume 9360 of LNCS, pages 15-32, Springer, 2015.
DOI [bibtex] Benjamin Lucien Kaminski, Joost-Pieter Katoen. On the Hardness of Almost–Sure Termination, 40th International Symposium on Mathematical Foundations of Computer Science (MFCS 2015), Volume 9234 of LNCS, pages 308-318, Springer, 2015.
DOI fulltext PDF [bibtex] Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Federico Olmedo, Friedrich Gretz, Annabelle McIver. Conditioning in Probabilistic Programming, Electronic notes in theoretical computer science 319, pages 199-216, 2015.
2014
[bibtex] Benjamin Lucien Kaminski, Wolfgang Marquardt, Lasse Greiner, Sebastian Heger, Kerstin Bluhm, Manuel Hechinger, Manuel Dahmen, Jakob Mottweiler, Dominique Dechambre, Henner Hollert, André Bardow, Carsten Bolm, Kai Leonhard, Ludger Wolfgang Michael Wolff. CIF-3 : Model-Based Fuel Design, TMFB 2nd International Conference, 2014.
2011
DOI [bibtex] Raimondas Sasnauskas, Oscar Soria Dustmann, Benjamin Lucien Kaminski, Klaus Wehrle, Carsten Weise, Stefan Kowalewski. Scalable symbolic execution of distributed systems, 2011 31st International Conference on Distributed Computing Systems, (ICDCS 2011), pages 333-342, IEEE, 2011.