A Simple Algorithm for Global Data Flow Analysis Problems

DOI10.1137/0204044MaRDI QIDQ4095866zbMATH OpenOpenAlexFDO

Authors Matthew S. Hecht, Jeffrey D. Ullman

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

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

Cited in

(20)

• Efficient symbolic analysis of programs
• Approximate matching of regular expressions
• A strong-connectivity algorithm and its applications in data flow analysis
• Pathlistings applied to data flow 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
• An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators
• Approximate regular expression pattern matching with concave gap penalties
• Super-pattern matching
• Program reduction allowing for additional specifications
• A comparison of some algorithms for live variable analysis
• Analysis of program structure
• Iterative methods of program analysis
• Generalized dominators for structured programs
• The Choice Construct in the Soufflé Language
• Generalized dominators
• Data flow analysis of distributed communicating processes
• A region analysis algorithm for the live variables problem

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

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