Accelerated Data-Flow Analysis
From MaRDI portal
Recommendations
- Acceleration in Convex Data-Flow Analysis
- Extending abstract acceleration methods to data-flow programs with numerical inputs
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
- Abstract fixpoint computations with numerical acceleration methods
- Combining Widening and Acceleration in Linear Relation Analysis
Cited in
(15)- Dataflow analysis of array and scalar references
- Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs
- Structurally defined conditional data-flow static analysis
- Abstract fixpoint computations with numerical acceleration methods
- Extending abstract acceleration methods to data-flow programs with numerical inputs
- Improving strategies via SMT solving
- Convex Hull of Arithmetic Automata
- Combining Widening and Acceleration in Linear Relation Analysis
- Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
- Polynomial Precise Interval Analysis Revisited
- Acceleration of the abstract fixpoint computation in numerical program analysis
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
- scientific article; zbMATH DE number 1948399 (Why is no real title available?)
- A calculus for modular loop acceleration
- Acceleration in Convex Data-Flow Analysis
This page was built for publication: Accelerated Data-Flow Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612002)