Combining genetic algorithm and pairwise testing for optimised test generation from UML ADs

R. Anbunathan, A. Basu
{"title":"Combining genetic algorithm and pairwise testing for optimised test generation from UML ADs","authors":"R. Anbunathan, A. Basu","doi":"10.1049/IET-SEN.2018.5207","DOIUrl":null,"url":null,"abstract":"Unified modelling language (UML) activity diagram (AD) is used to represent system behaviour abstractly and is used by testers to generate test cases and test data. During the design of test cases, AD with concurrent activities may lead to a large number of paths, and it may not always be possible to test all execution paths. Research on deriving test cases from AD having concurrent activities has focused on conventional search techniques such as breadth-first search and depth-first search which has been found to be inefficient in such cases. To overcome this drawback, the authors propose a method using pairwise testing and genetic algorithm to derive a reduced number of test cases in AD with concurrent activities. Experiments conducted on various real-life concurrent systems show that the proposed technique generates a reduced number of test cases compared with existing methods.","PeriodicalId":13395,"journal":{"name":"IET Softw.","volume":"75 1","pages":"423-433"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Softw.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/IET-SEN.2018.5207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Unified modelling language (UML) activity diagram (AD) is used to represent system behaviour abstractly and is used by testers to generate test cases and test data. During the design of test cases, AD with concurrent activities may lead to a large number of paths, and it may not always be possible to test all execution paths. Research on deriving test cases from AD having concurrent activities has focused on conventional search techniques such as breadth-first search and depth-first search which has been found to be inefficient in such cases. To overcome this drawback, the authors propose a method using pairwise testing and genetic algorithm to derive a reduced number of test cases in AD with concurrent activities. Experiments conducted on various real-life concurrent systems show that the proposed technique generates a reduced number of test cases compared with existing methods.
结合遗传算法和成对测试,从UML ad优化测试生成
统一建模语言(UML)活动图(AD)用于抽象地表示系统行为,并且被测试人员用来生成测试用例和测试数据。在设计测试用例期间,具有并发活动的AD可能会导致大量的路径,并且可能并不总是能够测试所有的执行路径。从具有并发活动的AD中提取测试用例的研究主要集中在传统的搜索技术上,如广度优先搜索和深度优先搜索,这些技术在这种情况下被发现是低效的。为了克服这一缺点,作者提出了一种使用配对测试和遗传算法的方法,以减少AD中并发活动的测试用例数量。在各种实际并发系统上进行的实验表明,与现有方法相比,所提出的技术产生的测试用例数量减少了。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信