Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools
From MaRDI portal
Publication:2926643
Recommendations
- Finite element pointwise results on convex polyhedral domains
- Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra
- Computation of generalized convex approximations of planar geometric objects
- Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra
- Analysis of a new method for approximation of convex compact bodies by polyhedra
- Approximate convex decomposition of polyhedra and its applications
- scientific article; zbMATH DE number 1182566
- Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver
- Polyhedral and algebraic methods in computational geometry
Cited in
(11)- Widening Polyhedra with Landmarks
- Memory-efficient fixpoint computation
- Abstract interpretation meets convex optimization
- Acceleration of the abstract fixpoint computation in numerical program analysis
- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- scientific article; zbMATH DE number 2090855 (Why is no real title available?)
- Exact join detection for convex polyhedra and other numerical abstractions
- Acceleration in Convex Data-Flow Analysis
- ROBUST SET OPERATIONS ON POLYHEDRAL SOLIDS: A FIXED PRECISION APPROACH
- Property directed polyhedral abstraction
- Abstract fixpoint computations with numerical acceleration methods
This page was built for publication: Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926643)