Pages that link to "Item:Q3600478"
From MaRDI portal
The following pages link to SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities (Q3600478):
Displaying 10 items.
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses (Q988565) (← links)
- Sparsity preserving algorithms for octagons (Q1650959) (← links)
- On the efficiency of convex polyhedra (Q2130564) (← links)
- Abstract interpretation of microcontroller code: intervals meet congruences (Q2442953) (← links)
- Finding Relevant Templates via the Principal Component Analysis (Q2961584) (← links)
- Sound Bit-Precise Numerical Domains (Q2961585) (← links)
- Linear Absolute Value Relation Analysis (Q3000578) (← links)
- Static Contract Checking with Abstract Interpretation (Q3067530) (← links)
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships (Q3392932) (← links)
- Computing Abstract Distances in Logic Programs (Q5097625) (← links)