Skip to main content

Cost Reduction in Mutation Testing with Bytecode-Level Mutants Classification

  • Conference paper
  • First Online:
Artificial Intelligence and Soft Computing (ICAISC 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10841))

Included in the following conference series:

Abstract

The paper presents the application of classification based approach to software quality domain. In particular it deals with the issue of reducing the cost of mutation testing. The presented approach is based on the similarity of mutants represented at the bytecode level. The distance matrix for mutants is used in kNN algorithm to predict if a given test set detects a mutant or not. Experimental results are also presented in this paper on the basis of two systems. The obtained results show the usefulness of the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Acree, A.T.: On Mutation, Ph.D. Thesis, Georgia Institute of Technology, Atlanta, Georgia (1980)

    Google Scholar 

  2. Andrews, J.H., Briand, L.C., Labiche, Y.: Is mutation an appropriate tool for testing experiments? In: Proceedings of ICSE, pp. 402–411 (2005)

    Google Scholar 

  3. DeMillo, R.A., Lipton, R.J., Sayward, F.G.: Hints on test data selection: help for the practicing programmer. Computer 11(4), 34–41 (1978)

    Article  Google Scholar 

  4. Derezinska, A., Rudnik, M.: Evaluation of mutant sampling criteria in object-oriented mutation testing. In: Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, FedCSIS 2017, pp. 1315–1324 (2017)

    Google Scholar 

  5. Hussain, S.: Mutation Clustering, Masters Thesis, Kings College London, Strand, London (2008)

    Google Scholar 

  6. Ji, C., Chen, Z., Xu, B., Zhao, Z.: A novel method of mutation clustering based on domain analysis. In: Proceedings of the 21st International Conference on Software Engineering and Knowledge Engineering. Knowledge Systems Institute Graduate School (2009)

    Google Scholar 

  7. Jia, Y., Harman, M.: An analysis and survey of the development of mutation testing. IEEE Trans. Softw. Eng. 37, 649–678 (2011)

    Article  Google Scholar 

  8. Lindholm, T., Yellin, F., Bracha, G., Buckley, A.: The Java Virtual Machine Specification, Java SE 8 Edition, 1st edn. Addison-Wesley Professional, Boston (2015)

    Google Scholar 

  9. Ma, Y., Offutt, J., Kwon, Y.R.: MuJava: a mutation system for java. In: Proceedings of ICSE 2006, pp. 827–830 (2006)

    Google Scholar 

  10. Ma, Y., Offutt, J., Kwon, Y.R.: MuJava: an automated class mutation system. Softw. Test. Verif. Reliab. 15(2), 97–133 (2005)

    Article  Google Scholar 

  11. Mathur, A.P.: Performance, effectiveness, and reliability issues in software testing. In: Proceedings of the 5th International Computer Software and Applications Conference, pp. 604–605 (1991)

    Google Scholar 

  12. Mathur, A.P., Krauser, E.W.: Mutant unification for improved vectorization. Purdue University, West Lafayette, Indiana, Technique report SERC-TR-14-P (1988)

    Google Scholar 

  13. Myers, G., Sandler, C., Badgett, T.: The Art of Software Testing. Wiley, London (2011)

    Google Scholar 

  14. Roman, A.: Testing and Software Quality. PWN, Warsaw (2015). (in Polish)

    Google Scholar 

  15. Strug, J., Strug, B.: Machine learning approach in mutation testing. In: Nielsen, B., Weise, C. (eds.) ICTSS 2012. LNCS, vol. 7641, pp. 200–214. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-34691-0_15

    Chapter  MATH  Google Scholar 

  16. Strug, J., Strug, B.: Classifying mutants with decomposition kernel. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2016. LNCS (LNAI), vol. 9692, pp. 644–654. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39378-0_55

    Chapter  Google Scholar 

  17. Strug, J., Strug, B.: Using classification for cost reduction of applying mutation testing. In: Proceedings of FedCSIS 2017, pp. 99–108 (2017)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Barbara Strug .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Strug, J., Strug, B. (2018). Cost Reduction in Mutation Testing with Bytecode-Level Mutants Classification. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2018. Lecture Notes in Computer Science(), vol 10841. Springer, Cham. https://doi.org/10.1007/978-3-319-91253-0_66

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-91253-0_66

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-91252-3

  • Online ISBN: 978-3-319-91253-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics