A Simple Algorithm for Global Data Flow Analysis Problems

DOI10.1137/0204044zbMath0329.68039OpenAlexW2050464392MaRDI QIDQ4095866

Jeffrey D. Ullman, Matthew S. Hecht

Publication date: 1975

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

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

Mathematics Subject Classification ID

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

Related Items (19)

Efficient symbolic analysis of programs ⋮ Approximate regular expression pattern matching with concave gap penalties ⋮ Super-pattern matching ⋮ Program reduction allowing for additional specifications ⋮ Iterative methods of program analysis ⋮ Approximate matching of regular expressions ⋮ A strong-connectivity algorithm and its applications in data flow analysis ⋮ Pathlistings applied to data flow analysis ⋮ Generalized dominators ⋮ Generalized dominators for structured programs ⋮ A comparison of some algorithms for live variable analysis ⋮ Node listings for reducible flow graphs ⋮ Finding the depth of a flow graph ⋮ Monotone data flow analysis frameworks ⋮ The method of attributes for data flow analysis. II: Demand analysis ⋮ Data flow analysis of distributed communicating processes ⋮ Analysis of program structure ⋮ An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators ⋮ A region analysis algorithm for the live variables problem

This page was built for publication: A Simple Algorithm for Global Data Flow Analysis Problems