Automated circular assume-guarantee reasoning

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

9 Scopus citations


Compositional verification techniques aim to decompose the verification of a large system into the more manageable verification of its components. In recent years, compositional techniques have gained significant successes following a breakthrough in the ability to automate assume-guarantee reasoning. However, automation is still restricted to simple acyclic assume-guarantee rules. In this work, we focus on automating circular assume-guarantee reasoning in which the verification of individual components mutually depends on each other. We use a sound and complete circular assume-guarantee rule and we describe how to automatically build the assumptions needed for using the rule. Our algorithm accumulates joint constraints on the assumptions based on (spurious) counterexamples obtained from checking the premises of the rule, and uses a SAT solver to synthesize minimal assumptions that satisfy these constraints. We implemented our approach and compared it with an established learningbased method that uses an acyclic rule. In all cases, the assumptions generated for the circular rule were significantly smaller, leading to smaller verification problems. Further, on larger examples, we obtained a significant speedup as well.

Original languageEnglish
Title of host publicationFM 2015
Subtitle of host publicationFormal Methods - 20th International Symposium, Proceedings
EditorsNikolaj Bjorner, Frank de Boer
PublisherSpringer Verlag
Number of pages17
ISBN (Electronic)9783319192482
StatePublished - 2015
Externally publishedYes
Event20th International Symposium on Formal Methods, FM 2015 - Oslo, Norway
Duration: 24 Jun 201526 Jun 2015

Publication series

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


Conference20th International Symposium on Formal Methods, FM 2015


Dive into the research topics of 'Automated circular assume-guarantee reasoning'. Together they form a unique fingerprint.

Cite this