Symbolic polytopes for quantitative interpolation and verification

DOI10.1007/978-3-319-21690-4_11MaRDI QIDQ1702919zbMATH OpenOpenAlexFDO

Authors Klaus von Gleissenthall, Boris Köpf, Andrey Rybalchenko

Publication date 1 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-21690-4_11

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Recommendations

• Constraint Solving for Interpolation
• Constraint solving for interpolation
• Sharper and Simpler Nonlinear Interpolants for Program Verification
• Generating non-linear interpolants by semidefinite programming
• Polynomial Constraints for Sets with Cardinality Bounds

Cited in

(1)

• Qualitative Symbolic Perturbation: Two Applications of a New Geometry-based Perturbation Framework

This page was built for publication: Symbolic polytopes for quantitative interpolation and verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702919)