Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis

zbMath1237.68054arXiv1111.5223MaRDI QIDQ2881067

Stéphane Gaubert, Eric Goubault, Assalé Adjé

Publication date: 3 April 2012

Full work available at URL: https://arxiv.org/abs/1111.5223

zbMATH Keywords

quadratic programmingsemidefinite programmingconvex programmingLyapunov functionspolicy iterationabstract interpretation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Quadratic programming (90C20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

A sums-of-squares extension of policy iterations ⋮ Template polyhedra and bilinear optimization ⋮ Certification of real inequalities: templates and sums of squares

Uses Software

• SeDuMi
• YALMIP
• Lurupa