On loops, dominators, and dominance frontier
- 1 May 2000
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Identifying loops in almost linear timeACM Transactions on Programming Languages and Systems, 1999
- Dominators in Linear TimeSIAM Journal on Computing, 1999
- A new, simpler linear-time dominators algorithmACM Transactions on Programming Languages and Systems, 1998
- Nesting of reducible and irreducible loopsACM Transactions on Programming Languages and Systems, 1997
- Optimal control dependence computation and the Roman chariots problemACM Transactions on Programming Languages and Systems, 1997
- Identifying loops using DJ graphsACM Transactions on Programming Languages and Systems, 1996
- The transitive closure of control dependenceACM Letters on Programming Languages and Systems, 1992
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- A fast algorithm for finding dominators in a flowgraphACM Transactions on Programming Languages and Systems, 1979
- Testing flow graph reducibilityJournal of Computer and System Sciences, 1974