A Configurable CEGAR Framework with Interpolation-Based Refinements - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

A Configurable CEGAR Framework with Interpolation-Based Refinements


Correctness of software components in a distributed system is a key issue to ensure overall reliability. Formal verification techniques such as model checking can show design flaws at early stages of development. Abstraction is a key technique for reducing complexity by hiding information, which is not relevant for verification. Counterexample-Guided Abstraction Refinement (CEGAR) is a verification algorithm that starts from a coarse abstraction and refines it iteratively until the proper precision is obtained. Many abstraction types and refinement strategies exist for systems with different characteristics. In this paper we show how these algorithms can be combined into a configurable CEGAR framework. In our framework we also present a new CEGAR configuration based on a combination of abstractions, being able to perform better for certain models. We demonstrate the use of the framework by comparing several configurations of the algorithms on various problems, identifying their advantages and shortcomings.
Fichier principal
Vignette du fichier
426757_1_En_11_Chapter.pdf (363.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01432916 , version 1 (12-01-2017)





Ákos Hajdu, Tamás Tóth, András Vörös, István Majzik. A Configurable CEGAR Framework with Interpolation-Based Refinements. 36th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2016, Heraklion, Greece. pp.158-174, ⟨10.1007/978-3-319-39570-8_11⟩. ⟨hal-01432916⟩
57 View
119 Download



Gmail Facebook Twitter LinkedIn More