Font Size: a A A

With The Priority Parameter Pair-wise Coverage Test Set Generation Strategy

Posted on:2009-08-12Degree:MasterType:Thesis
Country:ChinaCandidate:J ZhuFull Text:PDF
GTID:2208360245467394Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Pairwise testing requires that for each pair of input parameters of a system, every combination of valid values of these two parameters be covered by at least one test case. Pairwise testing is practical and effective for various types of software systems, as most of the system faults are caused by some unexpected system parameters and the interaction among them. In many applications where interaction testing is needed, the entire test suite is not run as a result of time or budget constraints.In these situations, it is essential to prioritize the cases.Here, several typical strategies for generating minimum pair-wise coverage testing set are studied. We drive weight for each value of each parameter, and adapt two different methods to generate an ordered pair-wise coverage test set. One strategy is to accord weights set for each value of each parameter of the system, then produce ordered pair-wise coverage test set for having generated but unordered one. The other strategy is to produce prioritized pair-wise coverage test set by introducing priority weights during test set generation process. When run to completion, all pair-wise interactions are tested, but when terminated after any intermediate number of tests, those deemed most important are tested. Finally, we are going to compare and analyze those two pair-wise coverage test set generating strategies in terms of test set scare and the amount of weights the test set covers.
Keywords/Search Tags:Greedy algorithm, Pair-wise interaction coverage, Test prioritization, Software testing
PDF Full Text Request
Related items