Reference:

Javier Esparza, Stefan Kiefer, and Stefan Schwoon. Abstraction refinement with Craig interpolation and symbolic pushdown systems. Journal on Satisfiability, Boolean Modeling and Computation, 5:27–56, June 2008. Special Issue on Constraints to Formal Verification.

Abstract:

Counterexample-guided abstraction refinement (CEGAR) has proven to be a powerful method for software model-checking. In this paper, we investigate this concept in the context of sequential (possibly recursive) programs whose statements are given as BDDs. We examine how Craig interpolants can be computed efficiently in this case and propose a new, special type of interpolants. Moreover, we show how to treat multiple counterexamples in one refinement cycle. We have implemented this approach within the model-checker Moped and report on experiments.

Suggested BibTeX entry:

@article{EKS08b,
    author = {Javier Esparza and Stefan Kiefer and Stefan Schwoon},
    journal = {Journal on Satisfiability, Boolean Modeling and Computation},
    month = {June},
    note = {Special Issue on Constraints to Formal Verification},
    pages = {27--56},
    title = {Abstraction Refinement with {Craig} Interpolation and Symbolic Pushdown Systems},
    volume = {5},
    year = {2008}
}