Reformulating Branch Coverage as a Many-Objective Optimization Problem

A. Panichella, Fitsum Meshesha Kifetew, Paolo Tonella

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

Abstract

Test data generation has been extensively investigated as a search problem, where the search goal is to maximize the number of covered program elements (e.g., branches). Recently, the whole suite approach, which combines the fitness functions of single branches into an aggregate, test suite-level fitness, has been demonstrated to be superior to the traditional single-branch at a time approach. In this paper, we propose to consider branch coverage directly as a many-objective optimization problem, instead of aggregating multiple objectives into a single value, as in the whole suite approach. Since programs may have hundreds of branches (objectives), traditional many-objective algorithms that are designed for numerical optimization problems with less than 15 objectives are not applicable. Hence, we introduce a novel highly scalable many-objective genetic algorithm, called MOSA (Many-Objective Sorting Algorithm), suitably defined for the many-objective branch coverage problem. Results achieved on 64 Java classes indicate that the proposed many-objective algorithm is significantly more effective and more efficient than the whole suite approach. In particular, effectiveness (coverage) was significantly improved in 66% of the subjects and efficiency (search budget consumed) was improved in 62% of the subjects on which effectiveness remains the same.
Original languageEnglish
Title of host publicationIEEE 8th International Conference on Software Testing, Verification and Validation
PublisherIEEE
Number of pages10
Edition2015
ISBN (Electronic)978-1-4799-7125-1
DOIs
Publication statusPublished - 7 May 2015
EventICST 2015: 8th International Conference on Software Testing, Verification and Validation - Graz, Australia
Duration: 13 Apr 201517 Apr 2015
Conference number: 8

Conference

ConferenceICST 2015: 8th International Conference on Software Testing, Verification and Validation
Abbreviated titleICST 2015
CountryAustralia
CityGraz
Period13/04/1517/04/15

Fingerprint Dive into the research topics of 'Reformulating Branch Coverage as a Many-Objective Optimization Problem'. Together they form a unique fingerprint.

Cite this