A. W. Appel, Modern Compiler Implementation in ML, 1998.
DOI : 10.1017/CBO9780511811449

W. Andrew, L. Appel, and . George, Optimal coalescing challenge, 2000.

W. Andrew, L. Appel, and . George, Optimal spilling for CISC machines with few registers, PLDI'01, pp.243-253, 2001.

P. Bergner, P. Dahl, and D. Engebretsen, Spill code minimization via interference region spilling, PLDI '97, pp.287-295, 1997.
DOI : 10.1145/258916.258941

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

F. Bouchez, A Study of Spilling and Coalescing in Register Allocation as Two Separate Phases, 2008.
URL : https://hal.archives-ouvertes.fr/tel-00403504

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

P. Briggs, Register Allocation via Graph Coloring, 1992.

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

G. Chaitin, Register allocation and spilling via graph coloring, Symposium on Compiler Construction, pp.98-105, 1982.

C. Fred, J. L. Chow, and . Hennessy, The priority-based coloring approach to register allocation, ACM TOPLAS, vol.12, issue.4, pp.501-536, 1990.

D. Keith, L. T. Cooper, and . Simpson, Live range splitting in a graph coloring register allocator, CC '98, pp.174-187, 1998.

C. Fu and K. Wilken, A faster optimal register allocator, MICRO 35, pp.245-256, 2002.

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

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

D. Goodwin and K. Wilken, Optimal and Near-optimal Global Register Allocation Using 0-1 Integer Programming, Software: Practice and Experience, vol.26, issue.8, pp.929-965, 1996.
DOI : 10.1002/(SICI)1097-024X(199608)26:8<929::AID-SPE40>3.0.CO;2-T

D. W. Goodwin, Optimal and near-optimal global register allocation, 1996.

D. Grund and S. Hack, A Fast Cutting-Plane Algorithm for Optimal Coalescing, CC'07, pp.111-125, 2007.
DOI : 10.1007/978-3-540-71229-9_8

R. Gupta, M. L. Soffa, and D. Ombres, Efficient register allocation via coloring using clique separators, ACM Transactions on Programming Languages and Systems, vol.16, issue.3, pp.370-386, 1994.
DOI : 10.1145/177492.177499

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

P. Kolte and M. J. Harrold, Load/store range analysis for global register allocation, PLDI'93, pp.268-277, 1993.

. Guei-yuan, T. Lueh, and . Gross, Fusion-based register allocation, ACM TOPLAS, vol.22, 1997.

J. Park and S. Moon, Optimistic register coalescing, PACT '98, p.196, 1998.
DOI : 10.1145/1011508.1011512

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

V. Sarkar and R. Barik, Extended Linear Scan: An Alternate Foundation for Global Register Allocation, CC'07, pp.141-155, 2007.
DOI : 10.1007/978-3-540-71229-9_10

. Robert-endre-tarjan, Decomposition by clique separators, Discrete Mathematics, vol.55, issue.2, pp.221-232, 1985.
DOI : 10.1016/0012-365X(85)90051-2

D. B. West, Introduction to Graph Theory, 2000.

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