扫描手机二维码

欢迎您的访问
您是第 位访客

开通时间:..

最后更新时间:..

  • 王永亮 ( 教授 )

    的个人主页 http://faculty.nuaa.edu.cn/wyl/zh_CN/index.htm

  •   教授
论文成果 当前位置: 中文主页 >> 科学研究 >> 论文成果
Locating minimal failure-causing schema based on combinatorial fault frequent tree

点击次数:
所属单位:计算机科学与技术学院/人工智能学院/软件学院
发表刊物:Dongnan Daxue Xuebao
摘要:To solve the problem that a minimal failure-causing schema (MFS) in actual software may be influenced by masking effects, a locating MFS technique based on the combinatorial fault frequent tree (CFF-tree) and the corresponding iterative framework are proposed. First, a CFF-tree is constructed based on the combination test suite and the test results. Then, the frequent parameter combination of the tree is extracted as the MFS and ranked according to the suspiciousness score. Based on the locating MFS iterative framework, the process repeats until a stop criterion is satisfied. The simulation experiments are carried out to validate the effectiveness of the method in the two cases with and without masking effects. The experimental results show that in these two cases the proposed method can locate MFS and effectively reduce the number of the additional test cases. © 2018, Editorial Department of Journal of Southeast University. All right reserved.
ISSN号:1001-0505
是否译文:否
发表时间:2018-03-20
合写作者:Wang, Yong,黄志球,Wei, Liangfen,李勇
通讯作者:Wang, Yong,王永亮

 

版权所有©2018- 南京航空航天大学·信息化处(信息化技术中心)