| 2022 |
| Lisa Pühl.
Verification of neural networks using binary tree search for branching,
2022. |
| Jan Erik Karuc.
Verifying parametric Markov models using decision diagrams,
2022. |
| DOIFull Text | Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Tobias Winkler.
Weighted programming,
pages 66, ACM, 2022. |
| 2021 |
| DOI | Alexander Hoppen, Thomas Noll.
A Debugger for Probabilistic Programs,
Volume 13085 of LNCS, pages 282-289, Springer, 2021. |
| DOI | Sascha Müller, Adeline Jordon, Andreas Gerndt, Thomas Noll.
A Modular Approach to Non-deterministic Dynamic Fault Trees,
Volume 12852 of Programming and Software Engineering, pages 243-257, 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 | Muhammad Hannan Khan, Osman Hassan, Shahid Khan.
Accelerating SpMV Multiplication in Probabilistic Model Checkers Using GPUs,
Volume 12819, Theoretical computer science and general issues of LNCS, pages 86-104, Springer, 2021. |
| Fabian Gasser.
Analysis of concurrent probabilistic programs with shared variables,
27 pages, 2021. |
| DOIFull Text | Christina Gehnen.
Automata-based model checking of recursive systems,
pages 1 Online-Ressource: Illustrationen, RWTH Aachen University, 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. |
| DOI | Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács.
Automated Termination Analysis of Polynomial Probabilistic Programs,
Volume 12648 of LNCS, pages 491-518, Springer, 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. |
| Marvin Jansen.
Decidability and complexity of entailment checking in quantitative separation logic,
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. |
| Mengying Xue.
Efficient analysis of time-bounded reachability in markov automata,
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 | Bahare Salmani Barzoki, Joost-Pieter Katoen.
Fine-Tuning the Odds in Bayesian Networks,
Volume 12897 of LNCS, pages 268-283, Springer, 2021. |
| DOIFull Text | .
Foundations of probabilistic programming,
pages xiv, 568 Seiten : Illustrationen, Cambridge University Press, 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. |
| Domenic Quirl.
IDE-Ready parsing of compile-time dynamic languages,
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. |
| DOIFull Text | Dario Veltri.
Learning probabilistic automata with SMT solving,
71 pages, RWTH Aachen University, 2021. |
| DOI | Tim Quatmann, Sebastian Junges, Joost-Pieter Katoen.
Markov automata with multiple objectives,
pages 33-86, Springer, 2021. |
| DOI | Shahid Khan, Matthias Volk, Joost-Pieter Katoen, Alexis Braibant, Marc Bouissou.
Model Checking the Multi-Formalism Language FIGARO,
pages 463-470, IEEE, 2021. |
| DOI | Shahid Khan, Joost-Pieter Katoen, Matthias Volk, Ahmad Zafar, Falak Sher.
Modelling and Analysis of Fire Sprinklers by Verifying Dynamic Fault Trees,
IEEE, 2021. |