%0 Journal Article %1 pmaragathavalli2013evolutionary %A P.Maragathavalli, %A S.Kanmani, %D 2013 %E ACEEE, %J ACEEE Int. J. on Information Technology %K al ath based coverag e evolutionary executi genetic gori multivariate on p problems reduction stage sui te test testing thm time %N 1 %T Evolutionary Testing Approach for Solving Path- Oriented Multivariate Problems %U /brokenurl#doi.searchdl.org/01/IJIT/3/1/1100.pdf %V 3 %X A multivariate approach involves varying number of objectives to be satisfied simultaneously in testing process. An evolutionary approach, genetic algorithm is taken for solving multivariate problems in software engineering. The Multivariate Optimization Problem (M OP) has a set of solutions, each of which satisfies the objectives at an acceptable level. Another evolutionary algorithm named SBGA (stage- based genetic algorithm) with two stages is attempted for solving problems with multiple objectives like cost minimization, time reduction and maximizing early fault deduction capabilities. In this paper, a multivariate genetic algorithm (MGA) in terms of stages for path-based programs is presented to get the benefits of both multi-criteria optimization and genetic algorithm. The multiple variables considered for test data generation are maximum path coverage with minimum execution time and test-suite minimization. The path coverage and the no. of test cases generated using SBGA are experimented with low, medium and high complexity object-oriented programs and compared with the existing GA approaches. The data-flow testing of OOPs in terms of path coverage are resulted with almost 88%. Thus, the efficiency of generated testcases has been improved in terms of path coverage with minimum execution time as well as with the minimal test suite size.

@article{pmaragathavalli2013evolutionary, abstract = {A multivariate approach involves varying number of objectives to be satisfied simultaneously in testing process. An evolutionary approach, genetic algorithm is taken for solving multivariate problems in software engineering. The Multivariate Optimization Problem (M OP) has a set of solutions, each of which satisfies the objectives at an acceptable level. Another evolutionary algorithm named SBGA (stage- based genetic algorithm) with two stages is attempted for solving problems with multiple objectives like cost minimization, time reduction and maximizing early fault deduction capabilities. In this paper, a multivariate genetic algorithm (MGA) in terms of stages for path-based programs is presented to get the benefits of both multi-criteria optimization and genetic algorithm. The multiple variables considered for test data generation are maximum path coverage with minimum execution time and test-suite minimization. The path coverage and the no. of test cases generated using SBGA are experimented with low, medium and high complexity object-oriented programs and compared with the existing GA approaches. The data-flow testing of OOPs in terms of path coverage are resulted with almost 88%. Thus, the efficiency of generated testcases has been improved in terms of path coverage with minimum execution time as well as with the minimal test suite size. }, added-at = {2013-03-09T07:41:30.000+0100}, author = {P.Maragathavalli and S.Kanmani}, biburl = {https://www.bibsonomy.org/bibtex/2b546ff55af3b5a9746c2cd38a9c407f7/ideseditor}, editor = {ACEEE}, interhash = {4fb484158a44f14e200908d0561729c0}, intrahash = {b546ff55af3b5a9746c2cd38a9c407f7}, journal = {ACEEE Int. J. on Information Technology}, keywords = {al ath based coverag e evolutionary executi genetic gori multivariate on p problems reduction stage sui te test testing thm time}, month = mar, number = 1, timestamp = {2013-03-09T07:41:30.000+0100}, title = {Evolutionary Testing Approach for Solving Path- Oriented Multivariate Problems }, url = {/brokenurl#doi.searchdl.org/01/IJIT/3/1/1100.pdf}, volume = 3, year = 2013 }