Static Analysis by Policy Iteration on Relational Domains
From MaRDI portal
Publication:5756499
DOI10.1007/978-3-540-71316-6_17zbMath1187.68151OpenAlexW1547121950MaRDI 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
Related Items (20)
Template-Based Unbounded Time Verification of Affine Hybrid Automata ⋮ A sums-of-squares extension of policy iterations ⋮ Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case ⋮ Mathematical programming: Turing completeness and applications to software analysis ⋮ Decoupling the ascending and descending phases in abstract interpretation ⋮ Abstract interpretation meets convex optimization ⋮ Tropical linear-fractional programming and parametric mean payoff games ⋮ Acceleration of the abstract fixpoint computation in numerical program analysis ⋮ A Policy Iteration Technique for Time Elapse over Template Polyhedra ⋮ Generalizing the Template Polyhedral Domain ⋮ Improving Strategies via SMT Solving ⋮ Stratified Static Analysis Based on Variable Dependencies ⋮ Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs ⋮ Unnamed Item ⋮ Pentagons: a weakly relational abstract domain for the efficient validation of array accesses ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ A zonotopic framework for functional abstractions ⋮ Policy iteration in finite templates domain ⋮ Static Analysis by Abstract Interpretation: A Mathematical Programming Approach ⋮ Template polyhedra and bilinear optimization
Uses Software
This page was built for publication: Static Analysis by Policy Iteration on Relational Domains
