A Comparison of Two Algorithms for Global Data Flow Analysis

From MaRDI portal

Revision as of 07:23, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4105782

Jump to:navigation, search

DOI10.1137/0205014zbMath0338.68026OpenAlexW2090893462MaRDI QIDQ4105782

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

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

Related Items (6)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4105782&oldid=17877305"