On some reliability estimation problems in random and partition testing

Random testing is receiving increasing attention in recent years. Aside from its relative simplicity and low cost, studies have shown that random testing is an effective testing strategy. An advantage of random testing is that the reliability of the program can be estimated from the test outcomes. The authors extend the Thayer-Lipow-Nelson reliability model to account for the cost of errors. They also compare random with partition testing by looking at upper confidence bounds for the cost weighted performance of the two strategies.<<ETX>>

[1]  R. Faure,et al.  Introduction to operations research , 1968 .

[2]  N. L. Johnson,et al.  Distributions in Statistics: Discrete Distributions. , 1970 .

[3]  L. Kronsjö Algorithms: Their Complexity and Efficiency , 1979 .

[4]  B. Littlewood Software Reliability Model for Modular Program Structure , 1979, IEEE Transactions on Reliability.

[5]  Joe W. Duran,et al.  Quantifying Software Validity by Sampling , 1980, IEEE Transactions on Reliability.

[6]  C. Read,et al.  Handbook of the normal distribution , 1982 .

[7]  Carlos Urias Munoz,et al.  Automatic Generation of Random Self-Checking Test Cases , 1983, IBM Syst. J..

[8]  J. Patel,et al.  Handbook of the normal distribution , 1983 .

[9]  Simeon C. Ntafos,et al.  An Evaluation of Random Testing , 1984, IEEE Transactions on Software Engineering.

[10]  Victor R. Basili,et al.  Cleanroom Software Development: An Empirical Evaluation , 1987, IEEE Transactions on Software Engineering.

[11]  Harlan D. Mills,et al.  Cleanroom Software Engineering , 1987, IEEE Software.

[12]  R. Taylor,et al.  Partition testing does not inspire confidence , 1988, [1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis.

[13]  Richard G. Hamlet,et al.  Theoretical comparison of testing methods , 1989, TAV3.

[14]  Richard G. Hamlet,et al.  Partition Testing Does Not Inspire Confidence , 1990, IEEE Trans. Software Eng..