Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming
No abstract available.
Related papers
- Synthesizing Invariants for Polynomial Programs by Semidefinite Programming TOPLAS 2025
- Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants SAS 2016
- Abstract Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation CAV 2015
- Lagrangian-Based Duality for Quantified SMT Algorithms CAV 2026
- Space-Efficient Polymorphic Gradual Typing, Mostly Parametric PLDI 2024
- Relational Parametricity and Units of Measure POPL 1997
- Checking Deadlock-Freedom of Parametric Component-Based Systems TACAS 2019
- Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants TACAS 2023