W. B. Ackerman, Efficient Implementation of Applicative Languages, 1984.

S. Ananian, The static single information form, 1999.

W. Andrew, J. Appel, and . Palsberg, Modern Compiler Implementation in Java, 2002.

P. Biggar, Design and Implementation of an Ahead-of-Time Compiler for PHP, 2009.

P. Biggar, D. Edsko-de-vries, and . Gregg, A practical solution for scripting language compilers, Proceedings of the 2009 ACM symposium on Applied Computing, SAC '09, pp.1916-1923, 2009.
DOI : 10.1145/1529282.1529709

R. Bodik, R. Gupta, and V. Sarkar, ABCD: eliminating array bounds checks on demand, PLDI, pp.321-333, 2000.

B. Boissinot, S. Hack, D. Grund, B. Dupont-de-dinechin, and F. Rastello, Fast liveness checking for ssa-form programs, Proceedings of the sixth annual IEEE/ACM international symposium on Code generation and optimization , CGO '08, pp.35-44, 2008.
DOI : 10.1145/1356058.1356064

URL : https://hal.archives-ouvertes.fr/inria-00192219

P. Briggs, K. D. Cooper, and L. Torczon, Improvements to graph coloring register allocation, ACM Transactions on Programming Languages and Systems, vol.16, issue.3, pp.428-455, 1994.
DOI : 10.1145/177492.177575

Z. Budimlic, K. D. Cooper, T. J. Harvey, K. Kennedy, T. S. Oberg et al., Fast copy coalescing and live-range identification, PLDI, pp.25-32, 2002.

R. Cartwright and M. Felleisen, The semantics of program dependence. SIGPLAN Not, pp.13-27, 1989.

C. Chambers and D. Ungar, Customization: optimizing compiler technology for SELF, a dynamically-typed object-oriented programming language, ACM SIGPLAN Notices, vol.24, issue.7, pp.146-160, 1989.
DOI : 10.1145/74818.74831

J. Choi, R. Cytron, and J. Ferrante, Automatic construction of sparse data flow evaluation graphs, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.55-66, 1991.
DOI : 10.1145/99583.99594

F. Chow, S. Chan, S. Liu, R. Lo, and M. Streich, Effective representation of aliases and indirect memory operations in SSA form, CC, pp.253-267, 1996.
DOI : 10.1007/3-540-61053-7_66

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/inria-00528590

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., Why does Astr??e scale up?, Formal Methods in System Design, vol.345, issue.1, pp.229-264, 2009.
DOI : 10.1007/s10703-009-0089-6

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck, Efficiently computing static single assignment form and the control dependence graph, ACM Transactions on Programming Languages and Systems, vol.13, issue.4, pp.451-490, 1991.
DOI : 10.1145/115372.115320

L. Damas and R. Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '82, pp.207-212, 1982.
DOI : 10.1145/582153.582176

C. Douglas, F. Teixeira, and . Pereira, The design and implementation of a non-iterative range analysis algorithm on a production compiler, SBLP, pp.45-59, 2011.

S. J. Fink, K. Knobe, and V. Sarkar, Unified Analysis of Array and Object References in Strongly Typed Languages, SAS, pp.155-174, 2000.
DOI : 10.1007/978-3-540-45099-3_9

T. Gawlitza, J. Leroux-reineke, H. Seidl, G. Sutre, and R. Wilhelm, Polynomial Precise Interval Analysis Revisited, Efficient Algorithms, vol.3, issue.1, pp.422-437, 2009.
DOI : 10.1007/978-3-540-74061-2_12

URL : https://hal.archives-ouvertes.fr/hal-00414750

L. George and B. Matthias, Taming the IXP network processor, PLDI, pp.26-37, 2003.

A. Jong-hoon-an, J. S. Chaudhuri, M. Foster, and . Hicks, Dynamic inference of static types for ruby, POPL, pp.459-472, 2011.

R. Johnson, D. Pearson, and K. Pingali, The program tree structure, PLDI, pp.171-185, 1994.

R. Johnson and K. Pingali, Dependence-based program analysis, PLDI, pp.78-89, 1993.

C. Lattner and V. S. Adve, LLVM: A compilation framework for lifelong program analysis & transformation, International Symposium on Code Generation and Optimization, 2004. CGO 2004., pp.75-88, 2004.
DOI : 10.1109/CGO.2004.1281665

R. Lo, F. Chow, R. Kennedy, S. Liu, and P. Tu, Register promotion by sparse partial redundancy elimination of loads and stores, PLDI, pp.26-37, 1998.

S. Mahlke, R. Ravindran, M. Schlansker, R. Schreiber, and T. Sherwood, Bitwidth cognizant architecture synthesis of custom hardware accelerators, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.20, issue.11, pp.1355-1371, 2001.
DOI : 10.1109/43.959864

A. Miné, The octagon abstract domain, Higher-Order and Symbolic Computation, vol.2477, issue.3, pp.31-100, 2006.
DOI : 10.1007/s10990-006-8609-1

M. Gowri, N. , and S. Sinha, Accurate interprocedural null-dereference analysis for java, ICSE, pp.133-143, 2009.

F. Nielson, H. R. Nielson, and C. Hankin, Principles of program analysis, 2005.
DOI : 10.1007/978-3-662-03811-6

H. Oh, K. Heo, W. Lee, W. Lee, and K. Yi, Design and implementation of sparse global analyses for c-like languages, PLDI, pp.229-238, 2012.

K. Pingali and G. Bilardi, Optimal control dependence computation and the Roman chariots problem, TOPLAS, pp.462-491, 1997.
DOI : 10.1145/256167.256217

J. Bradley and P. , Optimization of Object-Oriented and Concurrent Programs, 1996.

G. Ramalingam, On sparse evaluation representations, Theoretical Computer Science, vol.277, issue.1-2, pp.119-147, 2002.
DOI : 10.1016/S0304-3975(00)00315-7

A. Alves-rimsa, M. D. Amorim, and F. M. Pereira, Tainted flow analysis on e-SSA-form programs, CC, pp.124-143, 2011.

A. Alves-rimsa, M. D. Amorim, F. M. Pereira, and R. Bigonha, Efficient static checker for tainted variable attacks, Science of Computer Programming, vol.80, pp.91-105, 2014.
DOI : 10.1016/j.scico.2013.03.012

R. Ernani-rodrigues, V. Hugo-sperle-campos, and F. Pereira, A fast and low overhead technique to secure programs against integer overflows, CGO, pp.1-11, 2013.

S. Roy and Y. N. Srikant, The Hot Path SSA Form: Extending the Static Single Assignment Form for Speculative Optimizations, CC, pp.304-323, 2010.
DOI : 10.1007/978-3-642-11970-5_17

B. Scholz, C. Zhang, and C. Cifuentes, User-Input Dependence Analysis via Graph Reachability, 2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation, 2008.
DOI : 10.1109/SCAM.2008.22

J. Singer, Static Program Analysis Based on Virtual Register Renaming, 2006.

C. Vugranam, R. Sreedhar, D. M. Dz-ching-ju, V. Gillies, and . Santhanam, Translating out of static single assignment form, SAS, pp.194-210, 1999.

M. Stephenson, J. Babb, and S. Amarasinghe, Bitwidth analysis with application to silicon compilation, PLDI, pp.108-120, 2000.

Z. Su and D. Wagner, A class of polynomially solvable range constraints for interval analysis without widenings, Theoretical Computer Science, vol.345, issue.1, pp.122-138, 2005.
DOI : 10.1016/j.tcs.2005.07.035

S. Tobin-hochstadt and M. Felleisen, The design and implementation of typed scheme, pp.395-406, 2008.

N. Mark, F. K. Wegman, and . Zadeck, Constant propagation with conditional branches, TOPLAS, vol.13, issue.2, 1991.

M. Weiss, The transitive closure of control dependence: the iterated join, ACM Letters on Programming Languages and Systems, vol.1, issue.2, pp.178-190, 1992.
DOI : 10.1145/151333.151337

F. Kenneth and Z. , Incremental Data Flow Analysis in a Structured Program Editor, 1984.