An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
From MaRDI portal
Recommendations
Cites work
- A canonical form for generalized linear constraints
- A few graph-based relational numerical abstract domains
- Affine relationships among variables of a program
- An improved algorithm for transitive closure on acyclic digraphs
- Difference decision diagrams
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3610766 (Why is no real title available?)
- scientific article; zbMATH DE number 3635493 (Why is no real title available?)
- scientific article; zbMATH DE number 1400094 (Why is no real title available?)
- scientific article; zbMATH DE number 5175527 (Why is no real title available?)
- Improving linear constraint propagation by changing constraint representation
- Model-checking in dense real-time
- Static Analysis in Disjunctive Numerical Domains
- Static analysis of linear congruence equalities among variables of a program
- Trace partitioning in abstract interpretation based static analyzers
Cited in
(7)- Exploiting sparsity in difference-bound matrices
- Donut domains: efficient non-convex domains for abstract interpretation
- A new numerical abstract domain based on difference-bound matrices
- Compact Difference Bound Matrices
- Controller synthesis for timeline-based games
- Clustered relational thread-modular abstract interpretation with local traces
- Controller synthesis for timeline-based games
This page was built for publication: An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452614)