Interpolation sequences revisited

This work revisits the formulation of interpolation sequences, in order to better understand their relationships with Bounded Model Checking and with other Unbounded Model Checking approaches relying on standard interpolation. We first focus on different Bounded Model Checking schemes (bound, exact and exact-assume), pointing out their impact on the interpolation-based strategy. Then, we compare the abstraction ability of interpolation sequences with standard interpolation, highlighting their convergence at potentially different sequential depths. We finally propose a tight integration of interpolation sequences with an abstraction-refinement strategy. Our contributions are first presented from a theoretical standpoint, then supported by experimental results (on academic and industrial benchmarks) adopting a state-of-the-art academic tool.

[1]  Daniel Kroening,et al.  Approximation Refinement for Interpolation-Based Model Checking , 2008, VMCAI.

[2]  Joao Marques-Silva.  Improvements to the Implementation of Interpolant-Based Model Checking , 2005, CHARME.

[3]  Ranjit Jhala,et al.  Interpolant-Based Transition Relation Approximation , 2005, CAV.

[4]  Roger Conant Lyndon.  Properties preserved in subdirect products , 1959 .

[5]  William Craig,et al.  Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory , 1957, Journal of Symbolic Logic.

[6]  Orna Grumberg,et al.  Interpolation-sequence based model checking , 2009, 2009 Formal Methods in Computer-Aided Design.

[7]  Kenneth L. McMillan,et al.  Interpolation and SAT-Based Model Checking , 2003, CAV.

[8]  Alan Mishchenko,et al.  A single-instance incremental SAT formulation of proof- and counterexample-based abstraction , 2010, Formal Methods in Computer Aided Design.

[9]  Daniel Kroening,et al.  Predicate Abstraction of ANSI-C Programs Using SAT , 2004, Formal Methods Syst. Des..

[10]  Armando Tacchella,et al.  Benefits of Bounded Model Checking at an Industrial Setting , 2001, CAV.

[11]  Joao Marques-Silva.  Interpolant Learning and Reuse in SAT-Based Model Checking , 2007, Electron. Notes Theor. Comput. Sci..

[12]  R. Lyndon.  An interpolation theorem in the predicate calculus. , 1959 .

[13]  E. Clarke,et al.  Symbolic model checking using SAT procedures instead of BDDs , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).

[14]  Gianpiero Cabodi,et al.  Trading-Off SAT Search and Variable Quantifications for Effective Unbounded Model Checking , 2008, 2008 Formal Methods in Computer-Aided Design.

[15]  G. Cabodi,et al.  Stepping Forward with Interpolants in Unbounded Model Checking , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.