An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph (1994)
by
G. Ramalingam
,
Thomas Reps
| Venue: | IN ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES (POPL |
| Citations: | 12 - 1 self |
BibTeX
@INPROCEEDINGS{Ramalingam94anincremental,
author = {G. Ramalingam and Thomas Reps},
title = {An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph},
booktitle = {IN ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES (POPL},
year = {1994},
pages = {287--298},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a new incremental algorithm for the problem of maintaining the dominator tree of a reducible flowgraph as the flowgraph undergoes changes such as the insertion and deletion of edges. Such an algorithm has applications in incremental dataflow analysis and incremental compilation.
Citations
| 749 | Efficiently computing static single assignment form and the control dependence graph - Cytron, Ferrante, et al. - 1991 |
| 127 | T.: A fast algorithm for finding dominators in a flowgraph - Lengauer, Endre, et al. - 1979 |
| 65 | Incremental evaluation of computational circuits - Alpern, Hoover, et al. - 1990 |
| 38 | A linear time algorithm for finding dominators in flow graphs and related problems - Harel - 1985 |
| 25 | Optimal-time incremental semantic analysis for syntax-directed editors - Reps - 1982 |
| 11 | Incremental data flow update via attribute and dominator updates - Carroll, Ryder |
| 7 | Data flow update via dominator and attribute updates - Carroll - 1988 |
| 2 | Combine and Conquer - Cohen, Tamassia - 1992 |
| 2 | Finding dominators - Ochranova - 1983 |
