R. Johnson, D. Pearson, and K. Pingali. Finding regions fast: Single entry single exit and control regions in linear time. In Proc. Sigplan'94 PLDI, 1994. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
The Static Single Information Form - Ananian (1999) (1 citation) (Correct)
Imperative Program Transformation By Rewriting - Lacey, de Moor (2001) (16 citations) (Correct)
Value Dependence Graphs: Representation Without Taxation - Weise, Crew, Ernst.. (1994) (43 citations) (Correct)
Quasi-Fully Dynamic Algorithms for Two-Connectivity.. - Korupolu, Ramachandran (1997) (Correct)
What's in a Region? or Computing control dependences in.. - Ball (1993) (Correct)
Program Dependence Graphs for the Rest of Us - Ballance, al. (1993) (8 citations) (Correct)
Fully Dynamic Cycle-Equivalence in Graphs - Henzinger (1994) (3 citations) (Correct)
Maintaining Dynamic Graph Properties - Deterministically Moreno Marzolla (Correct)
The Static Single Information Form - Ananian (1999) (1 citation) (Correct)
The Program Structure Tree: Computing Control Regions in.. - Johnson, Pearson, Pingali (1994) (33 citations) Self-citation (Johnson Pearson Pingali) (Correct)
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