基于三目标搜索的测试用例集约简方法
现有测试用例集约简方法基本只考量优化集的规模和错误覆盖率,很少考虑其测试效率,导致优化集的测试运行时间较长,且运行代价较大。针对该问题,提出一种三目标搜索算法。对测试用例覆盖度和运行代价的双目标优先级模型进行细化,给出每个目标的定量细化方法,根据此模型计算出各个用例的优先级,运用到改进蚁群算法中作为各节点的初始信息素值进行优化遍历搜索,将错误检测率作为蚂蚁挑选下一个节点的影响因子,并制定信息素更新规则,使其能够尽快找到最优解。实验结果表明,与贪心算法、基本蚁群算法等相比,该算法得到的测试用例最小集规模较小,具有较高的错误检测率。...
Saved in:
| Published in | 计算机工程 Vol. 42; no. 3; pp. 84 - 88 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
广东工业大学计算机学院,广州,510006
2016
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1000-3428 |
| DOI | 10.3969/j.issn.1000-3428.2016.03.015 |
Cover
| Abstract | 现有测试用例集约简方法基本只考量优化集的规模和错误覆盖率,很少考虑其测试效率,导致优化集的测试运行时间较长,且运行代价较大。针对该问题,提出一种三目标搜索算法。对测试用例覆盖度和运行代价的双目标优先级模型进行细化,给出每个目标的定量细化方法,根据此模型计算出各个用例的优先级,运用到改进蚁群算法中作为各节点的初始信息素值进行优化遍历搜索,将错误检测率作为蚂蚁挑选下一个节点的影响因子,并制定信息素更新规则,使其能够尽快找到最优解。实验结果表明,与贪心算法、基本蚁群算法等相比,该算法得到的测试用例最小集规模较小,具有较高的错误检测率。 |
|---|---|
| AbstractList | TP309; 现有测试用例集约简方法基本只考量优化集的规模和错误覆盖率,很少考虑其测试效率,导致优化集的测试运行时间较长,且运行代价较大.针对该问题,提出一种三目标搜索算法.对测试用例覆盖度和运行代价的双目标优先级模型进行细化,给出每个目标的定量细化方法,根据此模型计算出各个用例的优先级,运用到改进蚁群算法中作为各节点的初始信息素值进行优化遍历搜索,将错误检测率作为蚂蚁挑选下一个节点的影响因子,并制定信息素更新规则,使其能够尽快找到最优解.实验结果表明,与贪心算法、基本蚁群算法等相比,该算法得到的测试用例最小集规模较小,具有较高的错误检测率. 现有测试用例集约简方法基本只考量优化集的规模和错误覆盖率,很少考虑其测试效率,导致优化集的测试运行时间较长,且运行代价较大。针对该问题,提出一种三目标搜索算法。对测试用例覆盖度和运行代价的双目标优先级模型进行细化,给出每个目标的定量细化方法,根据此模型计算出各个用例的优先级,运用到改进蚁群算法中作为各节点的初始信息素值进行优化遍历搜索,将错误检测率作为蚂蚁挑选下一个节点的影响因子,并制定信息素更新规则,使其能够尽快找到最优解。实验结果表明,与贪心算法、基本蚁群算法等相比,该算法得到的测试用例最小集规模较小,具有较高的错误检测率。 |
| Author | 张妍 傅秀芬 |
| AuthorAffiliation | 广东工业大学计算机学院,广州510006 |
| AuthorAffiliation_xml | – name: 广东工业大学计算机学院,广州,510006 |
| Author_FL | ZHANG Yan FU Xiufen |
| Author_FL_xml | – sequence: 1 fullname: ZHANG Yan – sequence: 2 fullname: FU Xiufen |
| Author_xml | – sequence: 1 fullname: 张妍 傅秀芬 |
| BookMark | eNo9jztLxEAAhLc4wfO8PyFil7iP7KuUwxccWGgfNjE5E3SjWUTsLESRA7HwLDxBsRCrs1BBU_hrYlb_hZETi2Fg-JhhpkBDZzoCYBZBl0gm51M3MUa7CELoEA8LF0PEXEhciGgDNP_zSdA2JgkgRYRTTkQTkM_boizOy7czOxxVd6fVxY19ubfXx9Vr_-tpYC8fy4_-9_DEFg92dFRdvVfPg2kwEattE7X_vAXWlxY3OitOd215tbPQdUIqqENJjFVUK2QyiCCPKQ4DFnueoBgRBT0ZcUlFiGUQR0huShZQ5UmBPc4V5qQF5satB0rHSvf8NNvPdb3npybthb8PIan_1eDMGAy3Mt3bS2p0N092VH7oMyYwQpJC8gNViWcp |
| ClassificationCodes | TP309 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2RA 92L CQIGP W92 ~WA 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.3969/j.issn.1000-3428.2016.03.015 |
| DatabaseName | 中文期刊服务平台 中文科技期刊数据库-CALIS站点 维普中文期刊数据库 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| DocumentTitleAlternate | Test Suite Reduction Method Based on Triple Target Search |
| DocumentTitle_FL | Test Suite Reduction Method Based on Triple Target Search |
| EndPage | 88 |
| ExternalDocumentID | jsjgc201603015 668211950 |
| GrantInformation_xml | – fundername: 广东省自然科学基金资助项目“对象监控机及其权限提升攻击检测研究” funderid: (9151009001000007) |
| GroupedDBID | -0Y 2B. 2C0 2RA 5XA 5XJ 92H 92I 92L ACGFS ALMA_UNASSIGNED_HOLDINGS CCEZO CQIGP CUBFJ CW9 TCJ TGT U1G U5S W92 ~WA 4A8 93N ABJNI PSX |
| ID | FETCH-LOGICAL-c585-53f2aef2ac69be07f52cb6f4485213a049e7958c29bfe19d96b5a4982477a273 |
| ISSN | 1000-3428 |
| IngestDate | Thu May 29 04:21:01 EDT 2025 Wed Feb 14 10:21:28 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | 双目标模型 优先级 错误检测率 improved ant colony algorithm 软件测试 software test priority 改进蚁群算法 double target model error detection rate |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c585-53f2aef2ac69be07f52cb6f4485213a049e7958c29bfe19d96b5a4982477a273 |
| Notes | ZHANG Yan;FU Xiufen;School of Computer Science and Technology,Guangdong University of Technology; Guangzhou 510006, China 31-1289/TP software test; double target model; priority; error detection rate; improved ant colony algorithm Existing test case reduction methods basically only take the size and the error detection rate of the optimization set into consideration,rarely paying attention to the test efficiency,so that the test of the opitimization set takes long,and the test cost is high. For this problem,this paper proposes a triple target search algorithm. It details the double target priority model based on the coverage and the test cost of the test case,refines each target＇s quantitative method,then calculates the priority of each test case according to the model,uses the priority as the initial pheromone value in the improved ant colony algorithm for ergodic optimization,at last regards the error detection rate as the impact factor for the ant to pick the next node,and formulates the pheromone update rule |
| PageCount | 5 |
| ParticipantIDs | wanfang_journals_jsjgc201603015 chongqing_primary_668211950 |
| PublicationCentury | 2000 |
| PublicationDate | 2016 |
| PublicationDateYYYYMMDD | 2016-01-01 |
| PublicationDate_xml | – year: 2016 text: 2016 |
| PublicationDecade | 2010 |
| PublicationTitle | 计算机工程 |
| PublicationTitleAlternate | Computer Engineering |
| PublicationTitle_FL | Computer Engineering |
| PublicationYear | 2016 |
| Publisher | 广东工业大学计算机学院,广州,510006 |
| Publisher_xml | – name: 广东工业大学计算机学院,广州,510006 |
| SSID | ssib051375738 ssib017479294 ssj0042200 ssib001102934 ssib023646288 |
| Score | 2.0451546 |
| Snippet | 现有测试用例集约简方法基本只考量优化集的规模和错误覆盖率,很少考虑其测试效率,导致优化集的测试运行时间较长,且运行代价较大。针对该问题,提出一种三目标搜索算法。对测... TP309; 现有测试用例集约简方法基本只考量优化集的规模和错误覆盖率,很少考虑其测试效率,导致优化集的测试运行时间较长,且运行代价较大.针对该问题,提出一种三目标搜索算... |
| SourceID | wanfang chongqing |
| SourceType | Aggregation Database Publisher |
| StartPage | 84 |
| SubjectTerms | 优先级 双目标模型 改进蚁群算法 软件测试 错误检测率 |
| Title | 基于三目标搜索的测试用例集约简方法 |
| URI | http://lib.cqvip.com/qk/95200X/201603/668211950.html https://d.wanfangdata.com.cn/periodical/jsjgc201603015 |
| Volume | 42 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals issn: 1000-3428 databaseCode: DOA dateStart: 20160101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.doaj.org/ omitProxy: true ssIdentifier: ssj0042200 providerName: Directory of Open Access Journals |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwELZKkRAcEI8iSnn0UB9Tso7t2MckzapCggtF6m0V57FVD1ug20tPHBAIVUIcKAeKBOKAOJUDIMEe-DXLBv4F40l2Cagqj8Nas358nngSe-xkZghZyDUoGRnPHWMS7sBNIZxEZsxJTJ5x4SaeTK2h8PUbcvkWv7YqVqeOzDS-Wtrqm8V0-0C7kv-RKuSBXK2V7D9IdgIKGUCDfCEFCUP6VzKmsaC6TcOAxtymKkZCUaVp7FMd0gByJA1cCnt-ILRLdWSLQk4DhnWgFbdFoaAqpLGiQZtqgUVQRyFgjEXaAiqJzQMaIAH4ykVkQNCI49EqnuVY5UXMmAatur6uOImQbUFDyMTuoC81ef-DJZFlHAjoSi01SxSjqmrjY_fQEhiKmicYlWkl3m2IpWnYrgfHjsCk3yoHOQm4xbPEEl7doWzXdWBMtB1JFjV6QXBtPzMV9r2GbEz81sLe47Wher0ycNZ4ArzGNF9FtRsrDOqgpcjTUuNSZOEXJ_D2Y0KJbnUrK9bfnH2vb653U4axv13rOuEos8dMjZMC1HJBKdQ_vfrZEAA2aPT4v2h5vkCvepVCwhlzK6ccNQ_HyELN4NXD2LPeRtY2et07oEOhSVuvSHrdhva1coqcrLdN80H1DJwmU9trZ8iJhjPNs8T7-nIwHDwefnpU7u2PXj0cPXlRfnhdPr8_-rjz7d1u-fTt8MvO970H5eBNuX9v9Ozz6P3uDLnZjleiZacOCeKksK91hFewJIdfKrXJXb8QLDWy4FyBFuolsNvNfS1UyrQp8pbOtDQi4Vox7vsJKOrnyHRvo5efJ_MmsRudTBvlp9wepsJOKcsFU1nRMsZjs2RucvGd25Xjl46UimHc5FlypR6OTj0dbHZ-Fd2FP9aYI8ctXR3nXSTT_btb-SVQcPvmMor7B2dxfMs |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E5%9F%BA%E4%BA%8E%E4%B8%89%E7%9B%AE%E6%A0%87%E6%90%9C%E7%B4%A2%E7%9A%84%E6%B5%8B%E8%AF%95%E7%94%A8%E4%BE%8B%E9%9B%86%E7%BA%A6%E7%AE%80%E6%96%B9%E6%B3%95&rft.jtitle=%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%B7%A5%E7%A8%8B&rft.au=%E5%BC%A0%E5%A6%8D&rft.au=%E5%82%85%E7%A7%80%E8%8A%AC&rft.date=2016&rft.pub=%E5%B9%BF%E4%B8%9C%E5%B7%A5%E4%B8%9A%E5%A4%A7%E5%AD%A6%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%AD%A6%E9%99%A2%2C%E5%B9%BF%E5%B7%9E%2C510006&rft.issn=1000-3428&rft.volume=42&rft.issue=3&rft.spage=84&rft.epage=88&rft_id=info:doi/10.3969%2Fj.issn.1000-3428.2016.03.015&rft.externalDocID=jsjgc201603015 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F95200X%2F95200X.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjsjgc%2Fjsjgc.jpg |