Exact join detection for convex polyhedra and other numerical abstractions

DOI10.1016/j.comgeo.2009.09.002zbMath1187.65018OpenAlexW2003535389MaRDI QIDQ2269830

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

zbMATH Keywords

convexitypolyhedronabstract interpretationunionnumerical abstractionpowerset domain

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Donut Domains: Efficient Non-convex Domains for Abstract Interpretation, A new look at the automatic synthesis of linear ranking functions

Uses Software

• PPL
• Octagon
• PipLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
• Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
• Applications of polyhedral computations to the analysis and verification of hardware and software systems
• A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
• Corrigendum to: ``The explicit linear quadratic regulator for constrained systems
• A case when the union of polytopes is convex
• Not necessarily closed convex polyhedra and the double description method
• Two Variables per Linear Inequality as an Abstract Domain
• Parametric integer programming
• An Improved Tight Closure Algorithm for Integer Octagonal Constraints
• Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
• Static Analysis
• Frontiers of Combining Systems
• 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
• Static Analysis
• Convexity recognition of the union of polyhedra
• Extended convex hull
• The explicit linear quadratic regulator for constrained systems