A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time
[article]
2019
arXiv
pre-print
The notion of program sensitivity (aka Lipschitz continuity) specifies that changes in the program input result in proportional changes to the program output. For probabilistic programs the notion is naturally extended to expected sensitivity. A previous approach develops a relational program logic framework for proving expected sensitivity of probabilistic while loops, where the number of iterations is fixed and bounded. In this work, we consider probabilistic while loops where the number of
arXiv:1902.04744v3
fatcat:7463cjox7jcqzjh3qqchd7vgyq