Analyzing and Extending MUMCUT for Fault-based Testing of General Boolean Expressions

Sun, C.T.; Yang, Dong; Lai, Richard; Sim, Kwan Yong; Chen, Tsong Yueh

doi:10.1109/cit.2006.51

Cited by 14 publications

(18 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is expected that the fault-detection effectiveness could be improved by enhancing the diversity among selected test cases [34]. However, the faultdetection effectiveness and efficiency of the above extensions to MUMCUT have not yet been evaluated, which is to be reported later in this paper.…”

Section: Test Case Generation Strategiesmentioning

confidence: 98%

“…As mentioned above, some faults in the general Boolean expressions cannot be detected by MUMCUT [36], and hence some extensions were proposed to improve its fault-detection effectiveness [34]. However, their improvements are not evaluated yet.…”

Section: Research Questionsmentioning

confidence: 99%

“…We also investigated the reason why such faults cannot be detected by the existing fault-based strategies [34]. Based on the investigations on undetected faults, we proposed some guidelines for extending MUMCUT such that more faults can be detected.…”

Section: Test Case Generation Strategiesmentioning

confidence: 99%

“…We have provided a comprehensive comparison of all fault-based testing strategies for general Boolean expressions in terms of the fault-detection effectiveness and efficiency. We further analyse to what extent our MUMCUT extensions [34] can improve the performance over the original MUMCUT-CUN, as summarised in Table 4, where the performance improvements in terms of fault-detection effectiveness and efficiency are given in the 2nd and 3rd columns, respectively.…”

Section: Performance Improvement and Cost Of Mumcut Extensionsmentioning

confidence: 99%

“…Various test case generation strategies for Boolean specifications have been proposed, and they are grouped into syntactic and semantic [23]. The syntactic strategies normally require Boolean specifications under test to be in a specific form, and most notable ones include the family of basic meaningful impact strategies [40], MUMCUT [6], and MUMCUT extensions [34]. The semantic strategies do not require the Boolean expression to be in a particular form, and typical ones include sensitive strategies [18], MC/DC [13], BRO strategies [38], and the predicate coverage criteria such as predicate coverage (PC), clause coverage (CC), multiple condition coverage (MCC), active clause coverage (ACC), general active clause coverage (GACC), correlated active clause coverage (CACC), restricted active clause coverage (RACC), inactive clause coverage (ICC), general inactive clause coverage (GICC), and restricted inactive clause coverage (RICC) [1].…”

Section: Test Case Generation Strategiesmentioning

confidence: 99%

See 4 more Smart Citations

Evaluating and Comparing Fault-Based Testing Strategies for General Boolean Specifications: A Series of Experiments

Sun

Zai

Liu

2014

The Computer Journal

View full text Add to dashboard Cite

A great amount of fault-based testing strategies have been proposed to generate test cases for detecting certain types of faults in Boolean specifications. However, most of the previous studies on these strategies were focused on the Boolean expressions in the disjunctive normal form, even the irredundant disjunctive normal form -little work has been conducted to comprehensively investigate their performance on general Boolean specifications. In this study, we conducted a series of experiments to evaluate and compare eighteen fault-based testing strategies using over four thousand randomly generated fault-seeded Boolean expressions. In the experiments, a testing strategy is regarded as effective and efficient if it can detect most of the seeded faults using a small number of test cases. Our experimental results show that if a testing strategy is highly effective and efficient when testing the Boolean expressions in the irredundant disjunctive normal form, it also shows high effectiveness and efficiency on general Boolean expressions. It is found that one family of fault-based testing strategies, namely MUMCUT, normally deliver the best performance among all the eighteen strategies. Our study provides an in-depth understanding and insight of fault-based testing for general Boolean expressions.

show abstract

Section: Test Case Generation Strategiesmentioning

confidence: 98%

Section: Research Questionsmentioning

confidence: 99%

Section: Test Case Generation Strategiesmentioning

confidence: 99%

Section: Performance Improvement and Cost Of Mumcut Extensionsmentioning

confidence: 99%

Section: Test Case Generation Strategiesmentioning

confidence: 99%

See 3 more Smart Citations

Evaluating and Comparing Fault-Based Testing Strategies for General Boolean Specifications: A Series of Experiments

Sun

Zai

Liu

2014

The Computer Journal

View full text Add to dashboard Cite

show abstract

On detecting faults for Boolean expressions

et al. 2008

View full text Add to dashboard Cite

Fault based testing aims at detecting hypothesized faults based on specifications or program source. There are some fault based techniques for testing Boolean expressions which are commonly used to model conditions in specifications as well as logical decisions in program source. The MUMCUT strategy has been proposed to generate test cases from Boolean expressions. Moreover, it detects eight common types of hypothesized faults provided that the original expression is in irredundant disjunctive normal form, IDNF. Software practitioners are more likely to write the conditions and logical decisions in general form rather than IDNF. Hence, it is interesting to investigate the fault detecting capability of the MUMCUT strategy with respect to general form Boolean expressions. In this article, we perform empirical studies to investigate the fault detection capability of the MUMCUT strategy with respect to general form Boolean expressions as well as mutated expressions. A mutated expression can be obtained from the original given Boolean expression by making a syntactic change based on a particular type of fault.

show abstract