Skip to main content

A Framework for Mutant Genetic Generation for WS-BPEL

  • Conference paper
SOFSEM 2009: Theory and Practice of Computer Science (SOFSEM 2009)

Abstract

The rise of Web Services and their WS-BPEL compositions in recent years makes necessary to pay special attention to testing in this context. Mutation testing is a white box testing technique that has been applied successfully to programs written in different languages. In order to apply it we need a set of mutation operators and a system for mutant generation. This paper introduces a set of mutation operators for the WS-BPEL 2.0 language and a framework, based in genetic algorithms, for automatic mutant generation without rendering all possible mutants. This framework can also detect potentially equivalent mutants.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Papazoglou, M.: Web services technologies and standards. Computing Surveys (submitted)

    Google Scholar 

  2. OASIS: Web services business process execution language 2.0 (2007), http://docs.oasis-open.org/wsbpel/2.0/OS/wsbpel-v2.0-OS.html

  3. Woodward, M.R.: Mutation testing —its origin and evolution. Information and Software Technology 35(3), 163–169 (1993)

    Article  Google Scholar 

  4. Offutt, J., Untch, R.H.: Mutation 2000: uniting the orthogonal. In: Mutation testing for the new century, pp. 34–44. Kluwer Academic Publishers, Norwell (2001)

    Chapter  Google Scholar 

  5. Michalewicz, Z.: Genetic algorithms + data structures = Evolution programs. Springer, Heidelberg (1992)

    Book  MATH  Google Scholar 

  6. Zhu, H., Hall, P., May, J.: Software unit test coverage and adequacy. ACM Computing Surveys 29(4), 366–427 (1997)

    Article  Google Scholar 

  7. Mantere, T., Alander, J.T.: Evolutionary software engineering, a review. Applied Soft Computing 5(3), 315–331 (2005)

    Article  Google Scholar 

  8. Agrawal, H., Demillo, R., Hathaway, R., Hsu, W., Hsu, W., Krauser, E., Martin, R.J., Mathur, A., Spafford, E.: Design of mutant operators for the C programming language. Tech. Rep. SERC-TR-41-P (1989)

    Google Scholar 

  9. King, K.N., Offutt, J.: A Fortran language system for mutation-based software testing. Software - Practice and Experience 21(7), 685–718 (1991)

    Article  Google Scholar 

  10. Offutt, J., Voas, J., Payne, J.: Mutation operators for Ada. Tech. Rep. ISSE-TR-96-09 (1996)

    Google Scholar 

  11. Tuya, J., Suárez-Cabal, M.J., de la Riva, C.: Mutating database queries. Information and Software Technology 49(4), 398–417 (2007)

    Article  Google Scholar 

  12. Estero Botaro, A., Palomo Lozano, F., Medina Bulo, I.: Mutation operators for WS-BPEL 2.0. In: ICSSEA 2008: Proceedings of the 21th International Conference on Software & Systems Engineering and their Applications, Paris, France (to be published) (December 2008)

    Google Scholar 

  13. Goldberg, D.E.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  14. Ma, Y.S., Offutt, J., Kwon, Y.R.: Mujava: an automated class mutation system. Software Testing, Verification & Reliability 15(2), 97–133 (2005)

    Article  Google Scholar 

  15. Delamaro, M., Maldonado, J.: Proteum–a tool for the assessment of test adequacy for C programs. In: Proceedings of the Conference on Performability in Computing System (PCS 1996), pp. 79–95 (1996)

    Google Scholar 

  16. Bottaci, L.: Instrumenting programs with flag variables for test data search by genetic algorithms. In: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1337–1342 (2002)

    Google Scholar 

  17. Adamopoulos, K., Harman, M., Hierons, R.M.: How to overcome the equivalent mutant problem and achieve tailored selective mutation using co-evolution. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 1338–1349. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Domínguez-Jiménez, J.J., Estero-Botaro, A., Medina-Bulo, I. (2009). A Framework for Mutant Genetic Generation for WS-BPEL. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds) SOFSEM 2009: Theory and Practice of Computer Science. SOFSEM 2009. Lecture Notes in Computer Science, vol 5404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95891-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-95891-8_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-95890-1

  • Online ISBN: 978-3-540-95891-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics