An Improved Tight Closure Algorithm for Integer Octagonal Constraints

DOI10.1007/978-3-540-78163-9_6zbMath1138.68474OpenAlexW2097774457MaRDI QIDQ5452703

Patricia M. Hill, Enea Zaffanella, Roberto Bagnara

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture, Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness, Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions, Trichotomy for integer linear systems based on their sign patterns, A certifying algorithm for lattice point feasibility in a system of UTVPI constraints, Splitting the Control Flow with Boolean Flags, Unnamed Item, Algorithms for tight spans and tropical linear spaces, Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants, A combinatorial certifying algorithm for linear feasibility in UTVPI constraints, Exact join detection for convex polyhedra and other numerical abstractions, Unnamed Item, Iterating Octagons, Certified abstract cost analysis, Unnamed Item, Ranking Functions for Linear-Constraint Loops, Incrementally closing octagons

Uses Software

• PPL

Cites Work

• Unnamed Item
• Unnamed Item
• The octagon abstract domain
• Grids: A Domain for Analyzing the Distribution of Numerical Values
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Fast Decision Procedures Based on Congruence Closure
• Static analysis of arithmetical congruences
• Computer Aided Verification
• Programming Languages and Systems
• Frontiers of Combining Systems
• Static Analysis