The Study of the Sequential Inclusion of Paths in the Analysis of Program Code for the Task of Selecting Input Test Data Konstantin E. Serdyukov[ооо-оооз-41б2-129sJ and Tatiana V. Avdeenko[ооо-о0002-sб14-59З4J NovosiЬirskStateTechnical University ,К . Marks avenue20, 630073NovosiЬirsk,sRusia Review of Existing Researches of Testing Automation and Selection of Test Data

eTh article proposeeths resultsofа study evaluating oneand amny paths ofpamgro code,the workis notfinished yet. То solve the proЫemof generatingdata sets,it is proposeto d useа geneticalgorithm fordeterminng the complexity ofprogam coderfo yman paths. eTh pproosed methodalows to generatedata for multiple codepaths Ьу sequentialy elimnating operationsto achieve miaxmum possiЫe codecoverageF.oreachgenerateddata settheoperations onthepathare excluded ofrm folowing generation,which alows generating newsetsalong otherpaths.The article describes the resultsofthis method with а description ofthedata generationmethodand aanlysis of the generated data setsrfo many paths.

 genetic algorith щ testdata conotrl flowgraph fitness function testingprocessp roamgr code optimzation method testdata generationc ode coverage