Static Analysis by Policy Iteration on Relational Domains
From MaRDI portal
Publication:5756499
DOI10.1007/978-3-540-71316-6_17zbMATH Open1187.68151OpenAlexW1547121950MaRDI QIDQ5756499FDOQ5756499
Authors: Stéphane Gaubert, Éric Goubault, Ankur Taly, S. Zennou 
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
Recommendations
- Computer Aided Verification
- Precise Relational Invariants Through Strategy Iteration
- Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis
- Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis
- Acceleration of the abstract fixpoint computation in numerical program analysis
Cited In (36)
- Logico-numerical max-strategy iteration
- A sums-of-squares extension of policy iterations
- Tropical linear-fractional programming and parametric mean payoff games
- Mathematical programming: Turing completeness and applications to software analysis
- Policy iteration in finite templates domain
- Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis
- A zonotopic framework for functional abstractions
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
- Stratified static analysis based on variable dependencies
- Program analysis with local policy iteration
- Template-based unbounded time verification of affine hybrid automata
- Finding relevant templates via the principal component analysis
- Abstract interpretation meets convex optimization
- Acceleration of the abstract fixpoint computation in numerical program analysis
- Polynomial approximations of the relational semantics of imperative programs
- Policy iteration within logico-numerical abstract domains
- Decoupling the ascending and descending phases in abstract interpretation
- Template polyhedra and bilinear optimization
- Template polyhedra with a twist
- Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case
- Descending chains and narrowing on template abstract domains
- Computing relaxed abstract semantics w.r.t. quadratic zones precisely
- A Policy Iteration Technique for Time Elapse over Template Polyhedra
- Invariant generation through strategy iteration in succinctly represented control flow graphs
- Static analysis by abstract interpretation: a mathematical programming approach
- Mathematical programming based debugging
- Computer Aided Verification
- Validating numerical semidefinite programming solvers for polynomial invariants
- Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis
- Improving strategies via SMT solving
- A change-based heuristic for static analysis with policy iteration
- Generalizing the template polyhedral domain
- Guided Static Analysis
- Precise Relational Invariants Through Strategy Iteration
- Beyond Iteration Vectors: Instancewise Relational Abstract Domains
Uses Software
This page was built for publication: Static Analysis by Policy Iteration on Relational Domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756499)
