The following pages link to Christoph Matheja (Q832286):
Displaying 7 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)
