Incrementally closing octagons
From MaRDI portal
Publication:2335904
DOI10.1007/s10703-017-0314-7zbMath1425.68242arXiv1610.02952OpenAlexW2963853010MaRDI QIDQ2335904
Publication date: 18 November 2019
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.02952
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The two variable per inequality abstract domain
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
- Some ways to reduce the space dimension in polyhedra computations
- The octagon abstract domain
- Temporal constraint networks
- Exploiting sparsity in difference-bound matrices
- Learning a variable-clustering strategy for Octagon from labeled data generated by a static analysis
- The octagon abstract domain for continuous constraints
- A Graphical Theorem of the Alternative for UTVPI Constraints
- Simple and Efficient Algorithms for Octagons
- Incremental Satisfiability and Implication for UTVPI Constraints
- A Constraint Solver Based on Abstract Domains
- Access Analysis-Based Tight Localization of Abstract Memories
- On a routing problem
- Taming the Wrapping of Integer Arithmetic
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- Compact Difference Bound Matrices
- Access-Based Localization for Octagons
- Programming Languages and Systems
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
- Frontiers of Combining Systems
- Computer Aided Verification
- A Theorem on Boolean Matrices