Cliff Click
- 1.A. Aho, R. Sethi, and J. Ullman. Compilers- Principles, Techniques, and Tools. Addison- Wesley, 1985. Google Scholar
Digital Library
- 2.B. Alpern, M. N. Wegman, and F. K. Zadeck. Detecting equality of variables in programs. In Conference Record of the Fifteenth A CM Symposium on the Principles of Programming Languages, 1988. Google ScholarDigital Library
- 3.R.A. Ballance, A. B. Maccabe, and K. J. Ottenstein. The program dependence web: A representation supporting control-, data- and demanddriven interpretation of imperative languages. In Proceedings of the SIGPLAN '90 Cot~ference on Programming Languages Design and Implementation, June 1990. Google ScholarDigital Library
- 4.P. Briggs, Register Allocation via Graph Coloring. Ph.D. thesis, Rice University, 1992. Google ScholarDigital Library
- 5.P. Briggs. The Massively Scalar Compiler Project. Unpublished report. Preliminary version available via ftp://cs.rice, edu/public/preston/optimizer/ shared.ps. Rice University, July 1994.Google Scholar
- 6.P. Briggs and K. Cooper. Effective partial redundancy elimination. In Proceedings of the SIGPLAN '94 Conference on Programming Languages Design and Implementation, June 1994. Google ScholarDigital Library
- 7.P. Briggs and T. Harvey. Iloc '93. Technical report CRPC-TR93323, Rice University, 1993.Google Scholar
- 8.R. Cartwright and M. Felleisen. The semantics of program dependence. In Proceedings of the SIGPLAN '89 Conference on Programming Languages Design and Implementation, June 1989. Google ScholarDigital Library
- 9.G.J. Chaitin. Register allocation and spilling via graph coloring. In Proceedings of the SIGPLAN '82 Symposium on Compiler Construction, June 1982. Google ScholarDigital Library
- 10.C. Click, Combining Analyses, Combining Optimizations. Ph.D. thesis, Rice University, 1995. Google ScholarDigital Library
- 11.J. Cocke and J. T. Schwartz. Programming languages and their compilers. Courant institute of Mathematical Sciences, New York University, April 1970. Google ScholarDigital Library
- 12.R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In Conference Record of the Sixteenth A CM Symposium on the Principles of Programming Languages, Jan. 1989. Google ScholarDigital Library
- 13.K.H. Drechsler and M. P. Stadel. A solution to a problem with Morel and Renvoise's "Global optimization by suppression of partial redundancies". A CM Transactions on Programming Languages and Systems, 10(4):635-640, Oct. 1988. Google ScholarDigital Library
- 14.G. E. Forstyhe, M. A. Malcom, and C. B. Moler. Computer Methods for Mathematical Computations. Prentice-Hall, Englewood Cliffs, New Jersey, 1977. Google ScholarDigital Library
- 15.J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. A CM Transactions on Programming Languages and Systems, 9(3):319-349, July, 1987. Google ScholarDigital Library
- 16.J. Knoop, O. Rtithing, and B. Steffen. Partial dead code elimination. In Proceedings of the SIGPLAN '94 Conference on Programming Languages Design and Implementation, June 1994. Google ScholarDigital Library
- 17.T. Lengauer and R. E. Tarjan. A fast algorithm for finding dominators in a flowgraph. A CM Transactions on Programming Languages and Systems, 1(1):121-I41, July, 1979. Google ScholarDigital Library
- 18.E. Morel and C. Renvoise. Global optimization by suppression of partial redundancies. Communications of the ACM, 22(2):96--103, Feb. 1979. Google ScholarDigital Library
- 19.B. K. Rosen., M. N. Wegman, and F. K. Zadeck, Global Value Numbers and Redundant Computations. In Conference Record of the Fifteenth A CM Symposium on the Principles of Programming Languages, Jan. 1988. Google ScholarDigital Library
- 20.T. Simpson, Global Value Numbering. Unpublished report. Available from ftp://cs.rice.edu/ public/preston/optimizer/gval.ps. Rice University, 1994.Google Scholar
- 21.R. E. Tarjan. Testing flow graph reducibility. Journal of Computer and System Sciences, 9:355- 365, 1974.Google ScholarDigital Library
- 22.C. Vick, SSA-Based Reduction of Operator Strength. Masters thesis, Rice University, pages 11-15, 1994.Google Scholar
- 23.D. Weise, R. Crew, M. Ernst, and B. Steensgaard. Value dependence graphs: Representation without taxation. In Proceedings of the 21st A CM SIGPLAN Symposium on the Principles of Programming Languages, 1994. Google ScholarDigital Library
- 24.M. N. Wegman and F. K. Zadeck. Constant propagation with conditional branches. A CM Transactions on Programming Languages and Systems, I3(2):181-210, April 1991. Google ScholarDigital Library
Recommendations
Combining analyses, combining optimizations
Modern optimizing compilers use several passes over a program's intermediate representation to generate good code. Many of these optimizations exhibit a phase-ordering problem. Getting the best code may require iterating optimizations until a fixed ...
Global value numbers and redundant computations
POPL '88: Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesA simple graph-based intermediate representation
We present a graph-based intermediate representation (IR) with simple semantics and a low-memory-cost C++ implementation. The IR uses a directed graph with labeled vertices and ordered inputs but unordered outputs. Vertices are labeled with opcodes, ...
Comments