ACM Home Page
Please provide us with feedback. Feedback
Incremental computation of dominator trees
Full text PdfPdf (259 KB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 19 ,  Issue 2  (March 1997) table of contents
Pages: 239 - 252  
Year of Publication: 1997
ISSN:0164-0925
Authors
Vugranam C. Sreedhar  Hewlett-Packard Company, Cupertino, CA
Guang R. Gao  McGill Univ., Montre´al, P.Q., Canada
Yong-Fong Lee  Intel Corporation, Santa Clara, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 38,   Citation Count: 5
Additional Information:

references   cited by   index terms   review   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/244795.244799
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
3
4
5
6
 
7
JOHNSON, R. 1994. Dependence based program analysis. Ph.D. thesis, Cornell Univ., Ithaca, N.Y.
 
8
9
10
 
11
 
12
 
13
SREEDHAR, V. C. AND GAO, G. R. 1996. Computing qS-nodes in linear time using dj graphs. J. of Program. Lang. 3, 4, 191-213.
14
15



REVIEW

"Svetlana Segarceanu : Reviewer"

A new incremental algorithm for maintaining the dominator tree of a flowgraph is presented. The first section of the paper defines a flowgraph, some domination relations in a flowgraph, and the dominator tree of a flowgraph. Maintaining the do  more...

Collaborative Colleagues:
Vugranam C. Sreedhar: colleagues
Guang R. Gao: colleagues
Yong-Fong Lee: colleagues