A Theoretical and Empirical Analysis of the Role of Test Sequence Length in Software Testing for Structural Coverage

• Published in: IEEE transactions on software engineering Vol. 38; no. 3; pp. 497 - 519
• Main Author: Arcuri, A.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01-05-2012; IEEE Computer Society
• Subjects: Algorithm design and analysis; Benchmarks; Containers; Evolutionary testing; length; Object oriented programming; object-oriented software; Search problems; search-based software engineering; Software; Software algorithms; Software engineering; Software testing; state problem; Studies; test sequence; Test systems
• ISSN: 0098-5589; 1939-3520
• DOI: 10.1109/TSE.2011.44

In the presence of an internal state, often a sequence of function calls is required to test software. In fact, to cover a particular branch of the code, a sequence of previous function calls might be required to put the internal state in the appropriate configuration. Internal states are not only present in object-oriented software, but also in procedural software (e.g., static variables in C programs). In the literature, there are many techniques to test this type of software. However, to the best of our knowledge, the properties related to the choice of the length of these sequences have received only a little attention in the literature. In this paper, we analyze the role that the length plays in software testing, in particular branch coverage. We show that, on "difficult" software testing benchmarks, longer test sequences make their testing trivial. Hence, we argue that the choice of the length of the test sequences is very important in software testing. Theoretical analyses and empirical studies on widely used benchmarks and on an industrial software are carried out to support our claims.