Translating out of static single assignment form

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

Volumn 1694, Issue , 1999, Pages 194-210

  Sreedhar, Vugranam C ^a   Ju, Roy Dz Ching ^a   Gillies, David M ^a   Santhanam, Vatsa ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA FLOW ANALYSIS; FLOCCULATION; FLOW GRAPHS; SEMANTICS;

CONGRUENCE CLASS; CONTROL FLOWS; COPY PLACEMENTS; DATA FLOW; INTERFERENCE GRAPHS; OPERATIONAL SEMANTICS; STATIC SINGLE ASSIGNMENT FORM; STATIC SINGLE ASSIGNMENTS;

STATIC ANALYSIS;

EID: 84957634891     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48294-6_13     Document Type: Conference Paper

References (12)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.
2. P. Briggs, K. Cooper, T. Harvey, and Taylor Simpson. Practical improvements to the construction and destruction of static single assignment form. Software-Practice and Experience, 28(8):859-881, July 1998.
3. G. J. Chaitin, Register allocation and spilling via graph coloring. SIGPLAN Notices 17(6):98-105, June 1982. Proc. of the ACM SIGPLAN ‘82 Symp. on Compiler Construction.
4. F. Chow, S. Chan, R. Kennedy, S. Liu, R. Lo, and P. Tu, “A New Algorithm for Partial Redundancy Elimination based on SSA Form,” Proc. of the 1997 ACM SIGPLAN Conf. on Programming Language Design and Implementation, pp. 273-286, 1997.
5. C. Click. Global Code Motion Global Value Numbering. SIGPLA Notices, 30(6):246-257, June 1995. Proceedings of the ACM SIGPLAN’95 Conference on Programming Language Design and Implementation.
6. R. Cytron and R. Gershbein. Efficient accommodation of may-alias information in SSA form. SIGPLAN Notices, 28(6):36-45, June 1993. Proceedings of the ACM SIGPLAN’93 Conference on Programming Language Design and Implementation
7. 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 Transactions on Programming Languages and Systems, 13(4):451-490, October 1991.
8. A. Leung and L. George. Static Single Assignment Form for Machine Code. SIGPLAN Notices, 34(5):204-214, May 1999. Proceedings of the ACM SIGPLAN’99 Conference on Programming Language Design and Implementation.
9. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers, CA, 1997.
10. P. Pineo and M. L. Soffa. A practical approach to the symbolic debugging of parallelized code. Proceedings of International Conference on Compiler Construction, April 1994.
11. V. C. Sreedhar and G. R. Gao. Computing-nodes in linear time using DJ graphs. Journal of Programming Languages, 13(4):191-213, 1996.
12. M. N. Wegman and F. K. Zadeck. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 13(2):181-210, April 1991.