An Adaptive EM Algorithm for the Maximum Likelihood Estimation of Non-Homogeneous Poisson Process Software Reliability Growth Models

Author(s):  
Vidhyashree Nagaraju ◽  
Lance Fiondella ◽  
Panlop Zeephongsekul ◽  
Thierry Wandji

Non-homogeneous Poisson process (NHPP) software reliability growth models (SRGM a ) enable quantitative metrics to guide decisions during the software engineering life cycle, including test resource allocation and release planning. However, many SRGM possess complex mathematical forms that make them difficult to apply. Specifically, traditional procedures solve a system of nonlinear equations to identify the numerical parameters that best characterize failure data. Recently, researchers have developed expectation-maximization (EM) algorithms for NHPP SRGM that exhibit better convergence properties and can therefore find maximum likelihood estimates with greater ease. This paper presents an adaptive EM (AEM) algorithm, which combines an earlier EM algorithm for NHPP SRGM with unconstrained search of the model parameter space. Our performance analysis shows that the AEM outperforms state-of-the-art EM algorithms for NHPP SRGM with very strong statistical significance, which is as much as hundreds of times faster on some data sets. Thus, the approach can fit SRGM very quickly. We also incorporate this high performance adaptive EM algorithm into a heuristic nested model selection procedure to objectively select a model of least complexity that best characterizes the failure data. Results indicate this heuristic approach often identifies the model possessing the best model selection criteria. a Acronyms are not pluralized.

Three software reliability growth models (SRGMs) - one proposed by the authors and two existing in literature based on non homogeneous Poisson Process (NHPP) are considered. Combinations of the three models are suggested as super models to measure software reliability. A comparative study of the suggested models is made with reference to three criteria as applied to eight different data sets and is noticed that the suggested model has a good contribution in the combination to come out as a better SRGM model


Author(s):  
SHINJI INOUE ◽  
NAOKI IWAMOTO ◽  
SHIGERU YAMADA

This paper discusses an new approach for discrete-time software reliability growth modeling based on an discrete-time infinite server queueing model, which describes a debugging process in a testing phase. Our approach enables us to develop discrete-time software reliability growth models (SRGMs) which could not be developed under conventional discrete-time modeling approaches. This paper also discuss goodness-of-fit comparisons of our discrete-time SRGMs with conventional continuous-time SRGMs in terms of the criterion of the mean squared errors, and show numerical examples for software reliability analysis of our models by using actual data.


Sign in / Sign up

Export Citation Format

Share Document