Efficiently Computing Static Single Assignment form and the Control Dependence Graph

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 13, Issue 4, 1991, Pages 451-490

  Cytron, Ron ^a   Ferrante, Jeanne ^a   Rosen, Barry K ^a   Wegman, Mark N ^a   Zadeck, F Kenneth ^b  

^a IBM RESEARCH   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

control dependence; control flow graph; def use chain; dominator; optimizing compilers

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER SOFTWARE - OPTIMIZATION; DATA PROCESSING - DATA STRUCTURES; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

CONTROL DEPENDENCE GRAPHS; CONTROL FLOW GRAPHS; PROGRAM OPTIMIZATION; STATIC SINGLE ASSIGNMENT FORM;

COMPUTER OPERATING SYSTEMS;

EID: 0026243790     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/115372.115320     Document Type: Article

References (52)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass, 1986.
2. ALLEN, F. E., BURKE, M., CHARLES, P., CYTRON, R., AND FERRANTE, J An overview of the PTRAN analysis system for multiprocessing. J. Parallel Distrib. Comput. 5, (Oct. 1988), 617-640.
3. ALLEN, J. R Dependence analysis for subscripted variables and its application to program transformations. Ph.D. thesis, Department of Computer Science, Rice Univ., Houston, Tex., Apr. 1983.
4. ALLEN, J R, AND JOHNSON, S Compiling C for vectorization, parallelization and inline expansion. In Proceedings of the SIGPLAN ‘88 Symposium on Compiler Construction. SIGPLAN Not. (ACM) 23, 7 (June 1988), 241-249
5. ALPERN, B, WEGMAN, M. N., AND ZADECK, F. K. Detecting equality of values m programs In Conference Record of the 15th ACM Symposium on Principles of Programming Languages (Jan. 1988), ACM, New York, pp. 1-11.
6. BALLANCE, R. A., MACCABE, A. B., AND OTTENSTEIN, K. J. The program dependence web: A representation supporting control-, data-, and demand driven interpretation of languages. In Proceedings of the SIGPLAN 90 Symposium on Compiler Construction. SIGPLAN Not. (ACM) 25, 6 (June 1990), 257-271.
7. BANNING, J. B. An efficient way to find the side effects of procedure calls and the aliases of variables. In Conference Record of the 6th ACM Symposium on Principles of Programming Languages (Jan. 1979) ACM, New York, pp. 29-41
8. BARTH, J. M. An interprocedural data flow analysis algorithm. In Conference Record of the 4th ACM Symposium on Principles of Programming Languages (Jan. 1977) ACM, New York: pp. 119-131.
9. BURKE, M. An interval-based approach to exhaustive and incremental interprocedural data flow analysis. ACM Trans. Program Lang. Syst. 12, 3 (July 1990), 341-395.
10. BURKE, M., AND CYTRON, R. Interprocedural dependence analysis and parallelization. In Proceedings of the SIGPLAN 86 Symposium on Compiler Construction SIGPLAN Not (ACM) 21, 7 (June 1986), 162-175.
11. CARTWRIGHT, R., AND FELLEISEN, ?. The semantics of program dependence. In Proceedings of the SIGPLAN 89 Symposium on Compiler Construction. SIGPLAN Not. (ACM) 24, 7 (July 1989), 13-27.
12. CHAITIN, G. J. Register allocation and spilling via graph coloring. In Proceedings of the SIGPLAN 82 Symposium on Compiler Construction. SIGPLAN Not. (ACM) 17, 6 (June 1982), 98-105.
13. CHAITIN, G. J., AUSLÄNDER, M. A., CHANDRA, A. K., COCKE, J., HOPKINS, ?. E., AND MARKSTEIN, P. W. Register allocation via coloring. Comput. Lang. 6 (1981), 47-57.
14. CHASE, D. R. Safety considerations for storage allocation optimizations. In Proceedings of the SIGPLAN 88 Symposium on Compiler Construction. SIGPLAN Not. (ACM) 23, 7 (June 1988), 1-10.
15. CHASE, D. R., WEGMAN, M. AND ZADECK, F. K. Analysis of pointers and structures. In Proceedings of the SIGPLAN 90 Symposium on Compiler Construction. SIGPLAN Not. (ACM) 25, (June 1990), 296-310.
16. CHOI, J., CYTRON, R., AND FERRANTE, J. Automatic construction of sparse data flow evaluation graphs. In Conference Record of the 18th ACM Symposium on Principles of Programming Languages (Jan. 1991). ACM, New York, pp. 55-66.
17. CHOW, F. C. A portable machine-independent global optimizer-Design and measurements. Ph.D. thesis and Tech. Rep. 83-254, Computer Systems Laboratory, Stanford Univ., Stanford, Calif., Dec. 1983.
18. CHOW, F. C., AND HENNESSY, J. L. The priority-based coloring approach to register allocation. ACM Trans. Program. Lang. Syst. 12, 4 (Oct. 1990), 501-536.
19. COOPER, K. D. Interprocedural data flow analysis in a programming environment. Ph.D. thesis, Dept. of Mathematical Sciences, Rice Univ., Houston, Tex., 1983.
20. CYTRON, R., AND FERRANTE, J. An improved control dependence algorithm. Tech. Rep. RC 13291, IBM Corp., Armonk, N.Y., 1987.
21. CYTRON, R., AND FERRANTE, J. What's in a name? In Proceedings of the 1987 International Conference on Parallel Processing (Aug. 1987), pp. 19-27.
22. CYTRON, R., LOWRY, A., AND ZADECK, F. K. Code motion of control structures in high-level languages. In Conference Record of the 13th ACM Symposium on Principles of Programming Languages (Jan. 1986). ACM, New York, pp. 70-85.
23. DENNIS, J. B. First version of a data flow procedure language. Tech. Rep. Comput. Struc. Group Memo 93 (MAC Tech. Memo 61), MIT, Cambridge, Mass., May 1975.
24. FERRANTE, J., OTTENSTEIN, K. J., AND WARREN, J. D. The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst. 9, 3 (July 1987), 319-349.
25. GIEGERICH, R. A formal framework for the derivation of machine-specific optimizers. ACM Trans. Program. Lang. Syst. 5, 3 (July 1983), 478-498.
26. HAREL, D. A linear time algorithm for finding dominators in flow graphs and related problems. In Proceedings of the 17th ACM Symposium on Theory of Computing (May 1985). ACM, New York, pp. 185-194.
27. HORWITZ, S., PFEIFFER, P., AND REPS, T. Dependence analysis for pointer variables. In Proceedings of the SIGPLAN 89 Symposium on Compiler Construction. SIGPLAN Not. (ACM) 24, 7 (June 1989).
28. HORWITZ, S., PRINS, J., AND REPS, T. Integrating non-interfering versions of programs. ACM Trans. Program. Lang. Syst. 11, 3 (July 1989), 345-387.
29. JONES, N. D., AND MUCHNICK, S. S. Flow analysis and optimization of LISP-like structures. In Program Flow Analysis, S. S. Muchnick and N. D. Jones, Eds. Prentice-Hall, Englewood Cliffs, N.J., 1981, chap. 4, pp. 102-131.
30. KENNEDY, K. W. Global dead computation elimination. Tech. Rep. SETL Newsl. 111, Courant Institute of Mathematical Sciences, New York Univ., New York, N.Y., Aug. 1973.
31. KENNEDY, K. W. A survey of data flow analysis techniques. In Program Flow Analysis, S. S. Muchnick and N. D. Jones, Eds. Prentice-Hall, Englewood Cliffs, N.J., 1981.
32. KUCK, D. J. The Structure of Computers and Computations. Wiley, New York, 1978.
33. LARUS, J. R. Restructuring symbolic programs for concurrent execution on multiprocessors. Tech. Rep. UCB/CSD 89/502, Computer Science Dept., Univ. of California at Berkeley, Berkeley, Calif., May 1989.
34. LARUS, J R., AND HILFINGER, P. N Detecting conflicts between structure accesses In Proceedings of the ACM SIGPLAN 88 Symposium on Compiler Construction. SIGPLAN Not. 23, 7 (July 1988), 21-34.
35. LENGAUER, T., AND TARJAN, R. E. A fast algorithm for finding dominatore in a flowgraph. ACM Trans. Program. Lang. Syst. 1, 1 (July 1979), 121-141
36. MUCHNICK, S. S., AND JONES, N. D, EDS Program Flow Analysis. Prentice-Hall, Englewood Cliffs, N.J., 1981
37. MYERS, E. W. A precise interprocedural data flow algorithm. In Conference Record of the 8th ACM Symposium on Principles of Programming Languages (Jan. 1981). ACM, New York, pp. 219-230.
38. OTTENSTEIN, K. J. Data-flow graphs as an intermediate form. Ph.D. thesis, Dept. of Computer Science, Purdue Univ., W. Lafayette, Ind., Aug. 1978.
39. POINTER, L. Perfect report: 1. Tech. Rep CSRD 896, Center for Supercomputing Research and Development, Univ. of Illinois at Urbana-Champaign, Urbana, 111., July 1989
40. REIF, J. H., AND LEWIS, H. R. Efficient symbolic analysis of programs. J. Comput. Syst. Sci. 32, 3 (June 1986), 280-313.
41. REIF, J. H., AND TARJAN, R. E Symbolic program analysis in almost linear time. SIAM J. Comput. 11, 1 (Feb. 1982), 81-93
42. ROSEN, B. K. Data flow analysis for procedural languages J. ACM 26, 2 (Apr. 1979), 322-344.
43. ROSEN, B. K, WEGMAN, M. N., AND ZADECK, F. K. Global value numbers and redundant computations. In Conference Record of the 15th ACM Symposium on Principles of Programming Languages, (Jan. 1988). ACM, New York, pp. 12-27.
44. RUGGIERI, C., AND MURTAGH, T. P. Lifetime analysis of dynamically allocated objects. In Conference Record of the 15th ACM Symposium on Principles of Programming Languages (Jan. 1988). ACM, New York, pp. 285-293.
45. SHAPIRO, R. M, AND SAINT, H The representation of algorithms. Tech. Rep. CA-7002-1432, Massachusetts Computer Associates, Feb. 1970.
46. SMITH, B. T., BOYLE, J. M., DONGARRA, J. J., GARBOW, B. S., IKEBE, Y., KLEMA, V. C., AND MOLER, C B. Matrix Eigensystem Routines - Eispack Guide. Springer-Verlag, New York, 1976.
47. TARJAN, R. E. Finding dominators in directed graphs. SIAM J. Comput 3, 1 (1974), 62-89.
48. WEGBREIT, B Property extraction in well-founded property sets. IEEE Trans. Softw. Eng. SE-1, 3 (Sept. 1975), 270-285.
49. WEGMAN, M. N, AND ZADECK, F. K. Constant propagation with conditional branches. In Conference Record of the 12th ACM Symposium on Principles of Programming Languages (Jan.). ACM, New York, pp. 291-299.
50. WEGMAN, M. N., AND ZADECK, F. K. Constant propagation with conditional branches. ACM Trans. Program. Lang. Syst. To be published.
51. WOLFE, M. J. Optimizing supercompilers for supercomputers. Ph.D. thesis, Dept of Computer Science, Univ. of Illinois at Urbana-Champaign, Urbana Ill., 1982
52. YANG, W., HORWITZ, S., AND REPS, T. Detecting program components with equivalent behaviors. Tech Rep. 840. Dept. of Computer Science, Univ. of Wisconsin at Madison, Madison, Apr. 1989