V. Sreedhar, G. Gao, and Y. Lee. DJ-Graphs and their Applications to Flowgraph Analyses. Technical Report ACAPS Memo 70, McGill University, May 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Generalized Dominators - Gupta (1995) (Correct)
....synchronization structure of a program to uncover opportunities for distributed breakpointing through which event state can be captured following the detection of an event occurrence. Generalized postdominator information is used in identifying distributed breakpoints. Recently Sreedhar and Gao [9] have developed a new representation for flowgraph analysis called DJ graphs. Using this representation they have derived an algorithm for computing generalized dominators with the time complexity O(j E j Theta j V j Thetan) where j E j is the number of edges in the flow graph and n is bounded ....
V.C. Sreedhar, Y-F. Lee, and G.R. Gao, "DJ-Graphs and their Application to Flowgraph Analyses," McGill University, School of Computer Science, ACAPS Technical Memo 70, May 1994.
Incremental Computation of Dominator Trees - Sreedhar, Gao, Lee (1995) (5 citations) Self-citation (Sreedhar Gao) (Correct)
.... maintaining dominator trees were restricted to reducible flowgraphs [RR94, CR88] In this paper we present a new algorithm for incrementally maintaining the dominator tree of an arbitrary flowgraph, either reducible or irreducible, based on a program representation called the DJ graph [SG95, SGL94a] For the case where an edge is inserted, our algorithm is also faster than previous approaches (in the worst case) For the deletion case, our algorithm is likely to run fast on the average cases. 1 Introduction In the past few years, Static Single Assignment (SSA) form [CFR 89, CFR ....
....[CR88, RR94] For the deletion case, our new incremental algorithm is also competitive in terms of running time. It is expected to run faster on the average cases while not compromising its worstcase time complexity. To incrementally maintain a dominator tree, we use properties of DJ graphs [SG95, SGL94a] and iterated dominance frontiers [CFR 91] A DJ graph is nothing but a dominator tree augmentedwith join edges that potentially lead to merge points in the corresponding flowgraph. In a flowgraph, anedgex y is a join edge if x does not strictly dominate y. DJ graphs allow us to solve a ....
[Article contains additional citation context not shown here]
Vugranam C. Sreedhar, Guang R. Gao, and Yongfong Lee. DJ-graphs and their applications to flowgraph analyses. TechnicalReport ACAPSMemo 70, McGill University, May 1994.
An efficient incremental algorithm for maintaining.. - Sreedhar, Gao, Lee (1994) Self-citation (Sreedhar Gao) (Correct)
.... maintaining dominator trees were restricted to reducible flowgraphs [RR94, CR88] In this paper we present a new algorithm for incrementally maintaining the dominator tree of an arbitrary flowgraph, both reducible and irreducible, based on a program representation called the DJ Graph [SG94, SGL94] For the case where an edge is inserted, our algorithm is also faster than previous approaches. For the deletion case, our new incremental algorithm is likely to run fast on the average cases. We also discuss one important application of dominator tree update: incrementally updating OE nodes of ....
....[CR88, RR94] For the deletion case, our new incremental algorithm is also competitive in term of runtime. It is expected to to run faster on the average cases while not compromising its worst case time complexity. To incrementally maintain the dominator tree, we use properties of DJ graphs [SG94, SGL94] and iterated dominance frontiers [CFR 91] A DJ graph is nothing but a dominator tree augmented with join edges that potentially lead to merge points in its corresponding flowgraph. In a flowgraph, an edge x y is a join edge if x does not strictly dominate y. DJ graphs allow us to solve a ....
[Article contains additional citation context not shown here]
Vugranam C. Sreedhar, Guang R. Gao, and Yong-fong Lee. DJ-graphs and their applications to flowgraph analyses. Technical Report ACAPS Memo 70, McGill University, May 1994.
A Linear Time Algorithm for Placing φ-Nodes - Sreedhar, Gao (1995) Self-citation (Sreedhar Gao) (Correct)
....speedup even on real benchmark programs. On increasingly taller laddergraphs our algorithm exhibit linear behavior. We have been using DJ graphs and the algorithmic framework presented here to solve a number of other related flowgraph problems. We direct interested readers to our companion papers [SGL94a, SGL94b] Acknowledgement We would like to thank many people for their support and encouragement during the course of our work. We owe much thanks to Yong fong Lee for his insightful technical discussions and also for critically commenting on drafts of the paper. Erik Altman simplified one of ....
VugranamC. Sreedhar, GuangR. Gao, andYongfong Lee. DJ-graphs and their applications to flowgraph analyses. Technical Report ACAPS Memo 70, McGill University, May 1994.
Proofing: An Efficient and Safe Alternative to Mobile-Code.. - Gal, Probst, Franz (Correct)
No context found.
V. Sreedhar, G. Gao, and Y. Lee. DJ-Graphs and their Applications to Flowgraph Analyses. Technical Report ACAPS Memo 70, McGill University, May 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC