Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-89439-1_39 | LPAR |
Keywords | Field | DocType |
satisfiability problem,integer array,transition rule,array element,flat counter automaton,automata-theoretic argument,quantifier prefix,singly indexed arrays,control state,satisfiability,indexation | Integer,Bounded quantifier,Computer science,Boolean satisfiability problem,Algorithm,Prefix,Decidability,Reachability,Counter automaton,Undecidable problem | Conference |
Volume | ISSN | Citations |
5330 | 0302-9743 | 6 |
PageRank | References | Authors |
0.49 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Habermehl | 1 | 502 | 30.39 |
| Radu Iosif | 2 | 483 | 42.44 |
| Tomás Vojnar | 3 | 136 | 27.58 |