Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
A Logic of Singly Indexed Arrays
verfasst von : Peter Habermehl, Radu Iosif, Tomáš Vojnar
Erschienen in: Logic for Programming, Artificial Intelligence, and Reasoning
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We present a logic interpreted over integer arrays, which allows difference bound comparisons between array elements situated within a constant sized window. We show that the satisfiability problem for the logic is undecidable for formulae with a quantifier prefix { ∃ , ∀ }
*
∀
*
∃
*
∀
*
. For formulae with quantifier prefixes in the ∃
*
∀
*
fragment, decidability is established by an automata-theoretic argument. For each formula in the ∃
*
∀
*
fragment, we can build a flat counter automaton with difference bound transition rules (FCADBM) whose traces correspond to the models of the formula. The construction is modular, following the syntax of the formula. Decidability of the ∃
*
∀
*
fragment of the logic is a consequence of the fact that reachability of a control state is decidable for FCADBM.