A Comparison of Two Algorithms for Global Data Flow Analysis

DOI10.1137/0205014MaRDI QIDQ4105782zbMATH OpenOpenAlexFDO

Authors Ken Kennedy

Publication date 1976

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0205014

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(7)

• Profitability computations on program flow graphs
• A comparison of some algorithms for live variable analysis
• An algorithm for tracing live variables based on a straightened program graph
• ON THE STRUCTURE OF DIRECTED GRAPHS WITH APPLICATIONS: A Rapprochement with Systems Theory Part II
• Dynamic program slicing
• A region analysis algorithm for the live variables problem
• Syntactic and semantic soundness of structural dataflow analysis

This page was built for publication: A Comparison of Two Algorithms for Global Data Flow Analysis

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