Chunyan Xia, Xingya Wang, Li Qiao, Yan Zhang, Baoying Ma, Chenyang Shi
{"title":"基于遗传算法的可行基本路径生成","authors":"Chunyan Xia, Xingya Wang, Li Qiao, Yan Zhang, Baoying Ma, Chenyang Shi","doi":"10.1109/DSA.2019.00054","DOIUrl":null,"url":null,"abstract":"In this paper, a feasible basic path generation method based on a genetic algorithm is proposed, which combines a probabilistic statistical method with a genetic algorithm to generate a feasible basic path. First, conditional probability relations and a maximum likelihood estimation method are used to measure the correlation among the conditional statements and determine the mutually exclusive edges in the Decision-to-Decision Graph of the program under test. Then, the feasibility of generating a path is judged by the exclusive edge relation. Finally, a genetic algorithm is used to generate the feasible basic path set of the program under test. The experimental results based on six benchmark programs and three industrial programs show that, compared with the traditional method, this method can effectively improve the coverage rate of feasible basic path generation and reduce the time cost of software testing.","PeriodicalId":342719,"journal":{"name":"2019 6th International Conference on Dependable Systems and Their Applications (DSA)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Feasible Basic Path Generation Based on Genetic Algorithm\",\"authors\":\"Chunyan Xia, Xingya Wang, Li Qiao, Yan Zhang, Baoying Ma, Chenyang Shi\",\"doi\":\"10.1109/DSA.2019.00054\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a feasible basic path generation method based on a genetic algorithm is proposed, which combines a probabilistic statistical method with a genetic algorithm to generate a feasible basic path. First, conditional probability relations and a maximum likelihood estimation method are used to measure the correlation among the conditional statements and determine the mutually exclusive edges in the Decision-to-Decision Graph of the program under test. Then, the feasibility of generating a path is judged by the exclusive edge relation. Finally, a genetic algorithm is used to generate the feasible basic path set of the program under test. The experimental results based on six benchmark programs and three industrial programs show that, compared with the traditional method, this method can effectively improve the coverage rate of feasible basic path generation and reduce the time cost of software testing.\",\"PeriodicalId\":342719,\"journal\":{\"name\":\"2019 6th International Conference on Dependable Systems and Their Applications (DSA)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 6th International Conference on Dependable Systems and Their Applications (DSA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DSA.2019.00054\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 6th International Conference on Dependable Systems and Their Applications (DSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSA.2019.00054","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Feasible Basic Path Generation Based on Genetic Algorithm
In this paper, a feasible basic path generation method based on a genetic algorithm is proposed, which combines a probabilistic statistical method with a genetic algorithm to generate a feasible basic path. First, conditional probability relations and a maximum likelihood estimation method are used to measure the correlation among the conditional statements and determine the mutually exclusive edges in the Decision-to-Decision Graph of the program under test. Then, the feasibility of generating a path is judged by the exclusive edge relation. Finally, a genetic algorithm is used to generate the feasible basic path set of the program under test. The experimental results based on six benchmark programs and three industrial programs show that, compared with the traditional method, this method can effectively improve the coverage rate of feasible basic path generation and reduce the time cost of software testing.