Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants
No abstract available.
Related papers
- Synthesizing Invariants for Polynomial Programs by Semidefinite Programming TOPLAS 2025
- Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming VMCAI 2005
- Abstract Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation CAV 2015
- A reflexive tactic for polynomial positivity using numerical solvers and floating-point computations CPP 2017
- An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs ESOP 2016
- Piecewise Analysis of Probabilistic Programs via 𝑘-Induction POPL 2026
- Generating Non-linear Interpolants by Semidefinite Programming CAV 2013
- Property-based Polynomial Invariant Generation Using Sums-of-Squares Optimization SAS 2015