S. Akshay, J. Ouaknine, T. Antonopoulos, and J. Worrell, Reachability problems for Markov chains, Information Processing Letters, vol.115, issue.2, 2013.
DOI : 10.1016/j.ipl.2014.08.013

S. Mário, M. E. Alvim, C. Andrés, and . Palamidessi, Information flow in interactive systems, Lecture Notes in Computer Science, vol.6269, pp.102-116, 2010.

S. Mário, M. E. Alvim, C. Andrés, and . Palamidessi, Quantitative information flow in interactive systems, Journal of Computer Security, vol.20, issue.1, pp.3-50, 2012.

S. Mário, K. Alvim, C. Chatzikokolakis, G. Palamidessi, and . Smith, Measuring information leakage using generalized gain functions, pp.265-279, 2012.

D. Arnold, H. Loeliger, P. O. Vontobel, A. Kavcic, and W. Zeng, Simulation-Based Computation of Information Rates for Channels With Memory, IEEE Transactions on Information Theory, vol.52, issue.8, pp.523498-3508, 2006.
DOI : 10.1109/TIT.2006.878110

M. Backes, B. Köpf, and A. Rybalchenko, Automatic Discovery and Quantification of Information Leaks, 2009 30th IEEE Symposium on Security and Privacy, 2009.
DOI : 10.1109/SP.2009.18

S. Murilo, R. M. Baptista, E. R. Rubinger, J. C. Viana, U. Sartorelli et al., Mutual information rate and bounds for it, PLoS ONE, vol.7, issue.10, pp.46745-2012

G. Barthe, P. R. Argenio, and T. Rezk, Secure information flow by self-composition, CSFW, pp.100-114, 2004.

D. P. Bertsekas and J. N. Tsitsiklis, Introduction To Probability Quantifying information leakage of randomized protocols, Athena Scientific books. Athena Scientific Lecture Notes in Computer Science, vol.7737, pp.68-87, 2002.

F. Biondi, A. Legay, B. F. Nielsen, and A. Wasowski, Maximizing entropy over Markov processes, 24nd Nordic Workshop on Programming Theory -NWPT, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01242613

F. Biondi, A. Legay, B. F. Nielsen, and A. Wasowski, Maximizing Entropy over Markov Processes, LATA, pp.128-140, 2013.
DOI : 10.1007/978-3-642-37064-9_13
URL : https://hal.archives-ouvertes.fr/hal-01242613

F. Biondi, A. Legay, B. F. Nielsen, and A. Wasowski, Maximizing entropy over Markov processes, Journal of Logic and Algebraic Programming
URL : https://hal.archives-ouvertes.fr/hal-01242613

F. Biondi, A. Legay, L. Traonouez, and A. Wasowski, QUAIL: A Quantitative Security Analyzer for Imperative Code, Sharygina and Veith [83], pp.702-707
DOI : 10.1007/978-3-642-39799-8_49
URL : https://hal.archives-ouvertes.fr/hal-01242615

M. Boreale, Quantifying information leakage in process calculi, Information and Computation, vol.207, issue.6, pp.699-725, 2009.
DOI : 10.1016/j.ic.2008.12.007

M. Boreale and F. Pampaloni, Quantitative Multirun Security under Active Adversaries, 2012 Ninth International Conference on Quantitative Evaluation of Systems, pp.158-167, 2012.
DOI : 10.1109/QEST.2012.31

M. Boreale, F. Pampaloni, and M. Paolini, Asymptotic Information Leakage under One-Try Attacks, Lecture Notes in Computer Science, vol.6604, pp.396-410, 2011.
DOI : 10.1007/978-3-642-19805-2_27

C. Braun, K. Chatzikokolakis, and C. Palamidessi, Quantitative Notions of Leakage for One-try Attacks, Electronic Notes in Theoretical Computer Science, vol.249, pp.75-91, 2009.
DOI : 10.1016/j.entcs.2009.07.085
URL : https://hal.archives-ouvertes.fr/inria-00424852

D. Brumley and D. Boneh, Remote timing attacks are practical, Computer Networks, vol.48, issue.5, pp.701-716, 2005.
DOI : 10.1016/j.comnet.2005.01.010

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
DOI : 10.1007/978-3-540-78499-9_22

K. Chatzikokolakis, T. Chothia, and A. Guha, Statistical Measurement of Information Leakage, Lecture Notes in Computer Science, vol.6015, pp.390-404
DOI : 10.1007/978-3-642-12002-2_33

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

K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, On the Bayes risk in information-hiding protocols, Journal of Computer Security, vol.16, issue.5, pp.531-571, 2008.
DOI : 10.3233/JCS-2008-0333
URL : https://hal.archives-ouvertes.fr/inria-00349224

D. Chaum, The dining cryptographers problem: Unconditional sender and recipient untraceability, Journal of Cryptology, vol.1, issue.1, pp.65-75, 1988.
DOI : 10.1007/BF00206326

H. Chen and P. Malacaria, The Optimum Leakage Principle for Analyzing Multi-threaded Programs, Lecture Notes in Computer Science, vol.5973, pp.177-193, 2009.
DOI : 10.1007/978-3-642-14496-7_15

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

H. Chen and P. Malacaria, Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions, Electronic Proceedings in Theoretical Computer Science, vol.7, pp.1-15, 2009.
DOI : 10.4204/EPTCS.7.1

T. Chothia and A. Guha, A Statistical Test for Information Leaks Using Continuous Mutual Information, 2011 IEEE 24th Computer Security Foundations Symposium, pp.177-190, 2011.
DOI : 10.1109/CSF.2011.19

T. Chothia, Y. Kawamoto, and C. Novakovic, A Tool for Estimating Information Leakage, Sharygina and Veith [83], pp.690-695
DOI : 10.1007/978-3-642-39799-8_47

T. Chothia, Y. Kawamoto, C. Novakovic, and D. Parker, Probabilistic Point-to-Point Information Leakage, 2013 IEEE 26th Computer Security Foundations Symposium, pp.193-205, 2013.
DOI : 10.1109/CSF.2013.20

D. Clark, S. Hunt, and P. Malacaria, Quantitative Analysis of the Leakage of Confidential Data, Electronic Notes in Theoretical Computer Science, vol.59, issue.3, pp.238-251, 2001.
DOI : 10.1016/S1571-0661(04)00290-7

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

R. Michael, A. C. Clarkson, F. B. Myers, and . Schneider, Quantifying information flow with beliefs, Journal of Computer Security, vol.17, issue.5, pp.655-701, 2009.

T. M. Cover and J. A. Thomas, Elements of Information Theory, 2012.

G. Danezis, R. Dingledine, and N. Mathewson, Mixminion: design of a type III anonymous remailer protocol, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405), pp.2-15, 2003.
DOI : 10.1109/SECPRI.2003.1199323

D. E. Denning, A lattice model of secure information flow, Communications of the ACM, vol.19, issue.5, pp.236-243, 1976.
DOI : 10.1145/360051.360056

D. E. Denning, Cryptography and Data Security, 1982.

R. Dingledine, N. Mathewson, and P. F. Syverson, Tor: The secondgeneration onion router, USENIX Security Symposium, pp.303-320, 2004.

B. Espinoza, G. S. , and J. Karhumäki, Min-entropy as a resource Skolem's problem -on the border between decidability and undecidability, Inf. Comput, vol.22642, pp.57-75, 2005.

M. Hall, E. Frank, G. Holmes, B. Pfahringer, P. Reutemann et al., The WEKA data mining software, ACM SIGKDD Explorations Newsletter, vol.11, issue.1, pp.10-18, 2009.
DOI : 10.1145/1656274.1656278

E. Martin, J. Hellman, and . Raviv, Probability of error, equivocation, and the chernoff bound, IEEE Transactions on Information Theory, vol.16, issue.4, pp.368-372, 1970.

J. Heusser and P. Malacaria, Quantifying information leaks in software, Proceedings of the 26th Annual Computer Security Applications Conference on, ACSAC '10, pp.261-269, 2010.
DOI : 10.1145/1920261.1920300

K. Andrew, M. R. Hirsch, and . Clarkson, Belief semantics of authorization logic. CoRR, abs, 1302.

W. James and I. Gray, Toward a mathematical foundation for information flow security, IEEE Symposium on Security and Privacy, pp.21-35, 1991.

E. Thompson and J. , Probability Theory: The Logic of Science, 2003.

S. Kiefer, A. S. Murawski, J. Ouaknine, B. Wachter, and J. Worrell, APEX: An Analyzer for Open Probabilistic Programs, Proc. CAV'12, 2012.
DOI : 10.1007/978-3-642-31424-7_51

C. Paul and . Kocher, Timing attacks on implementations of diffie-hellman, rsa, dss, and other systems, Lecture Notes in Computer Science, vol.1109, pp.104-113, 1996.

C. Paul, J. Kocher, B. Jaffe, P. Jun, and . Rohatgi, Introduction to differential power analysis, J. Cryptographic Engineering, vol.1, issue.1, pp.5-27, 2011.

B. Köpf and D. A. Basin, Automatically deriving information-theoretic bounds for adaptive side-channel attacks, Journal of Computer Security, vol.19, issue.1, pp.1-31, 2011.
DOI : 10.3233/JCS-2009-0397

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

B. Köpf and G. Smith, Vulnerability Bounds and Leakage Resilience of Blinded Cryptography under Timing Attacks, 2010 23rd IEEE Computer Security Foundations Symposium, pp.44-56
DOI : 10.1109/CSF.2010.11

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

M. Kwiatkowska, G. Norman, and D. Parker, PRISM 4.0: Verification of Probabilistic Real-Time Systems, Proc. CAV'11, 2011.
DOI : 10.1007/3-540-45657-0_17
URL : https://hal.archives-ouvertes.fr/hal-00648035

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

B. Lin and D. Kifer, A framework for extracting semantic guarantees from privacy. CoRR, abs, 1208.

B. Lin and D. Kifer, Information preservation in statistical privacy and bayesian estimation of unattributed histograms, Proceedings of the 2013 international conference on Management of data, SIGMOD '13, pp.677-688, 2013.
DOI : 10.1145/2463676.2463721

P. Malacaria, Assessing security threats of looping constructs, POPL, pp.225-235, 2007.

P. Malacaria, Algebraic foundations for information theoretical, probabilistic and guessability measures of information flow. CoRR, abs/1101, 2011.

P. Malacaria and H. Chen, Lagrange multipliers and maximum information leakage in different observational models, Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security , PLAS '08, pp.135-146, 2008.
DOI : 10.1145/1375696.1375713

P. Malacaria and J. Heusser, Information Theory and Security: Quantitative Information Flow, Lecture Notes in Computer Science, vol.37, issue.3, pp.87-134, 2010.
DOI : 10.1007/11547662_24

M. Ueli and . Maurer, Authentication theory and hypothesis testing, IEEE Transactions on Information Theory, vol.46, issue.4, pp.1350-1356, 2000.

S. Mccamant and M. D. Ernst, Quantitative information flow as network flow capacity, 2008.

J. Mclean, Security models and information flow, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy, pp.180-189, 1990.
DOI : 10.1109/RISP.1990.63849

S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability. Cambridge Mathematical Library, 2009.

S. Micali and L. Reyzin, Physically Observable Cryptography, Lecture Notes in Computer Science, vol.2951, pp.278-296, 2004.
DOI : 10.1007/978-3-540-24638-1_16

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

C. Mu and D. Clark, A Tool: Quantitative Analyser for Programs, 2011 Eighth International Conference on Quantitative Evaluation of SysTems
DOI : 10.1109/QEST.2011.25

J. Newsome, S. Mccamant, and D. Song, Measuring channel capacity to distinguish undue influence, Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security, PLAS '09, 2009.
DOI : 10.1145/1554339.1554349

R. O. Kevin, M. R. Neill, S. Clarkson, and . Chong, Information-flow security for interactive programs, CSFW, pp.190-201, 2006.

J. Ouaknine, Decision Problems for Linear Recurrence Sequences, Lecture Notes in Computer Science, vol.8070, p.2, 2013.
DOI : 10.1007/978-3-642-40164-0_2

J. Ouaknine and J. Worrell, Positivity Problems for Low-Order Linear Recurrence Sequences, pp.366-379, 2014.
DOI : 10.1137/1.9781611973402.27

. Mads-tinggaard-pedersen, Automated information-theoretical evaluation of different anonymity protocols on coherent topologies, 2013.

Q. Phan, P. Malacaria, O. Tkachuk, and C. S. Pasareanu, Symbolic quantitative information flow, ACM SIGSOFT Software Engineering Notes, vol.37, issue.6, pp.1-5, 2012.
DOI : 10.1145/2382756.2382791

A. Di-pierro, C. Hankin, and H. Wiklicky, Approximate non-interference, Journal of Computer Security, vol.12, issue.1, pp.37-82, 2004.
DOI : 10.3233/JCS-2004-12103

L. Martin and . Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1994.

G. Michael, P. F. Reed, D. M. Syverson, and . Goldschlag, Anonymous connections and onion routing, IEEE Journal on Selected Areas in Communications, vol.16, issue.4, pp.482-494, 1998.

K. Michael, A. D. Reiter, and . Rubin, Crowds: Anonymity for web transactions, ACM Trans. Inf. Syst. Secur, vol.1, issue.1, pp.66-92, 1998.

N. Santhi and A. Vardy, Analog codes on graphs. CoRR, abs/cs/0608086, 2006.

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

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

G. Smith, Quantifying Information Flow Using Min-Entropy, 2011 Eighth International Conference on Quantitative Evaluation of SysTems, pp.159-167
DOI : 10.1109/QEST.2011.31

G. Smith and R. Alpízar, Non-termination and secure information flow, Mathematical Structures in Computer Science, vol.14, issue.06, pp.1183-1205, 2011.
DOI : 10.1007/11537311_32

M. Dennis, C. E. Volpano, G. Irvine, and . Smith, A sound type system for secure flow analysis, Journal of Computer Security, vol.4, issue.23, pp.167-188, 1996.

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

H. Yasuoka and T. Terauchi, On bounding problems of quantitative information flow, Journal of Computer Security, vol.19, issue.6, pp.1029-1082, 2011.
DOI : 10.3233/JCS-2011-0437

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

L. De-alfaro, Temporal logics for the specification of performance and reliability, STACS, pp.165-176, 1997.
DOI : 10.1007/BFb0023457

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

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

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

K. Chatterjee, K. Sen, and T. , Henzinger, Model-checking ?-regular properties of interval markov chains

K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, Anonymity protocols as noisy channels, in: Information and Computation, 2006.

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, 2007.
DOI : 10.3233/JCS-2007-15302

T. Cover and J. Thomas, Elements of information theory, 1991.

S. H. Clark, Quantitative information flow, relations and polymorphic types, Journal of Logic and Computation, Special Issue on Lambda-calculus, type theory and natural language, pp.18-181, 2005.

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

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

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

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

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

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 sidechannels, CAV, pp.2012-564

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

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

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.

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

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

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

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

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

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

G. Smith, On the Foundations of Quantitative Information Flow, FOSSACS, pp.288-302, 2009.
DOI : 10.1137/060651380

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

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

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

L. Succ-(-t-)-=-{u-?-s-\{t} and |. Pt, u > 0} be the set of successors of t 6. If Pt,t = 1: (a) For each state s ? Pred(t) set P s,? = Ps,t (b) Remove t from S and T and go back to step 3

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

D. M. Goldschlag, M. G. Reed, and P. F. Syverson, Onion routing, Communications of the ACM, vol.42, issue.2, pp.39-41, 1999.
DOI : 10.1145/293411.293443

S. J. Murdoch and G. Danezis, Low-Cost Traffic Analysis of Tor, 2005 IEEE Symposium on Security and Privacy (S&P'05), pp.183-195, 2005.
DOI : 10.1109/SP.2005.12

T. G. Abbott, K. J. Lai, M. R. Lieberman, and E. C. Price, Browser-Based Attacks on Tor, Privacy Enhancing Technologies, pp.184-199, 2007.
DOI : 10.1007/978-3-540-75551-7_12

T. Cover and J. Thomas, Elements of information theory, 1991.

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

F. Biondi, A. Legay, B. F. Nielsen, and A. W?sowski, Maximizing entropy over markov processes Under review, 2012.

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

G. Winskel, The formal semantics of programming languages -an introduction. Foundation of computing series, 1993.

P. Malacaria, Risk assessment of security threats for looping constructs*, Journal of Computer Security, vol.18, issue.2, pp.191-228, 2010.
DOI : 10.3233/JCS-2010-0360

M. S. Alvim, M. E. Andrés, and C. Palamidessi, Quantitative information flow in interactive systems, Journal of Computer Security, vol.20, issue.1, pp.3-50, 2012.
DOI : 10.3233/JCS-2011-0433
URL : https://hal.archives-ouvertes.fr/inria-00637356

H. Chen and P. Malacaria, The Optimum Leakage Principle for Analyzing Multi-threaded Programs, Lecture Notes in Computer Science, vol.5973, pp.177-193, 2009.
DOI : 10.1007/978-3-642-14496-7_15

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

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

M. D. Preda and R. Giacobazzi, Semantics-based code obfuscation by abstract interpretation, Journal of Computer Security, vol.17, issue.6, pp.855-908, 2009.
DOI : 10.3233/JCS-2009-0345

B. Bérard, J. Mullins, and M. Sassolas, Quantifying opacity, 2010.

F. Biondi, A. Legay, P. Malacaria, and A. Wasowski, Quantifying information leakage of randomized protocols, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01242614

K. Chatzikokolakis, T. Chothia, and A. Guha, Statistical Measurement of Information Leakage, TACAS, 2010.
DOI : 10.1007/978-3-642-12002-2_33

K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, Anonymity protocols as noisy channels, Information and Computation, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00349225

D. Chaum, The dining cryptographers problem: Unconditional sender and recipient untraceability, Journal of Cryptology, vol.1, issue.1, pp.65-75, 1988.
DOI : 10.1007/BF00206326

S. Kiefer, A. S. Murawski, J. Ouaknine, B. Wachter, and J. Worrell, APEX: An Analyzer for Open Probabilistic Programs, Proc. CAV'12, 2012.
DOI : 10.1007/978-3-642-31424-7_51

V. Klebanov, Precise quantitative information flow analysis using symbolic model counting, p.2012

B. Köpf, L. Mauborgne, and M. Ochoa, Automatic Quantification of Cache Side-Channels, p.2012
DOI : 10.1007/978-3-642-31424-7_40

P. Malacaria, Algebraic foundations for information theoretical, probabilistic and guessability measures of information flow. CoRR, abs/1101, 2011.

S. Mccamant and M. D. Ernst, Quantitative information flow as network flow capacity, 2008.

C. Mu and D. Clark, A Tool: Quantitative Analyser for Programs, 2011 Eighth International Conference on Quantitative Evaluation of SysTems, 2011.
DOI : 10.1109/QEST.2011.25

Q. Phan, P. Malacaria, O. Tkachuk, and C. S. Pasareanu, Symbolic quantitative information flow, ACM SIGSOFT Software Engineering Notes, vol.37, issue.6, pp.1-5, 2012.
DOI : 10.1145/2382756.2382791

A. Sabelfeld and A. C. Myers, Language-based information-flow security, IEEE Journal on Selected Areas in Communications, vol.21, issue.1, pp.5-19, 2003.
DOI : 10.1109/JSAC.2002.806121

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