Refinement to certify abstract interpretations: illustrated on linearization for polyhedra
From MaRDI portal
Computational aspects related to convexity (52B55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formalization of mathematics in connection with theorem provers (68V20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Recommendations
Cites work
- scientific article; zbMATH DE number 605806 (Why is no real title available?)
- Affine arithmetic and applications to real-number proving
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- Deciding Kleene algebras in \texttt{Coq}
- Grammar Analysis and Parsing by Abstract Interpretation
- Guarded commands, nondeterminacy and formal derivation of programs
- Intuitionistic Refinement Calculus
- Polyhedral approximation of multivariate polynomials using Handelman's theorem
- Programming Languages and Systems
- Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra
- Representing polynomials by positive linear functions on compact convex polyhedra
- The Bernstein polynomial basis: a centennial retrospective
- Theorem Proving in Higher Order Logics
- Verification, Model Checking, and Abstract Interpretation
Cited in
(1)
This page was built for publication: Refinement to certify abstract interpretations: illustrated on linearization for polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1739912)