J. A. Goguen and J. Meseguer, Security Policies and Security Models, 1982 IEEE Symposium on Security and Privacy, pp.11-20, 1982.
DOI : 10.1109/SP.1982.10014

P. Ryan, J. Mclean, J. Millen, and V. Gligor, Non-interference, who needs it?, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., pp.237-238, 2001.
DOI : 10.1109/CSFW.2001.930149

P. Malacaria, Assessing security threats of looping constructs, Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. POPL '07, pp.225-235, 2007.

D. Clark, S. Hunt, and P. Malacaria, A static analysis for quantifying information flow in a simple imperative language, Journal of Computer Security, vol.15, issue.3, pp.321-371, 2007.
DOI : 10.3233/JCS-2007-15302

C. E. Shannon, A mathematical theory of communication. The Bell system technical journal 27, pp.379-423, 1948.

J. K. Millen, Covert Channel Capacity, 1987 IEEE Symposium on Security and Privacy, pp.60-66, 1987.
DOI : 10.1109/SP.1987.10013

P. Malacaria, Algebraic foundations for information theoretical, probabilistic and guessability measures of information flow, p.3453, 2011.

F. Biondi, A. Legay, P. Malacaria, and A. Wasowski, Quantifying Information Leakage of Randomized Protocols, Lecture Notes in Computer Science, vol.7737, pp.68-87, 2013.
DOI : 10.1007/978-3-642-35873-9_7
URL : https://hal.archives-ouvertes.fr/hal-01242614

B. Jonsson and K. G. Larsen, Specification and refinement of probabilistic processes, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.266-277, 1991.
DOI : 10.1109/LICS.1991.151651

M. L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1994.
DOI : 10.1002/9780470316887

J. Stoer, R. Bulirsch, R. Bartels, W. Gautschi, and C. Witzgall, Introduction to Numerical Analysis, Texts in Applied Mathematics, 2010.

E. T. Jaynes, Information Theory and Statistical Mechanics, Physical Review, vol.106, issue.4, pp.620-630, 1957.
DOI : 10.1103/PhysRev.106.620

D. Clark and S. H. , Quantitative Information Flow, Relations and Polymorphic Types, Special Issue on Lambda-calculus, type theory and natural language, pp.181-199, 2005.
DOI : 10.1093/logcom/exi009

G. Smith, On the Foundations of Quantitative Information Flow, Lecture Notes in Computer Science, vol.38, issue.1, pp.288-302, 2009.
DOI : 10.1137/060651380

B. Köpf and D. A. Basin, An information-theoretic model for adaptive side-channel attacks, Proceedings of the 14th ACM conference on Computer and communications security , CCS '07, pp.286-296, 2007.
DOI : 10.1145/1315245.1315282

B. Köpf, L. Mauborgne, and M. Ochoa, Automatic Quantification of Cache Side-Channels, Lecture Notes in Computer Science, vol.7358, pp.564-580, 2012.
DOI : 10.1007/978-3-642-31424-7_40

H. Yasuoka and T. Terauchi, Quantitative Information Flow - Verification Hardness and Possibilities, 2010 23rd IEEE Computer Security Foundations Symposium, pp.15-27, 2010.
DOI : 10.1109/CSF.2010.9

M. S. Alvim, K. Chatzikokolakis, C. Palamidessi, and G. Smith, Measuring Information Leakage Using Generalized Gain Functions, 2012 IEEE 25th Computer Security Foundations Symposium, pp.265-279, 2012.
DOI : 10.1109/CSF.2012.26
URL : https://hal.archives-ouvertes.fr/hal-00734044

J. Landauer and T. Redmond, A lattice of information, [1993] Proceedings Computer Security Foundations Workshop VI, pp.65-70, 1993.
DOI : 10.1109/CSFW.1993.246638

A. Aldini and A. D. Pierro, Estimating the maximum information leakage, International Journal of Information Security, vol.176, issue.1, pp.219-242, 2008.
DOI : 10.1007/s10207-007-0050-x

R. Giacobazzi and I. Mastroeni, Abstract non-interference: parameterizing noninterference by abstract interpretation, pp.186-197, 2004.

I. Mastroeni and R. Giacobazzi, An abstract interpretation-based model for safety semantics, International Journal of Computer Mathematics, vol.116, issue.4, pp.665-694, 2011.
DOI : 10.1007/BF01211865

K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, Anonymity protocols as noisy channels, Information and Computation, vol.206, issue.2-4, pp.378-401, 2008.
DOI : 10.1016/j.ic.2007.07.003
URL : https://hal.archives-ouvertes.fr/inria-00349225

M. Bhargava and C. Palamidessi, Probabilistic Anonymity, LNCS, vol.3653, pp.171-185, 2005.
DOI : 10.1007/11539452_16
URL : https://hal.archives-ouvertes.fr/inria-00201101

H. Chen and P. Malacaria, Quantifying maximal loss of anonymity in protocols, Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, ASIACCS '09, pp.206-217, 2009.
DOI : 10.1145/1533057.1533087

P. Malacaria and H. Chen, Lagrange multipliers and maximum information leakage in different observational models. PLAS '08, pp.135-146, 2008.

R. E. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010

K. Chatterjee, K. Sen, and T. A. Henzinger, Model-Checking ??-Regular Properties of Interval Markov Chains, Lecture Notes in Computer Science, vol.4962, pp.302-317, 2008.
DOI : 10.1007/978-3-540-78499-9_22

I. Kozine and L. V. Utkin, Interval-valued finite Markov chains, Reliable Computing, vol.8, issue.2, pp.97-113, 2002.
DOI : 10.1023/A:1014745904458

V. Girardin, Entropy Maximization for Markov and Semi-Markov Processes, Methodology and Computing in Applied Probability, vol.6, issue.1, pp.109-127, 2004.
DOI : 10.1023/B:MCAP.0000012418.88825.18

L. De-alfaro, Formal Verification of Probabilistic Systems, 1997.

L. De-alfaro, Temporal logics for the specification of performance and reliability, STACS. Lecture Notes in Computer Science, vol.1200, pp.165-176, 1997.
DOI : 10.1007/BFb0023457

B. Delahaye, J. P. Katoen, K. G. Larsen, A. Legay, M. L. Pedersen et al., Abstract Probabilistic Automata, Lecture Notes in Computer Science, vol.2, issue.1-2, pp.324-339, 2011.
DOI : 10.1007/11817949_5
URL : https://hal.archives-ouvertes.fr/hal-01084342