default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Matheja
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c21]Martin Kuhn, Joscha Grüger, Christoph Matheja, Andrey Rivkin:
Data Petri Nets Meet Probabilistic Programming. BPM 2024: 21-38- [c20]Alyzia-Maria Konsta
, Alberto Lluch-Lafuente, Christoph Matheja:
What Should Be Observed for Optimal Reward in POMDPs? CAV (3) 2024: 373-394 - [c19]Martin Kuhn, Joscha Grüger, Christoph Matheja, Andrey Rivkin:
LogPPL: A Tool for Probabilistic Process Mining. ICPM Doctoral Consortium / Demo 2024 - [i19]Alyzia-Maria Konsta, Alberto Lluch-Lafuente, Christoph Matheja:
What should be observed for optimal reward in POMDPs? CoRR abs/2405.10768 (2024) - [i18]Martin Kuhn, Joscha Grüger, Christoph Matheja, Andrey Rivkin:
Data Petri Nets meet Probabilistic Programming (Extended version). CoRR abs/2406.11883 (2024) - 2023
- [j10]Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A Deductive Verification Infrastructure for Probabilistic Programs. Proc. ACM Program. Lang. 7(OOPSLA2): 2052-2082 (2023) - [j9]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Lena Verscht:
A Calculus for Amortized Expected Runtimes. Proc. ACM Program. Lang. 7(POPL): 1957-1986 (2023) - [j8]Christoph Matheja, Jens Pagel, Florian Zuleger:
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions. ACM Trans. Comput. Log. 24(1): 1:1-1:76 (2023) - [c18]Kevin Batz, Mingshuai Chen, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants. TACAS (2) 2023: 410-429 - [d1]Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A Deductive Verification Infrastructure for Probabilistic Programs - Artifact Evaluation. Zenodo, 2023
- [i17]Philipp Schröer, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A Deductive Verification Infrastructure for Probabilistic Programs. CoRR abs/2309.07781 (2023) - 2022
- [c17]Kevin Batz, Ira Fesefeldt, Marvin Jansen, Joost-Pieter Katoen, Florian Keßler, Christoph Matheja, Thomas Noll:
Foundations for Entailment Checking in Quantitative Separation Logic. ESOP 2022: 57-84 - [c16]Vytautas Astrauskas, Aurel Bílý, Jonás Fiala, Zachary Grannan, Christoph Matheja, Peter Müller, Federico Poli, Alexander J. Summers:
The Prusti Project: Formal Verification for Rust. NFM 2022: 88-108 - [i16]Kevin Batz, Ira Fesefeldt, Marvin Jansen, Joost-Pieter Katoen, Florian Keßler, Christoph Matheja, Thomas Noll:
Foundations for Entailment Checking in Quantitative Separation Logic (extended version). CoRR abs/2201.11464 (2022) - [i15]Kevin Batz, Mingshuai Chen, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants. CoRR abs/2205.06152 (2022) - [i14]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Lena Verscht:
A Calculus for Amortized Expected Runtimes. CoRR abs/2211.12923 (2022) - 2021
- [j7]Fabian Wolff, Aurel Bílý, Christoph Matheja, Peter Müller, Alexander J. Summers:
Modular specification and verification of closures in Rust. Proc. ACM Program. Lang. 5(OOPSLA): 1-29 (2021) - [j6]Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
A pre-expectation calculus for probabilistic sensitivity. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - [j5]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning. Proc. ACM Program. Lang. 5(POPL): 1-30 (2021) - [c15]Kevin Batz, Mingshuai Chen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer:
Latticed k-Induction with an Application to Probabilistic Programs. CAV (2) 2021: 524-549 - [c14]Ira Fesefeldt, Christoph Matheja, Thomas Noll, Johannes Schulte:
Automated Checking and Completion of Backward Confluence for Hyperedge Replacement Grammars. ICGT 2021: 283-293 - [i13]Kevin Batz, Mingshuai Chen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer:
Latticed k-Induction with an Application to Probabilistic Programs. CoRR abs/2105.14100 (2021) - [i12]Aurel Bílý, Christoph Matheja, Peter Müller:
Flexible Refinement Proofs in Separation Logic. CoRR abs/2110.13559 (2021) - 2020
- [b1]Christoph Matheja:
Automated reasoning and randomization in separation logic. RWTH Aachen University, Germany, 2020 - [j4]Vytautas Astrauskas, Christoph Matheja, Federico Poli, Peter Müller, Alexander J. Summers:
How do programmers use unsafe rust? Proc. ACM Program. Lang. 4(OOPSLA): 136:1-136:27 (2020) - [c13]Kevin Batz, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer:
PrIC3: Property Directed Reachability for MDPs. CAV (2) 2020: 512-538 - [i11]Jens Pagel, Christoph Matheja, Florian Zuleger:
Complete Entailment Checking for Separation Logic with Inductive Definitions. CoRR abs/2002.01202 (2020) - [i10]Kevin Batz, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer:
PrIC3: Property Directed Reachability for MDPs. CoRR abs/2004.14835 (2020) - [i9]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Relatively Complete Verification of Probabilistic Programs. CoRR abs/2010.14548 (2020)
2010 – 2019
- 2019
- [j3]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
On the hardness of analyzing probabilistic programs. Acta Informatica 56(3): 255-285 (2019) - [j2]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll:
Quantitative separation logic: a logic for reasoning about probabilistic pointer programs. Proc. ACM Program. Lang. 3(POPL): 34:1-34:29 (2019) - [c12]Mihaela Sighireanu, Juan Antonio Navarro Pérez, Andrey Rybalchenko, Nikos Gorogiannis, Radu Iosif, Andrew Reynolds, Cristina Serban, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger, Wei-Ngan Chin, Quang Loc Le, Quang-Trung Ta, Ton-Chanh Le, Thanh-Toan Nguyen, Siau-Cheng Khoo, Michal Cyprian, Adam Rogalewicz, Tomás Vojnar, Constantin Enea, Ondrej Lengál, Chong Gao, Zhilin Wu:
SL-COMP: Competition of Solvers for Separation Logic. TACAS (3) 2019: 116-132 - [c11]Jens Katelaan, Christoph Matheja, Florian Zuleger:
Effective Entailment Checking for Separation Logic with Inductive Definitions. TACAS (2) 2019: 319-336 - [i8]Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Kantorovich Continuity of Probabilistic Programs. CoRR abs/1901.06540 (2019) - 2018
- [j1]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo:
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms. J. ACM 65(5): 30:1-30:68 (2018) - [c10]Hannah Arndt, Christina Jansen, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll:
Let this Graph Be Your Witness! - An Attestor for Verifying Java Pointer Programs. CAV (2) 2018: 3-11 - [c9]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
How long, O Bayesian network, will I sample thee? - A program analysis perspective on expected sampling times. ESOP 2018: 186-213 - [c8]Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger:
Harrsh: A Tool for Unied Reasoning about Symbolic-Heap Separation Logic. LPAR (Workshop and Short Papers) 2018: 23-36 - [c7]Hannah Arndt, Christina Jansen, Christoph Matheja, Thomas Noll:
Graph-Based Shape Analysis Beyond Context-Freeness. SEFM 2018: 271-286 - [c6]Maurice van Keulen, Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen:
Rule-Based Conditioning of Probabilistic Data. SUM 2018: 290-305 - [i7]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times. CoRR abs/1802.10433 (2018) - [i6]Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll:
Quantitative Separation Logic. CoRR abs/1802.10467 (2018) - 2017
- [c5]Christina Jansen, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger:
Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic. ESOP 2017: 611-638 - [i5]Hannah Arndt, Christina Jansen, Christoph Matheja, Thomas Noll:
Heap Abstraction Beyond Context-Freeness. CoRR abs/1705.03754 (2017) - 2016
- [c4]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo:
Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. ESOP 2016: 364-389 - [c3]Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Reasoning about Recursive Probabilistic Programs. LICS 2016: 672-681 - [c2]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Inferring Covariances for Probabilistic Programs. QEST 2016: 191-206 - [i4]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo:
Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. CoRR abs/1601.01001 (2016) - [i3]Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Reasoning about Recursive Probabilistic Programs. CoRR abs/1603.02922 (2016) - [i2]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Inferring Covariances for Probabilistic Programs. CoRR abs/1606.08280 (2016) - [i1]Christina Jansen, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger:
Unified Reasoning about Robustness Properties of Symbolic-Heap Separation Logic. CoRR abs/1610.07041 (2016) - 2015
- [c1]Christoph Matheja, Christina Jansen, Thomas Noll:
Tree-Like Grammars and Separation Logic. APLAS 2015: 90-108
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
