Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Breaking Up is Hard to Do: An Evaluation of Automated Assume-Guarantee Reasoning
 

Summary: 7
Breaking Up is Hard to Do: An Evaluation of
Automated Assume-Guarantee Reasoning
JAMIESON M. COBLEIGH, GEORGE S. AVRUNIN,
and LORI A. CLARKE
University of Massachusetts Amherst
Finite-state verification techniques are often hampered by the state-explosion problem. One pro-
posed approach for addressing this problem is assume-guarantee reasoning, where a system under
analysis is partitioned into subsystems and these subsystems are analyzed individually. By com-
posing the results of these analyses, it can be determined whether or not the system satisfies a
property. Because each subsystem is smaller than the whole system, analyzing each subsystem
individually may reduce the overall cost of verification. Often the behavior of a subsystem is de-
pendent on the subsystems with which it interacts, and thus it is usually necessary to provide
assumptions about the environment in which a subsystem executes. Because developing assump-
tions has been a difficult manual task, the evaluation of assume-guarantee reasoning has been
limited. Using recent advances for automatically generating assumptions, we undertook a study
to determine if assume-guarantee reasoning provides an advantage over monolithic verification.
In this study, we considered all two-way decompositions for a set of systems and properties, using
two different verifiers, FLAVERS and LTSA. By increasing the number of repeated tasks in these
systems, we evaluated the decompositions as they were scaled. We found that in only a few cases

  

Source: Avrunin, George S. - Department of Mathematics and Statistics, University of Massachusetts at Amherst

 

Collections: Mathematics