What's Decidable About Sequences?

The authors present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of data structures such as lists and queues. They give a decision procedure for the quantifier-free fragment, based on an encoding into the first-order theory of concatenation; the procedure has PSPACE complexity. The quantifier-free fragment of the theory of sequences can express properties such as sortedness and injectivity, as well as Boolean combinations of periodic and arithmetic facts relating the elements of the sequence and their positions (e.g., "For all even i's, the element at position i has value i + 3 or 2i").

Provided by: ETH Zurich Topic: Software Date Added: Feb 2011 Format: PDF

Find By Topic