Not necessarily closed convex polyhedra and the double description method
From MaRDI portal
Publication:2576576
DOI10.1007/s00165-005-0061-1zbMath1101.68674OpenAlexW2093225431MaRDI QIDQ2576576
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
Publication date: 13 December 2005
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-005-0061-1
Abstract interpretationConvex polyhedraDouble descriptionData-flow analysisStrict linear inequalities
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Efficient constraint/generator removal from double description of polyhedra, Donut Domains: Efficient Non-convex Domains for Abstract Interpretation, On the efficiency of convex polyhedra, On finite linear systems containing strict inequalities, Tracking smooth trajectories in linear hybrid systems, Symbolic analysis of linear hybrid automata -- 25 years later, Parameter Synthesis for Bounded Cost Reachability in Time Petri Nets, Splitting the Control Flow with Boolean Flags, PPLite: zero-overhead encoding of NNC polyhedra, Exact join detection for convex polyhedra and other numerical abstractions, A new look at the automatic synthesis of linear ranking functions, A Note on the Inversion Join for Polyhedral Analysis, Speeding up Polyhedral Analysis by Identifying Common Constraints, Applications of polyhedral computations to the analysis and verification of hardware and software systems, Cost Problems for Parametric Time Petri Nets*
Uses Software
