LSV 15th anniversary, February 6–7, 2012, Cachan
Analysing Probabilistic Programs: Pushing the Limits of Automation
Talk by
Joost-Pieter Katoen
(RWTH Aachen University)
Slides
Abstract
We present recent progress in the automated analysis of programs in which
assignments can be random, possibly parameterized. We show how constraint
solving can be used to synthesize loop invariants, and provide two formally
related semantic views on such programs.
