Joost-Pieter Katoen

Katoen named ACM Fellow

Prof. Joost-Pieter Katoen has been named ACM Fellow 2020 for his contributions to model checking of software and probabilistic systems. The ACM Fellows program recognizes the top 1% of ACM Members for their outstanding accomplishments in computing and information technology and/or outstanding service to ACM and the larger computing community. Fellows are nominated by their […]

Three papers at TACAS 2021

We are delighted to inform you that three MOVES papers have been accepted at TACAS 2021: “Inductive Synthesis for Probabilistic Programs Reaches New Horizons” by Roman Andriushchenko, Milan Ceska, Sebastian Junges and Joost-Pieter Katoen “Multi-objective Optimization of Long-run Average and Total Rewards” by Tim Quatmann and Joost-Pieter Katoen, and “Finding Provably Optimal Markov Chains” by Jip […]

Paper at ESOP 2021

The paper entitled “Automated Termination Analysis of Polynomial Probabilistic Programs ” by Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen and Laura Kov√°cs has been accepted for the European Symposium on Programming (ESOP 2021). The paper presents an algebraic approach and the publicly available tool Amber to automatically prove whether a probabilistic programs is almost-surely terminating (or […]

Distinguished POPL 2021 Paper Award

We are happy to announce that the paper A Pre-Expectation Calculus for Probabilistic Sensitivity by Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Kaminski, Joost-Pieter Katoen and Christoph Matheja has been selected as distinguished POPL 2021 paper. The paper develops a logic for estimating sensitivity properties (how do changes in the inputs affect the program’s output?) […]

LOPSTR 2020 Best Paper Award

We are happy to announce that the paper “Generating Functions for Probabilistic Programs” by Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman and Tobias Winkler has received the best paper award at LOPSTR 2020, the 30th Int. Symp. on Logic-Based Program Synthesis and Transformation.

Book Foundations of Probabilistic Programming Published

The book “Foundations of Probabilistic Programming”, edited by Gilles Barthe, Joost-Pieter Katoen and Alexandra Silva has been published under gold open access. It contains survey chapters of various leading researchers on formal semantics, verification, analysis and applications of probabilistic programming. Get your free download at: https://www.cambridge.org/core/books/foundations-of-probabilistic-programming/819623B1B5B33836476618AC0621F0EE#

Ackermann Award 2020

Benjamin Kaminski will receive the prestigious 2020 Ackermann Award for his Ph.D. dissertation on “Advanced Weakest Precondition Calculi for Probabilistic Programs” which he defended in February 2019. The Ackermann Award is an annual award by the EACSL (European Association of Computer Science Logic) and is given to an outstanding dissertation in the area “Logic in […]

Storm Journal Paper

The paper ” The Probabilistic Model Checker Storm” by Christian Hensel, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann and Matthias Volk has been accepted for the Journal of Software Tools in Technology Transfer. The paper presents the ins and outs of Storm, the model checker for discrete and continuous Markov models (with and without non-determinism) that […]

Two POPL 2021 Papers

We are delighted to announce that the following papers have been accepted for ACM Principles of Programming Languages 2021: ¬†Relatively Complete Verification of Probabilistic Programs by Kevin Batz, Benjamin Kaminski, Joost-Pieter Katoen and Christoph Matheja, and A Pre-Expectation Calculus for Probabilistic Sensitivity by Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Kaminski, Joost-Pieter Katoen and Christoph […]

3rd Place TRA VISIONS 2020 Young Researcher Competition

Congratulations to Matthias Volk and Norman Weik who got the 3rd place in the Young Researcher Competition in the Category “Rail” for their contribution “Reliability analysis of railway station infrastructure based on dynamic fault trees” at the TRA VISIONS 2020 Conference, see https://www.travisions.eu/TRAVisions/young_researcher_results_2020/