What else is decidable about integer arrays?
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F08%3APU76681" target="_blank" >RIV/00216305:26230/08:PU76681 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
What else is decidable about integer arrays?
Original language description
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the $exists^* forall^*$ first-order fragment and allows (1) Presburger constraints on existentially quantified variables, (2) difference constraints aswell 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., $forall i ~.~ 0 leq i < n rightarrow a[i+1]=a[i]-1$) as well as periodic facts (e.g., $forall i ~.~ i equiv_2 0 rightarrow a[i] = 0$). The decision procedure follows the automata-theoretic approach: we translate formulae into a special class of B"uchi counter automata such that anymodel of a formula corresponds to an accepting run of an automaton, and vice versa. The emptiness problem for this class of counter automata is shown to be<br>decidable as a consequence of earlier results on counter automata with a flat c
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA102%2F07%2F0322" target="_blank" >GA102/07/0322: Advanced Formal Approaches in the Design and Verification of Computer-Based Systems</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2008
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Foundations of Software Science and Computation Structures
ISBN
978-3-540-78497-5
ISSN
—
e-ISSN
—
Number of pages
16
Pages from-to
—
Publisher name
Springer Verlag
Place of publication
Berlin
Event location
Budapešť
Event date
Mar 29, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—