Counterexample guided abstraction refinement is better under equational abstraction

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We introduce an improved version of the equational abstraction for rewrite theories in which the temporal logic used handles also maximal finite paths and the representation of the atomic propositions, by itself, can not lead to useless abstractions. Afterward, we establish a counterexample guided abstraction refinement procedure under equational abstraction and we prove by a consistent example that it may lead to better abstractions than in the case of the classical counterexample guided abstraction refinement procedure under predicate abstraction. The new procedure offers us for free something similar to the localization for predicate abstraction and it is able to reuse the already developed heuristics for discovering predicates that eliminate spurious counterexamples.

Original languageEnglish
Title of host publicationProceedings - Fifteenth IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, ECBS 2008
Pages126-135
Number of pages10
DOIs
Publication statusPublished - 28 May 2008
Externally publishedYes
Event15th IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, ECBS 2008 - Belfast, United Kingdom
Duration: 31 Mar 20084 Apr 2008

Publication series

NameProceedings - Fifteenth IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, ECBS 2008

Conference

Conference15th IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, ECBS 2008
Country/TerritoryUnited Kingdom
CityBelfast
Period31/03/084/04/08

Fingerprint

Dive into the research topics of 'Counterexample guided abstraction refinement is better under equational abstraction'. Together they form a unique fingerprint.

Cite this