Файловый архив студентов. Файловый архив студентов.
1261 вуз, 4629 предмет.
/ Регистрация
FAQ Обратная связь Вопросы и предложения
Добавил:
Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз:
Санкт-Петербургский государственный электротехнический университет "ЛЭТИ"
Предмет:
Электротехника
Файл:

Cooper K.Engineering a compiler

.pdf
Скачиваний:
49
Добавлен:
23.08.2013
Размер:
2.31 Mб
Скачать
☆

BIBLIOGRAPHY

363

[22]Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, and Peter W. Markstein. Register allocation via graph coloring. Computer Languages, 6(1):47–57, January 1981.

[23]R.W. Conway and T.R. Wilcox. Design and implementation of a diagnostic compiler for pl/i. Communications of the ACM, pages 169–179, 1973.

[24]Keith D. Cooper, Ken Kennedy, and Linda Torczon. The impact of interprocedural analysis and optimization in the IRn programming environment.

ACM Transactions on Programming Languages and Systems, 8(4):491–523, October 1986.

[25]Keith D. Cooper and L. Taylor Simpson. Optimistic global value numbering. In preparation.

[26]Keith D. Cooper and L. Taylor Simpson. Live range splitting in a graph coloring register allocator. In Proceedings of the Seventh International Compiler Construction Conference, CC ’98, Lecture Notes in Computer Science 1383, 1998.

[27]Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, 1992.

[28]Jack W. Davidson and Christopher W. Fraser. Register allocation and exhaustive peephole optimization. Software–Practice and Experience, 14(9):857–865, September 1984.

[29]Andrei P. Ershov. Reduction of the problem of memory allocation in programming to the problem of coloring the vertices of graphs. Doklady Akademii Nauk S.S.S.R., 142(4), 1962. English translation in Soviet Mathematics 3:163–165, 1962.

[30]Andrei P. Ershov2 Alpha – an automatic programming system of high e ciency. Journal of the ACM, 13(1):17–24, January 1966.

[31]R.W. Floyd. An algorithm for coding e cient arithmetic expressions. Communications of the ACM, pages 42–51, January 1961.

[32]George E. Forsythe, Michael A. Malcolm, and Cleve B. Moler. Computer Methods for Mathematical Computations. Prentice-Hall, Inc., Englewood Cli s, NJ, 1977.

[33]Lal George and Andrew W. Appel. Iterated register coalescing. In Conference Record of POPL ’96: 23rd ACM SIGPLAN/SIGACT Symposium on Princples of Programming Languages, pages 208–218, St. Petersburg, Florida, January 1996.

2The modern spelling is Ershov. Older variations include Yershov and Erˇsov.

364

BIBLIOGRAPHY

[34]Rajiv Gupta, Mary Lou So a, and Tim Steele. Register allocation via clique separators. SIGPLAN Notices, 24(7):264–274, July 1989. Proceedings of the ACM SIGPLAN ’89 Conference on Programming Language Design and Implementation.

[35]David R. Hanson. Fast allocation and deallocation of memory based on object lifetimes. Software—Practice and Experience, 20(1):5–12, January 1990.

[36]William Harrison. A class of register allocation algorithms. Technical report, IBM Thomas J. Watson Research Center, 1975.

[37]Donald E. Knuth. The Art Of Computer Programming. Addison-Wesley, 1973.

[38]Donald E. Knuth. The Art of Computer Programming, Volume 3, Sorting and Searching. Addison-Wesley Publishing Company, Reading, Massachusetts, 1973.

[39]Steven M. Kurlander and Charles N. Fischer. Zero-cost range splitting.

SIGPLAN Notices, 29(6):257–265, June 1994. Proceedings of the ACM SIGPLAN ’94 Conference on Programming Language Design and Implementation.

[40]S. S. Lavrov. Store economy in closed operator schemes. Journal of Computational Mathematics and Mathematical Physics, 1(4):687–701, 1961. English translation in U.S.S.R. Computational Mathematics and Mathematical Physics 3:810-828, 1962.

[41]Thomas Lengauer and Robert Endre Tarjan. A fast algorithm for finding dominators in a flowgraph. ACM Transactions on Programming Languages and Systems, 1(1):121–141, July 1979.

[42]Vincenczo Liberatore, Martin Farach, and Ulrich Kremer. Hardness and algorithms for local register allocation. Technical Report LCSR-TR332, Rutgers University, June 1997.

[43]Todd A. Proebsting and Charles N. Fischer. Linear-time, optimal code scheduling for delayed-load architectures. SIGPLAN Notices, 26(6):256– 267, June 1991. Proceedings of the ACM SIGPLAN ’91 Conference on Programming Language Design and Implementation.

[44]Todd A. Proebsting and Charles N. Fischer. Probalistic register allocation. SIGPLAN Notices, 27(7):300–310, July 1992. Proceedings of the ACM SIGPLAN ’92 Conference on Programming Language Design and Implementation.

[45]R.T. Prosser. Applications of boolean matrices to the analysis of flow diagrams. In Proceedings of the Eastern Joint Computer Conference, pages 133–138. Spartan Books, NY, USA, December 1959.

BIBLIOGRAPHY

365

[46]Philip J. Schielke. To be announced. PhD thesis, Rice University, August 1999.

[47]Ravi Sethi and Je rey D. Ullman. The generation of optimal code for arithmetic expressions. Journal of the ACM, 17(7):715–728, July 1970.

[48]L. Taylor Simpson. Value-Driven Redundancy Elimination. PhD thesis, Rice University, 1996.

[49]Philip H. Sweany and Steven J. Beaty. Dominator-path scheduling—a global scheduling method. SIGMICRO Newsletter, 23(12):260–263, December 1992. In Proceedings of the 25th Annual International Symposium on Microarchitecture.

[50]Ken Thompson. Regular expression search algorithm. Communications of the ACM, 11(6):419–422, 1968.

[51]William Wulf, Richard K. Johnson, Charles B. Weinstock, Steven O. Hobbs, and Charles M. Geschke. The Design of an Optimizing Compiler. Programming Language Series. American Elsevier Publishing Company, 1975.

Соседние файлы в предмете Электротехника
Помощь Обратная связь Вопросы и предложения Пользовательское соглашение Политика конфиденциальности