| Incremental computation of dominator trees |
| Full text |
Pdf
(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
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 38, Citation Count: 5
|
|
|
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
|
Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
|
| |
2
|
Bowen Alpern , Roger Hoover , Barry K. Rosen , Peter F. Sweeney , F. Kenneth Zadeck, Incremental evaluation of computational circuits, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.32-42, January 22-24, 1990, San Francisco, California, United States
|
 |
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
|
Vugranam C. Sreedhar , Guang R. Gao , Yong-Fong Lee, A new framework for exhaustive and incremental data flow analysis using DJ graphs, Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation, p.278-290, May 21-24, 1996, Philadelphia, Pennsylvania, United States
|
 |
15
|
|
CITED BY 5
|
|
|
|
|
|
|
|
Sumit Gupta , Mehrdad Reshadi , Nick Savoiu , Nikil Dutt , Rajesh Gupta , Alex Nicolau, Dynamic common sub-expression elimination during scheduling in high-level synthesis, Proceedings of the 15th international symposium on System Synthesis, October 02-04, 2002, Kyoto, Japan
|
|
|
|
|
|
|
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...
|