Abstract
Despite the importance of random testing approach, it is not used itself, but plays a core role in many testing methods. Based on the intuition that evenly distributed test cases have more chance for revealing non-point pattern failure regions, various Adaptive Random Testing (ART) methods have been proposed. A large portion of this methods such as ART with random partitioning by localization have edge preference problem. This problem would decrease the performance of these methods. In this article the enlarged input domain approach is used for decreasing the edge preference in ART through dynamic partitioning by localization with Restriction. Simulations have shown that the failure detection capability of ART through dynamic partitioning by localization with Restriction and enlarged input domain is comparable and usually better than that of other adaptive random testing approaches.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beizer B (1990) Software testing techniques. Van Nostrand Reinhold, New York
Laski JW, Korel B (1983) A data flow oriented program testing strategy. IEEE Trans Softw Eng 9(3):347–354
Offutt J, Liu S (1999) Generating test data from SOFL specifications. J Syst Softw 49(1):49–62
Offutt J, Liu S, Abdurazik A, Ammann P (2003) Generating test data from state-based specifications. Softw Test Verification Reliab 13(1):25–53
Stocks P, Carrington D (1996) A framework for specification-based testing. IEEE Trans Softw Eng 22(11):777–793
White LJ, Cohen EI (1980) A domain strategy for computer program testing. IEEE Trans Softw Eng 6(3):247–257
Hamlet R (1994) Random testing. Encyclopedia of Software Engineering. Wiley, New York, pp 970–978
Loo PS, Tsai WK (1988) Random testing revisited. Inf Softw Technol 30(7):402–417
Chan FT, Chen TY, Mak IK, Yu YT (1996) Proportional sampling strategy: guidelines for software testing practitioners. Inf Softw Technol 38:775–782
Chen TY, Tse TH, Yu YT (2001) Proportional sampling strategy: a compendium and some insights. J Syst Softw 58:65–81
Mak IK (1997) On the effectiveness of random testing. Master’s thesis. (Department of Computer Science. The University of Melbourne, Melbourne
Chen TY, Eddy G, Merkel R, Wong PK (2004) Adaptive random testing through dynamic partitioning. Accepted to appear in Proceedings of the 4th international conference on quality software (QSIC)
Chen TY, Huang DH (2004) Adaptive random testing by localization in Asia-Pacific software engineering conference. pp 1530–1362
Mayer J, Schneckenburger C (2006) Adaptive random testing with enlarged input domain. In: Sixth international conference on quality software (QSIC’06) IEEE. pp 251–258
Chen TY, leung H, Mak IK (2004) Adaptive random testing. In: 9th Asian computing science conference on computer science. LNC 3321, pp 320–329. Springer, Berlin
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
sabor, K.k., mohsenzadeh, m. (2013). Adaptive Random Testing Through Dynamic Partitioning by Localization with Restriction and Enlarged Input Domain. In: Lu, W., Cai, G., Liu, W., Xing, W. (eds) Proceedings of the 2012 International Conference on Information Technology and Software Engineering. Lecture Notes in Electrical Engineering, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34531-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-34531-9_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34530-2
Online ISBN: 978-3-642-34531-9
eBook Packages: EngineeringEngineering (R0)