It really does matter how you normalize the branch distance in search‐based software testing

Abstract

SUMMARY The use of search algorithms for test data generation has seen many successful results. For structural criteria like branch coverage, heuristics have been designed to help the search. The most common heuristic is the use of approach level (usually represented with an integer) to reward test cases whose executions get close (in the control flow graph) to the target branch. To solve the constraints of the predicates in the control flow graph, the branch distance is commonly employed. These two measures are linearly combined. Since the approach level is more important, the branch distance is normalized, often in the range [0, 1]. In this paper, different types of normalizing functions are analyzed. The analyses show that the one that is usually employed in the literature has several flaws. The paper presents a different normalizing function that is very simple and does not suffer from these limitations. Empirical and analytical analyses are carried out to compare these two functions. In particular, their effect is studied on commonly used search algorithms, such as Hill Climbing, Simulated Annealing and Genetic Algorithms. Copyright © 2011 John Wiley & Sons, Ltd.

1600 faults in 100 projects: automatically finding faults while achieving high coverage with EvoSuite

“…ν is a normalization function [1] in the range [0,1]. This leads to the following (minimizing) fitness function for branch coverage:…”

Ensuring the Observability of Structural Test Obligations

“…For that same reason, they are ideal as test generation targets [52,44,35], as coverage can be straightforwardly measured and optimized for [5].…”

Coverage-Aware Test Database Reduction

“…Several approaches to normalize the distances are given in the literature such as that defined by Baresel [93] which expressed the normalized distance as 1-1.001 -dist . However, this kind of normalization has some drawbacks [94]. The problem of searching for solutions in the context of the reduction of frames, which is the subject of this section, has some particularities that have to be handled:…”