Validating numerical semidefinite programming solvers for polynomial invariants

DOI10.1007/978-3-662-53413-7_21zbMath1394.68085OpenAlexW2507512032MaRDI QIDQ5915715

Pierre Roux, Yuen-Lam Voronin, Sriram Sankaranarayanan

Publication date: 27 August 2018

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53413-7_21

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Sharper and Simpler Nonlinear Interpolants for Program Verification ⋮ Vector barrier certificates and comparison systems ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ Template polyhedra and bilinear optimization

This page was built for publication: Validating numerical semidefinite programming solvers for polynomial invariants