Acceleration of the abstract fixpoint computation in numerical program analysis
DOI10.1016/J.JSC.2011.12.050zbMATH Open1244.68029OpenAlexW2114898233MaRDI QIDQ435974FDOQ435974
Olivier Bouissou, Yassamine Seladji, Alexandre Chapoutot
Publication date: 13 July 2012
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.050
Recommendations
acceleration of convergenceabstract numerical domainsfixpointKleene iterationnumerical sequence transformationwidening operator with thresholds
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Acceleration of convergence in numerical analysis (65B99)
Cites Work
- Combining Widening and Acceleration in Linear Relation Analysis
- Title not available (Why is that?)
- The octagon abstract domain
- Title not available (Why is that?)
- A lattice-theoretical fixpoint theorem and its applications
- Extrapolation methods theory and practice
- Computing polynomial program invariants
- Title not available (Why is that?)
- Generating all polynomial invariants in simple loops
- Static Analysis of Finite Precision Computations
- Computer Aided Verification
- Static Analysis by Policy Iteration on Relational Domains
- Extrapolation methods for vector sequences
- Generalizations of aitken's process for accelerating the convergence of sequences
- Abstract fixpoint computations with numerical acceleration methods
- Extending abstract acceleration methods to data-flow programs with numerical inputs
- The Epsilon Algorithm and Operational Formulas of Numerical Analysis
- Accelerated Data-Flow Analysis
- Guided Static Analysis
- Static Analysis of Numerical Algorithms
- Title not available (Why is that?)
- Abstract Interpretation Frameworks
- Programming Languages and Systems
- Programming Languages and Systems
- Widening Polyhedra with Landmarks
- Verification, Model Checking, and Abstract Interpretation
- Computer Aided Verification
Cited In (5)
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case
- Learning a Strategy for Choosing Widening Thresholds from a Large Codebase
- Abstract Semantic Differencing for Numerical Programs
- Fast numerical program analysis with reinforcement learning
- Sound Numerical Computations in Abstract Acceleration
Uses Software
This page was built for publication: Acceleration of the abstract fixpoint computation in numerical program analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q435974)
