.. Differential, 35 3.3.1 Context and vocabulary, 35 3.3.2 Previous approaches to the privacy problem . . . . . . . . . . . . . . 36

M. Andrés, N. Bordenabe, K. Chatzikokolakis, and C. Palamidessi, Geo-indistinguishability, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, pp.28-69, 2013.

S. Mário, K. Alvim, C. Chatzikokolakis, G. Palamidessi, and . Smith, Measuring information leakage using generalized gain functions, Proceedings of the 25th IEEE Computer Security Foundations Symposium (CSF), pp.265-279, 2012.

[. Braun, K. Chatzikokolakis, and C. Palamidessi, Quantitative Notions of Leakage for One-try Attacks, Proceedings of the 25th Conf. on Mathematical Foundations of Programming Semantics, pp.75-91, 2009.

S. Boldo and J. Filliatre, Formal Verification of Floating-Point Programs, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), pp.187-194, 2007.

M. Bhargava and C. Palamidessi, Probabilistic Anonymity, Proceedings of the 16th International Conference on Concurrency Theory (CONCUR 2005), pp.171-185, 2005.

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, Proceedings of the 14th International Conference on the Foundations of Software Science and Computational Structures (FOSSACS'11), pp.396-410, 2011.

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.

L. [. Champion, P. De-pascale, and . Juutinen, The $\infty$-Wasserstein Distance: Local Solutions and Existence of Optimal Transport Maps, SIAM Journal on Mathematical Analysis, vol.40, issue.1, pp.1-20, 2008.

. M. Cgh-+-96-]-r, G. H. Corless, D. E. Gonnet, D. J. Hare, D. E. Jeffrey et al., On the lambert w function, In ADVANCES IN COMPUTATIONAL MATHEMATICS, pp.329-359, 1996.

[. Chaudhuri, S. Gulwani, and R. Lublinerman, Continuity analysis of programs, POPL, pp.57-70, 2010.

S. Chaudhuri, S. Gulwani, R. Lublinerman, and S. Navidpour, Proving programs robust, Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering, SIGSOFT/FSE '11, pp.102-112, 2011.

D. Clark, S. Hunt, and P. Malacaria, Quantified Interference for a While Language, Proceedings of the Second Workshop on Quantitative Aspects of Programming LanguagesCPP08] Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden. Anonymity protocols as noisy channels. Information and Computation, pp.149-166, 2004.

W. Edsger and . Dijkstra, A short introduction to the art of programming. circulated privately, p.83, 1971.

[. Dodis, A. López-alt, I. Mironov, and S. P. Vadhan, Differential Privacy with Imperfect Randomness, Advances in Cryptology?CRYPTO 2012, pp.497-516, 2012.

C. Dwork, F. Mcsherry, K. Nissim, and A. Smith, Calibrating Noise to Sensitivity in Private Data Analysis, Proceedings of the Third Theory of Cryptography Conference (TCC), pp.265-284, 2006.
DOI : 10.1007/11681878_14

C. Dwork, Differential Privacy, 33rd International Colloquium on Automata, Languages and Programming (ICALP), pp.1-12, 2006.
DOI : 10.1007/11787006_1

C. Dwork, A firm foundation for private data analysis, Taesu Kim, and Te-Won Lee. On the multivariate Laplace distribution, pp.86-96, 2011.

M. Gaboardi, A. Haeberlen, J. Hsu, A. R. Narayan, and B. C. Pierce, Linear dependent types for differential privacy, Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL), pp.357-370, 2013.

I. Gazeau, D. Miller, and C. Palamidessi, A non-local method for robustness analysis of floating point programs, Proceedings 10th Workshop on Quantitative Aspects of Programming Languages and Systems of Electronic Proceedings in Theoretical Computer Science, pp.63-76

I. Gazeau, D. Miller, and C. Palamidessi, Non-local Robustness Analysis via Rewriting Techniques, Electronic Proceedings in Theoretical Computer Science, vol.103, issue.4, 2012.

[. Gazeau, D. Miller, and C. Palamidessi, Preserving differential privacy under finite-precision semantics, Proceedings 11th International Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL) of Electronic Proceedings in Theoretical Computer Science, pp.1-18, 2013.

]. D. Gol91 and . Goldberg, What every computer scientist should know about floating-point arithmetic, ACM Computing Surveys, vol.23, issue.1, pp.5-47, 1991.

E. Goubault, Static Analyses of the Precision of Floating-Point Operations, Static Analysis, 8th International Symposium, pp.234-259, 2001.

E. Goubault and S. Putot, Static Analysis of Finite Precision Computations

J. Gerben, E. F. Hekstra, and . Deprettere, Floating point cordic, p.65, 1993.

Y. Joseph, K. R. Halpern, ]. C. O-'neillhoa69, . Hoarehr11, . Shen-shyang et al., Anonymity and information hiding in multiagent systems An axiomatic basis for computer programming Differential privacy for location pattern mining, Proceedings of the 4th ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS (SPRINGL), pp.483-512, 1969.

J. [. Kota and . Cavallaro, Numerical accuracy and hardware tradeoffs for CORDIC arithmetic for special-purpose processors, IEEE Transactions on Computers, vol.42, issue.7, pp.769-779, 1993.
DOI : 10.1109/12.237718

N. Li and T. Li, t-Closeness: Privacy Beyond k-Anonymity and l-Diversity, 2007 IEEE 23rd International Conference on Data Engineering, p.37, 2007.

P. Malacaria, Assessing security threats of looping constructs, Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.225-235, 2007.

I. Mironov, On significance of the least significant bits for differential privacy, Proceedings of the 2012 ACM conference on Computer and communications security, CCS '12

A. Machanavajjhala, D. Kifer, J. M. Abowd, J. Gehrke, and L. Vilhuber, Privacy: Theory meets Practice on the Map, 2008 IEEE 24th International Conference on Data Engineering, pp.277-286, 2008.

A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam, -diversity, ACM Transactions on Knowledge Discovery from Data, vol.1, issue.1

[. Majumdar and I. Saha, Symbolic Robustness Analysis, 2009 30th IEEE Real-Time Systems Symposium
DOI : 10.1109/RTSS.2009.17

M. H. Newman, Systematic testing for control applications On Theories with a Combinatorial Definition of Equivalence, MEMOCODE, pp.16-17, 1942.

A. Narayanan and V. Shmatikov, De-anonymizing Social Networks, 2009 30th IEEE Symposium on Security and Privacy, pp.173-187, 2009.
DOI : 10.1109/SP.2009.22

A. Di-pierro, C. Hankin, and H. Wiklicky, Measuring the confinement of probabilistic systems, Theoretical Computer Science, vol.340, issue.1, pp.3-56, 2005.

D. Rebollo-monedero, J. Forné, and J. Domingo-ferrer, From t-Closeness to PRAM and Noise Addition Via Information Theory, Privacy in Statistical Databases, pp.100-112, 2008.

W. Smith, On the foundations of quantitative information flow [Swe02] Latanya Sweeney. k-anonymity: A model for protecting privacy, Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures, pp.17-288, 1986.

E. Jack and . Volder, The CORDIC trigonometric computing technique, IRE Transactions on Electronic Computers, vol.77, issue.8, pp.330-334, 1959.