Download now Free registration required
In search based test data generation, the problem of test data generation is reduced to that of function minimization or maximization. Traditionally, for branch testing, the problem of test data generation has been formulated as a minimization problem. In this paper, the authors define an alternate maximization formulation and experimentally compare it with the minimization formulation. They use genetic algorithm and binary particle swarm optimization as the search technique and in addition to the usual operators they also employ a branch ordering strategy, memory and elitism.
- Format: PDF
- Size: 2462.1 KB