Abstract
Opinion is divided over the effectiveness of random testing. It produces test cases cheaply, but struggles with boundary conditions and is labour intensive without an automated oracle. We have created a search-based testing technique that evolves multiple sets of efficient subdomains, from which small but effective test suites can be randomly sampled. The new technique handles boundary conditions by targeting different mutants with each set of subdomains. It achieves an average 230% improvement in mutation score over conventional random testing.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Duran, J.W.: An Evaluation of Random Testing. IEEE Transactions on Software Engineering 10(4), 438–444 (1984)
Arcuri, A., Iqbal, M.Z., Briand, L.: Random Testing: Theoretical Results and Practical Implications. IEEE Transactions on Software Engineering 38(2), 258–277 (2012)
Myers, G.J., Badgett, T., Sandler, C.: The Art of Software Testing. Wiley (2011)
Jia, Y., Harman, H.: An Analysis and Survey of the Development of Mutation Testing. IEEE Transactions on Software Engineering 37(5), 649–678 (2011)
Michael, C.C., McGraw, G., Schatz, M.A.: Generating Software Test Data by Evolution. IEEE Transactions on Software Engineering 27(12), 1085–1110 (2001)
Bäck, T.: Evolutionary Algorithms in Theory and Practice, pp. 66–90. Oxford (1996)
Babb, B., Moore, F., Aldridge, S., Peterson, M.R.: State-of-the-Art Lossy Compression of Martian Images via the CMA-ES Evolution Strategy. In: International Society for Optics and Photonics, vol. 8305, pp. 22–26. SPIE (2012)
Nissen, V., Gold, S.: Survivable Network Design with an Evolution Strategy. In: Jung, J., Shan, Y., Bui, L.T. (eds.) Success in Evolutionary Computation. SCI, pp. 263–283. Springer, Heidelberg (2008)
Jung, J.: Using Evolution Strategy for Cooperative Focused Crawling on Semantic Web. J. Neural Comput. Appl. 18(3), 213–221 (2009)
Hansen, N.: The CMA Evolution Strategy: A Comparing Review. In: Lozano, J.A., Larrañaga, P., Inza, I., Bengoetxea, E. (eds.) Towards a New Evolutionary Computation. StudFuzz, vol. 192, pp. 75–102. Springer, Heidelberg (2006)
Hansen, N., Auger, A., Ros, R., Finck, S., Posik, P.: Comparing Results of 31 Algorithms from BBOB-2009. In: 12th Genetic and Evolutionary Computation Conference, pp. 1689–1696. ACM (2010)
Patrick, M., Alexander, R., Oriol, M., Clark, J.A.: Using Mutation Analysis to Evolve Subdomains for Random Testing. In: 8th International Workshop on Mutation Analysis. IEEE (2013)
Ghani, K., Clark, J.: Widening the Goal Posts: Program Stretching to Aid Search Based Software Testing. In: 1st International Symposium on Search Based Software Engineering, SSBSE (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Patrick, M., Alexander, R., Oriol, M., Clark, J.A. (2013). Efficient Subdomains for Random Testing. In: Ruhe, G., Zhang, Y. (eds) Search Based Software Engineering. SSBSE 2013. Lecture Notes in Computer Science, vol 8084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39742-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-39742-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39741-7
Online ISBN: 978-3-642-39742-4
eBook Packages: Computer ScienceComputer Science (R0)