H. A¨?ta¨?t-kaci, R. Boyer, P. Lincoln, and R. Nasr, Efficient implementation of lattice operations, ACM Transactions on Programming Languages and Systems, vol.11, issue.1, pp.115-146, 1989.
DOI : 10.1145/59287.59293

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

F. Bouchez, A. Darte, C. Guillon, and F. Rastello, Register Allocation: What does the NP-Completeness Proof of Chaitin et al. Really Prove? In The 19th International Workshop on Languages and Compilers for Parallel Computing (LCPC'06), 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, pp.859-881, 1998.

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

P. Brisk, F. Dabiri, J. Macbeth, and M. Sarrafzadeh, Polynomial Time Graph Coloring Register Allocation, 14th International Workshop on Logic and Synthesis, 2005.

Z. Budimli´cbudimli´c, K. D. Cooper, T. J. Harvey, K. Kennedy, T. S. Oberg et al., Fast Copy Coalescing and Live-Range Identification, Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation, pp.25-32, 2002.

K. D. Cooper, T. J. Harvey, and K. Kennedy, Iterative Data-Flow Analysis, Revisited, 2002.

D. Keith, L. Cooper, and . Torczon, Engineering a Compiler, 2004.

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

M. Gerlek, M. Wolfe, and E. Stoltz, A Reference Chain Approach for Live Variables, 1994.

S. Hack, D. Grund, and G. Goos, Register Allocation for Programs in SSA-Form, 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

A. Leung and L. George, Static Single Assignment Form for Machine Code, PLDI '99: Proceedings of the ACM SIGPLAN 1999 Conference on Programming Language Design and Implementation, pp.204-214, 1999.
DOI : 10.1145/301631.301667

F. Magno, Q. Pereira, and J. Palsberg, Register Allocation via Coloring of Chordal Graphs, Proceedings of APLAS'05, pp.315-329, 2005.

G. Ramalingam, On Loops, Dominators, and Dominance Frontier, PLDI '00: Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, pp.233-241, 2000.
DOI : 10.1145/358438.349330

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 '99: Proceedings of the 6th International Symposium on Static Analysis, pp.194-210, 1999.

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418