Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/8547
Title: | Program Test Data Generation for branch coverage with genetic algorithm: comparative evaluation of a maximization and minimization approach” in First International workshop on Software Engineering and Applications |
Authors: | Pachauri, A. |
Keywords: | Computer Science Search based test data generation Program test data generation Genetic algorithm |
Issue Date: | 2012 |
Publisher: | AIRCJJ |
Abstract: | 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 we define an alternate maximization formulation and experimentally compare it with the minimization formulation. We use a genetic algorithm as the search technique and in addition to the usual genetic algorithm operators we also employ the path prefix strategy as a branch ordering strategy and memory and elitism. Results indicate that there is no significant difference in the performance or the coverage obtained through the two approaches and either could be used in test data generation when coupled with the path prefix strategy, memory and elitism. |
URI: | https://airccj.org/CSCP/vol2/csit2140.pdf http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8547 |
Appears in Collections: | Department of Computer Science and Information Systems |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.