Automated Circular Assume-Guarantee Reasoning

Abstract

Abstract. 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.

Assume, Guarantee or Repair

“…Once the learner reaches a stable assumption A i j , it passes it to the equivalence phase (lines [12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27].…”

“…All these works address non-circular rules and are limited to finite state systems. Automatic assumption generation for circular rules is presented in [12,13], using compositional rules similar to the ones studied in [21,23].…”

Performance analysis of Israeli‐Jalfon's algorithm using probabilistic model checking

“…This would entail extending the verification procedure to include the use of probabilistic timed automata, which amounts to being a real‐time extension of the Markov decision process. Another possible research direction would be to employ techniques such as assume‐guarantee to perform compositional model checking, or abstraction‐refinement to verify larger and more complex versions of the model.…”

APML: An Architecture Proof Modeling Language

“…First works in this area go back to Pnueli's work about modular model checking [36] and Clarke's work on compositional model checking [14], in which they investigated possibilities to leverage assumptions about a component's environment for the verification of its implementation. Later on, attempts were made to automatically synthesize minimal assumptions from a component's implementation [7,19,20,35]. In all these studies, the focus is mainly on the verification of component implementations under the presence of assumptions about its environment.…”