Computer Science – Logic in Computer Science
Scientific paper
2010-01-13
Computer Science
Logic in Computer Science
Fixed a few lapses in the Mergesort example
Scientific paper
We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We 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"). The resulting expressive power is orthogonal to that of the most expressive decidable logics for arrays. Some examples demonstrate that the fragment is also suitable to reason about sequence-manipulating programs within the standard framework of axiomatic semantics.
No associations
LandOfFree
What's Decidable About Sequences? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with What's Decidable About Sequences?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and What's Decidable About Sequences? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-524991