Joost-Pieter Katoen

Positions for PhDs and postdocs

We solicit applications for PhD studentships and postdoctoral research positions in the area of verifying probabilistic programs. The positions are funded by the recently acquired ERC Advanced Grant “Formal Reasoning about Probabilistic Programs (FRAPPANT)”. What is this project all about? Probabilistic programs describe recipes on how to infer statistical conclusions about data from a complex […]

Paper at UAI 2018

The paper entitled “Finite-State Controllers of POMDPs using Parameter Synthesis” by Sebastian Junges, Nils Jansen, Ralf Wimmer, Tim Quatmann, Leonore Winterer, Bernd Becker, and Joost-Pieter Katoen has been accepted for the Uncertainty in AI 2018 Conference in Monterrey, USA. The key idea of the paper is that that computing randomised FSCs on POMDPs is equivalent […]

Paper at SPIN 2018 Symposium

The paper entitled “Improving Generalization in Software IC3” by Tim Lange, Frederick Prinz, Martin R. Neuhäußer (Siemens), Thomas Noll and Joost-Pieter Katoen has been accepted for the 25th International Symposium on Model Checking of Software (SPIN 2018) in Malaga, Spain. The paper presents several advancements to the generalization procedure of IC3, focused on software verification. […]

Paper in Acta Informatica

The paper entitled “On the Hardness of Analyzing Probabilistic Programs” by Benjamin Kaminski, Joost-Pieter Katoen, and Christoph Matheja has been accepted for publication in the journal Acta Informatica. The papers presents various hardness results for elementary decision problems on probabilistic programs such as “does a program terminate almost surely?”, “does it terminate in finite expected […]

Paper in Journal of the ACM

The paper entitled “Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms” by Benjamin Kaminski, Joost-Pieter Katoen, Christoph Matheja and Federico Olmedo has been accepted for the prestigious journal Journal of the ACM. This paper presents a wp–style calculus for obtaining bounds on the expected run time of randomized algorithms.Its application includes determining the (possibly […]

Two papers accepted at FM 2018

The papers “Verifying Auto-Generated C Code from Simulink” by Philipp Berger, Joost-Pieter Katoen, Erika Ábrahám, Md Tawhid Bin Waez and Thomas Rambow, as well as the paper “Formal Verification of Automotive Simulink Controller Models: Empirical Technical Challenges, Evaluation and Recommendations” by Johanna Nellen, Thomas Rambow, Md Tawhid Bin Waez, Erika Abraham and Joost-Pieter Katoen, have […]

Four Papers at CAV 2018

Four papers with involvement of the MOVES group have been accepted at CAV 2018: “Sound Value Iteration” by Tim Quatmann and Joost-Pieter Katoen “Let this Graph be your Witness! An Attestor for Verifying Java Pointer Programs” by Hannah Arndt, Christina Jansen, Joost-Pieter Katoen, Christoph Matheja and Thomas Noll “Monitoring CTMCs By Multi-Clock Timed Automata” by […]

Paper accepted at DSN 2018

The paper “Branching Bisimulation and Concurrent Object Verification” by Xiaoxiao Yang, Joost-Pieter Katoen, Huimin Lin, Gaoang Liu, and Hao Wu has been accepted for the 48th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2018) in Luxemburg. The paper, a result of the cooperation within the CDZ project CAP with the Institute of Software, […]

Paper accepted at Petri Nets 2018

The paper “One Nets Fits All — A unifying semantics of Dynamic Fault Trees using GSPNs” by Sebastian Junges, Joost-Pieter Katoen, Marielle Stoelinga and Matthias Volk has been accepted for Petri Nets 2018. The paper presents a simple, compositional GSPN semantics for DFTs that unifies all existing DFT semantics from the literature.

Paper accepted at TACAS 2018

The paper “Multi-Cost Bounded Reachability in MDPs” by Arnd Hartmanns, Sebastian Junges, Joost-Pieter Katoen and Tim Quatmann has been accepted for TACAS 2018. The paper presents an efficient algorithm for multi-objective model checking problems on Markov decision processes (MDPs) with multiple cost structures.