Incremental computation of static single assignment form

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

Volumn 1060, Issue , 1996, Pages 223-237

  Choi, Jong Deok ^a   Sarkar, Vivek ^b   Schonberg, Edith ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSTS; PROGRAM COMPILERS;

INCREMENTAL ALGORITHM; INCREMENTAL COMPUTATION; INTERMEDIATE REPRESENTATIONS; LOOP TRANSFORMATION; PROGRAM TRANSFORMATIONS; STANDARD ALGORITHMS; STATIC SINGLE ASSIGNMENT FORM; STATIC SINGLE ASSIGNMENTS;

OPTIMIZATION;

EID: 84957691833     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61053-7_64     Document Type: Conference Paper

References (21)

1. Frances Allen, Michael Burke, Philippe Charles, Ron Cytron, and Jeanne Ferrante. An overview of the ptran analysis system for multiprocessing. Proceedings of the ACM 1987 International Conference on Supercomputing, 1987. Also published in The Journal of Parallel and Distributed Computing, Oct., 1988, 5(5) pages 617–640.
2. Frances Allen and John Cocke. A catalogue of optimizing transformation. Design and Optimization of Compilers, pages 1–30, 1972.
3. Bowen Alpern, Mark N. Wegman, and F. Kenneth Zadeck. Detecting equality of variables in programs. Fifteenth ACM Principles of Programming Languages Symposium, pages 1–11, January 1988. San Diego, CA.
4. M.G. Burke and B.G. Ryder. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 16(7):723–728, July 1990.
5. Michael Burke. An interval-based approach to exhaustive and incremental interprocedural data-flow analysis. ACM Transactions on Programming Languages and Systems, 12(3):341–395, July 1990.
6. Jong-Deok Choi, Ron Cytron, and Jeanne Ferrante. Automatic construction of sparse data flow evaluation graphs. Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, January 1991.
7. Ron Cytron. private communication.
8. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, October 1991.
9. Ron Cytron and Reid Gershbein. Efficiently accommodating may-alias information in ssa form. Proceedings of the ACM Conference on Programming Language Design and Implementation, 1993.
10. Robert Giegerich, Ulrich Moencke, and Reinhard Wilhelm. Invariance of approximative semantics with respect to program transformation. 11th GI Annual Conference, Informatik-Fachberichte 50, pages 1–10, October 1981.
11. William G. Griswold and David Notkin. Automated Assistance for Program Restructuring. ACM Transactions on Software Engineering and Methodology, 2(3):228–269, July 1993.
12. T. J. Marlowe and B. Ryder. An efficient hybrid algorithm for incremental data flow analysis. ACM SIGPLAN Symp. on Principles of Programming Language, pages 184–196, January 1990.
13. Thomas J. Marlowe. Data Flow Analysis and Incremental Iteration. PhD thesis, Rutgers University, October 1989.
14. David A. Padua and Michael J. Wolfe. Advanced compiler optimizations for supercomputers. Communications of the ACM, 29(12):1184–1201, December 1986.
15. Barbara G. Ryder and Martin D. Carroll. Incrementally updating the dominator tree of a rooted diagraph. Technical report, Rutgers U., December 1986. Center for Computer Aids for Industrial Productivity Technical Report CAIP-TR-029.
16. Vivek Sarkar. The ptran parallel programming system. Parallel Functional Programming Languages and Compilers, pages 309–391, 1991.
17. Vivek Sarkar and Radhika Thekkath. A general framework for iteration-reordering loop transformations. Proceedings of the ACM SIGPLAN’92 Conference on Programming Language Design and Implementation, pages 175–187, June 1992.
18. Vugranam C. Sreedhar and Guang R. Gao. A linear time algorithm for placing ɸ-nodes. In 22nd Annual ACM SIGACT-SIGPLAN Symposium on the Principles of Programming Languages, pages 62–73, January 1995.
19. Mark Wegman and Ken Zadeck. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, pages 181–210, April 1991.
20. Michael J. Wolfe. Optimizing Supercompilers for Supercomputers. Pitman, London and The MIT Press, Cambridge, Massachusetts, 1989.
21. Wuu Yang, Susan Horwitz, and Thomas Reps. Detecting program components with equivalent behaviors. Technical report, University of Wisconsin, Madison, April 1989. Computer Sciences Technical Report Number 840.