Node listings for reducible flow graphs
- 1 December 1976
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 13 (3) , 286-299
- https://doi.org/10.1016/s0022-0000(76)80042-6
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Global Data Flow Analysis and Iterative AlgorithmsJournal of the ACM, 1976
- A Fast and Usually Linear Algorithm for Global Flow AnalysisJournal of the ACM, 1976
- A Simple Algorithm for Global Data Flow Analysis ProblemsSIAM Journal on Computing, 1975
- Testing flow graph reducibilityJournal of Computer and System Sciences, 1974
- Characterizations of Reducible Flow GraphsJournal of the ACM, 1974
- Fast algorithms for the elimination of common subexpressionsActa Informatica, 1973
- Flow Graph ReducibilitySIAM Journal on Computing, 1972
- A global flow analysis algorithmInternational Journal of Computer Mathematics, 1972
- Control flow analysisACM SIGPLAN Notices, 1970
- Global common subexpression eliminationACM SIGPLAN Notices, 1970