The following pages link to Christoph Matheja (Q832286):
Displayed 16 items.
- Latticed \(k\)-induction with an application to probabilistic programs (Q832288) (← links)
- Inferring covariances for probabilistic programs (Q1693100) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- \textsf{PrIC3}: property directed reachability for MDPs (Q2226756) (← links)
- How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times (Q2323973) (← links)
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489) (← links)
- Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic (Q2988661) (← links)
- Tree-Like Grammars and Separation Logic (Q3460900) (← links)
- Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms (Q4625651) (← links)
- Reasoning about Recursive Probabilistic Programs (Q4635928) (← links)
- Expected Runtime Analyis by Program Verification (Q5150950) (← links)
- A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions (Q5875940) (← links)
- Graph-based shape analysis beyond context-freeness (Q6039389) (← links)
- Effective entailment checking for separation logic with inductive definitions (Q6091412) (← links)
- Rule-based conditioning of probabilistic data (Q6109623) (← links)
- Foundations for entailment checking in quantitative separation logic (Q6166785) (← links)