A global flow analysis algorithm

DOI10.1080/00207167108803048MaRDI QIDQ5681518zbMATH OpenOpenAlexFDO

Authors Ken Kennedy

Publication date 1971

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207167108803048

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(12)

• Pathlistings applied to data flow analysis
• An \(O(n)\) algorithm for computing the set of available expressions of D-charts
• Testing flow graph reducibility
• Node listings for reducible flow graphs
• Correctness of parallel programs: The Church-Rosser approach
• Profitability computations on program flow graphs
• Monotone data flow analysis frameworks
• Fast algorithms for the elimination of common subexpressions
• A comparison of some algorithms for live variable analysis
• Applications of graph theory in computer systems
• An algorithm for tracing live variables based on a straightened program graph
• A region analysis algorithm for the live variables problem

This page was built for publication: A global flow analysis algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5681518)