| 2026 |
|---|
| DOI | Philipp Schröer, Darion Haase, Joost-Pieter Katoen. Error Localization, Certificates, and Hints for Probabilistic Program Verification via Slicing (Artifact Evaluation); v1,
Zenodo, 2026. |
| DOI | Joost-Pieter Katoen. The Optimal Strategy to Meet the Deadline: Ask Christel!,
Principles of formal quantitative analysis : essays dedicated to Christel Baier on the occasion of her 60th birthday / Nathalie Bertrand, Clemens Dubslaff, Sascha Klüppelholz, editors, 1-14, Springer, 2026. |
| DOI | Joost-Pieter Katoen. Facing Uncertainty in AI: From Formal Verification To Synthesis,
Theoretical Aspects of Computing – ICTAC 2025 : 22nd International Colloquium, Marrakech, Morocco, November 24–28, 2025, Proceedings / edited by Zhiming Liu, Adnane Saoud, Heike Wehrheim, 27-30, Springer Nature Switzerland, 2026. |
| DOI | Dominik Geißler, Tobias Winkler. Weighted Automata for Exact Inference in Discrete Probabilistic Programs,
Theoretical Aspects of Computing – ICTAC 2025 : 22nd International Colloquium, Marrakech, Morocco, November 24–28, 2025, Proceedings / edited by Zhiming Liu, Adnane Saoud, Heike Wehrheim, 261-278, Springer Nature Switzerland, 2026. |
| DOI | Martin Baum. Heuristic circuit mapping strategies for the SpinBus architecture,
1 Online-Ressource : Illustrationen, RWTH Aachen University, 2026. |
| DOI | Linus Heck, Tim Quatmann, Jip Josephine Spel, Joost-Pieter Katoen, Sebastian Junges. Generalized Parameter Lifting: Finer Abstractions for Parametric Markov Chains,
Automated technology for verification and analysis : 23rd International Symposium, ATVA 2025, Bengaluru, India, October 27-31, 2025 : proceedings / Meenakshi D´Souza, Raghavan Komondoor, B. Srivathsan, editors, 207-230, Springer, 2026. |
| DOI | Philipp Schroer, Joost-Pieter Katoen. Highly Incremental: A Simple Programmatic Approach for Many Objectives (Extended Version),
46 Seiten, 2026. |
| Samuel Akinlaja. Which probabalistic programs are modelcheckable?,
2026. |
| DOI | Arnd Hartmanns, Sebastian Junges, Tim Quatmann, Maximilian Weininger. The revised practitioner’s guide to MDP model checking algorithms,
31 Seiten, Springer, 2026. |
| DOI | Jonas Seidel. Sound and complete proof rules for almost-sure termination: from probabilistic control-flow graphs to program-level reasoning,
1 Online-Ressource : Illustrationen, RWTH Aachen University, 2026. |
| Xufei Xie. Visualizing execution-schedules for conveyor-based quantum computing hardware,
2026. |
| Matthias Wessling, Sebastian Brosch, Ann-Kathrin Mertens, Lea Maria Steinbeck, Richard Paul. Verfahren zur Herstellung flächiger, poröser Hydrogele mittels Fluss-Lithographie,
13 Seiten : Illustrationen, 2026. |
| DOI | Philipp Schroer, Joost-Pieter Katoen. Highly Incremental: A Simple Programmatic Approach for Many Objectives,
Formal Methods : 27th International Symposium, FM 2026, Tokyo, Japan, May 18–22, 2026, Proceedings, Part I / edited by Augusto Sampaio, Marielle Stoelinga, 559-577, Springer Nature Switzerland, 2026. |
| DOI | Yangjia Li, Mingshuai Chen, Liangran Zhao, Naijun Zhan, Hui Lu, Guohua Wu, Joost-Pieter Katoen. On termination of polynomial programs with equality conditions,
105487, Elsevier, 2026. |
| DOI | Dominik Geißler, Tobias Winkler. Correction to: Weighted Automata for Exact Inference in Discrete Probabilistic Programs,
Theoretical Aspects of Computing – ICTAC 2025 : 22nd International Colloquium, Marrakech, Morocco, November 24–28, 2025, Proceedings / edited by Zhiming Liu, Adnane Saoud, Heike Wehrheim, C1-C1, Springer Nature Switzerland, 2026. |
| DOI | Jonas Deutsch. Bounds for quantum weakest preconditions,
1 Online-Ressource : Illustrationen, RWTH Aachen University, 2026. |
| DOI | Arnd Hartmanns, Tim Quatmann, Mark Wijk. Tools and Algorithms for Sound Multi-Objective Probabilistic Model Checking,
Formal Methods : 27th International Symposium, FM 2026, Tokyo, Japan, May 18–22, 2026, Proceedings, Part I / edited by Augusto Sampaio, Marielle Stoelinga, 189-210, Springer Nature Switzerland, 2026. |
| DOI | Daniel Zilken, Kevin Batz, Joost-Pieter Katoen, Tobias Winkler. Verifying Sampling Algorithms via Distributional Invariants,
Formal Methods : 27th International Symposium, FM 2026, Tokyo, Japan, May 18–22, 2026, Proceedings, Part I / edited by Augusto Sampaio, Marielle Stoelinga, 259-278, Springer Nature Switzerland, 2026. |
| DOI | Roman Andriushchenko, Alexander Nikolai Bork, Milan Češka, Sebastian Junges, Joost-Pieter Katoen, Filip Macák. Search and explore: symbiotic policy synthesis in POMDPs,
4, Springer Science + Business Media B.V, 2026. |
| DOI | Philipp Schroer, Kevin Batz, Umut Yigit Dural, Darion Haase, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. Caesar: A Deductive Verifier for Probabilistic Programs,
Computer Aided Verification : 38th International Conference, CAV 2026, Lisbon, Portugal, July 26–29, 2026, Proceedings, Part III / edited by Eva Darulova, Anthony W. Lin, Philipp Rümmer, 565-582, Springer Nature Switzerland, 2026. |
| DOI | Milan Češka, Sebastian Junges, Luko Maas, Filip Macák, Tim Quatmann. Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families,
Computer Aided Verification : 38th International Conference, CAV 2026, Lisbon, Portugal, July 26–29, 2026, Proceedings, Part III / edited by Eva Darulova, Anthony W. Lin, Philipp Rümmer, 526-549, Springer Nature Switzerland, 2026. |
| Philip Strüwer. Semantic equivalences of probabilistic programs and their underlying Markov chains,
2026. |
| DOI | Dominik Geißler, Tobias Winkler. Probabilistic programming meets automata theory: Exact inference using weighted automata,
116224, Elsevier, 2026. |
| Felix Euting. Distribution transformers for probabilistic programs: a study of inductive definability,
2026. |
| Ole Dannemeyer. Belief-tracking policies for partially observable MDPs via randomized finite-state controllers,
2026. |