Pages that link to "Item:Q3867162"
From MaRDI portal
The following pages link to Verification Decidability of Presburger Array Programs (Q3867162):
Displaying 9 items.
- Semantics of algorithmic languages (Q760200) (← links)
- A note on Presburger arithmetic with array segments, permutation and equality (Q1073009) (← links)
- Complexity, convexity and combinations of theories (Q1141138) (← links)
- Presburger arithmetic with array segments (Q1159191) (← links)
- Array theory of bounded elements and its applications (Q2351149) (← links)
- Decision procedures for extensions of the theory of arrays (Q2457800) (← links)
- Equivalence between model-checking flat counter systems and Presburger arithmetic (Q2636509) (← links)
- The Complexity of Reversal-Bounded Model-Checking (Q3172883) (← links)
- Reasoning about reversal-bounded counter machines (Q6599624) (← links)
