| | |
Summary: Breaking Up is Hard to Do: An Investigation of
Decomposition for Assume-Guarantee Reasoning
Jamieson M. Cobleigh, George S. Avrunin, and Lori A. Clarke
Department of Computer Science
University of Massachusetts
Amherst, MA 01003, USA
jcobleig@cs.umass.edu, avrunin@cs.umass.edu, clarke@cs.umass.edu
ABSTRACT
Finite-state verification techniques are often hampered by the state-
explosion problem. One proposed approach for addressing this
problem is assume-guarantee reasoning. Using recent advances in
assume-guarantee reasoning that automatically generate assump-
tions, we undertook a study to determine if assume-guarantee rea-
soning provides an advantage over monolithic verification. In this
study, we considered all two-way decompositions for a set of sys-
tems and properties, using two different verifiers, FLAVERS and
LTSA. By increasing the number of repeated tasks, we evaluated
the decompositions as the systems were scaled. In only a few
cases could assume-guarantee reasoning verify properties on larger
|
