An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints

DOI10.1007/978-3-540-69738-1_20zbMath1132.68464OpenAlexW1945542985MaRDI QIDQ5452614

Mathias Péron, Nicolas Halbwachs

Publication date: 4 April 2008

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-69738-1_20

zbMATH Keywords

static analysisdifference-bound matricesabstract domainsalias analysisdisequalities

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Donut Domains: Efficient Non-convex Domains for Abstract Interpretation ⋮ Unnamed Item

Uses Software

• Octagon

Cites Work

• Model-checking in dense real-time
• An improved algorithm for transitive closure on acyclic digraphs
• A canonical form for generalized linear constraints
• Affine relationships among variables of a program
• Improving linear constraint propagation by changing constraint representation
• Static Analysis in Disjunctive Numerical Domains
• Programming Languages and Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints