Global Data Flow Analysis and Iterative Algorithms
From MaRDI portal
Cited in
(23)- Finding the depth of a flow graph
- Finite constants: Characterizations of a new decidable set of constants
- Slicing communicating automata specifications: Polynomial algorithms for model reduction
- Algebraic structures for transitive closure
- Convergence of chaotic iterative least fixed point computations
- A class of polynomially solvable range constraints for interval analysis without widenings
- A composite hoisting-strength reduction transformation for global program optimization part I
- Properties of data flow frameworks: A unified model
- Efficient symbolic analysis of programs
- A strong-connectivity algorithm and its applications in data flow analysis
- Automated formal analysis and verification: an overview
- Mechanized verification of computing dominators for formalizing compilers
- Convergence of datalog over (pre-) semirings
- Monotone data flow analysis frameworks
- Pathlistings applied to data flow analysis
- May-happen-in-parallel analysis for actor-based concurrency
- A composite hoisting-strength reduction transformation for global program optimization part ii
- Combining model checking and data-flow analysis
- On the convergence rate of linear Datalog^ over stable semirings
- Correctness of fixpoint transformations
- A region analysis algorithm for the live variables problem
- Node listings for reducible flow graphs
- Transitive closure and related semiring properties via eliminants
This page was built for publication: Global Data Flow Analysis and Iterative Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4076758)
