Verification Decidability of Presburger Array Programs
Journal of the ACM (JACM)
A Decision Procedure for the Correctness of a Class of Programs
Journal of the ACM (JACM)
Parameterized Verification with Automatically Computed Inductive Assertions
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Uniform Derivation of Decision Procedures by Superposition
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Decision Procedure for an Extensional Theory of Arrays
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
A program verifier
Decision procedures for extensions of the theory of arrays
Annals of Mathematics and Artificial Intelligence
A generic framework for reasoning about dynamic networks of infinite-state processes
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
What else is decidable about integer arrays?
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Flat parametric counter automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
What's decidable about arrays?
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Automatic Verification of Integer Array Programs
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
What's decidable about sequences?
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
On array theory of bounded elements
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Array Theory of Bounded Elements and its Applications
Journal of Automated Reasoning
| Hi-index | 0.00 |
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.