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

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

D. Volpano, C. Irvine, and G. Smith, A sound type system for secure flow analysis, Journal of Computer Security, vol.4, issue.2-3, pp.167-187, 1996.
DOI : 10.3233/JCS-1996-42-304

S. Hunt and D. Sands, On flow-sensitive security types, POPL '06: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp.79-90, 2006.

R. Darvas, D. Hähnle, and . Sands, From Exponential to Polynomial-Time Security Typing via Principal Types A Theorem Proving Approach to Analysis of Secure Information Flow, ESOP. City University London Programming Languages and Systems, pp.297-316, 2005.

G. Barthe, P. R. Argenio, and T. Rezk, Secure information flow by self-composition, Computer Security Foundations Workshop Proceedings. 17th IEEE, pp.100-114, 2004.
DOI : 10.1109/csfw.2004.1310735
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.378.849

H. Unno, N. Kobayashi, and A. Yonezawa, Combining type-based analysis and model checking for finding counterexamples against noninterference, PLAS '06: Proceedings of the 2006 workshop on Programming languages and analysis for security, p.17, 2006.

G. , L. Guernic, A. Banerjee, T. P. Jensen, and D. A. Schmidt, Automatabased confidentiality monitoring, " in ASIAN'06: Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues, 2006.

A. Russo and A. Sabelfeld, Dynamic vs. Static Flow-Sensitive Security Analysis, 2010 23rd IEEE Computer Security Foundations Symposium, pp.186-199, 2010.
DOI : 10.1109/CSF.2010.20

D. E. Denning, Cryptography and data security, 1982.

C. E. Shannon, A Mathematical Theory of Communication, The Bell System Technical Journal, pp.379-423, 1948.

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, 2002.
DOI : 10.1016/S1571-0661(04)00290-7

M. R. Clarkson, A. C. Myers, and F. B. Schneider, Belief in Information Flow, 18th IEEE Computer Security Foundations Workshop (CSFW'05), pp.31-45, 2005.
DOI : 10.1109/CSFW.2005.10

J. Y. Halpern, Reasoning about uncertainty, 2003.

G. Smith, On the Foundations of Quantitative Information Flow, Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held As Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, ser. FOSSACS '09, pp.288-302, 2009.
DOI : 10.1137/060651380

A. Rényi, On measures of entropy and information, the Fourth Berkeley Symposium on Mathematical Statistics and Probability, 1961.

G. Barthe, P. R. Argenio, and T. Rezk, Secure information flow by self-composition, Mathematical Structures in Computer Science, vol.4, issue.06, pp.1207-1252, 2011.
DOI : 10.1145/5397.5399

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

J. Heusser and P. Malacaria, Applied Quantitative Information Flow and Statistical Databases, Formal Aspects in Security and Trust, pp.96-110, 2009.
DOI : 10.1007/978-3-642-12459-4_8

V. Klebanov, Precise quantitative information flow analysis??? a symbolic approach, Theoretical Computer Science, vol.538, pp.124-139, 2014.
DOI : 10.1016/j.tcs.2014.04.022

T. A. Henzinger, R. Jhala, R. Majumdar, and K. L. Mcmillan, Abstractions from proofs, the 31st ACM SIGPLAN-SIGACT symposium, pp.232-244, 2004.

T. Ball, R. Majumdar, T. D. Millstein, and S. K. Rajamani, Automatic predicate abstraction of C programs, the ACM SIGPLAN 2001 conference, pp.203-213, 2001.

E. M. Clarke, D. Kroening, and F. Lerda, A Tool for Checking ANSI-C Programs, TACAS, vol.2988, issue.15, pp.168-176, 2004.
DOI : 10.1007/978-3-540-24730-2_15

B. Köpf and A. Rybalchenko, Automation of Quantitative Information-Flow Analysis, SFM, vol.21, issue.1, pp.1-28, 2013.
DOI : 10.1007/978-3-642-00596-1_21

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/hal-01108790

M. R. Clarkson and F. B. Schneider, Hyperproperties, Computer Security Foundations Symposium, 2008. CSF '08. IEEE 21st, pp.51-65, 2008.

P. Cousot and R. Cousot, Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94), pp.95-112, 1994.
DOI : 10.1109/ICCL.1994.288389

T. Amtoft and A. Banerjee, Information Flow Analysis in Logical Form, Programming Languages and Systems, pp.100-115, 2004.
DOI : 10.1007/978-3-540-27864-1_10

P. Cousot and R. Cousot, Static determination of dynamic properties of programs, Proceedings of the second International Symposium on Programming. Paris, pp.106-130, 1976.

P. Cousot and N. Halbwachs, Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, pp.84-96, 1978.
DOI : 10.1145/512760.512770

L. Mauborgne and X. , Trace Partitioning in Abstract Interpretation Based Static Analyzers, ESOP'05: Proceedings of the 14th European conference on Programming Languages and Systems, pp.5-20, 2005.
DOI : 10.1007/978-3-540-31987-0_2

]. A. Miné, The octagon abstract domain Higher-order and symbolic computation, pp.31-100, 2006.

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., Combination of Abstractions in the ASTRÉEASTR´ASTRÉE Static Analyzer, Programming Languages and Systems, pp.272-300, 2007.

P. Cousot and R. Cousot, Systematic design of program analysis frameworks, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '79, pp.269-282, 1979.
DOI : 10.1145/567752.567778

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285

P. Cousot and R. Cousot, Constructive versions of Tarski???s fixed point theorems, Pacific Journal of Mathematics, vol.82, issue.1, pp.43-57, 1979.
DOI : 10.2140/pjm.1979.82.43

P. Cousot, The calculational design of a generic abstract interpreter, NATO ASI SERIES F COMPUTER AND SYSTEMS SCIENCES, vol.173, pp.421-506, 1999.

J. Midtgaard and T. P. Jensen, A Calculational Approach to Control-Flow Analysis by Abstract Interpretation, SAS, vol.5079, issue.23, pp.347-362, 2008.
DOI : 10.1007/978-3-540-69166-2_23

J. Bertrane, P. Cousot, R. Cousot, J. Feret, L. Mauborgne et al., Static Analysis and Verification of Aerospace Software by Abstract Interpretation, AIAA Infotech@Aerospace 2010, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00528611

P. Granger, Static analysis of arithmetical congruences, International Journal of Computer Mathematics, vol.30, issue.3-4, 1989.
DOI : 10.1145/29873.29875

D. Clark, S. Hunt, and P. Malacaria, Quantitative Information Flow, Relations and Polymorphic Types, Journal of Logic and Computation, vol.15, issue.2, pp.181-199, 2005.
DOI : 10.1093/logcom/exi009

T. M. Cover and J. A. Thomas, Elements of Information Theory 2nd Edition, 2006.

B. Espinoza and G. Smith, Min-entropy as a resource, Information and Computation, vol.226, pp.57-75, 2013.
DOI : 10.1016/j.ic.2013.03.005

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

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

J. L. Massey, Guessing and entropy, Proceedings of 1994 IEEE International Symposium on Information Theory, p.204, 1994.
DOI : 10.1109/ISIT.1994.394764

B. Köpf and A. Rybalchenko, Approximation and Randomization for Quantitative Information-Flow Analysis, 2010 23rd IEEE Computer Security Foundations Symposium, pp.3-14, 2010.
DOI : 10.1109/CSF.2010.8

H. Yasuoka and T. Terauchi, On Bounding Problems of Quantitative Information Flow, Computer Security ? ESORICS 2010, pp.357-372, 2010.

A. Askarov, S. Hunt, A. Sabelfeld, and D. Sands, Termination-Insensitive Noninterference Leaks More Than Just a Bit, Computer Security -ESORICS 2008, 2008.
DOI : 10.3233/JCS-1996-42-304