Engineering a compiler: Second edition

Engineering a Compiler: Second Edition

Volumn 9780120884780, Issue , 2011, Pages 1-800

  Cooper, Keith D ^a   Torczon, Linda ^b  

^a RICE UNIVERSITY   (United States)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENGINEERING; INDUSTRIAL ENGINEERING;

CODE OPTIMIZATION; COMPILER TECHNOLOGY; INSTRUCTION SCHEDULING; LATEST DEVELOPMENT; RECENT RESEARCHES; REGISTER ALLOCATION; STATE OF THE ART; STATIC SINGLE ASSIGNMENT FORM;

PROGRAM COMPILERS;

EID: 84911127866     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/C2009-0-27982-7     Document Type: Book

References (359)

1. P.S. Abrams, An APL Machine, PhD thesis, Stanford University, Stanford, CA, 1970. Technical Report SLAC-R-114, Stanford Linear Accelerator Center, Stanford University, February 1970.
2. Aho A.V., Ganapathi M., Tjiang S.W.K. Code generation using tree matching and dynamic programming. ACM Trans. Program. Lang. Syst. 1989, 11(4):491-516.
3. Aho A.V., Hopcroft J.E., Ullman J.D. On finding lowest common ancestors in trees. Conference Record of the Fifth Annual ACM Symposium on Theory of Computing (STOC) 1973, 253-265. ACM, New York.
4. Aho A.V., Hopcroft J.E., Ullman J.D. The Design and Analysis of Computer Algorithms 1974, Addison-Wesley, Reading, MA.
5. Aho A.V., Johnson S.C. Optimal code generation for expression trees. J. ACM 1976, 23(3):488-501.
6. Aho A.V., Johnson S.C., Ullman J.D. Code generation for expressions with common subexpressions. Conference Record of the Third ACM Symposium on Principles of Programming Languages, Atlanta, GA 1976, 19-31. ACM, New York.
7. Aho A.V., Sethi R., Ullman J.D. Compilers: Principles, Techniques, and Tools 1986, Addison-Wesley, Reading, MA.
8. Aho A.V., Ullman J.D. The Theory of Parsing, Translation, and Compiling 1973, Prentice-Hall, Englewood Cliffs, NJ.
9. Aigrain P., Graham S.L., Henry R.R., McKusick M.K., Pelegri-Llopart E. Experience with a Graham-Glanville style code generator. SIGPLAN Not. 1984, 19(6):13-24.
10. Aiken A., Nicolau A. Optimal loop parallelization. SIGPLAN Not. 1988, 23(7):308-317.
11. Allen F.E. Program optimization. Annual Review in Automatic Programming 1969, vol. 5:239-307. Pergamon Press, Oxford, England. M. Halpern, C. Shaw (Eds.).
12. Allen F.E. Control flow analysis. SIGPLAN Not. 1970, 5(7):1-19.
13. Allen F.E. A basis for program optimization. Proceedings of Information Processing 71 1971, 385-390. North-Holland Publishing Company, Amsterdam.
14. Allen F.E. The history of language processor technology in IBM. IBM J. Res. Dev. 1981, 25(5):535-548.
15. F.E. Allen, Private communication, Dr. Allen noted that Beatty described live analysis in a document titled 'Optimization Methods for Highly Parallel, Multiregister Machines' dated September 1968, April 2009.
16. Allen F.E., Cocke J. A catalogue of optimizing transformations. Design and Optimization of Compilers 1972, 1-30. Prentice-Hall, Englewood Cliffs, NJ. R. Rustin (Ed.).
17. F.E. Allen, J. Cocke, Graph-Theoretic Constructs for Program Flow Analysis, Technical Report RC 3923 (17789), IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1972.
18. Allen F.E., Cocke J. A program data flow analysis procedure. Commun. ACM 1976, 19(3):137-147.
19. Allen F.E., Cocke J., Kennedy K. Reduction of operator strength. Program Flow Analysis: Theory and Applications 1981, 79-101. Prentice-Hall, Englewood Cliffs, NJ. S.S. Muchnick, N.D. Jones (Eds.).
20. Allen J.R., Kennedy K. Optimizing Compilers for Modern Architectures 2001, Morgan Kaufmann, San Francisco, CA.
21. Alpern B., Schneider F.B. Verifying temporal properties without temporal logic. ACM Trans. Program. Lang. Syst. 1989, 11(1):147-167.
22. Alpern B., Wegman M.N., Zadeck F.K. Detecting equality of variables in programs. Proceedings of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, San Diego, CA 1988, 1-11. ACM, New York.
23. Alstrup S., Harel D., Lauridsen P.W., Thorup M. Dominators in linear time. SIAM J. Comput. 1999, 28(6):2117-2132.
24. Auslander M.A., Hopkins M.E. An overview of the PL.8 compiler. SIGPLAN Not. 1982, 17(6):22-31.
25. Ayers A., Gottlieb R., Schooler R. Aggressive inlining. SIGPLAN Not. 1997, 32(5):134-145.
26. Backus J.W. The history of FORTRAN I, II, and III. History of Programming Languages 1981, 25-45. Academic Press, New York. R.L. Wexelblat (Ed.).
27. Backus J.W., Beeber R.J., Best S., Goldberg R., Haibt L.M., Herrick H.L., et al. The FORTRAN automatic coding system. Proceedings of the Western Joint Computer Conference 1957, 188-198. Institute of Radio Engineers, New York.
28. Bacon D.F., Graham S.L., Sharp O.J. Compiler transformations for high-performance computing. ACM Comput. Surv. 1994, 26(4):345-420.
29. Baer J.-L., Bovet D.P. Compilation of arithmetic expressions for parallel computation. Proceedings of 1968 IFIP Congress 1969, 340-346. North-Holland Publishing Company, Amsterdam.
30. Bagwell J.T. Local optimizations. SIGPLAN Not. 1970, 5(7):52-66.
31. Ball J.E. Predicting the effects of optimization on a procedure body. SIGPLAN '79: Proceedings of the 1979 SIGPLAN Symposium on Compiler Construction 1979, 214-220. ACM, New York.
32. Banning J. An efficient way to find side effects of procedure calls and aliases of variables. Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, San Antonio, TX 1979, 29-41. ACM, New York.
33. Barrett W.A., Couch J.D. Compiler Construction: Theory and Practice 1979, Science Research Associates, Inc., Chicago, IL.
34. Barth J.M. An interprocedural data flow analysis algorithm. Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, CA 1977, 119-131. ACM, New York.
35. Bauer A.M., Saal H.J. Does APL really need run-time checking?. Softw. Pract. Experience 1974, 4(2):129-138.
36. Belady L.A. A study of replacement algorithms for a virtual storage computer. IBM Syst. J. 1966, 5(2):78-101.
37. Bergner P., Dahl P., Engebretsen D., O'Keefe M.T. Spill code minimization via interference region spilling. SIGPLAN Not. 1997, 32(5):287-295.
38. Bernstein D., Goldin D.Q., Golumbic M.C., Krawczyk H., Mansour Y., Nahshon I., et al. Spill code minimization techniques for optimizing compilers. SIGPLAN Not. 1989, 24(7):258-263.
39. Bernstein D., Rodeh M. Global instruction scheduling for superscalar machines. SIGPLAN Not. 1991, 26(6):241-255.
40. Bernstein R.L. Producing good code for the case statement. Softw. Pract. Experience 1985, 15(10):1021-1024.
41. Binstock A., Rex J. Practical Algorithms for Programmers 1995, Addison-Wesley, Reading, MA.
42. Bird P.L. An implementation of a code generator specification language for table driven code generators. SIGPLAN Not. 1982, 17(6):44-55.
43. Bodík R., Gupta R., Soffa M.L. Complete removal of redundant expressions. SIGPLAN Not. 1998, 33(5):1-14.
44. Boehm H.-J. Space efficient conservative garbage collection. SIGPLAN Not. 1993, 28(6):197-206.
45. Boehm H.-J., Demers A. Implementing Russell. SIGPLAN Not. 1986, 21(7):186-195.
46. Boehm H.-J., Weiser M. Garbage collection in an uncooperative environment. Softw. Pract. Experience 1988, 18(9):807-820.
47. F. Bouchez, A Study of Spilling and Coalescing in Register Allocation As Two Separate Phases, PhD thesis, École Normale Supérieure de Lyon, Lyon, France, 2009.
48. Bradlee D.G., Eggers S.J., Henry R.R. Integrating register allocation and instruction scheduling for RISCs. SIGPLAN Not. 1991, 26(4):122-131.
49. P. Briggs, Register Allocation via Graph Coloring, PhD thesis, Department of Computer Science, Rice University, Houston, TX, 1992. Technical Report TR92-183, Computer Science Department, Rice University, 1992.
50. Briggs P., Cooper K.D., Harvey T.J., Simpson L.T. Practical improvements to the construction and destruction of static single assignment form. Softw. Pract. Experience 1998, 28(8):859-881.
51. Briggs P., Cooper K.D., Kennedy K., Torczon L. Coloring heuristics for register allocation. SIGPLAN Not. 1989, 24(7):275-284.
52. P. Briggs, K.D. Cooper, K. Kennedy, L. Torczon, Digital computer register allocation and code spilling using interference graph coloring, United States Patent 5,249,295, March 1993.
53. Briggs P., Cooper K.D., Simpson L.T. Value numbering. Softw. Pract. Experience 1997, 27(6):701-724.
54. Briggs P., Cooper K.D., Torczon L. Coloring register pairs. ACM Lett. Program. Lang. Syst. 1992, 1(1):3-13.
55. Briggs P., Cooper K.D., Torczon L. Rematerialization. SIGPLAN Not. 1992, 27(7):311-321.
56. Briggs P., Cooper K.D., Torczon L. Improvements to graph coloring register allocation. ACM Trans. Program. Lang. Syst. 1994, 16(3):428-455.
57. Briggs P., Torczon L. An efficient representation for sparse sets. ACM Lett. Program. Lang. Syst. 1993, 2(1-4):59-69.
58. th International Workshop on Logic and Synthesis 2005, 447-454.
59. Brouwer K., Gellerich W., Ploedereder E. Myths and facts about the efficient implementation of finite automata and lexical analysis. Proceedings of the International Conference on Compiler Construction CC'1998, vol. 1883 of LNCS 1998, 1-15. Springer-Verlag, Berlin, Heidelberg.
60. Brzozowski J.A. Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata, vol. 12 of MRI Symposia Series 1962, 529-561. Polytechnic Press, Polytechnic Institute of Brooklyn, New York.
61. Buchsbaum A.L., Kaplan H., Rogers A., Westbrook J.R. Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (STOC), Dallas, TX 1998, 279-288. ACM, New York.
62. Burke M. An interval-based approach to exhaustive and incremental interprocedural data-flow analysis. ACM Trans. Program. Lang. Syst. 1990, 12(3):341-395.
63. Burke M., Choi J.-D., Fink S., Grove D., Hind M., Sarkar V., et al. The Jalapeño dynamic optimizing compiler for Java™. Proceedings of the ACM 1999 Conference on Java Grande, San Francisco, CA 1999, 129-141. ACM, New York.
64. Burke M., Torczon L. Interprocedural optimization: eliminating unnecessary recompilation. ACM Trans. Program. Lang. Syst. 1993, 15(3):367-399.
65. Cai J., Paige R. Using multiset discrimination to solve language processing problems without hashing. Theor. Comput. Sci. 1995, 145(1-2):189-228.
66. Calder B., Grunwald D. Reducing branch costs via branch alignment. SIGPLAN Not. 1994, 29(11):242-251.
67. Callahan D., Carr S., Kennedy K. Improving register allocation for subscripted variables. SIGPLAN Not. 1990, 25(6):53-65.
68. Callahan D., Cooper K.D., Kennedy K., Torczon L. Interprocedural constant propagation. SIGPLAN Not. 1986, 21(7):152-161.
69. Cardelli L. Type systems. The Computer Science and Engineering Handbook 1996, 2208-2236. CRC Press, Boca Raton, FL. A.B. Tucker (Ed.).
70. Carr S., Kennedy K. Scalar replacement in the presence of conditional control flow. Softw. Pract. Experience 1994, 24(1):51-77.
71. Cattell R.G.G. Automatic derivation of code generators from machine descriptions. ACM Trans. Program. Lang. Syst. 1980, 2(2):173-190.
72. Cattell R.G.G., Newcomer J.M., Leverett B.W. Code generation in a machine-independent compiler. SIGPLAN Not. 1979, 14(8):65-75.
73. Chaitin G.J. Register allocation and spilling via graph coloring. SIGPLAN Not. 1982, 17(6):98-105.
74. G.J. Chaitin, Register allocation and spilling via graph coloring, United States Patent 4,571,678, February 1986.
75. Chaitin G.J., Auslander M.A., Chandra A.K., Cocke J., Hopkins M.E., Markstein P.W. Register allocation via coloring. Comput. Lang. 1981, 6(1):47-57.
76. Chase D.R. An improvement to bottom-up tree pattern matching. Proceedings of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, Munich, Germany 1987, 168-177. ACM, New York.
77. Chase D.R., Wegman M., Zadeck F.K. Analysis of pointers and structures. SIGPLAN Not. 1990, 25(6):296-310.
78. Chen J.B., Leupen B.D.D. Improving instruction locality with just-in-time code layout. Proceedings of the First USENIX Windows NT Workshop, Seattle, WA 1997, 25-32. The USENIX Association, Berkeley, CA.
79. Cheney C.J. A nonrecursive list compacting algorithm. Commun. ACM 1970, 13(11):677-678.
80. Choi J.-D., Burke M., Carini P.R. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. Proceedings of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC 1993, 232-245. ACM, New York.
81. F.C. Chow, A Portable Machine-Independent Global Optimizer-Design and Measurements, PhD thesis, Department of Electrical Engineering, Stanford University, Stanford, CA, 1983. Technical Report CSL-TR-83-254, Computer Systems Laboratory, Stanford University, December 1983.
82. Chow F.C., Hennessy J.L. Register allocation by priority-based coloring. SIGPLAN Not. 1984, 19(6):222-232.
83. Chow F.C., Hennessy J.L. The priority-based coloring approach to register allocation. ACM Trans. Program. Lang. Syst. 1990, 12(4):501-536.
84. C. Click, Combining Analyses, Combining Optimizations, PhD thesis, Department of Computer Science, Rice University, Houston, TX, 1995. Technical Report TR95-252, Computer Science Department, Rice University, 1995.
85. Click C. Global code motion/global value numbering. SIGPLAN Not. 1995, 30(6):246-257.
86. Click C., Cooper K.D. Combining analyses, combining optimizations. ACM Trans. Program. Lang. Syst. 1995, 17(2):181-196.
87. Cocke J. Global common subexpression elimination. SIGPLAN Not. 1970, 5(7):20-24.
88. Cocke J., Kennedy K. An algorithm for reduction of operator strength. Commun. ACM 1977, 20(11):850-856.
89. Cocke J., Markstein P.W. Measurement of program improvement algorithms. Proceedings of IFIP Congress 80, Information Processing 80, North Holland 1980, 221-228. Amsterdam, Netherlands. S.H. Lavington (Ed.).
90. Cocke J., Markstein P.W. Strength reduction for division and modulo with application to accessing a multilevel store. IBM J. Res. Dev. 1980, 24(6):692-694.
91. J. Cocke, J.T. Schwartz, Programming Languages and Their Compilers: Preliminary Notes, Technical Report, Courant Institute of Mathematical Sciences, New York University, New York, 1970.
92. Cohen J. Garbage collection of linked structures. ACM Comput. Surv. 1981, 13(3):341-367.
93. Cohn R., Lowney P.G. Hot cold optimization of large Windows/NT applications. Proceedings of the Twenty-Ninth IEEE/ACM Annual International Symposium on Microarchitecture (MICRO-29), Paris, France 1996, 80-89. ACM, New York.
94. Coleman S., McKinley K.S. Tile size selection using cache organization and data layout. SIGPLAN Not. 1995, 30(6):279-290.
95. Collins G.E. A method for overlapping and erasure of lists. Commun. ACM 1960, 3(12):655-657.
96. Conway M.E. Design of a separable transition diagram compiler. Commun. ACM 1963, 6(7):396-408.
97. Conway R.W., Wilcox T.R. Design and implementation of a diagnostic compiler for PL/I. Commun. ACM 1973, 16(3):169-179.
98. Cooper K.D., Eckhardt J. Improved passive splitting. Proceedings of the 2005 International Conference on Programming Languages and Compilers 2005, Computer Science Research, Education, and Applications (CSREA) Press, Athens, Georgia, pp. 1155-1122.
99. Cooper K.D., Hall M.W., Torczon L. An experiment with inline substitution. Softw. Pract. Experience 1991, 21(6):581-601.
100. K.D. Cooper, T.J. Harvey, K. Kennedy, A Simple, Fast Dominance Algorithm, Technical Report TR06-38870, Rice University Computer Science Department, Houston, TX, 2006.
101. Cooper K.D., Harvey T.J., Torczon L. How to build an interference graph. Softw. Pract. Experience 1998, 28(4):425-444.
102. Cooper K.D., Kennedy K. Interprocedural side-effect analysis in linear time. SIGPLAN Not. 1988, 23(7):57-66.
103. Cooper K.D., Kennedy K. Fast interprocedural alias analysis. Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, TX 1989, 49-59. ACM, New York.
104. Cooper K.D., Kennedy K., Torczon L. The impact of interprocedural analysis and optimization in the Rn programming environment. ACM Trans. Program. Lang. Syst. 1986, 8(4):491-523.
105. Cooper K.D., Schielke P.J. Non-local instruction scheduling with limited code growth. Proceedings of the 1998 ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES), Lecture Notes in Computer Science 1474 1998, 193-207. Springer-Verlag, Heidelberg, Germany. F. Mueller, A. Bestavros (Eds.).
106. Cooper K.D., Simpson L.T. Live range splitting in a graph coloring register allocator. Proceedings of the Seventh International Compiler Construction Conference (CC '98), Lecture Notes in Computer Science 1383 1998, 174-187. Springer-Verlag, Heidelberg, Germany.
107. Cooper K.D., Simpson L.T., Vick C.A. Operator strength reduction. ACM Trans. Program. Lang. Syst. 2001, 23(5):603-625.
108. Cooper K.D., Waterman T. Understanding energy consumption on the C62x. Proceedings of the 2002 Workshop on Compilers and Operating Systems for Low Power 2002, 4-1-4-8.
109. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms 1992, MIT Press, Cambridge, MA.
110. Cytron R., Ferrante J., Rosen B.K., Wegman M.N., Zadeck F.K. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst. 1991, 13(4):451-490.
111. Cytron R., Lowry A., Zadeck F.K. Code motion of control structures in high-level languages. Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, St. Petersburg Beach, FL 1986, 70-85. ACM, New York.
112. Daciuk J. Comparison of construction algorithms for minimal, acyclic, deterministic finite-state automata from sets of strings. Seventh International Conference on Implementation and Application of Automata, CIAA 2002, vol. 2068 of LNCS 2003, 255-261. Springer-Verlag, Berlin, Heidelberg.
113. Das M. Unification-based pointer analysis with directional assignments. SIGPLAN Not. 2000, 35(5):35-46.
114. th International Conference on Compiler Construction (CC '96), Linköping, Sweden, April 24--26 1996, 59-73. Springer-Verlag, London.
115. Davidson J.W., Fraser C.W. The design and application of a retargetable peephole optimizer. ACM Trans. Program. Lang. Syst. 1980, 2(2):191-202.
116. Davidson J.W., Fraser C.W. Automatic generation of peephole optimizations. SIGPLAN Not. 1984, 19(6):111-116.
117. Davidson J.W., Fraser C.W. Register allocation and exhaustive peephole optimization. Softw. Pract. Experience 1984, 14(9):857-865.
118. Davidson J.W., Fraser C.W. Automatic inference and fast interpretation of peephole optimization rules. Softw. Pract. Experience 1987, 17(11):801-812.
119. Davidson J.W., Holler A.M. A study of a C function inliner. Softw. Pract. Experience 1988, 18(8):775-790.
120. Demers A.J., Weiser M., Hayes B., Boehm H., Bobrow D., Shenker S. Combining generational and conservative garbage collection: framework and implementations. Proceedings of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, San Francisco, CA 1990, 261-269. ACM, New York.
121. DeRemer F. Simple LR(k) grammars. Commun. ACM 1971, 14(7):453-460.
122. DeRemer F., Pennello T.J. Efficient computation of LALR(1) look-ahead sets. SIGPLAN Not. 1979, 14(8):176-187.
123. Deutsch A. Interprocedural May-Alias analysis for pointers: beyond k-limiting. SIGPLAN Not. 1994, 29(6):230-241.
124. L.P. Deutsch, An Interactive Program Verifier, PhD thesis, Computer Science Department, University of California, Berkeley, CA, 1973. Technical Report CSL-73-1, Xerox Palo Alto Research, May 1973.
125. Deutsch L.P., Bobrow D.G. An efficient, incremental, automatic, garbage collector. Commun. ACM 1976, 19(9):522-526.
126. Deutsch L.P., Schiffman A.M. Efficient implementation of the Smalltalk-80 system. Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, Salt Lake City, UT 1984, 297-302. ACM, New York.
127. Dhamdhere D.M. On algorithms for operator strength reduction. Commun. ACM 1979, 22(5):311-312.
128. Dhamdhere D.M. A fast algorithm for code movement optimisation. SIGPLAN Not. 1988, 23(10):172-180.
129. Dhamdhere D.M. A new algorithm for composite hoisting and strength reduction. Int. J. Comput. Math. 1989, 27(1):1-14.
130. Dhamdhere D.M. Practical adaptation of the global optimization algorithm of Morel and Renvoise. ACM Trans. Program. Lang. Syst. 1991, 13(2):291-294.
131. Dhamdhere D.M., Isaac J.R. A composite algorithm for strength reduction and code movement optimization. Int. J. Comput. Inf. Sci. 1980, 9(3):243-273.
132. Donegan M.K., Noonan R.E., Feyock S. A code generator generator language. SIGPLAN Not 1979, 14(8):58-64.
133. Drechsler K.-H., Stadel M.P. A solution to a problem with Morel and Renvoise's "Global optimization by suppression of partial redundancies,". ACM Trans. Program. Lang. Syst. 1988, 10(4):635-640.
134. Drechsler K.-H., Stadel M.P. A variation of Knoop, Rüthing, and Steffen's "lazy code motion,". SIGPLAN Not. 1993, 28(5):29-38.
135. Earley J. An efficient context-free parsing algorithm. Commun. ACM 1970, 13(2):94-102.
136. Ebcioğlu K., Nakatani T. A new compilation technique for parallelizing loops with unpredictable branches on a VLIW architecture. Selected Papers of the Second Workshop on Languages and Compilers for Parallel Computing (LCPC '89) 1990, 213-229. Pitman Publishing, London.
137. Ellis J.R. Bulldog: A Compiler for VLIW Architectures 1986, The MIT Press, Cambridge, MA.
138. Emami M., Ghiya R., Hendren L.J. Context-sensitive interprocedural points-to analysis in the presence of function pointers. SIGPLAN Not. 1994, 29(6):242-256.
139. Ershov A.P. On programming of arithmetic expressions. Commun. ACM 1958, 1(8):3-6. The figures appear in volume 1, number 9, page 16.
140. Ershov A.P. Reduction of the problem of memory allocation in programming to the problem of coloring the vertices of graphs. Sov. Math.. Originally published in Doklady Akademii Nauk S.S.S.R. 1962, 142(4):163-165.
141. Ershov A.P. Alpha: an automatic programming system of high efficiency. J. ACM 1966, 13(1):17-24.
142. Farrow R. Linguist-86: yet another translator writing system based on attribute grammars. SIGPLAN Not. 1982, 17(6):160-171.
143. Farrow R. Automatic generation of fixed-point-finding evaluators for circular, but well-defined, attribute grammars. SIGPLAN Not. 1986, 21(7):85-98.
144. Fenichel R.R., Yochelson J.C. A LISP garbage-collector for virtual-memory computer systems. Commun. ACM 1969, 12(11):611-612.
145. Ferrante J., Ottenstein K.J., Warren J.D. The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst. 1987, 9(3):319-349.
146. Fischer C.N., LeBlanc R.J. The implementation of run-time diagnostics in Pascal. IEEE Trans. Software Eng. 1980, SE-6(4):313-319.
147. Fischer C.N., LeBlanc R.J. Crafting a Compiler with C 1991, Benjamin/Cummings, Redwood City, CA.
148. Fisher J.A. Trace scheduling: a technique for global microcode compaction. IEEE Trans. Comput. 1981, C-30(7):478-490.
149. Fisher J.A., Ellis J.R., Ruttenberg J.C., Nicolau A. Parallel processing: a smart compiler and a dumb machine. SIGPLAN Not. 1984, 19(6):37-47.
150. Floyd R.W. An algorithm for coding efficient arithmetic expressions. Commun. ACM 1961, 4(1):42-51.
151. Foster J.M. A syntax improving program. Comput. J. 1968, 11(1):31-34.
152. Fraser C.W., Hanson D.R., Proebsting T.A. Engineering a simple, efficient code generator generator. ACM Lett. Program. Lang. Syst. 1992, 1(3):213-226.
153. Fraser C.W., Henry R.R. Hard-coding bottom-up code generation tables to save time and space. Softw. Pract. Experience 1991, 21(1):1-12.
154. Fraser C.W., Wendt A.L. Integrating code generation and optimization. SIGPLAN Not. 1986, 21(7):242-248.
155. Fraser C.W., Wendt A.L. Automatic generation of fast optimizing code generators. SIGPLAN Not. 1988, 23(7):79-84.
156. Ganapathi M., Fischer C.N. Description-driven code generation using attribute grammars. Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, Albuquerque, NM 1982, 108-119. ACM, New York.
157. Ganzinger H., Giegerich R., Möncke U., Wilhelm R. A truly generative semantics-directed compiler generator. SIGPLAN Not. 1982, 17(6):172-184.
158. George L., Appel A.W. Iterated register coalescing. Proceedings of the Twenty-Third ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, St. Petersburg Beach, FL 1996, 208-218. ACM, New York.
159. Gibbons P.B., Muchnick S.S. Efficient instruction scheduling for a pipelined architecture. SIGPLAN Not. 1986, 21(7):11-16.
160. Glanville R.S., Graham S.L. A new method for compiler code generation. Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, Tucson, AZ 1978, 231-240. ACM, New York.
161. Gloy N., Smith M.D. Procedure placement using temporal-ordering information. ACM Trans. Program. Lang. Syst. 1999, 21(5):977-1027.
162. Goldberg A., Robson D. Smalltalk-80: The Language and Its Implementation 1983, Addison-Wesley, Reading, MA.
163. Goodman J.R., Hsu W.-C. Code scheduling and register allocation in large basic blocks. Proceedings of the Second International Conference on Supercomputing 1988, 442-452. ACM, New York.
164. E. Goto, Monocopy and Associative Operations in Extended Lisp, Technical Report 74-03, University of Tokyo, Tokyo, Japan, 1974.
165. Graham S.L. Table-driven code generation. IEEE Comput. 1980, 13(8):25-34.
166. Graham S.L., Harrison M.A., Ruzzo W.L. An improved context-free recognizer. ACM Trans. Program. Lang. Syst. 1980, 2(3):415-462.
167. Graham S.L., Henry R.R., Schulman R.A. An experiment in table driven code generation. SIGPLAN Not. 1982, 17(6):32-43.
168. Graham S.L., Wegman M. A fast and usually linear algorithm for global flow analysis. Conference Record of the Second ACM Symposium on Principles of Programming Languages, Palo Alto, CA 1975, 22-34. ACM, New York.
169. Graham S.L., Wegman M. A fast and usually linear algorithm for global flow analysis. J. ACM 1976, 23(1):172-202.
170. Granlund T., Kenner R. Eliminating branches using a superoptimizer and the GNU C compiler. SIGPLAN Not. 1992, 27(7):341-352.
171. Gries D. Compiler Construction for Digital Computers 1971, John Wiley & Sons, New York.
172. Grove D., Torczon L. Interprocedural constant propagation: a study of jump function implementations. Proceedings of the ACM SIGPLAN 93 Conference on Programming Language Design and Implementation (pldi) 1993, 90-99. ACM, New York, Also published as SIGPLAN Not. 28 (6) (1993).
173. Gupta R. Optimizing array bound checks using flow analysis. ACM Lett. Program. Lang. Syst. (LOPLAS) 1993, 2:135-150.
174. Gupta R., Soffa M.L. Region scheduling: an approach for detecting and redistributing parallelism. IEEE Trans. Software Eng. 1990, SE-16(4):421-431.
175. Gupta R., Soffa M.L., Steele T. Register allocation via clique separators. SIGPLAN Not. 1989, 24(7):264-274.
176. S. Hack, Register Allocation for Programs in SSA Form, PhD thesis, Universität Karlsruhe, Karlsruhe, Germany, 2007.
177. Hack S., Goos G. Optimal register allocation for SSA-form programs in polynomial time. Inf. Process. Lett. 2006, 98(4):150-155.
178. Hailperin M. Cost-optimal code motion. ACM Trans. Program. Lang. Syst. 1998, 20(6):1297-1322.
179. Hanson D.R. Fast allocation and deallocation of memory based on object lifetimes. Softw. Pract. Experience 1990, 20(1):5-12.
180. Harel D. A linear time algorithm for finding dominators in flow graphs and related problems. Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing (STOC) 1985, 185-194. ACM, New York.
181. W.H. Harrison, A Class of Register Allocation Algorithms, Technical Report RC-5342, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1975.
182. Harrison W.H. A new strategy for code generation: the general purpose optimizing compiler. IEEE Trans. Software Eng. 1979, SE-5(4):367-373.
183. Hashemi A.H., Kaeli D.R., Calder B. Efficient procedure mapping using cache line coloring. Proceedings of the ACM SIGPLAN 1997 Conference on Programming Language Design and Implementation 1997, 171-182. ACM, New York, Also appeared as SIGPLAN Not. 32 (5).
184. Hatcher P.J., Christopher T.W. High-quality code generation via bottom-up tree pattern matching. Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, St. Petersburg Beach, FL 1986, 119-130. ACM, New York.
185. Hecht M.S., Ullman J.D. Characterizations of reducible flow graphs. J. ACM 1974, 21(3):367-375.
186. Hecht M.S., Ullman J.D. A simple algorithm for global data flow analysis problems. SIAM J. Comput. 1975, 4(4):519-532.
187. Heller J. Sequencing aspects of multiprogramming. J. ACM 1961, 8(3):426-439.
188. Hennessy J.L., Gross T. Postpass code optimization of pipeline constraints. ACM Trans. Program. Lang. Syst. 1983, 5(3):422-448.
189. Heuring V.P. The automatic generation of fast lexical analysers. Softw. Pract. Experience 1986, 16(9):801-808.
190. Hind M., Burke M., Carini P., Choi J.-D. Interprocedural pointer alias analysis. ACM Trans. Program. Lang. Syst. 1999, 21(4):848-894.
191. Hind M., Pioli A. Which pointer analysis should I use?. ACM SIGSOFT Software Eng. Notes 2000, 25(5):113-123. In Proceedings of the International Symposium on Software Testing and Analysis.
192. Hoffmann C.M., O'Donnell M.J. Pattern matching in trees. J. ACM 1982, 29(1):68-95.
193. Hopcroft J.E. An n log n algorithm for minimizing states in a finite automaton. Theory of Machines and Computations: Proceedings 1971, 189-196. Academic Press, New York. Z. Kohavi, A. Paz (Eds.).
194. Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages, and Computation 1979, Addison-Wesley, Reading, MA.
195. Horowitz E., Sahni S. Fundamentals of Computer Algorithms 1978, Computer Science Press, Inc., Potomac, MD.
196. Horwitz L.P., Karp R.M., Miller R.E., Winograd S. Index register allocation. J. ACM 1966, 13(1):43-61.
197. Horwitz S., Pfeiffer P., Reps T. Dependence analysis for pointer variables. SIGPLAN Not. 1989, 24(7):28-40.
198. Horwitz S., Teitelbaum T. Generating editing environments based on relations and attributes. ACM Trans. Program. Lang. Syst. 1986, 8(4):577-608.
199. B.L. Huber, Path-Selection Heuristics for Dominator-Path Scheduling, Master's thesis, Computer Science Department, Michigan Technological University, Houghton, MI, 1995.
200. W. Hunt, B. Maher, K. Coons, D. Burger, K.S. McKinley, Optimal Huffman tree-height reduction for instruction level parallelism, unpublished manuscript, provided by authors, 2006.
201. Hwu W.-M.W., Mahlke S.A., Chen W.Y., Chang P.P., Warter N.J., Bringmann R.A., et al. The superblock: an effective technique for VLIW and superscalar compilation. J. Supercomputing-Special Issue on Instruction Level Parallelism 1993, 7(1-2):229-248.
202. Irons E.T. A syntax directed compiler for Algol 60. Commun. ACM 1961, 4(1):51-55.
203. Jazayeri M., Walter K.G. Alternating semantic evaluator. Proceedings of the 1975 Annual Conference of the ACM 1975, 230-234. ACM, New York.
204. Johnson M.S., Miller T.C. Effectiveness of a machine-level, global optimizer. SIGPLAN Not. 1986, 21(7):99-108.
205. S.C. Johnson, Yacc: Yet Another Compiler-Compiler, Technical Report 32 (Computing Science), AT&T Bell Laboratories, Murray Hill, NJ, 1975.
206. Johnson S.C. A tour through the portable C compiler. Unix Programmer's Manual 1979, vol. 2b. AT&T Bell Laboratories, Murray Hill, NJ. seventh ed.
207. Johnson W.L., Porter J.H., Ackley S.I., Ross D.T. Automatic generation of efficient lexical processors using finite state techniques. Commun. ACM 1968, 11(12):805-813.
208. Jones D.W. How (not) to code a finite state machine. ACM SIGPLAN Not. 1988, 23(8):19-22.
209. Joshi S.M., Dhamdhere D.M. A composite hoisting-strength reduction transformation for global program optimization. Int. J. Comput. Math. 1982, 11(1):21-44. (part I); 11 (2) 111--126 (part II).
210. Kam J.B., Ullman J.D. Global data flow analysis and iterative algorithms. J. ACM 1976, 23(1):158-171.
211. Kam J.B., Ullman J.D. Monotone data flow analysis frameworks. Acta Informatica 1977, 7:305-317.
212. Kasami T. An efficient recognition and syntax analysis algorithm for context-free languages, Scientific Report AFCRL-65-758 1965, Air Force Cambridge Research Laboratory, Bedford, MA.
213. Kennedy K. A global flow analysis algorithm. Int. J. Comput. Math. Sect. A 1971, 3:5-15.
214. K. Kennedy, Global Flow Analysis and Register Allocation for Simple Code Structures, PhD thesis, Courant Institute of Mathematical Sciences, New York University, New York, 1971.
215. Kennedy K. Global dead computation elimination, SETL Newsletter 111, Courant Institute of Mathematical Sciences 1973, New York University, New York.
216. Kennedy K. Reduction in strength using hashed temporaries, SETL Newsletter 102, Courant Institute of Mathematical Sciences 1973, New York University, New York.
217. Kennedy K. Use-definition chains with applications. Comput. Lang. 1978, 3(3):163-179.
218. Kennedy K. A survey of data flow analysis techniques. Program Flow Analysis: Theory and Applications 1981, 5-54. Prentice-Hall, Englewood Cliffs, NJ. N.D. Jones, S.S. Muchnik (Eds.).
219. Kennedy K., Zucconi L. Applications of graph grammar for program control flow analysis. Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, CA 1977, 72-85. ACM, New York.
220. Kennedy R., Chow F.C., Dahl P., Liu S.-M., Lo R., Streich M. Strength reduction via SSAPRE. Proceedings of the Seventh International Conference on Compiler Construction (CC '98) 1998, 144-158. Springer-Verlag, Heidelberg, Germany.
221. Kerns D.R., Eggers S.J. Balanced scheduling: instruction scheduling when memory latency is uncertain. SIGPLAN Not. 1993, 28(6):278-289.
222. Kessler R.R. Peep: an architectural description driven peephole optimizer. SIGPLAN Not. 1984, 19(6):106-110.
223. Kildall G.A. A unified approach to global program optimization. Conference Record of the ACM Symposium on Principles of Programming Languages, Boston, MA 1973, 194-206. ACM, New York.
224. Kleene S.C. Representation of events in nerve nets and finite automata. Automata Studies, Annals of Mathematics Studies 1956, vol. 34:3-41. Princeton University Press, Princeton, NJ. C.E. Shannon, J. McCarthy (Eds.).
225. Knoop J., Rüthing O., Steffen B. Lazy code motion. SIGPLAN Not. 1992, 27(7):224-234.
226. Knoop J., Rüthing O., Steffen B. Lazy strength reduction. Int. J. Program. Lang. 1993, 1(1):71-91.
227. Knuth D.E. A history of writing compilers. Comput. Autom. 1962, 11(12):8-18. Reprinted in Compiler Techniques, B.W. Pollack (Ed.), Auerbach, Princeton, NJ, 1972, pp. 38-56.
228. Knuth D.E. On the translation of languages from left to right. Inf. Control 1965, 8(6):607-639.
229. Knuth D.E. Semantics of context-free languages. Math. Syst. Theory 1968, 2(2):127-145.
230. Knuth D.E. Semantics of context-free languages: correction. Math. Syst. Theory 1971, 5(1):95-96.
231. Knuth D.E. The Art of Computer Programming 1973, Addison-Wesley, Reading, MA.
232. Kozen D.C. Automata and Computability 1997, Springer-Verlag, New York.
233. Smalltalk-80: Bits of History, Words of Advice 1983, Addison-Wesley, Reading, MA. G. Krasner (Ed.).
234. Krishnamurthy S.M. A brief survey of papers on scheduling for pipelined processors. SIGPLAN Not. 1990, 25(7):97-106.
235. Kurlander S.M., Fischer C.N. Zero-cost range splitting. SIGPLAN Not. 1994, 29(6):257-265.
236. Lam M. Software pipelining: an effective scheduling technique for VLIW machines. SIGPLAN Not. 1988, 23(7):318-328.
237. Lamb D.A. Construction of a peephole optimizer. Softw. Pract. Experience 1981, 11(6):639-647.
238. Landi W., Ryder B.G. Pointer-induced aliasing: a problem taxonomy. Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, Orlando, FL 1991, 93-103. ACM, New York.
239. Landskov D., Davidson S., Shriver B., Mallett P.W. Local microcode compaction techniques. ACM Comput. Surv. 1980, 12(3):261-294.
240. Landwehr R., Jansohn H.-S., Goos G. Experience with an automatic code generator generator. SIGPLAN Not. 1982, 17(6):56-66.
241. Larus J.R., Hilfinger P.N. Register allocation in the SPUR Lisp compiler. SIGPLAN Not. 1986, 21(7):255-263.
242. Lavrov S.S. Store economy in closed operator schemes. J. Comput. Math. Math. Phys. 1961, 1(4):687-701. English translation in U.S.S.R. Computational Mathematics and Mathematical Physics 3 (1962) 810--828.
243. V. Lefévre, Multiplication By an Integer Constant, Technical Report 4192, INRIA, Lorraine, France, 2001.
244. Lengauer T., Tarjan R.E. A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1979, 1(1):121-141.
245. Lewis P.M., Stearns R.E. Syntax-directed transduction. J. ACM 1968, 15(3):465-488.
246. Liberatore V., Farach-Colton M., Kremer U. Evaluation of algorithms for local register allocation. Proceedings of the Eighth International Conference on Compiler Construction (CC '99) 1999, 137-152. Springer-Verlag, Heidelberg, Germany.
247. Lieberman H., Hewitt C. A real-time garbage collector based on the lifetimes of objects. Commun. ACM 1983, 26(6):419-429.
248. Liskov B., Atkinson R.R., Bloom T., Moss J.E.B., Schaffert C., Scheifler R., et al. CLU Reference Manual, Lecture Notes in Computer Science 114 1981, Springer-Verlag, Heidelberg, Germany.
249. Lo J.L., Eggers S.J. Improving balanced scheduling with compiler optimizations that increase instruction-level parallelism. SIGPLAN Not. 1995, 30(6):151-162.
250. Lo R., Chow F., Kennedy R., Liu S.-M., Tu P. Register promotion by sparse partial redundancy elimination of loads and stores. SIGPLAN Not. 1998, 33(5):26-37.
251. Lowney P.G., Freudenberger S.M., Karzes T.J., Lichtenstein W.D., Nix R.P., O'Donnell J.S., et al. The multiflow trace scheduling compiler. J. Supercomputing-Special Issue 1993, 7(1-2):51-142.
252. Lowry E.S., Medlock C.W. Object code optimization. Commun. ACM 1969, 12(1):13-22.
253. Lu J., Cooper K.D. Register promotion in C programs. SIGPLAN Not. 1997, 32(5):308-319.
254. Lu J., Shillner R. Clean: removing useless control flow, unpublished manuscript, Department of Computer Science 1994, Rice University, Houston, TX.
255. Lucas P. The structure of formula-translators. ALGOL Bull. 1961, (Suppl. 16):1-27. [Die strukturanalyse von formelübersetzern, Elektronische Rechenanlagen 3 (4) (1961) 159--167.].
256. P.W. Markstein, V. Markstein, F.K. Zadeck, Reassociation and strength reduction. Unpublished book chapter.
257. Markstein V., Cocke J., Markstein P. Optimization of range checking. Proceedings of the 1982 SIGPLAN Symposium on Compiler Construction 1982, 114-119. ACM, New York, Also published as SIGPLAN Not. 17 (6) (1982).
258. Massalin H. Superoptimizer: a look at the smallest program. SIGPLAN Not. 1987, 22(10):122-126.
259. McCarthy J. Lisp: notes on its past and future. Proceedings of the 1980 ACM Conference on Lisp and Functional Programming 1980, v-viii. Stanford University, Stanford, CA.
260. McKeeman W.M. Peephole optimization. Commun. ACM 1965, 8(7):443-444.
261. McKinley K.S., Carr S., Tseng C.-W. Improving data locality with loop transformations. ACM Trans. Program. Lang. Syst. 1996, 18(4):424-453.
262. McNaughton R., Yamada H. Regular expressions and state graphs for automata. IRE Trans. Electron. Comput. 1960, EC-9(1):39-47.
263. Metzger R., Stroud S. Interprocedural constant propagation: an empirical study. ACM Lett. Program. Lang. Syst. (loplas) 1993, 2(1-4):213-232.
264. T.C. Miller, Tentative Compilation: A Design for an APL Compiler, PhD thesis, Yale University, New Haven, CT, 1978. See also the paper of the same title in the Proceedings of the International Conference on APL: Part 1, New York, 1979, pp. 88--95.
265. Milner R., Tofte M., Harper R., MacQueen D. The Definition of Standard ML-Revised 1997, MIT Press, Cambridge, MA.
266. J.S. Moore, The Interlisp Virtual Machine Specification, Technical Report CSL 76-5, Xerox Palo Alto Research Center, Palo Alto, CA, 1976.
267. Morel E., Renvoise C. Global optimization by suppression of partial redundancies. Commun. ACM 1979, 22(2):96-103.
268. Morgan R. Building an Optimizing Compiler 1998, Digital Press (an imprint of Butterworth--Heineman), Boston, MA.
269. R. Motwani, K.V. Palem, V. Sarkar, S. Reyen, Combining Register Allocation and Instruction Scheduling, Technical Report 698, Courant Institute of Mathematical Sciences, New York University, New York, 1995.
270. Muchnick S.S. Advanced Compiler Design & Implementation 1997, Morgan Kaufmann, San Francisco, CA.
271. Mueller F., Whalley D.B. Avoiding unconditional jumps by code replication. SIGPLAN Not. 1992, 27(7):322-330.
272. Murtagh T.P. An improved storage management scheme for block structured languages. ACM Trans. Program. Lang. Syst. 1991, 13(3):372-398.
273. Backus J.W., Bauer F.L., Green J., Katz C., McCarthy J., et al. Revised report on the algorithmic language Algol 60. Commun. ACM 1963, 6(1):1-17.
274. Ngassam E.K., Watson B.W., Kourie D.G. Hardcoding finite state automata processing. Proceedings of SAICSIT 2003 Annual Conference of the South African Insitute of Computer Scientists and Information Technologists 2003, 111-121. Republic of South Africa.
275. Nickerson B.R. Graph coloring register allocation for processors with multi-register operands. SIGPLAN Not. 1990, 25(6):40-52.
276. Norris C., Pollock L.L. A scheduler-sensitive global register allocator. Proceedings of Supercomputing '93, Portland, OR 1993, 804-813. ACM, New York.
277. Norris C., Pollock L.L. An experimental study of several cooperative register allocation and instruction scheduling strategies. Proceedings of the Twenty-Eighth Annual International Symposium on Microarchitecture (MICRO-28), Ann Arbor, MI 1995, 169-179. IEEE Computer Society Press, Los Alamitos, CA.
278. Nygaard K., Dahl O.-J. The development of the SIMULA languages. SIGPLAN Not. 1978, 13(8):245-272.
279. Paleczny M., Vick C.A., Click C. The Java HotSpot™ Server Compiler. Proceedings of the First Java™ Virtual Machine Research and Technology Symposium (JVM '01), Monterey, CA 2001, 1-12. The USENIX Association, Berkeley, CA.
280. Park J., Moon S.-M. Optimistic register coalescing. Proceedings of the 1998 International Conference on Parallel Architecture and Compilation Techniques (PACT) 1998, 196-204. IEEE Computer Society, Washington, DC.
281. Pelegrí-Llopart E., Graham S.L. Optimal code generation for expression trees: an application of BURS theory. Proceedings of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, San Diego, CA 1988, 294-308. ACM, New York.
282. Pennello T.J. Very fast LR parsing. SIGPLAN Not. 1986, 21(7):145-151.
283. Pereira F.M.Q., Palsberg J. Register allocation via coloring of chordal graphs. Proceedings of the Asian Symposium on Programming Languages and Systems (APLAS '05) 2005, 315-329. Springer-Verlag, Berlin, Heidelberg.
284. Pettis K., Hansen R.C. Profile guided code positioning. SIGPLAN Not. 1990, 25(6):16-27.
285. Pinter S.S. Register allocation with instruction scheduling: a new approach. SIGPLAN Not. 1993, 28(6):248-257.
286. Plotkin G.D. Call-by-name, call-by-value and the λ-calculus. Theor. Comput. Sci. 1975, 1(2):125-159.
287. Proebsting T.A. Simple and efficient BURS table generation. SIGPLAN Not. 1992, 27(7):331-340.
288. Proebsting T.A. Optimizing an ANSI C interpreter with superoperators. Proceedings of the Twenty-Second ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, CA 1995, 322-332. ACM, New York.
289. Proebsting T.A., Fischer C.N. Linear-time, optimal code scheduling for delayed-load architectures. SIGPLAN Not. 1991, 26(6):256-267.
290. Prosser R.T. Applications of boolean matrices to the analysis of flow diagrams. Proceedings of the Eastern Joint Computer Conference 1959, 133-138. Institute of Radio Engineers, New York.
291. Purdom P.W., Moore E.F. Immediate predominators in a directed graph [H]. Commun. ACM 1972, 15(8):777-778.
292. Rabin M.O., Scott D. Finite automata and their decision problems. IBM J. Res. Dev. 1959, 3(2):114-125.
293. Randell B., Russell L.J. Algol 60 Implementation: The Translation and Use of Algol 60 Programs on a Computer 1964, Academic Press, London.
294. Rau B.R., Glaeser C.D. Some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing. Proceedings of the Fourteenth Annual Workshop on Microprogramming (MICRO-14), Chatham, MA 1981, 183-198. IEEE Press, Piscataway, NJ.
295. Reif J.H. Symbolic programming analysis in almost linear time. Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, Tucson, AZ 1978, 76-83. ACM, New York.
296. Reif J.H., Lewis H.R. Symbolic evaluation and the global value graph. Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, CA 1977, 104-118. ACM, New York.
297. Reps T. Optimal-time incremental semantic analysis for syntax-directed editors. Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, Albuquerque, NM 1982, 169-176. ACM, New York.
298. Reps T., Alpern B. Interactive proof checking. Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, Salt Lake City, UT 1984, 36-45. ACM, New York.
299. Reps T., Teitelbaum T. The Synthesizer Generator: A System for Constructing Language-Based Editors 1988, Springer-Verlag, New York.
300. Richards M. The portability of the BCPL compiler. Softw. Pract. Experience 1971, 1(2):135-146.
301. Richardson S., Ganapathi M. Interprocedural analysis versus procedure integration. Inf. Process. Lett. 1989, 32(3):137-142.
302. Rivest R. On self-organizing sequential search heuristics. Commun. ACM 1976, 19(2):63-67.
303. Rogers A., Li K. Software support for speculative loads. SIGPLAN Not. 1992, 27(9):38-50.
304. Rosen B.K., Wegman M.N., Zadeck F.K. Global value numbers and redundant computations. Proceedings of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, San Diego, CA 1988, 12-27. ACM, New York.
305. Rosenkrantz D.J., Stearns R.E. Properties of deterministic top-down grammars. Inf. Control 1970, 17(3):226-256.
306. Sastry A.V.S., Ju R.D.C. A new algorithm for scalar register promotion based on SSA form. SIGPLAN Not. 1998, 33(5):15-25.
307. Scarborough R.G., Kolsky H.G. Improved optimization of FORTRAN object programs. IBM J. Res. Dev. 1980, 24(6):660-676.
308. P.J. Schielke, Stochastic Instruction Scheduling, PhD thesis, Department of Computer Science, Rice University, Houston, TX, 2000. Technical Report TR00-370, Computer Science Department, Rice University, 2000.
309. Schorr H., Waite W.M. An efficient machine-independent procedure for garbage collection in various list structures. Commun. ACM 1967, 10(8):501-506.
310. J.T. Schwartz, On Programming: An Interim Report on the SETL Project, Installment II: The SETL Language and Examples of Its Use, Technical Report, Courant Institute of Mathematical Sciences, New York University, New York, 1973.
311. Sethi R., Ullman J.D. The generation of optimal code for arithmetic expressions. J. ACM 1970, 17(4):715-728.
312. Shapiro M., Horwitz S. Fast and accurate flow-insensitive points-to analysis. Proceedings of the Twenty-Fourth ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Paris, France 1997, 1-14. ACM, New York.
313. R.M. Shapiro, H. Saint, The Representation of Algorithms, Technical Report CA-7002-1432, Massachusetts Computer Associates, Wakefield, MA, 1970.
314. Sheridan P.B. The arithmetic translator-compiler of the IBM FORTRAN automatic coding system. Commun. ACM 1959, 2(2):9-21.
315. Sipser M. Introduction to the Theory of Computation 1996, PWS Publishing Co., Boston, MA.
316. R.L. Sites, D.R. Perkins, Universal P-code Definition, Version 0.2, Technical Report 78-CS-C29, Department of Applied Physics and Information Sciences, University of California at San Diego, San Diego, CA, 1979.
317. Sleator D.D., Tarjan R.E. Amortized efficiency of list update and paging rules. Commun. ACM 1985, 28(2):202-208.
318. Smith M.D., Horowitz M., Lam M.S. Efficient superscalar performance through boosting. SIGPLAN Not. 1992, 27(9):248-259.
319. Smith M.D., Ramsey N., Holloway G. A generalized algorithm for graph-coloring register allocation. Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation 2004, 277-288. ACM, New York, Also appeared as SIGPLAN Not. 39 (6).
320. Smotherman M., Krishnamurthy S.M., Aravind P.S., Hunnicutt D. Efficient DAG construction and heuristic calculation for instruction scheduling. Proceedings of the Twenty-Fourth Annual IEEE/ACM International Symposium on Microarchitecture (MICRO-24), Albuquerque, NM 1991, 93-102. ACM, New York.
321. Sorkin A. Some comments on "A solution to a problem with Morel and Renvoise's 'Global optimization by suppression of partial redundancies,' ". ACM Trans. Program. Lang. Syst. 1989, 11(4):666-668.
322. Spillman T.C. Exposing side-effects in a PL/1 optimizing compiler. Proceedings of IFIP Congress '71, Information Processing 71, North-Holland 1972, 376-381. Amsterdam, Netherlands. C.V. Freiman, J.E. Griffith, J.L. Rosenfeld (Eds.).
323. G.L. Steele Jr., Rabbit: A Compiler for Scheme, Technical Report AI-TR-474, MIT Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 1978.
324. Steele G.L., Gabriel R.P. History of Programming Languages-II, "The Evolution of LISP," 1996, ACM Press, New York, pp. 233--330.
325. Stephenson M., Amarasinghe S. Predicting unroll factors using supervised classification. CGO '05: Proceedings of the International Symposium on Code Generation and Optimization 2005, 123-134. IEEE Computer Society, Washington, DC.
326. Sweany P.H., Beaty S.J. Post-compaction register assignment in a retargetable compiler. Proceedings of the Twenty-Third Annual International Symposium and Workshop on Microprogramming and Microarchitecture (MICRO-23), Orlando, FL 1990, 107-116. IEEE Computer Society Press, Los Alamitos, CA.
327. Sweany P.H., Beaty S.J. Dominator-path scheduling: a global scheduling method. ACM SIGMICRO Newsl. 1992, 23(1-2):260-263.
328. th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR '05), Lecture Notes in Compuer Science 3835 2005, 371-386. Springer-Verlag, Berlin, Heidelberg.
329. Tarjan R.E. Testing flow graph reducibility. J. Comput. Syst. Sci. 1974, 9(3):355-365.
330. Tarjan R.E. Fast algorithms for solving path problems. J. ACM 1981, 28(3):594-614.
331. Tarjan R.E. A unified approach to path problems. J. ACM 1981, 28(3):577-593.
332. Tarjan R.E., Reif J.H. Symbolic program analysis in almost-linear time. SIAM J. Comput. 1982, 11(1):81-93.
333. Thompson K. Programming techniques: regular expression search algorithm. Commun. ACM 1968, 11(6):419-422.
334. S.W.K. Tjiang, Twig Reference Manual, Technical Report CSTR 120, Computing Sciences, AT&T Bell Laboratories, Murray Hill, NJ, 1986.
335. L. Torczon, Compilation Dependences in an Ambitious Optimizing Compiler, PhD thesis, Department of Computer Science, Rice University, Houston, TX, 1985.
336. Ullman J.D. Fast algorithms for the elimination of common subexpressions. Acta Informatica 1973, 2(3):191-213.
337. Ungar D. Generation scavenging: a non-disruptive high performance storage reclamation algorithm. ACM SIGSOFT Software Eng. Notes 1984, 9(3):157-167.
338. Vyssotsky V., Wegner P. A Graph Theoretical FORTRAN Source Language Analyzer, Manuscript 1963, AT&T Bell Laboratories, Murray Hill, NJ.
339. Waite W., Goos G. Compiler Construction 1984, Springer-Verlag, New York.
340. Waite W.M. The cost of lexical analysis. Softw. Pract. Experience 1986, 16(5):473-488.
341. Wall D.W. Global register allocation at link time. Proceedings of the 1986 ACM SIGPLAN Symposium on Compiler Construction 1986, 264-275. ACM, New York.
342. S.K. Warren, The Coroutine Model of Attribute Grammar Evaluation, PhD thesis, Department of Mathematical Sciences, Rice University, Houston, TX, 1976.
343. Watson B. A fast new semi-incremental algorithm for the construction of minimal acyclic DFAs. Third International Workshop on Implementing Automata, WIA '98, vol. 1660 of LNCS 1999, 121-132. Springer-Verlag, Berlin, Heidelberg.
344. B.W. Watson, A taxonomy of deterministic finite automata minimization algorithms, Computing Science Report 93/44, Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven, The Netherlands, 1993.
345. Watson B.W. A fast and simple algorithm for constructing minimal acyclic deterministic finite automata. J. Univers. Comput. Sci. 2002, 8(2):363-367.
346. Wegman M.N., Zadeck F.K. Constant propagation with conditional branches. Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, New Orleans, LA 1985, 291-299. ACM, New York.
347. Wegman M.N., Zadeck F.K. Constant propagation with conditional branches. ACM Trans. Program. Lang. Syst. 1991, 13(2):181-210.
348. Weihl W.E. Interprocedural data flow analysis in the presence of pointers, procedure variables, and label variables. Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, Las Vegas, NV 1980, 83-94. ACM, New York.
349. Wiedmann C. Steps toward an APL compiler. ACM SIGAPL APL Quote Quad 1979, 9(4):321-328.
350. Wilson P.R. Uniprocessor garbage collection techniques. Proceedings of the International Workshop on Memory Management, Lecture Notes in Computer Science 637 1992, 1-42. Springer-Verlag, Heidelberg, Germany.
351. Wilson R.P., Lam M.S. Efficient context-sensitive pointer analysis for C programs. SIGPLAN Not. 1995, 30(6):1-12.
352. Wolfe M. High Performance Compilers for Parallel Computing 1996, Addison Wesley, Redwood City, CA.
353. Wood D. The theory of left-factored languages, part 1. Comput. J. 1969, 12(4):349-356.
354. Wood D. The theory of left-factored languages, part 2. Comput. J. 1970, 13(1):55-62.
355. Wood D. A further note on top-down deterministic languages. Comput. J. 1971, 14(4):396-403.
356. Wulf W., Johnsson R.K., Weinstock C.B., Hobbs S.O., Geschke C.M. The Design of an Optimizing Compiler, Programming Languages Series 1975, Elsevier, New York.
357. Young C., Johnson D.S., Karger D.R., Smith M.D. Near-optimal intraprocedural branch alignment. SIGPLAN Not. 1997, 32(5):183-193.
358. 3. Inf. Control 1967, 10(2):189-208.
359. Zadeck F.K. Incremental data flow analysis in a structured program editor. SIGPLAN Not. 1984, 19(6):132-143.