A Likelihood-Based Stopping Rule for Recapture Debugging

Abstract

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.. Biometrika Trust is collaborating with JSTOR to digitize, preserve and extend access to Biometrika. SUMMARY Consideration is given to determining when all the faults in a reliability system have been detected, assuming the use of the recapture debugging procedure introduced by Nayak (1988). A stopping rule based on the likelihood ratio is proposed. Compared to the stopping rule suggested by Nayak, this likelihood-based rule makes better use of the available information, and, for a given error level, yields a small reduction in the average time taken to reach a decision. A generalization is suggested for the situation where the faults in the software can be categorized into two or more classes, between which detection rates are permitted to differ.Some key words: Average time to termination; Likelihood ratio; Markov chain; Software reliability.