{"title":"A dynamic approach of test data generation","authors":"B. Korel","doi":"10.1109/ICSM.1990.131379","DOIUrl":null,"url":null,"abstract":"The author presents a dynamic approach to test data generation, in which the path selection stage is eliminated. In this approach, test data are derived on the basis of the actual execution of the program under test, of dynamic data flow analysis, and of function minimization methods. The approach starts by executing a program for an arbitrary program input. During program execution for each executed branch, a search procedure decides whether the execution should continue the current branch or whether an alternative branch should be taken. If an undesirable execution flow is observed at the current branch, then a real-valued function is associated with this branch, and function minimization search algorithms are used to automatically locate values of input variables which will change the flow of execution at this branch. In addition, dynamic data flow analysis is used to determine input variables which are responsible for the undesirable program behavior, leading to speedup of the search process.<<ETX>>","PeriodicalId":107276,"journal":{"name":"Proceedings. Conference on Software Maintenance 1990","volume":"194 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"80","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Conference on Software Maintenance 1990","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSM.1990.131379","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 80
Abstract
The author presents a dynamic approach to test data generation, in which the path selection stage is eliminated. In this approach, test data are derived on the basis of the actual execution of the program under test, of dynamic data flow analysis, and of function minimization methods. The approach starts by executing a program for an arbitrary program input. During program execution for each executed branch, a search procedure decides whether the execution should continue the current branch or whether an alternative branch should be taken. If an undesirable execution flow is observed at the current branch, then a real-valued function is associated with this branch, and function minimization search algorithms are used to automatically locate values of input variables which will change the flow of execution at this branch. In addition, dynamic data flow analysis is used to determine input variables which are responsible for the undesirable program behavior, leading to speedup of the search process.<>