Follow
Christoph Matheja
Title
Cited by
Cited by
Year
Weakest precondition reasoning for expected run–times of probabilistic programs
BL Kaminski, JP Katoen, C Matheja, F Olmedo
Programming Languages and Systems: 25th European Symposium on Programming …, 2016
1472016
Reasoning about recursive probabilistic programs
F Olmedo, BL Kaminski, JP Katoen, C Matheja
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
1002016
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
742018
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
612019
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
552020
On the hardness of analyzing probabilistic programs
BL Kaminski, JP Katoen, C Matheja
Acta Informatica 56, 255-285, 2019
472019
The prusti project: Formal verification for rust
V Astrauskas, A Bílı, J Fiala, Z Grannan, C Matheja, P Müller, F Poli, ...
NASA Formal Methods Symposium, 88-108, 2022
402022
How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times
K Batz, BL Kaminski, JP Katoen, C Matheja
Programming Languages and Systems: 27th European Symposium on Programming …, 2018
322018
Effective entailment checking for separation logic with inductive definitions
J Katelaan, C Matheja, F Zuleger
Tools and Algorithms for the Construction and Analysis of Systems: 25th …, 2019
292019
Modular specification and verification of closures in Rust
F Wolff, A Bílı, C Matheja, P Müller, AJ Summers
Proceedings of the ACM on Programming Languages 5 (OOPSLA), 1-29, 2021
262021
SL-COMP: competition of solvers for separation logic
M Sighireanu, JA Navarro Pérez, A Rybalchenko, N Gorogiannis, R Iosif, ...
Tools and Algorithms for the Construction and Analysis of Systems: 25 Years …, 2019
232019
Unified reasoning about robustness properties of symbolic-heap separation logic
C Jansen, J Katelaan, C Matheja, T Noll, F Zuleger
Programming Languages and Systems: 26th European Symposium on Programming …, 2017
232017
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
19*2021
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions
C Matheja, J Pagel, F Zuleger
ACM Transactions on Computational Logic 24 (1), 1-76, 2023
18*2023
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
182021
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, 524-549, 2021
172021
Automated reasoning and randomization in separation logic
C Matheja, R Iosif, JP Katoen
Fachgruppe Informatik, 2020
162020
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
142020
Tree-like grammars and separation logic
C Matheja, C Jansen, T Noll
Asian Symposium on Programming Languages and Systems, 90-108, 2015
122015
Foundations for entailment checking in quantitative separation logic
K Batz, I Fesefeldt, M Jansen, JP Katoen, F Keßler, C Matheja, T Noll
European Symposium on Programming, 57-84, 2022
102022
The system can't perform the operation now. Try again later.
Articles 1–20