Iterating Octagons

DOI10.1007/978-3-642-00768-2_29zbMath1234.68200OpenAlexW2911894214MaRDI QIDQ3617767

Codruţa Gîrlea, Radu Iosif, Marius Bozga

Publication date: 31 March 2009

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00768-2_29

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30)

Related Items

A Calculus for Modular Loop Acceleration, Verification of Gap-Order Constraint Abstractions of Counter Systems, Algebraic program analysis, A New Acceleration-Based Combination Framework for Array Properties, Verification of gap-order constraint abstractions of counter systems, Bounded underapproximations, Access-Based Localization for Octagons, Iterating Octagons, CTL* model checking for data-aware dynamic systems with arithmetic, Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description), Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm, Using basis dependence distance vectors in the modified Floyd-Warshall algorithm

Uses Software

• FLATA

Cites Work

• The octagon abstract domain
• A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
• On iterating linear transformations over recognizable sets of integers
• Iterating Octagons
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• An Improved Tight Closure Algorithm for Integer Octagonal Constraints
• What Else Is Decidable about Integer Arrays?
• Automated Technology for Verification and Analysis
• A Logic of Singly Indexed Arrays
• Flat Parametric Counter Automata
• Unnamed Item
• Unnamed Item