Reference: Javier Esparza, Stefan Kiefer, and Stefan Schwoon. Abstraction refinement with Craig interpolation and symbolic pushdown systems. Technical Report 2006/02, Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, January 2006. 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: @techreport{EKS06a,     author = {Javier Esparza and Stefan Kiefer and Stefan Schwoon},     institution = {Universit\"{a}t Stuttgart, Fakult\"{a}t Informatik, Elektrotechnik und Informationstechnik},     month = {January},     number = {2006/02},     title = {Abstraction Refinement with {Craig} Interpolation and Symbolic Pushdown Systems},     year = {2006} }

GZipped PostScript (219 kB) PDF (219 kB) Conference version