D. J. Aldous and H. Thorisson, Shift-coupling, Stochastic Proc. Appl, pp.1-14, 1993.
DOI : 10.1016/0304-4149(93)90034-2
URL : https://doi.org/10.1016/0304-4149(93)90034-2

T. Amtoft, S. Bandhakavi, and A. Banerjee, A logic for information flow in object-oriented programs

L. Avena, M. Heydenreich, F. Den-hollander, E. Verbitskiy, and W. Van-zuijlen, Random walks (lecture notes)

G. Barthe, P. D. Argenio, and T. Rezk, Secure Information Flow by Self-Composition, IEEE Computer Security Foundations Workshop (CSFW), pp.100-114, 2004.
DOI : 10.1109/csfw.2004.1310735

G. Barthe, B. Grégoire, and S. Zanella-béguelin, Formal certification of code-based cryptographic proofs, ACM SIGPLAN?SIGACT Symposium on Principles of Programming Languages (POPL), pp.90-101, 2009.
DOI : 10.1145/1480881.1480894
URL : http://www-sop.inria.fr/everest/personnel/Benjamin.Gregoire/Publi/popl09.pdf

G. Barthe, J. M. Crespo, and C. Kunz, Relational Verification Using Product Programs, International Symposium on Formal Methods (FM), pp.200-214, 2011.
DOI : 10.1007/978-3-540-68237-0_5
URL : http://software.imdea.org/~jmcrespo/docs/FM2011.pdf

G. Barthe, B. Köpf, F. Olmedo, and S. Z. Béguelin, Probabilistic relational reasoning for differential privacy, ACM SIGPLAN?SIGACT Symposium on Principles of Programming Languages (POPL), pp.97-110, 2012.
DOI : 10.1145/2103656.2103670

G. Barthe, J. M. Crespo, and C. Kunz, Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification, Symposium on the Logical Foundations of Computer Science (LFCS), pp.29-43, 2013.
DOI : 10.1007/978-3-642-35722-0_3
URL : http://software.imdea.org/~jmcrespo/docs/LFCS2013.pdf

G. Barthe, F. Dupressoir, B. Grégoire, C. Kunz, B. Schmidt et al., EasyCrypt: A Tutorial, Foundations of Security Analysis and Design VII (FOSAD), pp.146-166, 2013.
DOI : 10.1145/1594834.1480894
URL : https://hal.archives-ouvertes.fr/hal-01114366

G. Barthe, C. Fournet, B. Grégoire, P. Strub, N. Swamy et al., Probabilistic relational verification for cryptographic implementations, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.193-206, 2014.
DOI : 10.1145/2535838.2535847
URL : https://hal.archives-ouvertes.fr/hal-00935743

G. Barthe, M. Gaboardi, E. J. Gallego-arias, J. Hsu, C. Kunz et al., Proving Differential Privacy in Hoare Logic, 2014 IEEE 27th Computer Security Foundations Symposium, pp.411-424, 2014.
DOI : 10.1109/CSF.2014.36
URL : http://doi.org/10.1109/csf.2014.36

. Strub, Relational reasoning via probabilistic coupling, International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), pp.387-401, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01246719

G. Barthe, M. Gaboardi, E. J. Arias, J. Hsu, A. Roth et al., Higher-order approximate relational refinement types for mechanism design and differential privacy, ACM SIGPLAN?SIGACT Symposium on Principles of Programming Languages (POPL), pp.55-68, 2015.
DOI : 10.1145/2775051.2677000
URL : http://arxiv.org/pdf/1407.6845

G. Barthe, J. M. Crespo, and C. Kunz, Product programs and relational program logics, Journal of Logical and Algebraic Methods in Programming, vol.85, issue.5, 2016.
DOI : 10.1016/j.jlamp.2016.05.004

G. Barthe, M. Gaboardi, B. Grégoire, J. Hsu, and P. Strub, Proving Differential Privacy via Probabilistic Couplings, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, 2016.
DOI : 10.1007/978-3-662-43613-4_13
URL : https://hal.archives-ouvertes.fr/hal-01411097

G. Barthe, M. Gaboardi, B. Grégoire, J. Hsu, and P. Strub, A program logic for union bounds, International Colloquium on Automata, Languages and Programming (ICALP), 2016.
URL : https://hal.archives-ouvertes.fr/hal-01411095

N. Benton, Simple relational correctness proofs for static analyses and program transformations, ACM SIGPLAN?SIGACT Symposium on Principles of Programming Languages (POPL), pp.14-25, 2004.
DOI : 10.1145/964001.964003

N. Benton, M. Hofmann, and V. Nigam, Proof-Relevant Logical Relations for Name Generation, International Conference on Typed Lambda Calculi and Applications (TLCA), pp.48-60, 2013.
DOI : 10.1007/978-3-642-38946-7_6
URL : http://arxiv.org/pdf/1708.05193

L. Beringer, Relational Decomposition, Interactive Theorem Proving (ITP), pp.39-54, 2011.
DOI : 10.1016/j.tcs.2006.12.036
URL : http://www.cs.princeton.edu/~eberinge/itp.pdf

L. Beringer and M. Hofmann, Secure information flow and program logics, 20th IEEE Computer Security Foundations Symposium (CSF'07), pp.233-248, 2007.
DOI : 10.1109/CSF.2007.30
URL : http://www.cs.princeton.edu/~eberinge/CSF.pdf

A. Bizjak and L. Birkedal, Step-Indexed Logical Relations for Probability, International Confernece on Foundations of Software Science and Computation Structures (FoSSaCS), pp.279-294, 2015.
DOI : 10.1007/978-3-662-46678-0_18

S. Brooks, A. Gelman, G. Jones, and X. Meng, Handbook of Markov Chain Monte Carlo, 2011.
DOI : 10.1201/b10905

R. Bubley and M. Dyer, Path coupling: A technique for proving rapid mixing in Markov chains, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.223-231, 1997.
DOI : 10.1109/SFCS.1997.646111
URL : http://www.stanford.edu/~montanar/TEACHING/Stat375/papers/path_coupling.pdf

A. Canteaut, T. Fuhr, M. Naya-plasencia, P. Paillier, J. Reinhard et al., A unified indifferentiability proof for permutation-or block cipher-based hash functions, IACR Cryptology ePrint Archive, p.363, 2012.

M. Carbin, D. Kim, S. Misailovic, and M. C. Rinard, Proving acceptability properties of relaxed nondeterministic approximate programs
DOI : 10.1145/2254064.2254086
URL : http://people.csail.mit.edu/rinard/paper/pldi12.relaxed.pdf

S. Chaudhuri, S. Gulwani, and R. Lublinerman, Continuity analysis of programs, ACM SIGPLAN?SIGACT Symposium on Principles of Programming Languages (POPL), pp.57-70, 2010.
DOI : 10.1145/1706299.1706308
URL : http://research.microsoft.com/en-us/people/sumitg/pubs/popl10_continuity.pdf

A. Darvas, R. Hähnle, and D. Sands, A Theorem Proving Approach to Analysis of Secure Information Flow, Security in Pervasive Computing, pp.193-209, 2003.
DOI : 10.1007/978-3-540-32004-3_20

J. Hartog, Probabilistic extensions of semantical models, 2002.

P. Diaconis and D. Stroock, Geometric Bounds for Eigenvalues of Markov Chains, The Annals of Applied Probability, vol.1, issue.1, pp.36-61, 1991.
DOI : 10.1214/aoap/1177005980

N. M. Dixit, P. Srivastava, and N. K. Vishnoi, A Finite Population Model of Molecular Evolution: Theory and Computation, Journal of Computational Biology, vol.19, issue.10, pp.1176-1202, 2012.
DOI : 10.1089/cmb.2012.0064

N. Ghani, F. N. Forsberg, and A. Simpson, Comprehensive Parametric Polymorphism: Categorical Models and Type Theory, International Confernece on Foundations of Software Science and Computation Structures (FoSSaCS), pp.3-19, 2016.
DOI : 10.1145/99370.99404
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-662-49630-5_1.pdf

M. Gomulkiewicz, M. Klonowski, and M. Kutylowski, Rapid Mixing and Security of Chaum???s Visual Electronic Voting, European Symposium on Programming on Research in Computer Security (ESORICS), pp.132-145
DOI : 10.1007/978-3-540-39650-5_8

M. Jerrum, A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Struct, Algorithms, vol.7, issue.2, pp.157-166, 1995.

M. Jerrum and A. Sinclair, Approximating the Permanent, SIAM Journal on Computing, vol.18, issue.6, pp.1149-1178, 1989.
DOI : 10.1137/0218077
URL : http://www.cs.berkeley.edu/~sinclair/perm.pdf

M. Kovács, H. Seidl, and B. Finkbeiner, Relational abstract interpretation for the verification of 2-hypersafety properties, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, pp.211-222, 2013.
DOI : 10.1145/2508859.2516721

D. Kozen, Semantics of probabilistic programs, IEEE Symposium on Foundations of Computer Science (FOCS), pp.101-114, 1979.
DOI : 10.1016/0022-0000(81)90036-2
URL : https://doi.org/10.1016/0022-0000(81)90036-2

D. Kozen, A probabilistic PDL, Journal of Computer and System Sciences, vol.30, issue.2, pp.162-178, 1985.
DOI : 10.1016/0022-0000(85)90012-1
URL : https://doi.org/10.1016/0022-0000(85)90012-1

D. Kozen, Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16
DOI : 10.1016/0047-259X(71)90028-5
URL : http://dl.acm.org/ft_gateway.cfm?id=2933610&type=pdf

V. S. Kumar and H. Ramesh, Coupling vs. conductance for the Jerrum-Sinclair chain. Random Struct, Algorithms, vol.18, issue.1, pp.1-17, 2001.

U. D. Lago, D. Sangiorgi, and M. Alberti, On coinductive equivalences for higher-order probabilistic functional programs, ACM SIGPLAN?SIGACT Symposium on Principles of Programming Languages (POPL), pp.297-308, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01091573

D. A. Levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times, 2009.
DOI : 10.1090/mbk/058

N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, Equation of State Calculations by Fast Computing Machines, The Journal of Chemical Physics, vol.21, issue.6, pp.1087-1092, 1953.
DOI : 10.1063/1.1700747

S. Misailovic, D. M. Roy, and M. C. Rinard, Probabilistically Accurate Program Transformations, International Symposium on Static Analysis (SAS), pp.316-333, 2011.
DOI : 10.1145/1322263.1322279
URL : http://people.csail.mit.edu/rinard/paper/sas11.pdf

C. Morgan, A. Mciver, and K. Seidel, Probabilistic predicate transformers, ACM Transactions on Programming Languages and Systems, vol.18, issue.3, pp.325-353, 1996.
DOI : 10.1145/229542.229547

C. Müller, M. Kovács, and H. Seidl, An Analysis of Universal Information Flow Based on Self-Composition, 2015 IEEE 28th Computer Security Foundations Symposium, pp.380-393, 2015.
DOI : 10.1109/CSF.2015.33

A. Nanevski, A. Banerjee, and D. Garg, Verification of information flow and access control policies with dependent types, IEEE Symposium on Security and Privacy (S&P), pp.165-179, 2011.

L. H. Ramshaw, Formalizing the Analysis of Algorithms, 1979.

D. Sangiorgi and V. Vignudelli, Environmental bisimulations for probabilistic higher-order languages, ACM SIGPLAN?SIGACT Symposium on Principles of Programming Languages (POPL), pp.595-607, 2016.
DOI : 10.1145/2914770.2837651
URL : https://hal.archives-ouvertes.fr/hal-01337665

T. Sato, Approximate Relational Hoare Logic for Continuous Random Samplings, Workshop on the Mathematical Foundations of Programming Semantics (MFPS), 2016.
DOI : 10.1016/j.entcs.2016.09.043
URL : https://doi.org/10.1016/j.entcs.2016.09.043

S. Sidiroglou-douskos, S. Misailovic, H. Hoffmann, and M. C. Rinard, Managing performance vs. accuracy trade-offs with loop perforation, Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering, SIGSOFT/FSE '11, pp.124-134, 2011.
DOI : 10.1145/2025113.2025133

M. Sousa and I. Dillig, Cartesian Hoare logic for verifying k-safety properties, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp.57-69, 2016.
DOI : 10.1145/2908080.2908092
URL : http://dl.acm.org/ft_gateway.cfm?id=2908092&type=pdf

T. Terauchi and A. Aiken, Secure Information Flow as a Safety Problem, International Symposium on Static Analysis (SAS) Thorisson. Coupling, Stationarity, and Regeneration, pp.352-367, 2000.
DOI : 10.1007/11547662_24
URL : http://www.kb.ecei.tohoku.ac.jp/~terauchi/papers/tr05-infoflow.pdf

C. Villani, Optimal transport: old and new, 2008.
DOI : 10.1007/978-3-540-71050-9

H. Yang, Relational separation logic, Theoretical Computer Science, vol.375, issue.1-3, pp.308-334, 2007.
DOI : 10.1016/j.tcs.2006.12.036
URL : https://doi.org/10.1016/j.tcs.2006.12.036

A. Zaks and A. Pnueli, CoVaC: Compiler Validation by Program Analysis of the Cross-Product, International Symposium on Formal Methods (FM), pp.35-51, 2008.
DOI : 10.1007/978-3-540-68237-0_5