Proving uniformity and independence by self-composition and coupling - Archive ouverte HAL Access content directly
Conference Papers Year :

Proving uniformity and independence by self-composition and coupling


Proof by coupling is a classical proof technique for establishing probabilistic properties of two probabilistic processes, like stochastic dominance and rapid mixing of Markov chains. More recently, couplings have been investigated as a useful abstraction for formal reasoning about relational properties of probabilistic programs, in particular for modeling reduction-based cryptographic proofs and for verifying differential privacy. In this paper, we demonstrate that probabilistic couplings can be used for verifying non-relational probabilistic properties. Specifically, we show that the program logic pRHL— whose proofs are formal versions of proofs by coupling—can be used for formalizing uniformity and probabilistic independence. We formally verify our main examples using the EasyCrypt proof assistant.
Fichier principal
Vignette du fichier
1701.06477.pdf (680.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01541198 , version 1 (18-06-2017)


  • HAL Id : hal-01541198 , version 1


Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub. Proving uniformity and independence by self-composition and coupling. LPAR 2017 - International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, May 2017, Maun, Botswana. pp.19. ⟨hal-01541198⟩
425 View
301 Download


Gmail Facebook Twitter LinkedIn More