Int J Performability Eng ›› 2019, Vol. 15 ›› Issue (12): 3253-3261.doi: 10.23940/ijpe.19.12.p17.32533261

Previous Articles     Next Articles

Mining Minimal Failure-Causing Schema for Software Complex Configuration Space

Liangfen Weia, Yong Lib,c,*, Yong Wangb,c,d,*, Xiangyu Chene, and Zhaohui Xuf   

  1. aDepartment of Computer Engineering, Anhui Sanlian University, Hefei, 23060, China;
    bKey Laboratory of Safety-Critical Software (Nanjing University of Aeronautics and Astronautics), Ministry of Industry and Information Technology, Nanjing, 210000, China;
    cData Security Key Laboratory, Xinjiang Normal University, Urumqi, 830054, China;
    dState Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, 210000, China;
    eSchool of Computer and Information, Anhui Polytechnic University, Wuhu, 241000, China;
    fAvic East Optoelectronics (Shanghai) Co., LTD., Shanghai, 201100, China
  • Submitted on ; Revised on ; Accepted on
  • Contact: * E-mail address: liyong@live.com, yongwang@ahpu.edu.cn

Abstract: Minimal failure-causing schema (MFS) may be affected by masking effects in software complex configuration space. A method for mining MFS based on combination testing and its testing results is proposed. The method firstly constructs a combination-fault tree (CFF-tree) based on the combined test suite and its results, extracts the frequent parameter-value-combinations from the tree as suspicious MFS and calculates their suspiciousness scores, and finally sorts them according to their suspicious scores. Though an iterative framework, MFS is repeatedly mined and checked by programmers until a certain stopping criterion is satisfied. Simulation experiments are used to validate the effectiveness of our method with and without masking effects. The experimental results show that the proposed method can mine MFS in the two scenarios and effectively reduce the number of additional test cases.

Key words: minimal failure-causing schema, configuration space, CFF-tree, combination testing