Finding the depth of a flow graph
- 31 December 1977
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 15 (3), 300-309
- https://doi.org/10.1016/s0022-0000(77)80032-9
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Node listings for reducible flow graphsJournal of Computer and System Sciences, 1976
- A program data flow analysis procedureCommunications of the ACM, 1976
- Global Data Flow Analysis and Iterative AlgorithmsJournal of the ACM, 1976
- A Simple Algorithm for Global Data Flow Analysis ProblemsSIAM Journal on Computing, 1975
- Characterizations of Reducible Flow GraphsJournal of the ACM, 1974
- Fast algorithms for the elimination of common subexpressionsActa Informatica, 1973
- An empirical study of FORTRAN programsSoftware: Practice and Experience, 1971