DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/8545
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPachauri, A.-
dc.date.accessioned2023-01-18T10:00:58Z-
dc.date.available2023-01-18T10:00:58Z-
dc.date.issued2013-05-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0164121212003263-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8545-
dc.description.abstractOne of the problems faced in generating test data for branch coverage using a metaheuristic technique is that the population may not contain any individual that encodes test data for which the execution reaches the predicate node of the target branch. In order to deal with this problem, in this paper, we (a) introduce three approaches for ordering branches for selection as targets for coverage with a genetic algorithm (GA) and (b) experimentally evaluate branch ordering together with elitism and memory to improve test data generation performance. An extensive preliminary study was carried out to help frame the research questions and fine tune GA parameters which were then used in the final experimental study.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectComputer Scienceen_US
dc.subjectAutomated program test data generationen_US
dc.subjectSoftware Testingen_US
dc.subjectGenetic Algorithmsen_US
dc.titleAutomated test data generation for branch testing using genetic algorithm: An improved approach using branch ordering, memory and elitismen_US
dc.typeArticleen_US
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.