Properties of data flow frameworks: A unified model
From MaRDI portal
(Redirected from Publication:910237)
Recommendations
Cites work
- scientific article; zbMATH DE number 3876561 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3485178 (Why is no real title available?)
- scientific article; zbMATH DE number 3485194 (Why is no real title available?)
- scientific article; zbMATH DE number 3592938 (Why is no real title available?)
- scientific article; zbMATH DE number 5254145 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 3356176 (Why is no real title available?)
- A Fast and Usually Linear Algorithm for Global Flow Analysis
- A Lubricant for Data Flow Analysis
- A Unified Approach to Path Problems
- A program data flow analysis procedure
- A simple fixpoint argument without the restriction to continuity
- An efficient general iterative algorithm for dataflow analysis
- An empirical study of FORTRAN programs
- Applications of Path Compression on Balanced Trees
- Automatic translation of FORTRAN programs to vector form
- Conditions for incremental iteration: Examples and counterexamples
- Constructive versions of Tarski's fixed point theorems
- Efficient symbolic analysis of programs
- Fast Algorithms for Solving Path Problems
- Flow Graph Reducibility
- Global Data Flow Analysis and Iterative Algorithms
- Global optimization by suppression of partial redundancies
- Monoids for Rapid Data Flow Analysis
- Monotone data flow analysis frameworks
- Program Slicing
- Program derivation by fixed point computation
- Properties of data flow frameworks: A unified model
- Register Assignment Algorithm for Generation of Highly Optimized Object Code
- Sometime = always + recursion always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
- Symbolic Program Analysis in Almost-Linear Time
- Testing flow graph reducibility
- The Theoretical Aspects of the Optimal Fixedpoint
- The optimal approach to recursive programs
- The program dependence graph and its use in optimization
Cited in
(14)- On the computational complexity of dynamic graph problems
- Fixing Zeno gaps
- Least solutions of equations over N
- Properties of data flow frameworks: A unified model
- A framework for memory efficient context-sensitive program analysis
- Bidirectional data flow analysis for type inferencing.
- Reflexive transitive invariant relations: A basis for computing loop functions
- Application of static analyses for state-space reduction to the microcontroller binary code
- Mathematics for reasoning about loop functions
- On edge addition rewrite systems and their relevance to program analysis
- Sound refactorings
- A Formal Definition of Data Flow Graph Models
- On the computational complexity of data flow analysis over finite bounded meet semilattices
- Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity
This page was built for publication: Properties of data flow frameworks: A unified model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910237)
