Automated assumeguarantee reasoning for omegaregular systems and specifications
 Sagar Chaki,
 Arie Gurfinkel
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
We develop a learningbased automated assumeguarantee (AG) reasoning framework for verifying ωregular properties of concurrent systems. We study the applicability of noncircular (AGNC) and circular (AGC) AG proof rules in the context of systems with infinite behaviors. In particular, we show that AGNC is incomplete when assumptions are restricted to strictly infinite behaviors, while AGC remains complete. We present a general formalization, called LAG, of the learning based automated AG paradigm. We show how existing approaches for automated AG reasoning are special instances of LAG. We develop two learning algorithms for a class of systems, called ∞regular systems, that combine finite and infinite behaviors. We show that for ∞regular systems, both AGNC and AGC are sound and complete. Finally, we show how to instantiate LAG to do automated AG reasoning for ∞regular, and ωregular, systems using both AGNC and AGC as proof rules.
 Title
 Automated assumeguarantee reasoning for omegaregular systems and specifications
 Journal

Innovations in Systems and Software Engineering
Volume 7, Issue 2 , pp 131139
 Cover Date
 201106
 DOI
 10.1007/s1133401101481
 Print ISSN
 16145046
 Online ISSN
 16145054
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 Verification
 Compositional reasoning
 Assume guarantee
 Learning
 Omegaregular languages
 Industry Sectors
 Authors

 Sagar Chaki ^{(1)}
 Arie Gurfinkel ^{(1)}
 Author Affiliations

 1. Software Engineering Institute, Carnegie Mellon University, 4500 Fifth Ave., Pittsburgh, PA, 152132612, USA