Global Data Flow Analysis and Iterative Algorithms
From MaRDI portal
Publication:4076758
DOI10.1145/321921.321938zbMath0315.68031OpenAlexW2116098983WikidataQ56079998 ScholiaQ56079998MaRDI QIDQ4076758
Jeffrey D. Ullman, John B. Kam
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.321938
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (21)
May-Happen-in-Parallel Analysis for Actor-Based Concurrency ⋮ Correctness of fixpoint transformations ⋮ Efficient symbolic analysis of programs ⋮ Transitive closure and related semiring properties via eliminants ⋮ Combining Model Checking and Data-Flow Analysis ⋮ Convergence of chaotic iterative least fixed point computations ⋮ A strong-connectivity algorithm and its applications in data flow analysis ⋮ Pathlistings applied to data flow analysis ⋮ Properties of data flow frameworks: A unified model ⋮ Finite constants: Characterizations of a new decidable set of constants ⋮ Mechanized Verification of Computing Dominators for Formalizing Compilers ⋮ Node listings for reducible flow graphs ⋮ Algebraic structures for transitive closure ⋮ Finding the depth of a flow graph ⋮ Monotone data flow analysis frameworks ⋮ Slicing communicating automata specifications: Polynomial algorithms for model reduction ⋮ A class of polynomially solvable range constraints for interval analysis without widenings ⋮ A composite hoisting-strength reduction transformation for global program optimization part I ⋮ A composite hoisting-strength reduction transformation for global program optimization part ii ⋮ A region analysis algorithm for the live variables problem ⋮ Automated formal analysis and verification: an overview
Uses Software
This page was built for publication: Global Data Flow Analysis and Iterative Algorithms
