A. W. Appel, Modern Compiler Implementation in ML, 1998.

L. A. Belady, A study of replacement algorithms for a virtual storage computer, IBM Systems Journal, vol.5, issue.2, pp.78-101, 1966.

P. Bergner, P. Dahl, D. Engebretsen, and M. T. O'keefe, Spill code minimization via interference region spilling, SIGPLAN Conference on Programming Language Design and Implementation, pp.287-295, 1997.

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

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

G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins et al., Register allocation via coloring, Computer Languages, vol.6, pp.47-57, 1981.

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 and V. Liberatore, On local register allocation, SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, pp.564-573, 1998.

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

M. Charles and G. , Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics, vol.57, 2004.

K. Zadeck and K. Knobe, Register allocation using control trees, 1992.

G. A. Kildall, A unified approach to global program optimization, POPL '73: Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp.194-206, 1973.

P. Kolte and M. J. Harrold, Load/store range analysis for global register allocation, Proceedings of the conference on Programming language design and implementation, pp.268-277, 1993.

M. Yannakakis, Node-and edge-deletion np-complete problems, Proceedings of the tenth annual ACM symposium on Theory of computing (STOC), pp.253-264, 1978.