Acceleration in Convex Data-Flow Analysis
From MaRDI portal
Publication:5458862
DOI10.1007/978-3-540-77050-3_43zbMath1135.68369OpenAlexW1824417510MaRDI QIDQ5458862
Publication date: 24 April 2008
Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_43
Related Items (2)
Convex Hull of Arithmetic Automata ⋮ Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Affine relationships among variables of a program
- Well-abstracted transition systems: Application to FIFO automata.
- Semigroups, Presburger formulas, and languages
- Precise widening operators for convex polyhedra
- A class of polynomially solvable range constraints for interval analysis without widenings
- Accelerated Data-Flow Analysis
- Combining Widening and Acceleration in Linear Relation Analysis
- Static Analysis
- Flat Parametric Counter Automata
This page was built for publication: Acceleration in Convex Data-Flow Analysis