Adaptive Random Testing
In this paper, we introduce an enhanced form of random testing called Adaptive Random Testing. Adaptive random testing seeks to distribute test cases more evenly within the input space. It is based on the intuition that for non-point types of failure patterns, an even spread of test cases is more likely to detect failures using fewer test cases than ordinary random testing. Experiments are performed using published programs. Results show that adaptive random testing does outperform ordinary random testing significantly (by up to as much as 50%) for the set of programs under study. These results are very encouraging, providing evidences that our intuition is likely to be useful in improving the effectiveness of random testing.
Unable to display preview. Download preview PDF.
- 2.Hamlet, R.: Random testing. In: Marciniak, J.W. (ed.) Encyclopedia of Software Engineering (1994)Google Scholar
- 6.Association for Computing Machinery: Collected Algorithms from ACM. Association for Computing Machinery, vol. I, II, III (1980)Google Scholar
- 7.Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipes. Cambridge University Press, Cambridge (1986)Google Scholar
- 8.Freund, J.E.: Modern Elementary Statistics, 5th edn. Prentice-Hall, Englewood Cliffs (1979)Google Scholar
- 9.Chen, T.Y., Kuo, F.C., Merkel, R.G., Ng, S.P.: Mirror adaptive random testing. Information and Software Technology (accepted for publication)Google Scholar
- 10.Chen, T.Y., Eddy, G., Merkel, R., Wong, P.K.: Adaptive random testing through dynamic partitioning. In: Proceedings of the 4th International Conference on Quality Software (QSIC 2004). IEEE Computer Society Press, Los Alamitos (2004)Google Scholar