An Efficient Abstract Domain for Not Necessarily Closed Polyhedra
No abstract available.
Related papers
- A Direct Encoding for NNC Polyhedra CAV 2018
- Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra SAS 2013
- A Sound Floating-Point Polyhedra Abstract Domain APLAS 2008
- Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools VMCAI 2013
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships SAS 2009
- Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library SAS 2002
- Fast polyhedra abstract domain POPL 2017
- Strided Difference Bound Matrices CAV 2024