A. W. Appel and L. George, Optimal spilling for cisc machines with few registers, PLDI'01: Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, pp.243-253, 2001.
DOI : 10.1145/381694.378854

F. Bouchez, A. Darte, C. Guillon, and F. Rastello, Register allocation and spill complexity under SSA, 2005.
URL : https://hal.archives-ouvertes.fr/hal-02102197

P. Briggs, K. 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.

P. Brisk, F. Dabiri, J. Macbeth, and M. Sarrafzadeh, Polynomial time graph coloring register allocation, 14th International Workshop on Logic and Synthesis, 2005.

G. J. Chaitin, Register allocation & spilling via graph coloring, Proceedings of the ACM SIGPLAN'82 Symposium on Compiler Construction, vol.17, pp.98-105, 1982.

G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, and E. Martin, Hopkins, and Peter W. Markstein. Register allocation via coloring, Computer Languages, vol.6, pp.47-57, 1981.

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

R. Cytron and J. Ferrante, What's in a name? or the value of renaming for parallelism detection and storage allocation, Proceedings of the 1987 International Conference on Parallel Processing, pp.19-27, 1987.

M. Farach-colton and V. Liberatore, On local register allocation, Journal of Algorithms, vol.37, issue.1, pp.37-65, 2000.

M. R. Garey, D. S. Johnson, G. L. Miller, and C. Papadimitriou, The complexity of coloring circular arcs and chords, SIAM Journal of Algebraic Discrete Methods, vol.1, issue.2, pp.216-227, 1980.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

L. George and A. W. Appel, Iterated register coalescing, ACM Transactions on Programming Languages and Systems, vol.18, issue.3, pp.300-324, 1996.

M. Charles and G. , Algorithmic Graph Theory and Perfect Graphs, 1980.

S. Hack, D. Grund, and G. Goos, Register allocation for programs in SSA-form, Compiler Construction, vol.3923, 2006.

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.

V. Liberatore, M. Farach-colton, and U. Kremer, Evaluation of algorithms for local register allocation, Compiler Construction -8th International Conference, CC'99, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'99, vol.1575, pp.137-152, 1999.

T. Guei-yuan-lueh and A. Gross, Fusion-based register allocation, ACM Transactions on Programming Languages and Systems, vol.22, issue.3, pp.431-470, 2000.

F. Magno, Q. Pereira, and J. Palsberg, Register allocation via coloring of chordal graphs, Proceedings of APLAS'05, Asian Symposium on Programming Languages and Systems, pp.315-329, 2005.

F. Magno, Q. Pereira, and J. Palsberg, Register allocation after classical SSA elimination is NP-complete, Proceedings of FOSSACS'06, Foundations of Software Science and Computation Structures, 2006.

F. Rastello, C. Francois-deferrì-ere, and . Guillon, Optimizing translation out of SSA using renaming constraints, Proceedings of the International Symposium on Code Generation and Optimization (CGO'04), pp.265-278, 2004.

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, vol.1694, pp.194-210, 1999.