DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/8164
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRohil, Mukesh Kumar-
dc.date.accessioned2022-12-27T10:00:18Z-
dc.date.available2022-12-27T10:00:18Z-
dc.date.issued2013-
dc.identifier.urihttps://ieeexplore.ieee.org/abstract/document/6514229/authors#authors-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8164-
dc.description.abstractGenetic algorithms have been successfully applied in the area of software testing. The demand for automation of test case generation in object oriented software testing is increasing. Extensive tests can only be achieved through a test automation process. The benefits achieved through test automation include lowering the cost of tests and consequently, the cost of whole process of software development. Several studies have been performed using this technique for automation in generating test data but this technique is expensive and cannot be applied properly to programs having complex structures. Since, previous approaches in the area of object-oriented testing are limited in terms of test case feasibility due to call dependences and runtime exceptions. This paper proposes a strategy for evaluating the fitness of both feasible and unfeasible test cases leading to the improvement of evolutionary search by achieving higher coverage and evolving more number of unfeasible test cases into feasible ones.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectComputer Scienceen_US
dc.subjectGenetic Algorithmsen_US
dc.subjectObject oriented testingen_US
dc.subjectTest automationen_US
dc.subjectFitness functionen_US
dc.titleImproving GA based automated test data generation technique for object oriented softwareen_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.