Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs BL Kaminski, JP Katoen, C Matheja, F Olmedo European Symposium on Programming (ESOP) 9632, 364-389, 2016 | 155 | 2016 |
Reasoning about Recursive Probabilistic Programs F Olmedo, BL Kaminski, JP Katoen, C Matheja Logic in Computer Science (LICS), 672-681, 2016 | 108 | 2016 |
A New Proof Rule for Almost-Sure Termination A McIver, C Morgan, BL Kaminski, JP Katoen Proceedings of the ACM on Programming Languages 2 (POPL), 1-28, 2017 | 102* | 2017 |
Conditioning in Probabilistic Programming F Olmedo, F Gretz, N Jansen, BL Kaminski, JP Katoen, A McIver ACM Transactions on Programming Languages and Systems (TOPLAS) 40 (1), 1-50, 2018 | 97* | 2018 |
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms BL Kaminski, JP Katoen, C Matheja, F Olmedo Journal of the ACM (J.ACM) 65 (5), 1-68, 2018 | 90 | 2018 |
Quantitative Separation Logic: A Logic for Reasoning about Probabilistic Pointer Programs K Batz, BL Kaminski, JP Katoen, C Matheja, T Noll Proceedings of the ACM on Programming Languages 3 (POPL), 34, 2019 | 65* | 2019 |
On the Hardness of Almost–sure Termination BL Kaminski, JP Katoen Mathematical Foundations of Computer Science (MFCS), 307-318, 2015 | 60 | 2015 |
Optimistic Value Iteration A Hartmanns, BL Kaminski Computer Aided Verification (CAV), 488-511, 2020 | 56 | 2020 |
On the Hardness of Analyzing Probabilistic Programs BL Kaminski, JP Katoen, C Matheja Acta Informatica 56 (3), 255-285, 2019 | 55 | 2019 |
Advanced Weakest Precondition Calculi for Probabilistic Programs BL Kaminski Rheinisch-Westfälische Technische Hochschule Aachen, 2019 | 52 | 2019 |
Aiming low is harder: Induction for Lower Bounds in Probabilistic Program Verification M Hark, BL Kaminski, J Giesl, JP Katoen Proceedings of the ACM on Programming Languages 4 (POPL), 1-28, 2020 | 41 | 2020 |
Scalable Symbolic Execution of Distributed Systems R Sasnauskas, OS Dustmann, BL Kaminski, K Wehrle, C Weise, ... International Conference on Distributed Computing Systems (ICDCS), 333-342, 2011 | 37 | 2011 |
How long, O Bayesian network, will I sample thee? K Batz, BL Kaminski, JP Katoen, C Matheja European Symposium on Programming (ESOP), 186-213, 2018 | 35* | 2018 |
Bounded Model Checking for Probabilistic Programs N Jansen, C Dehnert, BL Kaminski, JP Katoen, L Westhofen Automated Technology for Verification and Analysis (ATVA) 9938, 68, 2016 | 32 | 2016 |
Understanding Probabilistic Programs JP Katoen, F Gretz, N Jansen, BL Kaminski, F Olmedo Correct System Design: Symposium in Honor of Ernst-Rüdiger Olderog on the …, 2015 | 26 | 2015 |
A Weakest Pre-expectation Semantics for Mixed-sign Expectations BL Kaminski, JP Katoen Logic In Computer Science (LICS), 1-12, 2017 | 25 | 2017 |
A Pre-expectation Calculus for Probabilistic Sensitivity A Aguirre, G Barthe, J Hsu, BL Kaminski, JP Katoen, C Matheja Proceedings of the ACM on Programming Languages 5 (POPL), 1-28, 2021 | 24* | 2021 |
Relatively Complete Verification of Probabilistic Programs: An Expressive Language for Expectation-based Reasoning K Batz, BL Kaminski, JP Katoen, C Matheja Proceedings of the ACM on Programming Languages 5 (POPL), 1-30, 2021 | 24 | 2021 |
Latticed k-Induction with an Application to Probabilistic Programs K Batz, M Chen, BL Kaminski, JP Katoen, C Matheja, P Schröer International Conference on Computer Aided Verification (CAV), 524-549, 2021 | 21 | 2021 |
PrIC3: Property Directed Reachability for MDPs K Batz, S Junges, BL Kaminski, JP Katoen, C Matheja, P Schröer Computer Aided Verification (CAV) 12225, 512–538, 2020 | 20* | 2020 |