Properties of data flow frameworks: A unified model
From MaRDI portal
Publication:910237
DOI10.1007/BF01237234zbMath0695.68049OpenAlexW2062764376MaRDI QIDQ910237
Barbara G. Ryder, Thomas J. jun. Marlowe
Publication date: 1990
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01237234
Related Items (13)
On the computational complexity of dynamic graph problems ⋮ Reflexive transitive invariant relations: A basis for computing loop functions ⋮ Application of static analyses for state-space reduction to the microcontroller binary code ⋮ Bidirectional data flow analysis for type inferencing. ⋮ Properties of data flow frameworks: A unified model ⋮ Least solutions of equations over N ⋮ On the computational complexity of data flow analysis over finite bounded meet semilattices ⋮ On edge addition rewrite systems and their relevance to program analysis ⋮ Fixing Zeno gaps ⋮ Sound refactorings ⋮ Mathematics for reasoning about loop functions ⋮ A framework for memory efficient context-sensitive program analysis ⋮ Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of data flow frameworks: A unified model
- Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
- A simple fixpoint argument without the restriction to continuity
- Efficient symbolic analysis of programs
- An efficient general iterative algorithm for dataflow analysis
- Conditions for incremental iteration: Examples and counterexamples
- Testing flow graph reducibility
- Monotone data flow analysis frameworks
- Constructive versions of Tarski's fixed point theorems
- Program derivation by fixed point computation
- Applications of Path Compression on Balanced Trees
- Program Slicing
- The program dependence graph and its use in optimization
- Automatic translation of FORTRAN programs to vector form
- Monoids for Rapid Data Flow Analysis
- A Unified Approach to Path Problems
- Fast Algorithms for Solving Path Problems
- Symbolic Program Analysis in Almost-Linear Time
- A Lubricant for Data Flow Analysis
- Global Data Flow Analysis and Iterative Algorithms
- A program data flow analysis procedure
- A Fast and Usually Linear Algorithm for Global Flow Analysis
- The Theoretical Aspects of the Optimal Fixedpoint
- The optimal approach to recursive programs
- Global optimization by suppression of partial redundancies
- Register Assignment Algorithm for Generation of Highly Optimized Object Code
- An empirical study of FORTRAN programs
- Flow Graph Reducibility
This page was built for publication: Properties of data flow frameworks: A unified model
