Skip to Main content Skip to Navigation
Conference papers

A Configurable CEGAR Framework with Interpolation-Based Refinements

Abstract : 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.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01432916
Contributor : Hal Ifip <>
Submitted on : Thursday, January 12, 2017 - 11:34:15 AM
Last modification on : Wednesday, September 25, 2019 - 12:04:06 PM
Long-term archiving on: : Friday, April 14, 2017 - 4:04:56 PM

File

426757_1_En_11_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Á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⟩

Share

Metrics

Record views

152

Files downloads

360