Optimal spilling for CISC machines with few registers, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'01), pp.243-253, 2001. ,
A study of replacement algorithms for a virtual-storage computer, IBM Systems Journal, vol.5, issue.2, pp.78-101, 1966. ,
DOI : 10.1147/sj.52.0078
Graphs and Hypergraphs, 1973. ,
Register allocation and spill complexity under SSA, 2005. ,
Register allocation: What does the NP-completeness proof of Chaitin et al. really prove?, International Workshop on Languages and Compilers for Parallel Computing (LCPC'06), 2006. ,
Polynomial time graph coloring register allocation, 14th International Workshop on Logic and Synthesis, 2005. ,
Fast copy coalescing and live range identification, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'02), pp.25-32, 2002. ,
Register allocation via coloring, Computer Languages, vol.6, issue.1, pp.47-57, 1981. ,
DOI : 10.1016/0096-0551(81)90048-5
Tailoring graph-coloring register allocation for runtime compilation, International Symposium on Code Generation and Optimization (CGO'06), pp.39-49, 2006. ,
Engineering a Compiler, 2004. ,
On Local Register Allocation, Journal of Algorithms, vol.37, issue.1, pp.37-65, 2000. ,
DOI : 10.1006/jagm.2000.1095
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979. ,
Algorithmic Graph Theory and Perfect Graphs, 1980. ,
Optimal bitwise register allocation using integer linear programming, International Workshop on Languages and Compilers for Parallel Computing (LCPC'06), 2006. ,
Optimal register allocation for SSA-form programs in polynomial time, Information Processing Letters, vol.98, issue.4, pp.150-155, 2006. ,
DOI : 10.1016/j.ipl.2006.01.008
Towards register allocation for programs in SSA-form, 2005. ,
Register Allocation for Programs in SSA-Form, International Conference on Compiler Construction, 2006. ,
DOI : 10.1007/11688839_20
Fusion-based register allocation, ACM Transactions on Programming Languages and Systems, vol.22, issue.3, pp.431-470, 2000. ,
DOI : 10.1145/353926.353929
Linear scan register allocation, ACM Transactions on Programming Languages and Systems, vol.21, issue.5, pp.895-913, 1999. ,
DOI : 10.1145/330249.330250
Quality and speed in linear-scan register allocation, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'98), pp.142-151, 1998. ,
Optimized interval splitting in a linear scan register allocator, Proceedings of the 1st ACM/USENIX international conference on Virtual execution environments , VEE '05, 2005. ,
DOI : 10.1145/1064979.1064998
Node-and edge-deletion NP-complete problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.253-264, 1978. ,
DOI : 10.1145/800133.804355
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