C. Baier, Probabilistic model checking, Dependable Software Systems Engineering, NATO Science for Peace and Security Series-D: Information and Communication Security, vol.45, pp.1-23, 2016.

G. Barthe, F. Dupressoir, B. Grégoire, C. Kunz, B. Schmidt et al., Easycrypt: A tutorial, Foundations of Security Analysis and Design (FOSAD), vol.8604, pp.146-166, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01114366

G. Barthe, T. Espitau, L. M. Ferrer-fioriti, and J. Hsu, Synthesizing probabilistic invariants via Doob's decomposition, International Conference on Computer Aided Verification (CAV), 2016.

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

G. Barthe, B. Grégoire, S. Heraud, and S. Z. Béguelin, Computer-aided security proofs for the working cryptographer, IACR International Cryptology Conference (CRYPTO), vol.6841, pp.71-90, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01112075

M. Bellare and P. Rogaway, The security of triple encryption and a framework for code-based game-playing proofs, IACR International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), pp.409-426, 2006.

A. Bizjak and L. Birkedal, Step-indexed logical relations for probability. In: International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), pp.279-294, 2015.

R. Chadha, L. Cruz-filipe, P. Mateus, and A. Sernadas, Reasoning about probabilistic sequential programs, Theoretical Computer Science, vol.379, issue.1-2, pp.142-165, 2007.

A. Chakarov and S. Sankaranarayanan, Probabilistic program analysis with martingales, International Conference on Computer Aided Verification (CAV), vol.8044, pp.511-526, 2013.

A. Chakarov and S. Sankaranarayanan, Expectation invariants as fixed points of probabilistic programs, International Symposium on Static Analysis (SAS), vol.8723, pp.85-100, 2014.

K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs, ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp.327-342, 2016.

P. Cousot and M. Monerau, Probabilistic abstract interpretation, European Symposium on Programming (ESOP), vol.7211, pp.169-193, 2012.

R. Crubillé and U. Dal-lago, On probabilistic applicative bisimulation and call-byvalue ?-calculi, European Symposium on Programming (ESOP), vol.8410, pp.209-228, 2014.

U. Dal-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

L. M. Fioriti and H. Hermanns, Probabilistic termination: Soundness, completeness, and compositionality, ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp.489-501, 2015.

F. Gretz, J. P. Katoen, and A. Mciver, Operational versus weakest pre-expectation semantics for the probabilistic guarded command language, Performance Evaluation, vol.73, pp.110-132, 2014.

S. Hart, M. Sharir, and A. Pnueli, Termination of probabilistic concurrent programs, ACM Transactions on Programming Languages and Systems, vol.5, issue.3, pp.356-380, 1983.

J. Den-hartog, Probabilistic extensions of semantical models, 2002.

J. Hurd, Formal verification of probabilistic algorithms, 2003.

J. Hurd, Verification of the Miller-Rabin probabilistic primality test, Journal of Logic and Algebraic Programming, vol.56, issue.1-2, pp.65-71, 2003.

J. Hurd, A. Mciver, and C. Morgan, Probabilistic guarded commands mechanized in HOL, Theoretical Computer Science, vol.346, issue.1, pp.96-112, 2005.
DOI : 10.1016/j.tcs.2005.08.005
URL : https://doi.org/10.1016/j.tcs.2005.08.005

R. Impagliazzo and S. Rudich, Limits on the provable consequences of one-way permutations, ACM SIGACT Symposium on Theory of Computing (STOC), pp.44-61, 1989.

B. L. Kaminski, J. P. Katoen, and C. Matheja, Inferring covariances for probabilistic programs, International Conference on Quantitative Evaluation of Systems (QEST), pp.191-206, 2016.
DOI : 10.1007/978-3-319-43425-4_14
URL : http://arxiv.org/pdf/1606.08280

B. Kaminski, J. P. Katoen, C. Matheja, and F. Olmedo, Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs, European Symposium on Programming (ESOP), 2016.

J. P. Katoen, The probabilistic model-checking landscape, IEEE Symposium on Logic in Computer Science (LICS), 2016.
DOI : 10.1145/2933575.2934574

D. Kempe, A. Dobra, and J. Gehrke, Gossip-based computation of aggregate information, pp.482-491, 2003.
DOI : 10.1109/sfcs.2003.1238221
URL : http://www.cs.cornell.edu/johannes/papers/2003/focs2003-gossip.pdf

D. Kozen, Semantics of probabilistic programs, vol.22, pp.328-350, 1981.
DOI : 10.1109/sfcs.1979.38

D. Kozen, A probabilistic PDL, Journal of Computer and System Sciences, vol.30, issue.2, pp.162-178, 1985.
DOI : 10.1145/800061.808758

M. Kwiatkowska, G. Norman, and D. Parker, PRISM 4.0: Verification of probabilistic real-time systems, International Conference on Computer Aided Verification (CAV), vol.6806, pp.585-591, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00648035

A. Mciver and C. Morgan, Abstraction, Refinement, and Proof for Probabilistic Systems, Monographs in Computer Science, 2005.

A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, A new rule for almost-certain termination, appeared at ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), 2018.

D. Monniaux, Abstract interpretation of probabilistic semantics, International Symposium on Static Analysis (SAS), vol.1824, pp.322-339, 2000.
DOI : 10.1007/978-3-540-45099-3_17

C. Morgan, Proof rules for probabilistic loops, BCS-FACS Conference on Refinement, 1996.

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
URL : http://www.sct.inf.ethz.ch/teaching/ws2006/SemSpecVer/papers/Probabilistic_Predicate_Transformers.pdf

F. Olmedo, B. L. Kaminski, J. P. Katoen, and C. Matheja, Reasoning about recursive probabilistic programs, IEEE Symposium on Logic in Computer Science (LICS), pp.672-681, 2016.
DOI : 10.1145/2933575.2935317
URL : http://arxiv.org/pdf/1603.02922

J. Pearl and A. Paz, Graphoids: Graph-based logic for reasoning about relevance relations, ECAI. pp, pp.357-363, 1986.

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

R. Rand and S. Zdancewic, VPHL: a verified partial-correctness logic for probabilistic programs, Conference on the Mathematical Foundations of Programming Semantics (MFPS), 2015.
DOI : 10.1016/j.entcs.2015.12.021
URL : https://doi.org/10.1016/j.entcs.2015.12.021

A. Sampson, P. Panchekha, T. Mytkowicz, K. S. Mckinley, D. Grossman et al., Expressing and verifying probabilistic assertions, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), p.14, 2014.
DOI : 10.1145/2666356.2594294
URL : http://homes.cs.washington.edu/~luisceze/publications/passert-pldi2014.pdf

M. Sharir, A. Pnueli, and S. Hart, Verification of probabilistic programs, SIAM Journal on Computing, vol.13, issue.2, pp.292-314, 1984.
DOI : 10.1137/0213021
URL : http://www.ma.huji.ac.il/hart/papers/verif-pr.pdf

L. G. Valiant, A scheme for fast parallel communication, SIAM Journal on Computing, vol.11, issue.2, pp.350-361, 1982.

L. G. Valiant and G. J. Brebner, Universal schemes for parallel communication, ACM SIGACT Symposium on Theory of Computing (STOC), pp.263-277, 1981.