Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/8137
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPanda, M.
dc.contributor.authorMohapatra, D.P.
dc.date.accessioned2020-03-30T10:18:07Z-
dc.date.available2020-03-30T10:18:07Z-
dc.date.issued2014
dc.identifier.citationAdvances in Intelligent Systems and Computing, 2014, Vol.216, , pp.367-379en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/8137-
dc.description.abstractIn this paper, we have developed an approach to generate test data for path coverage based testing using genetic algorithm. We have used control flow graph and cyclomatic complexity of the example program to find out the number of feasible paths present in the program and compared it with the actual number of paths covered by genetic algorithm. We have used genetic algorithm for generating test data automatically. We have shown that our algorithm is giving cent percent coverage, successfully covering all feasible paths. In our approach, we have observed that genetic algorithm is much more effective in generating test data within less time period, giving better coverage. � Springer India 2014.en_US
dc.titleGenerating test data for path coverage based testing using genetic algorithmsen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

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.