基于遗传算法的可行基本路径生成

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}
引用次数: 0

摘要

本文提出了一种基于遗传算法的可行基本路径生成方法,该方法将概率统计方法与遗传算法相结合,生成可行基本路径。首先,利用条件概率关系和极大似然估计方法来度量条件语句之间的相关性,确定待测程序的决策-决策图中的互斥边;然后,利用排他边关系判断路径生成的可行性。最后,利用遗传算法生成待测程序的可行基本路径集。基于6个基准方案和3个工业方案的实验结果表明,与传统方法相比,该方法能有效提高可行基本路径生成的覆盖率,降低软件测试的时间成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信