A combination of rewriting and constraint solving for the quantifier-free interpolation of arrays with integer difference constraints

  • Authors:
  • Roberto Bruttomesso;Silvio Ghilardi;Silvio Ranise

  • Affiliations:
  • Università della Svizzera Italiana, Lugano, Switzerland;Università degli Studi di Milano, Milan, Italy;Fondazione Bruno Kessler, Trento, Italy

  • Venue:
  • FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The use of interpolants in model checking is progressively gaining importance. The application of encodings based on the theory of arrays, however, is limited by the impossibility of deriving quantifierfree interpolants in general. To overcome this problem, we have recently proposed a quantifier-free interpolation solver for a natural variant of the theory of arrays. However, arrays are usually combined with fragments of arithmetic over indexes in applications, especially those related to software verification. In this paper, we propose a quantifier-free interpolation solver for the variant of arrays considered in previous work when combined with integer difference logic over indexes.