Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely
From MaRDI portal
Publication:4930733
DOI10.1007/978-3-642-15769-1_17zbMath1306.68025OpenAlexW1531851716MaRDI QIDQ4930733
Thomas Martin Gawlitza, Helmut Seidl
Publication date: 1 October 2010
Published in: Static Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15769-1_17
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (8)
Template-Based Unbounded Time Verification of Affine Hybrid Automata ⋮ Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case ⋮ Abstract interpretation meets convex optimization ⋮ Improving Strategies via SMT Solving ⋮ Numerical invariants through convex relaxation and max-strategy iteration ⋮ Proving Termination by Policy Iteration ⋮ Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs ⋮ Validating numerical semidefinite programming solvers for polynomial invariants
This page was built for publication: Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely
