| 2022 |
| Laura Bamberger.
Implementation of an LTL model checker for probabilistic pushdown automata,
2022. |
| DOIFull Text | Matthias Volk.
Dynamic fault trees,
RWTH Aachen University, 2022. |
| DOIFull Text | Christina Gehnen.
POMDP-based execution models for probabilistic programs with partial observability,
pages 1 Online-Ressource: Illustrationen, RWTH Aachen University, 2022. |
| 2021 |
| DOI | Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman, Tobias Winkler.
Generating Functions for Probabilistic Programs,
Volume 12561 of Theoretical Computer Science and General Issues, pages 231-248, Springer, 2021. |
| DOIFull Text | .
Foundations of probabilistic programming,
pages xiv, 568 Seiten : Illustrationen, Cambridge University Press, 2021. |
| DOIFull Text | Erika Ábrahám, James H. Davenport, Matthew England, Gereon Kremer.
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings,
pages 100633, Elsevier Science, 2021. |
| DOI | Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez, Tobias Winkler.
The complexity of reachability in parametric Markov decision processes,
pages 183-210, Elsevier, 2021. |
| DOIFull Text | Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja.
Relatively complete verification of probabilistic programs,
pages 39, ACM, 2021. |
| DOIFull Text | Dario Veltri.
Learning probabilistic automata with SMT solving,
71 pages, RWTH Aachen University, 2021. |
| DOIFull Text | Mikołaj Bojańczyk, Bartek Klin, Joshua Moerman.
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata,
16 pages, 2021. |
| Mengying Xue.
Efficient analysis of time-bounded reachability in markov automata,
2021. |
| DOIFull Text | Tim Quatmann, Joost-Pieter Katoen.
Multi-objective Optimization of Long-run Average and Total Rewards,
Volume 12651 of LNCS, pages 230-249, Springer, 2021. |
| DOIFull Text | Jip Josephine Spel, Sebastian Junges, Joost-Pieter Katoen.
Finding Provably Optimal Markov Chains,
Volume 12651 of LNCS, pages 173-190, Springer, 2021. |
| DOIFull Text | Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja.
A pre-expectation calculus for probabilistic sensitivity,
pages 52, Association for Computing Machinery, 2021. |
| DOI | Milan Češka, Hans Christian Hensel, Sebastian Junges, Joost-Pieter Katoen.
Counterexample-guided inductive synthesis for probabilistic systems,
pages 637-667, Springer, 2021. |
| DOI | Ira Justus Fesefeldt, Christoph Matheja, Thomas Noll, Johannes Schulte.
Automated Checking and Completion of Backward Confluence for Hyperedge Replacement Grammars,
Volume 12741 of LNCS, pages 283-293, Springer, 2021. |
| DOIFull Text | Qiuye Wang, Mingshuai Chen, Bai Xue, Naijun Zhan, Joost-Pieter Katoen.
Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming,
Volume 12759, Theoretical Computer Science and General Issues of LNCS, pages 443-466, Springer, 2021. |
| DOIFull Text | Kevin Batz, Mingshuai Chen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer.
Latticed $k$-Induction with an Application to Probabilistic Programs,
Volume 12760 of LNCS, pages 524-549, Springer, 2021. |
| Domenic Quirl.
IDE-Ready parsing of compile-time dynamic languages,
2021. |
| DOIFull Text | Tobias Winkler, Maximilian Weininger.
Stochastic Games with Disjunctions of Multiple Objectives,
Volume 346 of EPTCS, pages 85-100, NICTA, 2021. |
| DOI | Arnd Hartmanns, Joost-Pieter Katoen, Bram Kohlen, Jip Josephine Spel.
Tweaking the Odds in Probabilistic Timed Automata,
Volume 12846 of LNCS, pages 39-58, Springer, 2021. |
| Patrick Arens.
Weakest-preexpectation proof rules for disjoint concurrent probabilistic programs,
2021. |
| Marvin Jansen.
Decidability and complexity of entailment checking in quantitative separation logic,
2021. |
| DOIFull Text | Roman Andriushchenko, Milan Češka, Sebastian Junges, Joost-Pieter Katoen, Šimon Stupinský.
PAYNT,
Volume 12759, Theoretical Computer Science and General Issues of LNCS, pages 856-869, Springer, 2021. |
| DOI | Carlos E. Budde, Arnd Hartmanns, Michaela Klauck, Jan Křetínský, David Parker, Tim Quatmann, Andrea Turrini, Zhen Zhang.
On Correctness, Precision, and Performance in Quantitative Verification,
Volume 12479 of LNCS, pages 216-241, Springer, 2021. |