Coupling proofs are probabilistic product programs. Barthe, G., Grégoire, B., Hsu, J., & Strub, P. In Castagna, G. & Gordon, A. D., editors, Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017, pages 161–174, 2017. ACM.
Coupling proofs are probabilistic product programs [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/popl/BartheGHS17,
  author = {Gilles Barthe and Benjamin Gr{\'{e}}goire and
Justin Hsu and Pierre{-}Yves Strub},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl = {https://dblp.org/rec/conf/popl/BartheGHS17.bib},
  booktitle = {Proceedings of the 44th {ACM} {SIGPLAN} Symposium on
Principles of Programming Languages, {POPL} 2017,
Paris, France, January 18-20, 2017},
  doi = {10.1145/3009837.3009896},
  editor = {Giuseppe Castagna and Andrew D. Gordon},
  isbn = {978-1-4503-4660-3},
  pages = {161--174},
  publisher = {{ACM}},
  timestamp = {Mon, 14 Jun 2021 15:39:36 +0200},
  title = {Coupling proofs are probabilistic product programs},
  url = {https://doi.org/10.1145/3009837.3009896},
  year = {2017}
}

Downloads: 0