DSpace Repository

Automated test data generation for branch testing using genetic algorithm: An improved approach using branch ordering, memory and elitism

Show simple item record

dc.contributor.author Pachauri, A.
dc.date.accessioned 2023-01-18T10:00:58Z
dc.date.available 2023-01-18T10:00:58Z
dc.date.issued 2013-05
dc.identifier.uri https://www.sciencedirect.com/science/article/pii/S0164121212003263
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8545
dc.description.abstract One 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.iso en en_US
dc.publisher Elsevier en_US
dc.subject Computer Science en_US
dc.subject Automated program test data generation en_US
dc.subject Software Testing en_US
dc.subject Genetic Algorithms en_US
dc.title Automated test data generation for branch testing using genetic algorithm: An improved approach using branch ordering, memory and elitism en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account