| 2022 |
|---|
| Caroline Jabs. Novelty-detection-based split selection heuristics for neural network verification, 2022. |
| Ben Sturgis. Automatic verification of loop invariants in weighted programs, 2022. |
| Christian Blumenthal. Inference in discrete probabilistic programs using probability generating functions, 2022. |
| Laura Bamberger. Implementation of an LTL model checker for probabilistic pushdown automata, 2022. |
| DOI | Matthias Volk. Dynamic fault trees: semantics, analysis and applications, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2022. |
| DOI | Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács. The probabilistic termination tool amber, 90-109, Springer Science + Business Media B.V, 2022. |
| DOI | Christina Gehnen. POMDP-based execution models for probabilistic programs with partial observability, 1 Online-Ressource: Illustrationen, RWTH Aachen University, 2022. |
| 2021 |
|---|
| DOI | Mingshuai Chen, Martin Fränzle, Yangjia Li, Peter N. Mosaad, Naijun Zhan. Indecision and delays are the parents of failure - taming them algorithmically by synthesizing delay-resilient control, 497-528, Springer, 2021. |
| DOI | Leonore Winterer, Sebastian Junges, Ralf Wimmer, Nils Jansen, Ufuk Topcu, Joost-Pieter Katoen, Bernd Becker. Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions, 1040-1054, Institute of Electrical,Electronics Engineers, 2021. |
| DOI | Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman, Tobias Winkler. Generating Functions for Probabilistic Programs, Logic-based program synthesis and transformation : 30th international symposium, LOPSTR 2020, bologna, italy, september 7–9, 2020, proceedings / edited by maribel fernández, 231-248, Springer International Publishing [2021.] ; Cham : Imprint: Springer [2021.], 2021. |
| DOI | . Foundations of probabilistic programming, xiv, 568 Seiten : Illustrationen, Cambridge University Press, 2021. |
| DOI | 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, 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, 183-210, Elsevier, 2021. |
| DOI | Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. Relatively complete verification of probabilistic programs : an expressive language for expectation-based reasoning, 39, ACM, 2021. |
| DOI | Dario Veltri. Learning probabilistic automata with SMT solving, 71 Seiten, RWTH Aachen University, 2021. |
| DOI | Mikołaj Bojańczyk, Bartek Klin, Joshua Moerman. Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata, 16 Seiten, 2021. |
| Mengying Xue. Efficient analysis of time-bounded reachability in markov automata, 2021. |
| DOI | Tim Quatmann, Joost-Pieter Katoen. Multi-objective Optimization of Long-run Average and Total Rewards, Tools and algorithms for the construction and analysis of systems : 27th international conference, TACAS 2021, held as part of the european joint conferences on theory and practice of software, ETAPS 2021, luxembourg city, luxembourg, march 27 - april 1, 2021, proceedings, part I, 230-249, Springer International Publishing, 2021. |
| DOI | Jip Josephine Spel, Sebastian Junges, Joost-Pieter Katoen. Finding Provably Optimal Markov Chains, Tools and algorithms for the construction and analysis of systems : 27th international conference, TACAS 2021, held as part of the european joint conferences on theory and practice of software, ETAPS 2021, luxembourg city, luxembourg, march 27 - april 1, 2021, proceedings, part I, 173-190, Springer International Publishing, 2021. |
| DOI | Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. A pre-expectation calculus for probabilistic sensitivity, 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, 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, Graph transformation : 14th international conference, ICGT 2021, held as part of STAF 2021, virtual event, june 24-25, 2021, proceedings, 283-293, Springer International Publishing, 2021. |
| DOI | Qiuye Wang, Mingshuai Chen, Bai Xue, Naijun Zhan, Joost-Pieter Katoen. Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming, Computer-aided verification : 33rd international conference, CAV 2021 : Virtual event july 20-23, 2021 : Proceedings / alexandra silva, alexandra and K. Rustan M. Leino (eds.). - Part I, 443-466, Springer, 2021. |
| DOI | Kevin Batz, Mingshuai Chen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer. Latticed <span class="nocase">k</span>-Induction with an Application to Probabilistic Programs, Computer-aided verification : 33rd international conference, CAV 2021 : Virtual eventy july 20-23, 2021 : Proceedings / alexandra silva, alexandra and K. Rustan M. Leino (eds.). - Part II, 524-549, Springer, 2021. |
| Domenic Quirl. IDE-Ready parsing of compile-time dynamic languages, 2021. |