Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch a 23-minute conference presentation from POPL 2018 exploring an innovative approach to analyzing termination properties in probabilistic programs. Discover how lexicographic ranking supermartingales (RSMs) provide a sound and compositional method for verifying almost-sure termination in programs with nondeterminism. Learn how these RSMs extend traditional ranking functions used in non-probabilistic programs and can be efficiently synthesized for programs with linear arithmetic. The presentation covers theoretical foundations, practical applications, and experimental results demonstrating the effectiveness of lexicographic RSMs in determining termination probability and expected termination time. Presented by researchers from IIT Bombay and IST Austria, this talk offers valuable insights for those interested in program analysis, verification, and probabilistic programming.
