Citation Context

...pts to perform such reasoning focused on hardware systems [McM97, AH99] and the assumptions were provided manually. Recently, a method for automatically generating these assumptions has been proposed =-=[CGP03]-=-. Here, the task of computing an assumption is posed as a machine learning problem, where a learning algorithm for regular languages L ∗ [Ang87, RS93] is used to generate a finite-state assumption in ...

Citation Context

... very small, and often was empty. This will not always be the case, however, so we are exploring how counterexamples can be used to automate assume-guarantee reasoning using the L* learning algorithm =-=[CDP03]-=-. Counterexample generation also raises some interesting issues. We have studied how different variations of the state-propagation algorithm can impact performance, depending on whether consistent or ...

Citation Context

...nstruct environment models using user-provided environment requirements and by examining environment implementations. Finally, our use of learning algorithms is related to the work of Cobleigh et al. =-=[12]-=- (see also [7]) who use the L ∗ algorithm to automatically construct assumptions for compositional verification. In order to verify that the composition of two components C1 and C2 satisfies a safety ...

Citation Context

...k We refer the reader to our earlier papers [FFQ02,FQS02] for a discussion of the related work on verification of multithreaded software by compositional reasoning and model checking. Cobleigh et al. =-=[CGP03]-=- share our motivation of reducing the annotation cost of compositional reasoning. They use a counterexample-guided learning algorithm to infer environment assumptions, an approach that is very differe...

Citation Context

...elevant if irrelevant differences are suppressed. 2 Related Work Recent work has described proof-like and evidence-based counterexamples [7, 22]. Automatically generating assumptions for verification =-=[10]-=- can also be seen as a kind of error explanation. These approaches appear to be unlikely to result in succinct explanations, as they may encode the complexity of the transition system; one measure of ...

Citation Context

...tomatically constructing assumptions using game-theoretic techniques). Our work is inspired by the recent series of papers by the researchers at NASA Ames on compositional verification using learning =-=[12, 7]-=-. Compared to these papers, we believe that our work makes three contributions. First, we present a symbolic implementation of the learning algorithm, and this is essential since the alphabet is expon...

Citation Context

...hat programs obey a restricted class of locking disciplines with respect to thread interactions. Recent work on generation of environment assumptions for optimistic environments has been described in =-=[5, 14]-=-. Their work is aimed at finding environments within which the unit would satisfy its required properties. This is an important direction to pursue for modular program checking, but we also believe th...

Citation Context

...riginally developed to circumvent the difficulties associated with generating exact abstractions, and has recently been implemented as part of a fully automated and incremental verification framework =-=[22]-=-. Among the works most closely resembling ours we note the following. The Bandera project [24] offers tool support for the automated verification of Java programs based on abstract interpretation; the...

Citation Context

...e been considered, as have semi-decision procedures [25]. Note that the algorithm in [25] can be shown to terminate if the whole execution of a thread is assumed to be a transaction. Other techniques =-=[7, 16, 8]-=- try verifying each thread compositionally, by automatically abstracting the environment. Finally, the KISS checker [27] for concurrent programs simulates the executions of a concurrent program by the...

Citation Context

...ons preserve the properties that have been demonstrated at the design level. In previous work, we developed novel techniques for performing automated assume-guarantee verification at the design level =-=[9, 17]-=-. Assume-guarantee reasoning was originally aimed at enabling the stepwise development of concurrent processes, but has more recently been used to decompose the verification of large and complex syste...