Cartesian Factoring of Polyhedra in Linear Relation Analysis
No abstract available.
Related papers
- Static Analysis of ReLU Neural Networks with Tropical Polyhedra SAS 2021
- A practical construction for decomposing numerical abstract domains POPL 2018
- Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming SAS 2017
- 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
- Fast interprocedural linear two-variable equalities TOPLAS 2011
- Cartesian hoare logic for verifying k-safety properties PLDI 2016
- A theory of effects and resources: adjunction models and polarised calculi POPL 2016