A Fast and Usually Linear Algorithm for Global Flow Analysis
From MaRDI portal
Publication:4091443
DOI10.1145/321921.321939zbMath0326.68023OpenAlexW2047615655MaRDI QIDQ4091443
Mark N. Wegman, Susan L. Graham
Publication date: 1976
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321921.321939
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (14)
Algebraic program analysis ⋮ Pathlistings applied to data flow analysis ⋮ Properties of data flow frameworks: A unified model ⋮ Solving Multiple Dataflow Queries Using WPDSs ⋮ Efficient parallel algorithms for path problems in directed graphs ⋮ An \(O(n)\) algorithm for computing the set of available expressions of D-charts ⋮ A comparison of some algorithms for live variable analysis ⋮ Node listings for reducible flow graphs ⋮ Monotone data flow analysis frameworks ⋮ A composite algorithm for strength reduction and code movement optimization ⋮ The method of attributes for data flow analysis. II: Demand analysis ⋮ Data flow analysis of distributed communicating processes ⋮ A region analysis algorithm for the live variables problem ⋮ On sparse evaluation representations
This page was built for publication: A Fast and Usually Linear Algorithm for Global Flow Analysis
