C. S. Ananian, The Static Single Information Form, 1999.

A. W. Appel and J. Palsberg, Modern Compiler Implementation in Java, 2002.
DOI : 10.1017/CBO9780511811432

F. Bouchez, A. Darte, C. Guillon, R. , and F. , Register allocation and spill complexity under SSA, 2005.

F. Bouchez, A. Darte, C. Guillon, R. , and F. , Register Allocation: What does the NP-Completeness Proof of Chaitin et al. Really Prove?, The 19th International Workshop on Languages and Compilers for Parallel Computing (LCPC'06), 2006.

P. Brisk, F. Dabiri, R. Jafari, and M. Sarrafzadeh, Optimal register sharing for high-level synthesis of SSA form programs, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.25, issue.5, pp.772-779, 2006.
DOI : 10.1109/TCAD.2006.870409

P. Brisk and M. Sarrafzadeh, Interference graphs for procedures in static single information form are interval graphs, Proceedingsof the 10th international workshop on Software & compilers for embedded systems , SCOPES '07, pp.101-110, 2007.
DOI : 10.1145/1269843.1269858

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

K. D. Cooper and L. 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. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics, vol.57, 2004.

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

R. Johnson, D. Pearson, and K. Pingali, The program structure tree, ACM SIGPLAN Notices, vol.29, issue.6, pp.171-185, 1994.
DOI : 10.1145/773473.178258

F. M. Pereira and J. Palsberg, Register Allocation Via Coloring of Chordal Graphs, Proceedings of APLAS'05, pp.315-329, 2005.
DOI : 10.1007/11575467_21

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.202

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

V. C. Sreedhar, G. R. Gao, L. , and Y. , Identifying loops using DJ graphs, ACM Transactions on Programming Languages and Systems, vol.18, issue.6, pp.649-658, 1996.
DOI : 10.1145/236114.236115

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.3972

B. Steensgaard, Sequentializing program dependence graphs for irreducible programs, 1993.

M. Yannakakis and F. Gavril, The maximum k-colorable subgraph problem for chordal graphs, Information Processing Letters, vol.24, issue.2, pp.133-137, 1987.
DOI : 10.1016/0020-0190(87)90107-4