## 抄録

In counterexample-guided abstraction refinement, a predicate refinement scheme is said to be complete for a given theory if it is guaranteed to eventually find predicates sufficient to prove the given property, when such exist. However, existing complete methods require deciding if a proof of the counterexample’s spuriousness exists in some finite language of predicates. Such an exact finite-language-restricted predicate search is quite hard for many theories used in practice and incurs a heavy overhead. In this paper, we address the issue by showing that the language restriction can be relaxed so that the refinement process is restricted to infer proofs from some finite language L_{base} ∪ L_{ext} but is only required to return a proof when the counterexample’s spuriousness can be proved in L_{base}. Then, we show how a proof-based refinement algorithm can be made to satisfy the relaxed requirement and be complete by restricting only the theory-level reasoning in SMT to emit L_{base} -restricted partial interpolants (while such an approach has been proposed previously, we show for the first time that it can be done for languages that are not closed under conjunctions and disjunctions). We also present a technique that uses a property of counterexample patterns to further improve the efficiency of the refinement algorithm while still satisfying the requirement.We have experimented with a prototype implementation of the new refinement algorithm, and show that it is able to achieve complete refinement with only a small overhead.

本文言語 | English |
---|---|

ホスト出版物のタイトル | Programming Languages and Systems - 24th European Symposiumon Programming, ESOP 2015 held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, Proceedings |

編集者 | Jan Vitek |

出版社 | Springer Verlag |

ページ | 610-633 |

ページ数 | 24 |

ISBN（電子版） | 9783662466681 |

DOI | |

出版ステータス | Published - 2015 |

外部発表 | はい |

イベント | 24th European Symposium on Programming, ESOP 2015 held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015 - London, United Kingdom 継続期間: 2015 4月 11 → 2015 4月 18 |

### 出版物シリーズ

名前 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

巻 | 9032 |

ISSN（印刷版） | 0302-9743 |

ISSN（電子版） | 1611-3349 |

### Conference

Conference | 24th European Symposium on Programming, ESOP 2015 held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015 |
---|---|

国/地域 | United Kingdom |

City | London |

Period | 15/4/11 → 15/4/18 |

## ASJC Scopus subject areas

- 理論的コンピュータサイエンス
- コンピュータ サイエンス（全般）