Computer Engineering and Applications ›› 2018, Vol. 54 ›› Issue (13): 266-270.DOI: 10.3778/j.issn.1002-8331.1701-0284

Previous Articles    

Method of reduction test sequence set based on SysML activities diagram

MENG Lingchong1, SHU Jian2, HUANG Qintao2, CAO Weifang2   

  1. 1.School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China
    2.School of Software, Nanchang Hangkong University, Nanchang 330063, China
  • Online:2018-07-01 Published:2018-07-17

基于SysML活动图的测试序列集约简方法

孟令冲1,舒  坚2,黄勤涛2,曹伟芳2   

  1. 1.南昌航空大学 信息工程学院,南昌 330063
    2.南昌航空大学 软件学院,南昌 330063

Abstract: In the field of software testing, how to make a reduction prioritize test sequences generated by complex embedded system and make it satisfy the coverage criterion more quickly is the key problem which guides the test execution effectively. In view of this issue, this paper utilizes SysML activity diagram and combining it with embedded real-time system features to model embedded system. The concurrent activity is compressed to avoid the explosion of the active path combination caused by concurrent activity. This paper proposes BFC algorithm which can meet the requirement of coverage rate faster adopting to the test sequence priority evaluation index of edge-coverage rate. The experimental results show that the BFC algorithm can effectively reduce the test sequence and meet the coverage requirement at a faster speed, it improves testing efficiency.

Key words: software test, SysML activities diagram, test sequences reduction, edge-coverage rate

摘要: 如何对复杂的嵌入式系统生成的测试序列集进行约简,使其更快地满足覆盖准则,从而有效地指导测试执行,是软件测试领域的关键问题。针对这一问题,结合嵌入式实时系统特点,采用SysML活动图对嵌入式系统进行建模,为了避免并发活动引起活动路径组合爆炸的问题,将并发活动进行压缩,选用转移边覆盖率作为测试序列集的评判指标,提出了一种更快满足覆盖率要求的算法—BFC算法。实验结果表明,提出的BFC算法可以有效地约简测试序列集,以较快的速度达到覆盖要求,提高了测试效率。

关键词: 软件测试, SysML活动图, 测试序列约简, 转移边覆盖率