Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
Abstract elided by the publisher.
Related papers
- Cartesian Factoring of Polyhedra in Linear Relation Analysis SAS 2003
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships SAS 2009
- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints TACAS 2009
- Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic TACAS 2022
- An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection SAS 2019
- Precise Widening Operators for Convex Polyhedra SAS 2003
- Static Analysis of ReLU Neural Networks with Tropical Polyhedra SAS 2021
- A parametric segmentation functor for fully automatic and scalable array content analysis POPL 2011