The transitive closure of control dependence
- 1 June 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Letters on Programming Languages and Systems
- Vol. 1 (2) , 178-190
- https://doi.org/10.1145/151333.151337
Abstract
We characterize the transitive closure of the control dependence relation and give an application to the theory of control fow guards. We relate our result to characterizations by Beck et al., by Sarkar, and by Cytron et al., and strengthen a result of the latter concerning dominance frontiers and join sets.Keywords
This publication has 4 references indexed in Scilit:
- Loop distribution with arbitrary control flowPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- From control flow to dataflowJournal of Parallel and Distributed Computing, 1991
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987