Completed
Proving almost-sure termination
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Bayesian Inference by Program Verification - Joost-Pieter Katoen, RWTH Aachen University
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 nature Perspective
- 3 Probabilistic graphical models
- 4 Student's mood after an exam
- 5 Applications
- 6 Probabilistic GCL
- 7 Let's start simple
- 8 A loopy program For
- 9 Weakest pre-expectations
- 10 Examples
- 11 An operational perspective
- 12 Bayesian inference by program verification
- 13 Example: sampling within a circle
- 14 Weakest precondition of id-loops
- 15 Bayesian networks as programs
- 16 Soundness
- 17 Exact inference by wp-reasoning
- 18 Termination proofs: the classical case
- 19 Proving almost-sure termination
- 20 The symmetric random walk
- 21 Asymmetric-in-the-limit random walk
- 22 Positive almost-sure termination
- 23 Run-time invariant synthesis
- 24 Coupon collector's problem
- 25 Sampling time for example BN
- 26 The student's mood example
- 27 Experimental results
- 28 Printer troubleshooting in Windows 95
- 29 Predictive probabilistic programming
