Investigating data-flow coverage of classes using evolutionary algorithms

Liaskos, K. and Roper, M. and Wood, M.; (2007) Investigating data-flow coverage of classes using evolutionary algorithms. In: GECCO 2007. Assoc Computing Machinery, GBR, p. 1140. ISBN 9781595936974

[thumbnail of p1140_liaskos.pdf]
Preview
 PDF. Filename: p1140_liaskos.pdf
Final Published Version
Download (160kB)| Preview

Abstract

It is not unusual for a software development organization to expend 40% of total project effort on testing, which call be a very laborious and time-consuming process. Therefore, there is a big necessity for test automation. This paper describes an approach to automatically generate test-data for 00 software exploiting a Genetic Algorithm (GA) to achieve high levels of data-flow (d-u) coverage. A proof-of-concept tool is presented. The experimental results from testing six Java classes helped us identify three categories of problematic test targets, and suggest that in the future full d-u coverage with a reasonable computational cost may be possible if we overcome these obstacles.

ORCID iDs

Liaskos, K. ORCID logoORCID: https://orcid.org/0000-0002-7994-4383, Roper, M. and Wood, M. ORCID logoORCID: https://orcid.org/0000-0002-9449-1036;
CORE (COnnecting REpositories)