Joost-Pieter Katoen

Three papers at TACAS 2023

Three papers of the MOVES group have been accepted for TACAS 2023! “A Practitioner’s Guide to MDP Model Checking Algorithms” by Arnd Hartmanns, Sebastian Junges, Tim Quatmann and Maximilian Weininger presents an empirical evaluation of various algorithms (different forms of value iteration, policy iteration and direct algorithms) to compute reachability probabilities in Markov decision processes. […]

Paper at POPL 2023

The paper entitled “A Calculus for Amortized Expected Runtimes” by Kevin Batz, Benjamin Kaminski (Saarland/UCL), Joost-Pieter Katoen, Christoph Matheja (DTU Lyngby) and Lena Verscht has been accepted for presentation at the 50th ACM Symposium on Principles of Programming Languages (POPL). The paper presents a weakest precondition-style calculus to determine the amortized expected run-time of randomized […]

WhatsApp Research Award

Philipp Schroer and Joost-Pieter Katoen receive a Research Award from WhatsApp, through its parent company, Meta Platforms, Inc. for their research proposal “A Deductive Verification Infrastructure for Probabilistic Programs”. Out of 62 research proposals that were submitted to WhatsApp Privacy Aware Program Analysis, 6 projects have been awarded. For more information, see here.

Paper in Information & Computation

The paper entitled “Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming” by Qiuye Wang, Mingshuai Chen, Bai Xue, Naijun Zhan, and Joost-Pieter Katoen has been accepted for publication in the journal Information and Computation. The paper presents a novel condition on barrier certificates that witnesses unbounded-time safety of differential dynamical systems and provides […]

Journal Paper in FMSD

The paper entitled “The Probabilistic Termination Tool Amber” by Ezio Bartocci, Marcel Moosbrugger, Joost-Pieter Katoen and Laura Kovacs has been accepted in a special issue devoted to the Formal Methods Symposium 2021 in the journal Formal Methods in System Design. The paper describes a tool that can automatically check whether a probabilistic program (of a […]

Journal Paper in FMSD

The paper entitled “Stochastic Games with Lexicographic Objectives” by Krishnendu Chatterjee (IST), Joost-Pieter Katoen, Stephanie Mohr (TUM), Maximilain Weininger (TUM) and Tobias Winkler has been accepted fior publication in special issue devoted to CAV 2020 in the journal Formal Methods in System Design. The paper considers presents a detailed study of stochastic turn-based games (SG) […]

Paper in Journal of the ACM

The paper entitled “Generative Datalog with Continuous Distributions” by Martin Grohe, Benjamin Kaminski, Joost-Pieter Katoen and Peter Lindner has been accepted in Journal of the ACM. The paper defines a formal semantics (based on stochastic kernels and Markov processes) of a probabilistic version of the Datalog querying language for probabilistic databases storing data with continuous […]

Paper at OOPSLA 2022

The paper entitled “Reasoning about Distributed Reconfigurable Systems” by Emma Ahrens (RWTH), Marius Bozga (Grenoble), Radu Iosif (Grenoble) and Joost-Pieter Katoen has been accepted for presentation at the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA 2022) in Auckland, New Zealand. The paper presents a resource-based program logic for (local) reasoning about safety […]

Paper at CONCUR 2022

The paper entitled “Towards Concurrent Quantitative Separation Logic” by Ira Fesefeldt, Joost-Pieter Katoen and Thomas Noll has been accepted at the 33rd International Conference on Concurrency Theory (CONCUR), to be held in Warsaw. The paper proposes a variant of Quantitative Separation Logic (QSL) for reasoning about concurrent probabilistic programs.

Paper at QEST 2022

The paper entitled “POMDP Controllers With Optimal Budget” by Jip Spel, Svenja Stein and Joost-Pieter Katoen has been accepted for presentation at the 18th International Conference on Quantitative Evaluation of SysTems (QEST) in Warsaw, Poland. The paper tackles the problem of finding “almost optimal” valuations for parametric Markov chains, such that the expected reward to […]