Combining Genetic Algorithms and Mutation Testing to Generate Test Sequences

  • Carlos Molinero
  • Manuel Núñez
  • César Andrés
Conference paper

DOI: 10.1007/978-3-642-02478-8_43

Volume 5517 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Molinero C., Núñez M., Andrés C. (2009) Combining Genetic Algorithms and Mutation Testing to Generate Test Sequences. In: Cabestany J., Sandoval F., Prieto A., Corchado J.M. (eds) Bio-Inspired Systems: Computational and Ambient Intelligence. IWANN 2009. Lecture Notes in Computer Science, vol 5517. Springer, Berlin, Heidelberg

Abstract

The goal of this paper is to provide a method to generate efficient and short test suites for Finite State Machines (FSMs) by means of combining Genetic Algorithms (GAs) techniques and mutation testing. In our framework, mutation testing is used in various ways. First, we use it to produce (faulty) systems for the GAs to learn. Second, it is used to sort the intermediate tests with respect to the number of mutants killed. Finally, it is used to measure the fitness of our tests, therefore allowing to reduce redundancy. We present an experiment to show how our approach outperforms other approaches.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Carlos Molinero
    • 1
  • Manuel Núñez
    • 1
  • César Andrés
    • 1
  1. 1.Dept. Sistemas Informáticos y ComputaciónUniversidad Complutense de MadridMadridSpain