Date of Award

Winter 1991

Document Type

Dissertation

Degree Name

Doctor of Philosophy (PhD)

Department

Mathematics and Statistics

Program/Concentration

Computational and Applied Mathematics

Committee Director

Larry D. Lee

Committee Member

Edward Markowski

Committee Member

Ram C. Dahiya

Committee Member

John P. Morgan

Abstract

Nayak's (1988) model for the detection, removal, and recapture of the errors in a computer program is extended to a larger family of models in which the probabilities that the successive programs produce errors are described by the tail probabilities of discrete distribution on the positive integers. Confidence limits are derived for the probability that the final program produces errors. A comparison of the asymptotic variances of parameter estimates given by the error recapture and by the repetitive-run procedure of Nagel, Scholz, and Skrivan (1982) is made to determine which of these procedures efficiently uses the test time.

DOI

10.25777/73h9-np83

Share

COinS