Finding the depth of a flow graph
From MaRDI portal
Publication:1243127
DOI10.1016/S0022-0000(77)80032-9zbMath0369.68025OpenAlexW1996782193MaRDI QIDQ1243127
Amelia C. Fong, Jeffrey D. Ullman
Publication date: 1977
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(77)80032-9
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Node listings for reducible flow graphs
- Fast algorithms for the elimination of common subexpressions
- Characterizations of Reducible Flow Graphs
- Global Data Flow Analysis and Iterative Algorithms
- A program data flow analysis procedure
- A Simple Algorithm for Global Data Flow Analysis Problems
- An empirical study of FORTRAN programs
This page was built for publication: Finding the depth of a flow graph
