[1]袁剑锋,刘佳,郭建卫.基于CGA的MPI程序分支覆盖测试套件生成[J].计算机技术与发展,2024,34(07):78-86.[doi:10.20165/j.cnki.ISSN1673-629X.2024.0101]
 YUAN Jian-feng,LIU Jia,GUO Jian-wei.CGA-based Test Suite Generation for Branch Coverage of MPI Programs[J].,2024,34(07):78-86.[doi:10.20165/j.cnki.ISSN1673-629X.2024.0101]
点击复制

基于CGA的MPI程序分支覆盖测试套件生成

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
34
期数:
2024年07期
页码:
78-86
栏目:
软件技术与工程
出版日期:
2024-07-10

文章信息/Info

Title:
CGA-based Test Suite Generation for Branch Coverage of MPI Programs
文章编号:
1673-629X(2024)07-0078-09
作者:
袁剑锋12刘佳3郭建卫12
1. 徐州生物工程职业技术学院 信息管理学院,江苏 徐州 221000; 2. 徐州市农业物联网工程技术研究中心,江苏 徐州 221000; 3. 江苏安全技术职业学院 网络与信息安全学院,江苏 徐州 221000
Author(s):
YUAN Jian-feng12LIU Jia3GUO Jian-wei12
1. School of Information Management,Xuzhou Vocational College of Bioengineering,Xuzhou 221000,China; 2. Xuzhou Agricultural Internet of Things Engineering Technology Research Center,Xuzhou 221000,China; 3. School of Network and Information Security,Jiangsu College of Safety Technology,Xuzhou 221000,China
关键词:
消息传递接口程序协同进化遗传算法分支覆盖测试测试套件生成适应度值函数
Keywords:
message passing interface (MPI) programco-evolutionary genetic algorithmbranch coverage testingtest suite generationfitness function
分类号:
TP311
DOI:
10.20165/j.cnki.ISSN1673-629X.2024.0101
摘要:
针对程序的分支覆盖测试,元启发式搜索技术已经被广泛应用于测试数据生成中。 然而,当前的研究成果主要适用于串行程序。 因此,为覆盖消息传递接口(Message Passing Interface,MPI)程序的分支,该文研究基于协同进化遗传算法(Co-evolutionary Genetic Algorithm,CGA)的测试套件生成方法(简称为:CGA 生成法),该方法具有不受不可行分支影响的优势。 首先,基于收集覆盖信息的探针,定义最小归一化分支距离,并以此设计出相应的适应度值函数;然后,使用 CGA 生成进化个体,并基于设计的适应度值函数,计算这些个体的适应值;最后,基于计算的适应值,选择子种群中代表个体,以构成合作种群。 所提 CGA 生成法应用于 7 个基准 MPI 程序,并与其他多种方法进行比较。 实验结果表明,CGA 生成法的覆盖率通常高于其他搜索算法。
Abstract:
For the branch coverage testing of programs,meta-heuristic search techniques have been widely used in test data generation.However,current researches are mainly applicable to sequential programs. Therefore,to cover the branches in a Message Passing Interface (MPI) program,we propose a method of generating test suite based on the Co-evolutionary Genetic Algorithm (CGA),which has the advantage of being unaffected by infeasible branches. To fulfill this task,we firstly define the minimum normalized branch distance based on the probes that collect the coverage information, and design the corresponding fitness function. Then, we use CGA to generate evolutionary individuals and calculate the fitness of these individuals based on the designed fitness function. Finally,the representative in-dividuals in each subpopulation are selected to form a cooperative population based on the calculated fitness. The proposed method is applied to 7 benchmark MPI programs and compared with some state - of - the - art methods. The experimental results show that the coverage rate of the proposed method is usually higher than that of other methods.

相似文献/References:

[1]熊敏 刘玉树.基于协同进化遗传算法的地域选取方法[J].计算机技术与发展,2006,(06):174.
 XIONG Min,LIU Yu-shu.Terrain Selection Method Based on Co- evolutionary Genetic Algorithm[J].,2006,(07):174.

更新日期/Last Update: 2024-07-10