Reference : Random or Evolutionary Search for Object-Oriented Test Suite Generation?
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/35212
Random or Evolutionary Search for Object-Oriented Test Suite Generation?
English
Shamshiri [> >]
Rojas [> >]
Gazzola [> >]
Fraser [> >]
McMinn [> >]
Mariani [> >]
Arcuri, Andrea mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
In press
Software Testing, Verification & Reliability
John Wiley & Sons
Yes (verified by ORBilu)
0960-0833
1099-1689
[en] An important aim in software testing is constructing a test suite with high structural code coverage
– that is, ensuring that most if not all of the code under test has been executed by the test cases
comprising the test suite. Several search-based techniques have proved successful at automatically
generating tests that achieve high coverage. However, despite the well-established arguments
behind using evolutionary search algorithms (e.g., genetic algorithms) in preference to random
search, it remains an open question whether the benefits can actually be observed in practice
when generating unit test suites for object-oriented classes. In this paper, we report an empirical
study on the effects of using evolutionary algorithms (including a genetic algorithm and chemical
reaction optimization) to generate test suites, compared with generating test suites incrementally
with random search. We apply the EVOSUITE unit test suite generator to 1,000 classes randomly
selected from the SF110 corpus of open source projects. Surprisingly, the results show that the
difference is much smaller than one might expect: While evolutionary search covers more branches
of the type where standard fitness functions provide guidance, we observed that, in practice, the
vast majority of branches do not provide any guidance to the search. These results suggest that,
although evolutionary algorithms are more effective at covering complex branches, a random
search may suffice to achieve high coverage of most object-oriented classes.
http://hdl.handle.net/10993/35212
FnR ; FNR3949772 > Lionel Briand > VVLAB > Validation and Verification Laboratory > 01/01/2012 > 31/07/2018 > 2010

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
paper.pdfAuthor preprint524.74 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.