Combining Widening and Acceleration in Linear Relation Analysis

DOI10.1007/11823230_10zbMath1225.68071OpenAlexW1580450019MaRDI QIDQ3613383

Laure Gonnord, Nicolas Halbwachs

Publication date: 12 March 2009

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11823230_10

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Improving the results of program analysis by abstract interpretation beyond the decreasing sequence ⋮ A Calculus for Modular Loop Acceleration ⋮ Computing invariants with transformers: experimental scalability and accuracy ⋮ Algebraic program analysis ⋮ Descending chains and narrowing on template abstract domains ⋮ Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration ⋮ Decoupling the ascending and descending phases in abstract interpretation ⋮ Acceleration of the abstract fixpoint computation in numerical program analysis ⋮ Applying abstract acceleration to (co-)reachability analysis of reactive programs ⋮ Improving Strategies via SMT Solving ⋮ Tree dimension in verification of constrained Horn clauses ⋮ Proving Termination by Policy Iteration ⋮ Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach ⋮ Enforcing termination of interprocedural analysis ⋮ Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration ⋮ Narrowing Operators on Template Abstract Domains ⋮ Acceleration in Convex Data-Flow Analysis ⋮ Abstract Fixpoint Computations with Numerical Acceleration Methods ⋮ Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs ⋮ Lower Runtime Bounds for Integer Programs ⋮ Aspic

Uses Software

• HyTech

This page was built for publication: Combining Widening and Acceleration in Linear Relation Analysis