Combinatorial Interaction Testing for Test Selection in Grammar-Based Testing

2012 ◽  
Author(s):  
Elke Salecker ◽  
Sabine Glesner
Keyword(s):  
Test Selection ◽  
Interaction Testing ◽  
Combinatorial Interaction Testing

scholarly journals PRIORITIZATION OF COMBINATORIAL TEST CASES BY INCREMENTAL INTERACTION COVERAGE

2013 ◽  
Vol 23 (10) ◽  
pp. 1427-1457 ◽  
Author(s):  
RUBING HUANG ◽  
XIAODONG XIE ◽  
DAVE TOWEY ◽  
TSONG YUEH CHEN ◽  
YANSHENG LU ◽  
...  
Keyword(s):  
Test Case ◽  
Test Cases ◽  
New Strategy ◽  
Testing Cost ◽  
Test Prioritization ◽  
Interaction Testing ◽  
Parameter Interactions ◽  
Combinatorial Interaction Testing ◽  
Alternative Assumption ◽  
Better Than

Combinatorial interaction testing is a well-recognized testing method, and has been widely applied in practice, often with the assumption that all test cases in a combinatorial test suite have the same fault detection capability. However, when testing resources are limited, an alternative assumption may be that some test cases are more likely to reveal failure, thus making the order of executing the test cases critical. To improve testing cost-effectiveness, prioritization of combinatorial test cases is employed. The most popular approach is based on interaction coverage, which prioritizes combinatorial test cases by repeatedly choosing an unexecuted test case that covers the largest number of uncovered parameter value combinations of a given strength (level of interaction among parameters). However, this approach suffers from some drawbacks. Based on previous observations that the majority of faults in practical systems can usually be triggered with parameter interactions of small strengths, we propose a new strategy of prioritizing combinatorial test cases by incrementally adjusting the strength values. Experimental results show that our method performs better than the random prioritization technique and the technique of prioritizing combinatorial test suites according to test case generation order, and has better performance than the interaction-coverage-based test prioritization technique in most cases.

scholarly journals Enhancing Similarity Distances Using Mandatory and Optional for Early Fault Detection

2018 ◽  
Vol 11 (3) ◽  
pp. 1194
Author(s):  
Safwan Abd Razak ◽  
Mohd Adham Isa ◽  
Dayang N.A Jawawi
Keyword(s):  
Domain Knowledge ◽  
Product Line ◽  
Feature Model ◽  
Software Systems ◽  
Average Percentage ◽  
Shared Set ◽  
Interaction Testing ◽  
Method Of Production ◽  
Early Fault Detection ◽  
Combinatorial Interaction Testing

Software Product Line (SPL) describes procedures, techniques, and tools in software engineering by using a common method of production for producing a group of software systems that identical from a shared set of software assets. In SPL, the similarity-based prioritization can resemble combinatorial interaction testing in scalable and efficient way by choosing and prioritize configurations that most dissimilar. However, the similarity distances in SPL still not so much cover the basic detail of feature models which are the notations. Plus, the configurations always have been prioritized based on domain knowledge but not much attention has been paid to feature model notations. In this paper, we proposed the usage of mandatory and optional notations for similarity distances. The objective is to improve the average percentage of faults detected (APFD). We investigate four different distances and make modifications on the distances to increase APFD value. These modifications are the inclusion of mandatory and optional notations with the similarity distances. The results are the APFD values for all the similarity distances including the original and modified similarity distances. Overall, the results shown that by subtracting the optional notation value can increase the APFD by 3.71% from the original similarity distance.

Sign in / Sign up

Export Citation Format

Share Document