SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
No abstract available.
Related papers
- The Gauge Domain: Scalable Analysis of Linear Inequality Invariants CAV 2012
- An Order Theory Framework of Recurrence Equations for Static Cost Analysis - Dynamic Inference of Non-Linear Inequality Invariants SAS 2024
- Interprocedurally Analysing Linear Inequality Relations ESOP 2007
- Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors TACAS 2013
- Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers CAV 2009
- Learning nonlinear loop invariants with gated continuous logic networks PLDI 2020
- Dependent Types in Practical Programming POPL 1999
- The Rocq-NN-Roll Prover: Soundly Verifying Hyperproperties of Neural Networks in Rocq CAV 2026