Header

UZH-Logo

Maintenance Infos

Search-based testing of procedural programs: iterative single-target or multi-target approach?


Scalabrino, Simone; Grano, Giovanni; Di Nucci, Dario; Oliveto, Rocco; De Lucia, Andrea (2016). Search-based testing of procedural programs: iterative single-target or multi-target approach? In: Sarro, Federica; Deb, Kalyanmoy. Search Based Software Engineering : 8th International Symposium, SSBSE 2016, Raleigh, NC, USA, October 8-10, 2016, Proceedings. Cham: Springer, 64-79.

Abstract

In the context of testing of Object-Oriented (OO) software systems, researchers have recently proposed search based approaches to automatically generate whole test suites by considering simultaneously all targets (e.g., branches) defined by the coverage criterion (multi-target approach). The goal of whole suite approaches is to overcome the problem of wasting search budget that iterative single-target approaches (which iteratively generate test cases for each target) can encounter in case of infeasible targets. However, whole suite approaches have not been implemented and experimented in the context of procedural programs. In this paper we present OCELOT (Optimal Coverage sEarch-based tooL for sOftware Testing), a test data generation tool for C programs which implements both a state-of-the-art whole suite approach and an iterative single-target approach designed for a parsimonious use of the search budget. We also present an empirical study conducted on 35 open-source C programs to compare the two approaches implemented in OCELOT. The results indicate that the iterative single-target approach provides a higher efficiency while achieving the same or an even higher level of coverage than the whole suite approach.

Abstract

In the context of testing of Object-Oriented (OO) software systems, researchers have recently proposed search based approaches to automatically generate whole test suites by considering simultaneously all targets (e.g., branches) defined by the coverage criterion (multi-target approach). The goal of whole suite approaches is to overcome the problem of wasting search budget that iterative single-target approaches (which iteratively generate test cases for each target) can encounter in case of infeasible targets. However, whole suite approaches have not been implemented and experimented in the context of procedural programs. In this paper we present OCELOT (Optimal Coverage sEarch-based tooL for sOftware Testing), a test data generation tool for C programs which implements both a state-of-the-art whole suite approach and an iterative single-target approach designed for a parsimonious use of the search budget. We also present an empirical study conducted on 35 open-source C programs to compare the two approaches implemented in OCELOT. The results indicate that the iterative single-target approach provides a higher efficiency while achieving the same or an even higher level of coverage than the whole suite approach.

Statistics

Citations

Dimensions.ai Metrics
2 citations in Web of Science®
5 citations in Scopus®
2 citations in Microsoft Academic
Google Scholar™

Altmetrics

Downloads

6 downloads since deposited on 27 Jun 2017
4 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Book Section, refereed, original work
Communities & Collections:03 Faculty of Economics > Department of Informatics
Dewey Decimal Classification:000 Computer science, knowledge & systems
Language:English
Date:2016
Deposited On:27 Jun 2017 07:48
Last Modified:02 Feb 2018 12:29
Publisher:Springer
Series Name:Lecture Notes in Computer Science
Number:9962
ISSN:0302-9743
ISBN:978-3-319-47106-8
OA Status:Closed
Publisher DOI:https://doi.org/10.1007/978-3-319-47106-8_5
Related URLs:https://doi.org/10.1007/978-3-319-47106-8
Other Identification Number:merlin-id:14966

Download