Recommendations
Cites work
- Access-based localization for octagons
- Exploiting sparsity in difference-bound matrices
- scientific article; zbMATH DE number 1953274 (Why is no real title available?)
- Learning a variable-clustering strategy for Octagon from labeled data generated by a static analysis
- On a routing problem
- On computing the semi-sum of two integers
- Programming Languages and Systems
- Self-Organizing Binary Search Trees
- Simple and efficient algorithms for octagons
- The octagon abstract domain
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
Cited in
(9)- Sparsity preserving algorithms for octagons
- Exploiting sparsity in difference-bound matrices
- Analyzing fractional Horn constraint systems
- Incrementally closing octagons
- Access-based localization for octagons
- An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
- Closing the performance gap between doubles and rationals for octagons
- Memory-efficient fixpoint computation
- The octagon abstract domain
This page was built for publication: Compact Difference Bound Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056006)