F. E. Allen and J. Cocke, A program data flow analysis procedure, Communications of the ACM, vol.19, issue.3, p.137, 1976.
DOI : 10.1145/360018.360025

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

M. Bender and M. Farach-colton, The LCA Problem Revisited, LATIN 2000: Theoretical Informatics, pp.88-94, 2000.
DOI : 10.1007/10719839_9

B. Boissinot, A. Darte, B. Dupont-de-dinechin, C. Guillon, and F. Rastello, Revisiting Out-of-SSA Translation for Correctness, Code Quality and Efficiency, 2009 International Symposium on Code Generation and Optimization, pp.114-125, 2009.
DOI : 10.1109/CGO.2009.19
URL : https://hal.archives-ouvertes.fr/inria-00349925

F. Bouchez, A. Darte, C. Guillon, and F. Rastello, Register allocation: What does the NP-completeness proof of Chaitin et al. really prove?, International Workshop on Languages and Compilers for Parallel Computing, pp.283-298, 2006.

P. Briggs, K. D. Cooper, T. J. Harvey, and L. T. Simpson, Practical improvements to the construction and destruction of static single assignment form, Software: Practice and Experience, vol.28, issue.8, pp.859-881, 1998.
DOI : 10.1002/(SICI)1097-024X(19980710)28:8<859::AID-SPE188>3.0.CO;2-8

P. Briggs and L. Torczon, An efficient representation for sparse sets, ACM Letters on Programming Languages and Systems, vol.2, issue.1-4, pp.59-69, 1993.
DOI : 10.1145/176454.176484

L. Carter, J. Ferrante, and C. Thomborson, Folklore confirmed: Reducible flow graphs are exponentially larger, ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages (POPL'03), pp.106-114, 2003.

C. Click and M. Paleczny, A simple graph-based intermediate representation, ACM SIGPLAN Workshop on Intermediate Representations, pp.35-49, 1995.

K. D. Cooper, T. J. Harvey, and K. Kennedy, An Empirical Study of Iterative Data-Flow Analysis, 2006 15th International Conference on Computing, pp.266-276, 2006.
DOI : 10.1109/CIC.2006.22

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadek, 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

B. Dupont-de-dinechin, F. De-ferriere, C. Guillon, and A. Stoutchinin, Code generator optimizations for the ST120 DSP-MCU core, Proceedings of the international conference on Compilers, architectures, and synthesis for embedded systems , CASES '00, pp.93-102, 2000.
DOI : 10.1145/354880.354894

S. Hack, D. Grund, and G. Goos, Register Allocation for Programs in SSA-Form, International Conference on Compiler Construction, pp.247-262, 2006.
DOI : 10.1007/11688839_20

P. Havlak, Nesting of reducible and irreducible loops, ACM Transactions on Programming Languages and Systems, vol.19, issue.4, pp.557-567, 1997.
DOI : 10.1145/262004.262005

M. S. Hecht and J. D. Ullman, Characterizations of Reducible Flow Graphs, Journal of the ACM, vol.21, issue.3, pp.367-375, 1974.
DOI : 10.1145/321832.321835

S. Matthew, J. D. Hecht, and . Ullman, Analysis of a simple algorithm for global data flow problems, 1st annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL'73), pp.207-217, 1973.

J. Janssen and H. Corporaal, Making graphs reducible with controlled node splitting, ACM Transactions on Programming Languages and Systems, vol.19, issue.6, pp.1031-1052, 1997.
DOI : 10.1145/267959.269971
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.3925

B. John, J. D. Kam, and . Ullman, Global data flow analysis and iterative algorithms, Journal of the ACM, vol.23, issue.1, pp.158-171, 1976.

A. Gary and . Kildall, A unified approach to global program optimization, 1st annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL'73), pp.194-206, 1973.

T. Kotzmann, C. Wimmer, H. Mössenböck, T. Rodriguez, K. Russell et al., Design of the Java HotSpot#8482; client compiler for Java 6, ACM Transactions on Architecture and Code Optimization, vol.5, issue.1, pp.1-32, 2008.
DOI : 10.1145/1369396.1370017

A. Leung and L. George, Static single assignment form for machine code, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'99), pp.204-214, 1999.
DOI : 10.1145/301631.301667

. Libfirm, A library that provides an intermediate representation and optimisations for compilers

D. Mcallester, On the complexity analysis of static analyses, Journal of the ACM, vol.49, issue.4, pp.512-537, 2002.
DOI : 10.1145/581771.581774

M. Minoux, LTUR: a simplified linear-time unit resolution algorithm for horn formulae and computer implementation, Information Processing Letters, vol.29, issue.1, pp.1-12, 1988.
DOI : 10.1016/0020-0190(88)90124-X

F. Nielson, H. R. Nielson, and C. Hankin, Principles of Program Analysis, 1999.
DOI : 10.1007/978-3-662-03811-6

F. M. Pereira and J. Palsberg, Register Allocation Via Coloring of Chordal Graphs, Proceedings of Asian Symposium on Programming Languages and Systems (APLAS'05), pp.315-329, 2005.
DOI : 10.1007/11575467_21

G. Ramalingam, Identifying loops in almost linear time, ACM Transactions on Programming Languages and Systems, vol.21, issue.2, pp.175-188, 1999.
DOI : 10.1145/316686.316687

G. Ramalingam, On loops, dominators, and dominance frontiers, ACM Transactions on Programming Languages and Systems, vol.24, issue.5, pp.455-490, 2002.
DOI : 10.1145/570886.570887

G. Barbara, M. C. Ryder, and . Paull, Elimination algorithms for data flow analysis, ACM Computing Surveys, vol.18, issue.3, pp.277-316, 1986.

V. C. Sreedhar, R. D. Ju, D. M. Gillies, and V. Santhanam, Translating Out of Static Single Assignment Form, Proceedings of the 6th International Symposium on Static Analysis (SAS'99), pp.194-210, 1999.
DOI : 10.1007/3-540-48294-6_13

R. E. Tarjan, Testing flow graph reducibility, Journal of Computer and System Sciences, vol.9, issue.3, pp.355-365, 1974.
DOI : 10.1016/S0022-0000(74)80049-8
URL : http://doi.org/10.1016/s0022-0000(74)80049-8