| 2026 |
| DOI | Philipp Schröer, Darion Haase, Joost-Pieter Katoen.
Error Localization, Certificates, and Hints for Probabilistic Program Verification via Slicing (Artifact Evaluation),
Zenodo, 2026. |
| DOI | Joost-Pieter Katoen.
Facing Uncertainty in AI,
2026. |
| DOI | Joost-Pieter Katoen.
The Optimal Strategy to Meet the Deadline,
Volume 157 of LNCS, pages 1–14, Springer, 2026. |
| 2025 |
| DOIFull Text | Raphael Jean Berthon, Joost-Pieter Katoen, Zihan Zhou.
A Direct Reduction from Stochastic Parity Games to Simple Stochastic Games,
Volume 348 of Leibniz international proceedings in informatics, pages 9:1-9:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, 2025. |
| DOIFull Text | Roman Andriushchenko, Milan Češka, Filip Macák, Sebastian Junges, Joost-Pieter Katoen.
An Oracle-Guided Approach to Constrained Policy Synthesis Under Uncertainty,
pages 433-469, AI Access Found., 2025. |
| DOIFull Text | Lutz Klinkenberg.
Analysis of probabilistic programs using generating functions,
RWTH Aachen University, 2025. |
| DOIFull Text | Timm Spork, Christel Baier, Joost-Pieter Katoen, Sascha Klüppelholz, Jakob Piribauer.
Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains,
Volume 15932 of LNCS, pages 56-81, Springer, 2025. |
| DOIFull Text | Dominik Geißler.
Automata-based semantics for the probabilistic programming language ReDiP,
RWTH Aachen University, 2025. |
| Sascha Thiemann.
Compilation of quantum programs with control flow primitives in superposition,
2025. |
| DOIFull Text | Hannah Mertens, Tim Quatmann, Joost-Pieter Katoen.
Compositional Reasoning for Parametric Probabilistic Automata,
Volume 348 of Leibniz international proceedings in informatics, pages 31:1-31:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, 2025. |
| DOIFull Text | Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann, Tobias Winkler.
Computing Expected Visiting Times and Stationary Distributions in Markov Chains,
pages 23, Springer, 2025. |
| Rico Stanosek.
Cost-reliability optimal spare part allocation in dynamic fault trees with relaxed spare gates,
2025. |
| DOIFull Text | Emil Beothy-Elo.
Effective quantifier-based reasoning for quantitative deductive verification,
RWTH Aachen University, 2025. |
| DOI | Carolina Gerlach, Tobias Winkler, Erika Ábrahám, Borzoo Bonakdarpour, Sebastian Junges.
Efficient Probabilistic Model Checking for Relational Reachability,
Volume 15931 of LNCS, pages 127-147, Springer, 2025. |
| DOIFull Text | Carolina Gerlach, Tobias Winkler, Erika Ábrahám, Borzoo Bonakdarpour, Sebastian Junges.
Efficient Probabilistic Model Checking for Relational Reachability (Extended Version),
30 pages, 2025. |
| DOIFull Text | Philipp Schroer, Darion Haase, Joost-Pieter Katoen.
Error Localization, Certificates, and Hints for Probabilistic Program Verification via Slicing (Extended Version),
2025. |
| DOIFull Text | Mareike Metzler.
Evaluating tool support for fault tree analysis of satellite constellations,
RWTH Aachen University, 2025. |
| Glen Jordan Grant.
Exploration of certificate sharing for neural network verification,
2025. |
| Muhammad Asad Murtaza Butt.
Extending the assume–guarantee framework for parametric probabilistic automata,
2025. |
| DOIFull Text | Krishnendu Chatterjee, Tim Quatmann, Maximilian Schäffeler, Maximilian Weininger, Tobias Winkler, Daniel Zilken.
Fixed Point Certificates for Reachability and Expected Rewards in MDPs,
54 pages, 2025. |
| DOIFull Text | Krishnendu Chatterjee, Tim Quatmann, Maximilian Schäffeler, Maximilian Weininger, Tobias Winkler, Daniel Zilken.
Fixed Point Certificates for Reachability and Expected Rewards in MDPs,
Volume 15697 of LNCS, pages 130-151, Springer, 2025. |
| DOIFull Text | Kevin Batz, Joost-Pieter Katoen, Francesca Randone, Tobias Winkler.
Foundations for Deductive Verification of Continuous Probabilistic Programs,
pages 421-448, ACM, 2025. |
| Full Text | .
Fundamentals of Software Engineering (extended versions of selected papers of FSEN 2023),
Elsevier Science, 2025. |
| Sophia Greiwe.
Implementation of PRNG-based elimination of intermediate measurements in quantum circuits,
2025. |
| Elbeck Lazaridi.
Implementing the denotational semantics of probabilistic programs,
2025. |