Monotone data flow analysis frameworks
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3485226 (Why is no real title available?)
- scientific article; zbMATH DE number 3551830 (Why is no real title available?)
- scientific article; zbMATH DE number 3596231 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3388535 (Why is no real title available?)
- A Fast and Usually Linear Algorithm for Global Flow Analysis
- A Simple Algorithm for Global Data Flow Analysis Problems
- A global flow analysis algorithm
- Fast algorithms for the elimination of common subexpressions
- Global Data Flow Analysis and Iterative Algorithms
Cited in
(32)- Make flows small again: revisiting the flow framework
- Dataflow analysis for datarace-free programs
- The Birth of Model Checking
- Semantics-directed program analysis: a tool-maker's perspective
- Program Analysis Using Weighted Pushdown Systems
- A security flow control algorithm and its denotational semantics correctness proof
- Bidirectional data flow analysis for type inferencing.
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
- The tree equivalence of linear recursion schemes
- Mixed computation and compilation: New approaches to old problems
- Search for invariant linear relationships in programs
- Transformational derivation of an improved alias analysis algorithm
- Static analysis of IMC
- The tree equivalence problem for linear recursion schemes
- On the computational complexity of data flow analysis over finite bounded meet semilattices
- Eliminating partially dead code in explicitly parallel programs
- Program reduction allowing for additional specifications
- Data flow analysis of asynchronous systems using infinite abstract domains
- Abstract Interpretation with Applications to Timing Validation
- Time stamps for fixed-point approximation
- Transfer function synthesis without quantifier elimination
- Automated formal analysis and verification: an overview
- Properties of data flow frameworks: A unified model
- Using postdomination to reduce space requirements of data flow analysis
- Intensional Kleene and Rice theorems for abstract program semantics
- Efficient symbolic analysis of programs
- Finite constants: Characterizations of a new decidable set of constants
- A region analysis algorithm for the live variables problem
- Symbolic abstract heaps for polymorphic information-flow guard inference
- XML graphs in program analysis
- Demand-driven interprocedural analysis for map-based abstract domains
- Iterative methods of program analysis
This page was built for publication: Monotone data flow analysis frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245693)
