Engineering topics

Sofer, A.

Publications and source records attributed to Sofer, A..

3 records

NASA NTRS1985

Completely monotone regression estimates of software failure rates

A method for estimating the present failure rate of a program is presented. A crude nonparameter estimate of the failure rate function is obtained from past failure times. This estimate is then smoothed by fitting a completely monotonic function, which is the solution of a quadratic programming problem. The value of the smoothed function at present time is used as the estimate of present failure rate. Results of a Monte Carlo study of performance are given.

Miller, D. R.↗

NASA NTRS1983

A Bayesian modification to the Jelinski-Moranda software reliability growth model

The Jelinski-Moranda (JM) model for software reliability was examined. It is suggested that a major reason for the poor results given by this model is the poor performance of the maximum likelihood method (ML) of parameter estimation. A reparameterization and Bayesian analysis, involving a slight modelling change, are proposed. It is shown that this new Bayesian-Jelinski-Moranda model (BJM) is mathematically quite tractable, and several metrics of interest to practitioners are obtained. The BJM and JM models are compared by using several sets of real software failure data collected and in all cases the BJM model gives superior reliability predictions. A change in the assumption which underlay both models to present the debugging process more accurately is discussed.

Littlewood, B.↗

NASA NTRS1981

Software models: A Bayesian approach to parameter estimation in the Jelenski-Moranda software reliability model

Maximum likelihood estimation procedures for the Jelinski-Moranda software reliability model often give misleading answers. A reparameterization and a Bayesian analysis eliminate some of the problems incurred by MLE methods and often give better predictions on sets of real and simulated data. Practical difficulties in estimating the initial number of errors N and the failure rate of each error phi by the method of maximum likelihood are: N, the MLE of N, is occasionally infinite (i.e., the routines for calculating N and phi do not converge). It is shown that N is finite sub i only if the regression line of the interevent times t sub i vs. i has positive slope. A serious problem is that often N approximates n, the sample size, and sometimes N = n. Thus the MLE predicts that the program is perfect even when it is far from being so. Only when almost all failures have been removed can N and phi be trusted near the end of debugging.

Littlewood, B.↗