What Else Is Decidable about Integer Arrays?
From MaRDI portal
(Redirected from Publication:5458380)
Recommendations
Cited in
(19)- A note on Presburger arithmetic with array segments, permutation and equality
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- NP satisfiability for arrays as powers
- When is scalar multiplication decidable?
- Array theory of bounded elements and its applications
- Counting constraints in flat array fragments
- Decision procedures for flat array properties
- A Logic-Based Framework for Reasoning about Composite Data Structures
- Path Feasibility Analysis for String-Manipulating Programs
- Iterating Octagons
- Algorithmic Analysis of Array-Accessing Programs
- Inferring complete initialization of arrays
- What's decidable about sequences?
- A Logic of Singly Indexed Arrays
- Verification, Model Checking, and Abstract Interpretation
- Abstraction refinement and antichains for trace inclusion of infinite state systems
- Relational abstract interpretation of arrays in assembly code
- A solver for arrays with concatenation
- An input-output relational domain for algebraic data types and functional arrays
This page was built for publication: What Else Is Decidable about Integer Arrays?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458380)