Simple generation of static single-assignment form

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1781, Issue , 2000, Pages 110-125

  Aycock, John ^a   Horspool, Nigel ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FLOW GRAPHS;

COMPILER OPTIMIZATIONS; CONTROL FLOW GRAPHS; CORRECT SOLUTION; DATA-FLOW INFORMATION; MINIMAL SOLUTIONS; NON-REDUCIBLE; STATIC SINGLE ASSIGNMENT FORM; STATIC SINGLE ASSIGNMENTS;

PROGRAM COMPILERS;

EID: 84956985606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46423-9_8     Document Type: Conference Paper

References (27)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Code Optimization and Finite Church-Rosser Systems. In Design and Optimization of Compilers, R. Rustin, ed. Prentice Hall, 1971, pp. 89-105.
2. B. Alpern, M. N. Wegman, and F. K. Zadeck. Detecting Equality of Variables in Programs. Proceedings of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988, pp. 1-11.
3. A.W. Appel. SSA is Functional Programming. ACM SIGPLAN33, 4 (April 1998), pp. 17-20.
4. A. W. Appel. Modern Compiler Implementation in Java. Cambridge, 1998.
5. M. M. Brandis and H. Mössenböck. Single-Pass Generation of Static Single-Assignment Form for Structured Languages. ACM TOPLAS16, 6 (November 1994), pp. 1684-1698.
6. P. Briggs, T. Harvey, and T. Simpson. Static Single Assignment Construction, Version 1.0. Unpublished document, 1995.
7. J.-D. Choi, R. Cytron, and J. Ferrante. Automatic Construction of Sparse Data Flow Evaluation Graphs. ACM POPL’91, pp. 55-66.
8. F. Chow, S. Chan, R. Kennedy, S.-M. Liu, R. Lo, and P. Tu. A New Algorithm for Partial Redundancy Elimination based on SSA Form. ACM PLDI’97, pp. 273-286.
9. R. K. Cytron and J. Ferrante. Efficiently Computing φ-Nodes On-The-Fly. ACM TOPLAS17, 3 (May 1995), pp. 487-506.
10. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently Computing Static Single-Assignment Form and the Control Dependence Graph. ACM TOPLAS13, 4 (October 1991), pp. 451-490.
11. R. Cytron, A. Lowry, K. Zadeck. Code Motion of Control Structures in High-Level Languages. Proceedings of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, 1986, pp. 70-85.
12. M. J. Fischer. Efficiency of Equivalence Algorithms. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds. Plenum Press, 1972.
13. M. S. Hecht. Flow Analysis of Computer Programs, North-Holland, 1977.
14. M. S. Hecht and J. D. Ullman. Flow Graph Reducibility. SIAM Journal of Computing1, 2 (June 1972), pp.8-202.
15. J. E. Hopcroft and J. D. Ullman. Set Merging Algorithms. SIAM Journal of Computing2, 4 (December 1973), pp. 294-300.
16. R. Johnson, D. Pearson, and K. Pingali. The Program Structure Tree: Computing Control Regions in Linear Time. ACM PLDI’94, pp. 171-185.
17. D. E. Knuth. An Empirical Study of FORTRAN Programs. Software — Practice and Experience1, 1971, pp. 105-133.
18. D. E. Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms, Addison Wesley, 1997.
19. D. B. Loveman and R. A. Faneuf. Program Optimization — Theory and Practice. Conference on Programming Languages and Compilers for Parallel and Vector Machines, 1975, pp. 97-102.
20. R. Morgan. Building an Optimizing Compiler, Digital Press, 1998.
21. S. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann, 1997.
22. B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global Value Numbers and Redundant Computations. Proceedings of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988, pp. 12-27.
23. R. M. Shapiro and H. Saint. The Representation of Algorithms. Rome Air Development Center TR-69-313, Volume 2, September 1969.
24. V. C. Sreedhar and G. R. Gao. A Linear Time Algorithm for Placing φ-Nodes. Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Programming Languages, 1995, pp. 62-73.
25. R. E. Tarjan. Efficiency of a Good But Not Linear Set Union Algorithm. JACM22, 2 (April 1975), pp. 215-225.
26. J. D. Ullman. Fast Algorithms for the Elimination of Common Subexpressions. Acta Informatica2, 1973, pp. 191-213.
27. M. N. Wegman and F. K. Zadeck. Constant Propagation with Conditional Branches. ACM TOPLAS13, 2 (April 1991), pp.1-210.