What Else Is Decidable about Integer Arrays?

Peter Habermehl (1) , Radu Iosif (2) , Tomáš Vojnar (3)

1 Automates et Applications [LIAFA]
2 VERIMAG - IMAG - VERIMAG
3 FIT / BUT - Faculty of Information Technology [Brno]

We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the ∃ * ∀ * first-order fragment and allows (1) Presburger constraints on existentially quantified variables, (2) difference constraints as well as periodicity constraints on universally quantified indices, and (3) difference constraints on values. In particular, using our logic, one can express constraints on consecutive elements of arrays (e.g. ∀i. 0 ≤ i < n → a[i + 1] = a[i] − 1) as well as periodic facts (e.g. ∀i. i ≡ 2 0 → a[i] = 0). The decision procedure follows the automata-theoretic approach: we translate formulae into a special class of Büchi counter automata such that any model of a formula corresponds to an accepting run of the automaton, and vice versa. The emptiness problem for this class of counter automata is shown to be decidable, as a consequence of earlier results on counter automata with a flat control structure and transitions based on difference constraints. We show interesting program properties expressible in our logic, and give an example of invariant verification for programs that handle integer arrays.

Domaines: Logique en informatique [cs.LO]

Peter Habermehl, Radu Iosif, Tomáš Vojnar. What Else Is Decidable about Integer Arrays?. Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Mar 2008, Budapest, Hungary. ⟨10.1007/978-3-540-78499-9_33⟩. ⟨hal-01418914⟩