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

DOI10.1007/978-3-540-93900-9_20MaRDI QIDQ3600478zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Fast polyhedra abstract domain
• Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
• Verification, Model Checking, and Abstract Interpretation
• Interprocedurally Analysing Linear Inequality Relations
• Verification, Model Checking, and Abstract Interpretation

Cited in

(12)

• Sparsity preserving algorithms for octagons
• On the efficiency of convex polyhedra
• Abstract interpretation of microcontroller code: intervals meet congruences
• Finding relevant templates via the principal component analysis
• Sound bit-precise numerical domains
• Linear absolute value relation analysis
• Static contract checking with abstract interpretation
• Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
• Computing abstract distances in logic programs
• \textsf{TreeKs}: a functor to make numerical abstract domains scalable
• Verification, Model Checking, and Abstract Interpretation
• Pentagons: a weakly relational abstract domain for the efficient validation of array accesses

Describes a project that uses

Uses Software

• PPL
• Dagger
• Boogie
• SPEED

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600478)