The following pages link to Benjamin Lucien Kaminski (Q832285):
Displaying 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)
- Bounded model checking for probabilistic programs (Q1990501) (← links)
- Generating functions for probabilistic programs (Q2119118) (← links)
- Optimistic value iteration (Q2226755) (← 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)
- On the Hardness of Almost–Sure Termination (Q2946345) (← links)
- Understanding Probabilistic Programs (Q3449623) (← links)
- Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms (Q4625651) (← links)
- Reasoning about Recursive Probabilistic Programs (Q4635928) (← links)
- (Q5144701) (← links)
- Expected Runtime Analyis by Program Verification (Q5150950) (← links)
- Conditioning in probabilistic programming (Q5971400) (← links)
