Static Analysis by Policy Iteration on Relational Domains

DOI10.1007/978-3-540-71316-6_17zbMath1187.68151MaRDI QIDQ5756499

Eric Goubault, S. Zennou, Ankur Taly, Stéphane Gaubert

Publication date: 4 September 2007

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71316-6_17

Mathematics Subject Classification ID

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

Related Items

Stratified Static Analysis Based on Variable Dependencies, Validating numerical semidefinite programming solvers for polynomial invariants, A zonotopic framework for functional abstractions, Decoupling the ascending and descending phases in abstract interpretation, Mathematical programming: Turing completeness and applications to software analysis, Abstract interpretation meets convex optimization, Tropical linear-fractional programming and parametric mean payoff games, Acceleration of the abstract fixpoint computation in numerical program analysis, Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case, Pentagons: a weakly relational abstract domain for the efficient validation of array accesses, Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs, Template polyhedra and bilinear optimization, A sums-of-squares extension of policy iterations, Policy iteration in finite templates domain, Unnamed Item, Static Analysis by Abstract Interpretation: A Mathematical Programming Approach, Template-Based Unbounded Time Verification of Affine Hybrid Automata, Generalizing the Template Polyhedral Domain, Improving Strategies via SMT Solving, A Policy Iteration Technique for Time Elapse over Template Polyhedra

Uses Software

• Octagon