Computer Science – Logic in Computer Science
Scientific paper
2012-04-11
LMCS 8 (2:4) 2012
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-8(2:4)2012
The use of interpolants in model checking is becoming an enabling technology to allow fast and robust verification of hardware and software. The application of encodings based on the theory of arrays, however, is limited by the impossibility of deriving quantifier- free interpolants in general. In this paper, we show that it is possible to obtain quantifier-free interpolants for a Skolemized version of the extensional theory of arrays. We prove this in two ways: (1) non-constructively, by using the model theoretic notion of amalgamation, which is known to be equivalent to admit quantifier-free interpolation for universal theories; and (2) constructively, by designing an interpolating procedure, based on solving equations between array updates. (Interestingly, rewriting techniques are used in the key steps of the solver and its proof of correctness.) To the best of our knowledge, this is the first successful attempt of computing quantifier- free interpolants for a variant of the theory of arrays with extensionality.
Bruttomesso Roberto
Ghilardi Silvio
Ranise Silvio
No associations
LandOfFree
Quantifier-Free Interpolation of a Theory of Arrays 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 Quantifier-Free Interpolation of a Theory of Arrays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantifier-Free Interpolation of a Theory of Arrays will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-716945