What Else Is Decidable about Integer Arrays?
From MaRDI portal
Publication:5458380
DOI10.1007/978-3-540-78499-9_33zbMath1139.03007OpenAlexW1859059663MaRDI QIDQ5458380
Tomáš Vojnar, Peter Habermehl, Radu Iosif
Publication date: 11 April 2008
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_33
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (11)
Decision procedures for flat array properties ⋮ A Logic-Based Framework for Reasoning about Composite Data Structures ⋮ NP satisfiability for arrays as powers ⋮ Inferring complete initialization of arrays ⋮ Relational abstract interpretation of arrays in assembly code ⋮ A solver for arrays with concatenation ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ Path Feasibility Analysis for String-Manipulating Programs ⋮ Iterating Octagons ⋮ Abstraction refinement and antichains for trace inclusion of infinite state systems ⋮ Algorithmic Analysis of Array-Accessing Programs
This page was built for publication: What Else Is Decidable about Integer Arrays?
