The paper entitled “Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains” by Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann and Tobias Winkler has received the EAPLS (Eur. Association of Programming Languages) Best Paper Award@ETAPS 2024. The paper provides efficient and scalable algorithms to compute expected visiting times in Markov chains, and shows how […]

Joost-Pieter Katoen has been elected as member of Leopoldina, the German Academy of Sciences. This academy was established in 1652 and is the oldest academy in the world. Katoen is the first computer scienttist from RWTH Aachen University in Leopoldina and the 15th RWTH member of Leopoldina ever. See also press announcements: https://www.rwth-aachen.de/cms/root/Die-RWTH/Aktuell/Pressemitteilungen/Maerz-2024/~bgppks/Joost-Pieter-Katoen-in-die-Leopoldina-au/lidx/1/ and https://www.utwente.nl/en/eemcs/news/2024/3/1415316/professor-joost-pieter-katoen-inducted-into-the-leopoldina-academy-of-sciences

The paper entitled “Exact Bayesian Inference for Loopy Probabilistic Programs Using Generating Functions” by Lutz Klinkenberg, Christian Blumenthal, Mingshuai Chen, Darion Haase and Joost-Pieter Katoen has been accepted for the Conference Object-Oriented Programming, Systems, Languages, and Applications 2024 (OOPSLA). The paper presents a novel exact inference technique for discrete probabilistic programs with unbounded loops and conditioning. […]

The paper “Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains” by Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann and Tobias Winkler has been nominated for one of the ETAPS 2024 best paper awards. (For Tim, this is the second year in a row to be nominated for such an award.)

The ERC has granted the Proof-of-Concept proposal VERIPROB (A Deductive Verifier for Probabilistic Programs) by Joost-Pieter Katoen. The grant will enables the further development of Caesar, a verifier vor weakest precondition-reasoning on probabilistic programs.

The papers “Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains” by Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann and Tobias Winkler and “Learning Explainable and Better Performing Representations of POMDP Strategies” by Alexander Bork, Debraj Chakraborty, Kush Grover, Jan Kretinsky and Stefanie Mohr have both been accepted at TACAS 2024 in Luxemburg. The […]

The paper entitled “Natural Strategic Ability in Stochastic Multi-Agent Systems” by Raphael Berthon, Monyque Myttelmann, Antoniello Murano and Joost-Pieter Katoen has been accepted for the 38th AAAI Conference on Artificial Intelligence (AAAI 2024) in Vancouver, Canada. The paper present complexity result on the model checking of the probabilistic alternating temporal logics PATL and PATL∗ under […]

Two papers were accepted at the Dafny 2024 workshop. The paper “Caesar: A Verifier for Probabilistic Programs” by Philipp Schröer, Kevin Batz, Benjamin Kaminski (Saarland University and UCL), Joost-Pieter Katoen and Christoph Matheja (TU Denmark) presents a quantitative program verification infrastructure for discrete probabilistic programs, building on our work published at OOPSLA 2023. The paper […]

Tim Quatmann has been awarded a KI-Starter Grant for his project proposal “Verifying AI Systems under Partial Observability“. The KI-Starter Grant is an initiative of the State North-Rhine Westphalia to strengthen its position in AI and in particular stimulates young researchers in their academic career. Tim’s project focuses on the automated verification using model checking […]

The paper entitled “Programmatic Strategy Synthesis: Resolving Nondeterminism in  Probabilistic Programs” by Kevin Batz, Tom Biskup, Joost-Pieter Katoen, and Tobias Winkler has been accepted at the 51st ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2024). The paper shows how to use deductive verification to resolve pure nondeterminism in probabilistic programs such that the obtained determinized program […]