Aspic

swMATH4954MaRDI QIDQ17101

No author found.

Described by source

• Combining Widening and Acceleration in Linear Relation Analysis

Related Items (23)

Improving the results of program analysis by abstract interpretation beyond the decreasing sequence ⋮ Computing invariants with transformers: experimental scalability and accuracy ⋮ Algebraic program analysis ⋮ Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs ⋮ Some Reflections on Two Current Trends in Formal Argumentation ⋮ Widening with Thresholds for Programs with Complex Control Graphs ⋮ Descending chains and narrowing on template abstract domains ⋮ Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case ⋮ 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 ⋮ Automatic Modular Abstractions for Template Numerical Constraints ⋮ Proving Termination by Policy Iteration ⋮ Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach ⋮ Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs ⋮ Quantitative separation logic and programs with lists ⋮ Enforcing termination of interprocedural analysis ⋮ Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration ⋮ Transfer Function Synthesis without Quantifier Elimination ⋮ Abstract Fixpoint Computations with Numerical Acceleration Methods ⋮ Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs ⋮ Lower Runtime Bounds for Integer Programs ⋮ Termination Analysis of C Programs Using Compiler Intermediate Languages

This page was built for software: Aspic