Folgen
Christoph Matheja
Christoph Matheja
Assistant Professor, Technical University of Denmark (DTU)
Bestätigte E-Mail-Adresse bei dtu.dk - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
1312016
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
892016
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
522018
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
46*2019
On the hardness of analyzing probabilistic programs
BL Kaminski, JP Katoen, C Matheja
Acta Informatica 56, 255-285, 2019
332019
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
272019
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
272018
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
262020
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
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
202019
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
172023
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
132021
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), 2021
132021
Automated reasoning and randomization in separation logic
C Matheja, R Iosif, JP Katoen
Fachgruppe Informatik, 2020
132020
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
122021
Tree-like grammars and separation logic
C Matheja, C Jansen, T Noll
Programming Languages and Systems: 13th Asian Symposium, APLAS 2015, Pohang …, 2015
122015
Latticed k-Induction with an Application to Probabilistic Programs
K Batz, M Chen, BL Kaminski, JP Katoen, C Matheja, P Schröer
Computer Aided Verification: 33rd International Conference, CAV 2021 …, 2021
82021
PrIC3: property directed reachability for MDPs
K Batz, S Junges, BL Kaminski, JP Katoen, C Matheja, P Schröer
Computer Aided Verification: 32nd International Conference, CAV 2020, Los …, 2020
82020
Let this graph be your witness! an attestor for verifying Java pointer programs
H Arndt, C Jansen, JP Katoen, C Matheja, T Noll
Computer Aided Verification: 30th International Conference, CAV 2018, Held …, 2018
82018
Inferring covariances for probabilistic programs
BL Kaminski, JP Katoen, C Matheja
Quantitative Evaluation of Systems: 13th International Conference, QEST 2016 …, 2016
82016
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20