Paper

Search-based Software Testing and Test Data Generation for a Dynamic Programming Language

by S. Mairhofer, R. Feldt and R. Torkar

Manually creating test cases is time consuming and error prone. Search-based software testing can help automate this process and thus reduce time and effort and increase quality by automatically generating relevant test cases. Previous research has mainly focused on static programming languages and simple test data inputs such as numbers. This is not practical for dynamic programming languages that are increasingly used by software developers. Here we present an approach for search-based software testing for dynamically typed programming languages that can generate test scenarios and both simple and more complex test data. The approach is implemented as a tool, RuTeG, in and for the dynamic programming language Ruby. It combines an evolutionary search for test cases that give structural code coverage with a learning component to restrict the space of possible types of inputs. The latter is called for in dynamic languages since we cannot always know statically which types of objects are valid inputs. Experiments on 14 cases taken from real-world Ruby projects show that RuTeG achieves full or higher statement coverage on more cases and does so faster than randomly generated test cases.

Bibtex

@InProceedings{Mairhofer2011Gecco,
  author =    "Stefan Mairhofer and Robert Feldt and Richard Torkar",
  title =     {Search-based Software Testing and Test Data Generation for a Dynamic Programming Language},
  year =      "2011",
  booktitle = "Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)",
  pages =     "1859--1866",
  publisher = "ACM",
  keywords = "Search-based Software Engineering; Testing; Object-oriented programming; Dynamic language",
  url =       "http://www.cse.chalmers.se/~feldt/publications/mairhofer_2011_gecco.html",
}