An approach to global register allocation.
暂无分享,去创建一个
[1] Ravi Sethi,et al. Complete register allocation problems , 1973, SIAM J. Comput..
[2] Ikuo Nakata,et al. On compiling algorithms for arithmetic expressions , 1967, CACM.
[3] Roman R. Redziejowski. On arithmetic expressions and trees , 1969, CACM.
[4] William H. E. Day,et al. Compiler Assignment of Data Items to Registers , 1970, IBM Syst. J..
[5] Jeffrey D. Ullman,et al. The Generation of Optimal Code for Arithmetic Expressions , 1970, JACM.
[6] Joseph Michael Newcomer. Machine-independent generation of optimal local code. , 1975 .
[7] Gilbert Joseph Hansen,et al. Adaptive systems for the dynamic run-time optimization of programs. , 1974 .
[8] A. M. Geoffrion. Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .
[9] Laszlo A. Belady,et al. A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..
[10] Charles Matthew Geschke,et al. Global program optimizations. , 1973 .
[11] Fabrizio Luccio,et al. A comment on index register allocation , 1967, CACM.
[12] William A. Wulf,et al. The Design of an Optimizing Compiler , 1975 .
[13] L. G. Mitten. Branch-and-Bound Methods: General Formulation and Properties , 1970, Oper. Res..
[14] James C. Beatty. An axiomatic approach to code optimization for expressions , 1972, JACM.