| Weakest precondition reasoning for expected run–times of probabilistic programs BL Kaminski, JP Katoen, C Matheja, F Olmedo European Symposium on Programming, 364-389, 2016 | 112 | 2016 |
| Reasoning about Recursive Probabilistic Programs* F Olmedo, BL Kaminski, JP Katoen, C Matheja 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016 | 80 | 2016 |
| Weakest precondition reasoning for expected runtimes of randomized algorithms BL Kaminski, JP Katoen, C Matheja, F Olmedo Journal of the ACM (JACM) 65 (5), 1-68, 2018 | 33 | 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), 1-29, 2019 | 25 | 2019 |
| On the hardness of analyzing probabilistic programs BL Kaminski, JP Katoen, C Matheja Acta Informatica 56 (3), 255-285, 2019 | 24 | 2019 |
| How long, O Bayesian network, will I sample thee? K Batz, BL Kaminski, JP Katoen, C Matheja European Symposium on Programming, 186-213, 2018 | 20 | 2018 |
| Effective entailment checking for separation logic with inductive definitions J Katelaan, C Matheja, F Zuleger International Conference on Tools and Algorithms for the Construction and …, 2019 | 19 | 2019 |
| Unified reasoning about robustness properties of symbolic-heap separation logic C Jansen, J Katelaan, C Matheja, T Noll, F Zuleger European Symposium on Programming, 611-638, 2017 | 18 | 2017 |
| How do programmers use unsafe rust? V Astrauskas, C Matheja, F Poli, P Müller, AJ Summers Proceedings of the ACM on Programming Languages 4 (OOPSLA), 1-27, 2020 | 13 | 2020 |
| SL-COMP: Competition of solvers for separation logic M Sighireanu, JN Pérez, A Rybalchenko, N Gorogiannis, R Iosif, ... Tools and Algorithms for the Construction and Analysis of Systems-25 Years …, 2019 | 11 | 2019 |
| Tree-like grammars and separation logic C Matheja, C Jansen, T Noll Asian Symposium on Programming Languages and Systems, 90-108, 2015 | 11 | 2015 |
| Complete entailment checking for separation logic with inductive definitions J Pagel, C Matheja, F Zuleger arXiv e-prints, arXiv: 2002.01202, 2020 | 9 | 2020 |
| Automated reasoning and randomization in separation logic C Matheja, R Iosif, JP Katoen Fachgruppe Informatik, 2020 | 7 | 2020 |
| Let this Graph Be Your Witness! H Arndt, C Jansen, JP Katoen, C Matheja, T Noll International Conference on Computer Aided Verification, 3-11, 2018 | 7 | 2018 |
| Inferring covariances for probabilistic programs BL Kaminski, JP Katoen, C Matheja International Conference on Quantitative Evaluation of Systems, 191-206, 2016 | 7 | 2016 |
| 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 | 5 | 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 | 5 | 2021 |
| Graph-based shape analysis beyond context-freeness H Arndt, C Jansen, C Matheja, T Noll International Conference on Software Engineering and Formal Methods, 271-286, 2018 | 5* | 2018 |
| Harrsh: a tool for unified reasoning about symbolic-heap separation logic J Katelaan, C Matheja, T Noll, F Zuleger LPAR-22 Workshop and Short Paper Proceedings. Kalpa Publications in …, 2018 | 5 | 2018 |
| PrIC3: Property Directed Reachability for MDPs K Batz, S Junges, BL Kaminski, JP Katoen, C Matheja, P Schröer International Conference on Computer Aided Verification, 512-538, 2020 | 4 | 2020 |
Joost-Pieter KatoenDistinguished Professor of Computer Science, RWTH Aachen University and University of TwenteBestätigte E-Mail-Adresse bei cs.rwth-aachen.de
