Christoph Matheja
Christoph Matheja
Programming Methodology Group, ETH Zürich
Verified email at inf.ethz.ch - Homepage
Title
Cited by
Cited by
Year
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
882016
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
572016
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
172018
On the hardness of analyzing probabilistic programs
BL Kaminski, JP Katoen, C Matheja
Acta Informatica 56 (3), 255-285, 2019
152019
How long, O Bayesian network, will I sample thee?
K Batz, BL Kaminski, JP Katoen, C Matheja
European Symposium on Programming, 186-213, 2018
152018
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
122017
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
102019
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
102019
Tree-like grammars and separation logic
C Matheja, C Jansen, T Noll
Asian Symposium on Programming Languages and Systems, 90-108, 2015
82015
Inferring covariances for probabilistic programs
BL Kaminski, JP Katoen, C Matheja
International Conference on Quantitative Evaluation of Systems, 191-206, 2016
72016
SL-COMP: Competition of solvers for separation logic
M Sighireanu, JAN Pérez, A Rybalchenko, N Gorogiannis, R Iosif, ...
International Conference on Tools and Algorithms for the Construction and …, 2019
42019
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
32018
Complete entailment checking for separation logic with inductive definitions
J Pagel, C Matheja, F Zuleger
arXiv preprint arXiv:2002.01202, 2020
22020
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
22018
„Probabilistic Programs—A Natural Model for Approximate Computations.“
N Jansen, BL Kaminski, JP Katoen, C Matheja, F Olmedo
Extended Abstracts of the Workshop on Approximate Computing (AC 15), 2015
22015
Rule-based conditioning of probabilistic data
M van Keulen, BL Kaminski, C Matheja, JP Katoen
International Conference on Scalable Uncertainty Management, 290-305, 2018
12018
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
1*2018
PrIC3: Property Directed Reachability for MDPs
K Batz, S Junges, BL Kaminski, JP Katoen, C Matheja, P Schröer
arXiv preprint arXiv:2004.14835, 2020
2020
Automated reasoning and randomization in separation logic
C Matheja, R Iosif, JP Katoen
Fachgruppe Informatik, 2020
2020
Kantorovich Continuity of Probabilistic Programs
A Aguirre, G Barthe, J Hsu, BL Kaminski, JP Katoen, C Matheja
arXiv preprint arXiv:1901.06540, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–20