An Approach of Locating Minimal Failure-Causing Schema for Boolean-Specifications

The fault location method of relational tree model (BFSTRT) based on the breadth-first selection strategy is the best in locating the Minimal Failure-causing Schema (MFS). However, the BFSTRT has a defect that it cannot solve the situation of “additional test cases introduce new failure modes”, moreover, since the fault location method based on the relational tree model is to generate all sub patterns of the failure test case at one time when building the model tree, so this type of fault location method consumes large memory space. This paper proposes an Approach of Locating Minimal Failure-causing Schema for Boolean-Specification (BELF) method, which effectively solves the above two deficiencies in BFSTRT. The experimental results show that the localization efficiency of BELF is better than BFSTRT in terms of precision and recall.