Christoph Matheja

Available identifiers

Publication	Date of Publication	Type
Probabilistic program verification via inductive synthesis of inductive invariants	2024-04-05	Paper
Effective entailment checking for separation logic with inductive definitions	2023-11-24	Paper
Foundations for entailment checking in quantitative separation logic	2023-08-03	Paper
Rule-based conditioning of probabilistic data	2023-07-28	Paper
Graph-based shape analysis beyond context-freeness	2023-05-05	Paper
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions	2023-02-07	Paper
Latticed \(k\)-induction with an application to probabilistic programs	2022-03-25	Paper
Expected Runtime Analyis by Program Verification	2021-02-16	Paper
\textsf{PrIC3}: property directed reachability for MDPs	2021-02-09	Paper
How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times	2019-09-13	Paper
On the hardness of analyzing probabilistic programs	2019-03-21	Paper
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms	2019-02-25	Paper
Reasoning about Recursive Probabilistic Programs	2018-04-23	Paper
Inferring covariances for probabilistic programs	2018-01-11	Paper
Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic	2017-05-19	Paper
Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs	2016-04-26	Paper
Tree-Like Grammars and Separation Logic	2016-01-08	Paper

This page was built for person: Christoph Matheja