Exact join detection for convex polyhedra and other numerical abstractions
DOI10.1016/J.COMGEO.2009.09.002zbMATH Open1187.65018OpenAlexW2003535389MaRDI QIDQ2269830FDOQ2269830
Authors: Roberto Bagnara, Enea Zaffanella, Patricia M. Hill 
Publication date: 11 March 2010
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.09.002
Recommendations
- Optimal detection of intersections between convex polyhedra
- A dual approach to detect polyhedral intersections in arbitrary dimensions
- Fast detection of polyhedral intersection
- A complete and efficient algorithm for the intersection of a general and a convex polyhedron
- scientific article; zbMATH DE number 4098718
- Efficient algorithms for testing membership of a point in polygons and polyhedra
- Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools
- An accurate join for zonotopes, preserving affine input/output relations
- Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets
- An efficient abstract domain for not necessarily closed polyhedra
Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Parametric integer programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The explicit linear quadratic regulator for constrained systems
- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- Not necessarily closed convex polyhedra and the double description method
- Title not available (Why is that?)
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- Algorithm for discovering the set of all the solutions of a linear programming problem
- Algorithm for finding a general formula for the non-negative solutions of a system of linear equations
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- Corrigendum to: ``The explicit linear quadratic regulator for constrained systems
- Two variables per linear inequality as an abstract domain
- Frontiers of Combining Systems
- A case when the union of polytopes is convex
- Static Analysis
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
- Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
- Convexity recognition of the union of polyhedra
- A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
- Static Analysis
- Extended convex hull
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
- Value-range analysis of C programs. Towards proving the absence of buffer overflow vulnerabilities
Cited In (6)
- Donut domains: efficient non-convex domains for abstract interpretation
- A new look at the automatic synthesis of linear ranking functions
- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- An accurate join for zonotopes, preserving affine input/output relations
- A note on the inversion join for polyhedral analysis
- Title not available (Why is that?)
Uses Software
This page was built for publication: Exact join detection for convex polyhedra and other numerical abstractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269830)
