Automated circular assume-guarantee reasoning with N-way decomposition and alphabet refinement

Karam Abd Elkader*, Orna Grumberg, Corina S. Păsăreanu, Sharon Shoham

*Corresponding author for this work

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

8 Scopus citations

Abstract

In this work we develop an automated circular reasoning framework that is applicable to systems decomposed into multiple components. Our framework uses a family of circular assume-guarantee rules for which we give conditions for soundness and completeness. The assumptions used in the rules are initially approximate and their alphabets are automatically refined based on the counterexamples obtained from model checking the rule premises. A key feature of the framework is that the compositional rules that are used change dynamically with each iteration of the alphabet refinement, to only use assumptions that are relevant for the current alphabet, resulting in a smaller number of assumptions and smaller state spaces to analyze for each premise. Our preliminary evaluation of the proposed approach shows promising results compared to 2-way and monolithic verification.

Original languageEnglish
Title of host publicationComputer Aided Verification - 28th International Conference, CAV 2016, Proceedings
EditorsAzadeh Farzan, Swarat Chaudhuri
PublisherSpringer Verlag
Pages329-351
Number of pages23
ISBN (Print)9783319415277
DOIs
StatePublished - 2016
Event28th International Conference on Computer Aided Verification, CAV 2016 - Toronto, Canada
Duration: 17 Jul 201623 Jul 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9779
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference28th International Conference on Computer Aided Verification, CAV 2016
Country/TerritoryCanada
CityToronto
Period17/07/1623/07/16

Fingerprint

Dive into the research topics of 'Automated circular assume-guarantee reasoning with N-way decomposition and alphabet refinement'. Together they form a unique fingerprint.

Cite this