B. Alpern, The Jikes RVM project: Building an open source research community, IBM Systems Journal, vol.44, issue.2, p.399418, 2005.

W. Andrew, L. Appel, and . George, Optimal spilling for CISC machines with few registers, PLDI'01, p.243253, 2001.

L. A. Belady, A study of replacement algorithms for a virtual-storage computer, 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1966.
DOI : 10.1147/sj.52.0078

F. Bouchez, A. Darte, and F. Rastello, On the Complexity of Register Coalescing, International Symposium on Code Generation and Optimization (CGO'07), p.102114, 2007.
DOI : 10.1109/CGO.2007.26

F. Bouchez, A. Darte, and F. Rastello, On the complexity of spill everywhere under ssa form, LCTES'07, p.103112, 2007.
URL : https://hal.archives-ouvertes.fr/ensl-00180322

F. Bouchez, A. Darte, and F. Rastello, Advanced conservative and optimistic register coalescing, Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems, CASES '08, p.147156, 2008.
DOI : 10.1145/1450095.1450119

M. Braun and S. Hack, Register Spilling and Live-Range Splitting for SSA-Form Programs, Compiler Construction, p.174189, 2009.
DOI : 10.1007/978-3-642-00722-4_13

G. J. Chaitin, Register allocation & spilling via graph coloring, SIGPLAN'82: Proceedings of the 1982 SIGPLAN symposium on Compiler construction, p.98105, 1982.

Q. Colombet, B. Boissinot, P. Brisk, S. Hack, and F. Rastello, Graph-coloring and treescan register allocation using repairing, Proceedings of the 14th international conference on Compilers, architectures and synthesis for embedded systems, CASES '11, p.4554, 2011.
DOI : 10.1145/2038698.2038708

D. Keith, L. T. Cooper, and . Simpson, Live range splitting in a graph coloring register allocator, International Conference on Compiler Construction (CC'98), p.174187

B. Diouf, J. Cavazos, A. Cohen, and F. Rastello, Split Register Allocation: Linear Complexity Without the Performance Penalty, Intl. Conf. on High Performance and Embedded Architectures and Compilers (HiPEAC'10), 2010.
DOI : 10.1007/978-3-642-11515-8_7

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

J. Fabri, Automatic storage optimization, ACM Symp. on Compiler Construction, p.8391, 1979.
DOI : 10.1145/800229.806957

M. Farach-colton and V. Liberatore, On Local Register Allocation, Journal of Algorithms, vol.37, issue.1, p.3765, 2000.
DOI : 10.1006/jagm.2000.1095

A. Frank, Some polynomial algorithms for certain graphs and hypergraphs, Proceedings of the Fifth British Combinatorial Conference, p.211226, 1975.

M. Charles and G. , 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, CC'06, p.247262, 2006.
DOI : 10.1007/11688839_20

F. Magno, Q. Pereira, and J. Palsberg, Register allocation via coloring of chordal graphs, APLAS, p.315329, 2005.

M. Poletto and V. Sarkar, Linear scan register allocation, ACM Transactions on Programming Languages and Systems, vol.21, issue.5, p.895913, 1999.
DOI : 10.1145/330249.330250

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

A. Todd, C. N. Proebsting, and . Fischer, Probabilistic register allocation, Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation , PLDI '92, p.300310, 1992.

H. Rong, Tree register allocation, Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture, Micro-42, p.6777, 2009.
DOI : 10.1145/1669112.1669123

V. Sarkar and R. Barik, Extended Linear Scan: An Alternate Foundation for Global Register Allocation, Lecture Notes in Computer Science, vol.4420, issue.07, p.141155, 2007.
DOI : 10.1007/978-3-540-71229-9_10

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