A Fast and Usually Linear Algorithm for Global Flow Analysis
From MaRDI portal
Recommendations
Cited in
(21)- Pathlistings applied to data flow analysis
- Efficient parallel algorithms for path problems in directed graphs
- An \(O(n)\) algorithm for computing the set of available expressions of D-charts
- Node listings for reducible flow graphs
- Monotone data flow analysis frameworks
- The method of attributes for data flow analysis. II: Demand analysis
- On sparse evaluation representations
- scientific article; zbMATH DE number 3885296 (Why is no real title available?)
- scientific article; zbMATH DE number 3870590 (Why is no real title available?)
- Solving Multiple Dataflow Queries Using WPDSs
- Flow Analysis, Linearity, and PTIME
- Transmittance matrices and flowgraph reduction
- A comparison of some algorithms for live variable analysis
- A composite algorithm for strength reduction and code movement optimization
- Static Analysis
- Data flow analysis of distributed communicating processes
- A region analysis algorithm for the live variables problem
- Algebraic program analysis
- A polynomial-time algorithm for global value numbering
- Average case analysis of DJ graphs
- Properties of data flow frameworks: A unified model
This page was built for publication: A Fast and Usually Linear Algorithm for Global Flow Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4091443)