A Recursive Method for Reliability Computation of Moranda’s Geometric Software Reliability Model

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Paper, PWASET Volume 26, 2007, ISSN 1307-6884, 720-725 c.
The Moranda’s Geometric de-Eutrophication model alleviates some of the objections to the Jelinski Moranda model for software failures. In Moranda Geometric de-Eutrophication model,
N(t) is defined as the number of faults detected in the time interval (0, t]. In this paper, N(t) is studied as a pure birth stochastic process, where failure rates decrease geometrically with a detection and fixing of a fault. This paper demonstrates the use of a recursive scheme to
study the probability of detecting ' n' number of bugs in time (0, t].
The method uses a constructed table which makes this method more easier compared to all the other existing methods to compute the Probability of removal of n number of faults in time (0,t] i.e. Pn (t), intensity function λ(t), and Probability that the software does not fail in the interval (t, t +t ] i.e. (t). In the proposed procedure Pn (t) involves (n +1) terms and each term is multiplied by a constant, obtained from the constructed table. The developed system performs with 90% accuracy as compared to earlier system and approximately 10% reduction in time for projects with
size (delivered object code instructions) in the range of 5000-21000 and the tabular and the recursive technique has made the system simple to understand.

Author(s): Parvinder S.S.

Language: English
Commentary: 788635
Tags: Информатика и вычислительная техника;Надежность информационных систем