Lattice-based adaptive random testing

ABSTRACT

Adaptive Random Testing (ART) denotes a family of testing algorithms that have a better performance compared to pure random testing with respect to the number of test cases necessary to detect the first failure. Many of these algorithms, however, are not very efficient regarding runtime. A new ART algorithm is presented that has a better performance than all other ART methods for the block failure pattern. Its runtime is linear in the number of test cases selected, which is nearly as efficient as pure random testing, as opposed to most other ART methods. This new ART algorithm selects the test cases based on a lattice.

REFERENCES

• 1: V. D. Agrawal. When to use random testing. IEEE Transactions on Computers, 27:1054--1055, 1978.
• 2: G. Casella and R. L. Berger. Statistical Inference. Wadsworth Group, Duxbury, CA, USA, 2002.
• 3: F. T. Chan, T. Y. Chen, I. K. Mak, and Y. T. Yu. Proportional sampling strategy: Guidelines for software testing practitioners. Information and Software Technology, 38:775--782, 1996.
• 4: Kwok Ping Chan , Tsong Yueh Chen , Fei-Ching Kuo , Dave Towey, A Revisit of Adaptive Random Testing by Restriction, Proceedings of the 28th Annual International Computer Software and Applications Conference (COMPSAC'04), p.78-85, September 28-30, 2004
• 5: Kwok Ping Chan , Tsong Yueh Chen , Dave Towey, Restricted Random Testing, Proceedings of the 7th International Conference on Software Quality, p.321-330, June 09-13, 2002
• 6: K. P. Chan, T. Y. Chen, and D. Towey. Normalized restricted random testing. In Proceedings of the 18th Ada-Europe International Conference on Reliable Software Technologies, volume 2655 of Lecture Notes in Computer Science, pages 368--381. Springer, 2003.
• 7: T. Y. Chen , R. Merkel , G. Eddy , P. K. Wong, Adaptive Random Testing Through Dynamic Partitioning, Proceedings of the Quality Software, Fourth International Conference on (QSIC'04), p.79-86, September 08-10, 2004 [doi>10.1109/QSIC.2004.6]
• 8: T. Y. Chen, F.-C. Kuo, R. G. Merkel, and S. P. Ng. Mirror adaptive random testing. Information and Software Technology, 46:1001--1010, 2004.
• 9: T. Y. Chen, H. Leung, and I. K. Mak. Adaptive random testing. In M.~J. Maher, editor, Proceedings of the 9th Asian Computing Science Conference (ASIAN 2004), pages 320--329.
• 10: T. Y. Chen , T. H. Tse , Y. T. Yu, Proportional sampling strategy: a compendium and some insights, Journal of Systems and Software, v.58 n.1, p.65-81, August 2001 [doi>10.1016/S0164-1212(01)00028-0]
• 11: J. W. Duran and S. C. Ntafos. An evaluation of random testing. IEEE Transactions on Software Engineering, 10:438--444, 1984.
• 12: Phyllis G. Frankl , Richard G. Hamlet , Bev Littlewood , Lorenzo Strigini, Evaluating Testing Methods by Delivered Reliability, IEEE Transactions on Software Engineering, v.24 n.8, p.586-601, August 1998 [doi>10.1109/32.707695]
• 13: Phyllis Frankl , Dick Hamlet , Bev Littlewood , Lorenzo Strigini, Correction to: Evaluating Testing Methods by Delivered Reliability, IEEE Transactions on Software Engineering, v.25 n.2, p.286, March 1999 [doi>10.1109/TSE.1999.761452]
• 14: R. Hamlet. Random testing. In Encylopedia of Software Engineering, pages 970--978. Wiley, 1994.
• 15: P. S. Loo and W. K. Tsai. Random testing revisited. Information and Software Technology, 30:402--417, 1988.
• 16: Glenford J. Myers, Art of Software Testing, John Wiley & Sons, Inc., New York, NY, 1979
• 17: P. B. Schneck. Comment on "when to use random testing". IEEE Transactions on Computers, 28:580--581, 1979.

INDEX TERMS

Primary Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.5 Testing and Debugging
          Subjects: Testing tools (e.g., data generators, coverage testing)

Additional Classification:
  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS
      Subjects: Reliability and life testing

General Terms:
Verification

Keywords:
adaptive random testing, random testing, test case selection