Acceleration in Convex Data-Flow Analysis
From MaRDI portal
Recommendations
Cites work
- A class of polynomially solvable range constraints for interval analysis without widenings
- Accelerated Data-Flow Analysis
- Affine relationships among variables of a program
- Combining Widening and Acceleration in Linear Relation Analysis
- Flat Parametric Counter Automata
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1954380 (Why is no real title available?)
- scientific article; zbMATH DE number 1738295 (Why is no real title available?)
- Precise widening operators for convex polyhedra
- Semigroups, Presburger formulas, and languages
- Static Analysis
- Well-abstracted transition systems: Application to FIFO automata.
Cited in
(6)- Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs
- Extending abstract acceleration methods to data-flow programs with numerical inputs
- Convex Hull of Arithmetic Automata
- Accelerated Data-Flow Analysis
- Combining Widening and Acceleration in Linear Relation Analysis
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
This page was built for publication: Acceleration in Convex Data-Flow Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458862)