ACM Home Page
Please provide us with feedback. Feedback
Global value numbers and redundant computations
Full text PdfPdf (1.96 MB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
San Diego, California, United States
Pages: 12 - 27  
Year of Publication: 1988
ISBN:0-89791-252-7
Authors
B. K. Rosen  IBM Thomas J. Watson Research Center, Yorktown Heights, NY
M. N. Wegman  IBM Thomas J. Watson Research Center, Yorktown Heights, NY
F. K. Zadeck  Department of Computer Science, Brown University, Providence, RI
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 27,   Downloads (12 Months): 126,   Citation Count: 87
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/73560.73562
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
F. E. Allen. Program optimization. Ann. Rev. Automatic Programming, 5:239-307, 1969.
3
4
5
6
 
7
8
9
 
10
M. S. Hecht and J. D. Ullman. A simple algorithm for global data flow analysis problems. SlAM J. Computing, 4(4):519-532, December 1975.
11
12
13
14
 
15
J. H. Reif and R. E. Tarjan. Symbolic program analysis in almost linear time. SIAM J. Computing, 11(1):81-93, February 1982.
16
 
17
R. M. Shapiro and H. Saint. The Representation of Algorithms. Technical Report CA-7002-1432, Massachusetts Computer Associates, February 1970.
 
18
R. E. Tarjan. Depth first search and linear graph algorithms. SIAM J. Computing, 1(2):146-160, 1972.
 
19
R. E. Tarjan. Testing flow graph reducibility. J. Computer and System Sciences, 9:355-365, December 1974.

CITED BY  87

Collaborative Colleagues:
B. K. Rosen: colleagues
M. N. Wegman: colleagues
F. K. Zadeck: colleagues