An Anytime Approach to Analyzing Software Systems
Dan Rubenstein
Leon Osterweil
Shlomo Zilberstein.
Abstract
Proving that a software system satisfies its requirements
is a costly process. This paper discusses the benefits and
challenges of structuring the analysis of software as an anytime algorithm.
We demonstrate that certain incremental approaches to event sequence
analysis that produce partial results are anytime algorithms, and we show
how these partial results can be used to optimize the time to complete the
full analysis.
Download
[ps]
[pdf]