Pages that link to "Item:Q5458380"
From MaRDI portal
The following pages link to What Else Is Decidable about Integer Arrays? (Q5458380):
Displaying 12 items.
- Decision procedures for flat array properties (Q287272) (← links)
- Inferring complete initialization of arrays (Q383356) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- NP satisfiability for arrays as powers (Q2152659) (← links)
- When is scalar multiplication decidable? (Q2311210) (← links)
- A Logic-Based Framework for Reasoning about Composite Data Structures (Q3184673) (← links)
- Path Feasibility Analysis for String-Manipulating Programs (Q3617764) (← links)
- Iterating Octagons (Q3617767) (← links)
- Algorithmic Analysis of Array-Accessing Programs (Q3644742) (← links)
- Abstraction refinement and antichains for trace inclusion of infinite state systems (Q5919079) (← links)
- Relational abstract interpretation of arrays in assembly code (Q6108433) (← links)
- A solver for arrays with concatenation (Q6156632) (← links)