Random or evolutionary search for object‐oriented test suite generation?. (30th March 2018)

• Record Type: Journal Article
• Authors: Shamshiri, Sina; Rojas, José Miguel; Gazzola, Luca; Fraser, Gordon; McMinn, Phil; Mariani, Leonardo; Arcuri, Andrea
• Is Part Of: Software testing, verification & reliability. Volume 28:Number 4(2018)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2018-03-30
• Subjects: automated software testing -- automated test generation -- chemical reaction optimization -- genetic algorithms -- random search -- search‐based software testing; Computer software -- Testing -- Periodicals; Computer software -- Verification -- Periodicals; Computer software -- Reliability -- Periodicals; 005.14
• DOI: 10.1002/stvr.1660
• Languages: English
• ISSNs: 0960-0833

Abstract

Summary: 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 have 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 (eg, 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 EVO SUITE unit test suite generator to 1000 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. Abstract : This paper reports an empirical study on the effects of using evolutionary algorithms to generate test suites, compared to generating test suites incrementally with random search. We show 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.