An Improved Tight Closure Algorithm for Integer Octagonal Constraints
DOI10.1007/978-3-540-78163-9_6zbMATH Open1138.68474OpenAlexW2097774457MaRDI QIDQ5452703FDOQ5452703
Authors: Roberto Bagnara, Patricia M. Hill, Enea Zaffanella 
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-78163-9_6
Recommendations
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)
Cites Work
- Programming Languages and Systems
- The octagon abstract domain
- Computer Aided Verification
- Title not available (Why is that?)
- Fast Decision Procedures Based on Congruence Closure
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- Title not available (Why is that?)
- Grids: A Domain for Analyzing the Distribution of Numerical Values
- Static analysis of arithmetical congruences
- Frontiers of Combining Systems
- Static Analysis
Cited In (21)
- Iterating Octagons
- Incremental closure for systems of two variables per inequality
- Formalizing the face lattice of polyhedra
- Incrementally closing octagons
- Title not available (Why is that?)
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
- Ranking functions for linear-constraint loops
- Algorithms for tight spans and tropical linear spaces
- On integer closure in a system of unit two variable per inequality constraints
- Splitting the Control Flow with Boolean Flags
- Simple and efficient algorithms for octagons
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
- Certified abstract cost analysis
- An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints
- Exact join detection for convex polyhedra and other numerical abstractions
- Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions
- Trichotomy for integer linear systems based on their sign patterns
- Solving non-linear Horn clauses using a linear Horn clause solver
- Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
Uses Software
This page was built for publication: An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452703)
