Hypervolume-based search for test case prioritization

D. Di Nucci, Annibale Panichella, Andy Zaidman, Andrea De Lucia

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    19 Citations (Scopus)


    Test case prioritization (TCP) is aimed at finding an ideal ordering for executing the available test cases to reveal faults earlier. To solve this problem greedy algorithms and meta-heuristics have been widely investigated, but in most cases there is no statistically significant difference between them in terms of effectiveness. The fitness function used to guide meta-heuristics condenses the cumulative coverage scores achieved by a test case ordering using the Area Under Curve (AUC) metric. In this paper we notice that the AUC metric represents a simplified version of the hypervolume metric used in many objective optimization and we propose HGA, a Hypervolume-based Genetic Algorithm, to solve the TCP problem when using multiple test criteria. The results shows that HGA is more cost-effective than the additional greedy algorithm on large systems and on average requires 36% of the execution time required by the additional greedy algorithm.
    Original languageEnglish
    Title of host publicationSSBSE 2015: Search-Based Software Engineering
    Publication statusPublished - 2015


    Dive into the research topics of 'Hypervolume-based search for test case prioritization'. Together they form a unique fingerprint.

    Cite this