Journal of University of Science and Technology of China ›› 2018, Vol. 48 ›› Issue (1): 28-34.DOI: 10.3969/j.issn.0253-2778.2018.01.004

• Original Paper • Previous Articles     Next Articles

Locating failure-inducing combinations based on fault forest

WANG Yong, HUANG Zhiqiu, WEI Liangfen, LU Guifu   

  1. 1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics Nanjing 210000, China;
    2. College of Computer and Information, Anhui Polytechnic University Wuhu 241000, China;
    3. Department of Computer Engineering, Anhui SanLian University Hefei 230601, China)
  • Received:2017-05-16 Revised:2017-06-22 Online:2018-01-01 Published:2018-01-01

Abstract: Combinatorial testing, a method for sampling parameter combination in the parameter space of a system, is suitable for systems in which failure is caused by a specific parameter combination. Based on the results of combination testing, locating the minimal failure causing schema (MFS) can help programmers to localize faults and repair them. However, combination testing might be affected by the mask effect, and even test cases containing MFSs may not necessarily trigger a failure. Therefore, it is extremely difficult to pinpoint MFSs in systems affected by the mask effect. A fault location method based on fault forest is proposed. Given a set of t-way combination test (t≥2) and their augment test set, this method first learns some basic fault trees which generate a fault forest, then extracts the basic suspicious MFS from the forest, and finally orders those suspicious MFSs by their suspiciousness which will help programmers perform further diagnosis. The simulation results show that the presented method can effectively identify MFS. In particular, for the systems affected by mask effect, result is robust.

Key words: combinatorial testing, fault localization, fault forest, MFS

CLC Number: