SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities

DOI10.1007/978-3-540-93900-9_20zbMath1206.68092OpenAlexW1525502778MaRDI QIDQ3600478

Vincent Laviron, Francesco Logozzo

Publication date: 10 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-93900-9_20

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (10)

On the efficiency of convex polyhedra ⋮ Sparsity preserving algorithms for octagons ⋮ Computing Abstract Distances in Logic Programs ⋮ Finding Relevant Templates via the Principal Component Analysis ⋮ Sound Bit-Precise Numerical Domains ⋮ Abstract interpretation of microcontroller code: intervals meet congruences ⋮ Linear Absolute Value Relation Analysis ⋮ Pentagons: a weakly relational abstract domain for the efficient validation of array accesses ⋮ Static Contract Checking with Abstract Interpretation ⋮ Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships

Uses Software

• Dagger
• PPL
• Boogie
• SPEED

This page was built for publication: SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities