Complete instantiation-based interpolation

Nishant Totla, Thomas Wies

Research output: Contribution to journalArticle

Abstract

Craig interpolation has been a valuable tool for formal methods with interesting applications in program analysis and verification. Modern SMT solvers implement interpolation procedures for the theories that are most commonly used in these applications. However, many application-specific theories remain unsupported, which limits the class of problems to which interpolation-based techniques apply. In this paper, we present a generic framework to build new interpolation procedures via reduction to existing interpolation procedures. We consider the case where an application-specific theory can be formalized as an extension of a base theory with additional symbols and axioms. Our technique uses finite instantiation of the extension axioms to reduce an interpolation problem in the theory extension to one in the base theory. We identify a model-theoretic criterion that allows us to detect the cases where our technique is complete. We discuss specific theories that are relevant in program verification and that satisfy this criterion. In particular, we obtain complete interpolation procedures for theories of arrays and linked lists. The latter is the first complete interpolation procedure for a theory that supports reasoning about complex shape properties of heap-allocated data structures. We have implemented this procedure in a prototype on top of existing SMT solvers and used it to automatically infer loop invariants of list-manipulating programs.

Original languageEnglish (US)
Pages (from-to)537-548
Number of pages12
JournalACM SIGPLAN Notices
Volume48
Issue number1
DOIs
StatePublished - Jan 2013

Fingerprint

Interpolation
Surface mount technology
Formal methods
Data structures

Keywords

  • Craig interpolants
  • Data structures
  • Decision procedures
  • Program analysis
  • Satisfiability module theories

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Complete instantiation-based interpolation. / Totla, Nishant; Wies, Thomas.

In: ACM SIGPLAN Notices, Vol. 48, No. 1, 01.2013, p. 537-548.

Research output: Contribution to journalArticle

Totla, Nishant ; Wies, Thomas. / Complete instantiation-based interpolation. In: ACM SIGPLAN Notices. 2013 ; Vol. 48, No. 1. pp. 537-548.
@article{176fef7b42b4421b9137309baacbfada,
title = "Complete instantiation-based interpolation",
abstract = "Craig interpolation has been a valuable tool for formal methods with interesting applications in program analysis and verification. Modern SMT solvers implement interpolation procedures for the theories that are most commonly used in these applications. However, many application-specific theories remain unsupported, which limits the class of problems to which interpolation-based techniques apply. In this paper, we present a generic framework to build new interpolation procedures via reduction to existing interpolation procedures. We consider the case where an application-specific theory can be formalized as an extension of a base theory with additional symbols and axioms. Our technique uses finite instantiation of the extension axioms to reduce an interpolation problem in the theory extension to one in the base theory. We identify a model-theoretic criterion that allows us to detect the cases where our technique is complete. We discuss specific theories that are relevant in program verification and that satisfy this criterion. In particular, we obtain complete interpolation procedures for theories of arrays and linked lists. The latter is the first complete interpolation procedure for a theory that supports reasoning about complex shape properties of heap-allocated data structures. We have implemented this procedure in a prototype on top of existing SMT solvers and used it to automatically infer loop invariants of list-manipulating programs.",
keywords = "Craig interpolants, Data structures, Decision procedures, Program analysis, Satisfiability module theories",
author = "Nishant Totla and Thomas Wies",
year = "2013",
month = "1",
doi = "10.1145/2480359.2429132",
language = "English (US)",
volume = "48",
pages = "537--548",
journal = "ACM SIGPLAN Notices",
issn = "1523-2867",
publisher = "Association for Computing Machinery (ACM)",
number = "1",

}

TY - JOUR

T1 - Complete instantiation-based interpolation

AU - Totla, Nishant

AU - Wies, Thomas

PY - 2013/1

Y1 - 2013/1

N2 - Craig interpolation has been a valuable tool for formal methods with interesting applications in program analysis and verification. Modern SMT solvers implement interpolation procedures for the theories that are most commonly used in these applications. However, many application-specific theories remain unsupported, which limits the class of problems to which interpolation-based techniques apply. In this paper, we present a generic framework to build new interpolation procedures via reduction to existing interpolation procedures. We consider the case where an application-specific theory can be formalized as an extension of a base theory with additional symbols and axioms. Our technique uses finite instantiation of the extension axioms to reduce an interpolation problem in the theory extension to one in the base theory. We identify a model-theoretic criterion that allows us to detect the cases where our technique is complete. We discuss specific theories that are relevant in program verification and that satisfy this criterion. In particular, we obtain complete interpolation procedures for theories of arrays and linked lists. The latter is the first complete interpolation procedure for a theory that supports reasoning about complex shape properties of heap-allocated data structures. We have implemented this procedure in a prototype on top of existing SMT solvers and used it to automatically infer loop invariants of list-manipulating programs.

AB - Craig interpolation has been a valuable tool for formal methods with interesting applications in program analysis and verification. Modern SMT solvers implement interpolation procedures for the theories that are most commonly used in these applications. However, many application-specific theories remain unsupported, which limits the class of problems to which interpolation-based techniques apply. In this paper, we present a generic framework to build new interpolation procedures via reduction to existing interpolation procedures. We consider the case where an application-specific theory can be formalized as an extension of a base theory with additional symbols and axioms. Our technique uses finite instantiation of the extension axioms to reduce an interpolation problem in the theory extension to one in the base theory. We identify a model-theoretic criterion that allows us to detect the cases where our technique is complete. We discuss specific theories that are relevant in program verification and that satisfy this criterion. In particular, we obtain complete interpolation procedures for theories of arrays and linked lists. The latter is the first complete interpolation procedure for a theory that supports reasoning about complex shape properties of heap-allocated data structures. We have implemented this procedure in a prototype on top of existing SMT solvers and used it to automatically infer loop invariants of list-manipulating programs.

KW - Craig interpolants

KW - Data structures

KW - Decision procedures

KW - Program analysis

KW - Satisfiability module theories

UR - http://www.scopus.com/inward/record.url?scp=84877884742&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877884742&partnerID=8YFLogxK

U2 - 10.1145/2480359.2429132

DO - 10.1145/2480359.2429132

M3 - Article

VL - 48

SP - 537

EP - 548

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

SN - 1523-2867

IS - 1

ER -