98 citations · 206 across the 5 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.PL2017★ 36 cited
Proving Expected Sensitivity of Probabilistic Programs
Gilles Barthe, Thomas Espitau, Benjamin Grégoire +2
Program sensitivity, also known as Lipschitz continuity, describes how small changes in a program's input lead to bounded changes in the output. We propose an average notion of pro…
cs.PL2017
Proving uniformity and independence by self-composition and coupling
Gilles Barthe, Thomas Espitau, Benjamin Grégoire +2
Proof by coupling is a classical proof technique for establishing probabilistic properties of two probabilistic processes, like stochastic dominance and rapid mixing of Markov chai…