1. Chaitin, G.J., Auslander, M.A., Chandra, A.K., Cocke, J., Hopkins, M.E., Markstein, P.W.: Register allocation via graph coloring. Journal of Computer Languages 6, 45–57 (1981)
2. Briggs, P., Cooper, K.D., Torczon, L.: Improvements to graph coloring register allocation. ACM Trans. Program. Lang. Syst. 16, 428–455 (1994)
3. Golumbic, M.C.: Algorithmic Graph Theory And Perfect Graphs. Academic Press, London (1980)
4. Budimlić, Z., Cooper, K.D., Harvey, T.J., Kennedy, K., Oberg, T.S., Reeves, S.W.: Fast copy coalescing and live-range identification. In: Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pp. 25–32. ACM Press, New York (2002)
5. Bouchez, F.: Allocation de registres et vidage en mémoire. Master’s thesis, ÉNS Lyon (2005)