Results 1  10
of
48
A test generation strategy for pairwise testing
 IEEE Transactions on Software Engineering
, 1998
"... AbstractÐPairwise testing is a specificationbased testing criterion, which 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.In this paper, we propose a new test generation strategy for pairwis ..."
Abstract

Cited by 111 (3 self)
 Add to MetaCart
(Show Context)
AbstractÐPairwise testing is a specificationbased testing criterion, which 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.In this paper, we propose a new test generation strategy for pairwise testing. Index TermsÐSoftware testing, pairwise testing, test generation. 1
Combination testing strategies: A survey
 Software Testing, Verification, and Reliability
, 2005
"... Combination strategies are test case selection methods that identify test cases by combining values of the different test object input parameters based on some combinatorial strategy. This survey presents 16 different combination strategies, covering more than 40 papers that focus on one or several ..."
Abstract

Cited by 100 (6 self)
 Add to MetaCart
(Show Context)
Combination strategies are test case selection methods that identify test cases by combining values of the different test object input parameters based on some combinatorial strategy. This survey presents 16 different combination strategies, covering more than 40 papers that focus on one or several combination strategies. This collection represents most of the existing work performed on combination strategies. This survey describes the basic algorithms used by the combination strategies. Some properties of combination strategies, including coverage criteria and theoretical bounds on the size of test suites, are also included in this description. This survey paper also includes a subsumption hierarchy that attempts to relate the various coverage criteria associated with the identified combination strategies.
Constructing test suites for interaction testing
 Proc. Intl. Conf. on Software Engineering (ICSE 2003
, 2003
"... Software system faults are often caused by unexpected interactions among components. Yet the size of a test suite required to test all possible combinations of interactions can be prohibitive in even a moderately sized project. Instead, we may use pairwise or Øway testing to provide a guarantee tha ..."
Abstract

Cited by 88 (22 self)
 Add to MetaCart
(Show Context)
Software system faults are often caused by unexpected interactions among components. Yet the size of a test suite required to test all possible combinations of interactions can be prohibitive in even a moderately sized project. Instead, we may use pairwise or Øway testing to provide a guarantee that all pairs or Øway combinations of components are tested together. This concept draws on methods used in statistical testing for manufacturing and has been extended to software system testing. A covering array, � � Æ � Ø � � � Ú,isanÆ ¢ � array on Ú symbols such that every Æ ¢ Ø subarray contains all ordered subsets from Ú symbols of size Ø at least once. The properties of these objects, however, do not necessarily satisfy real software testing needs. Instead we examine a less studied object, the mixed level covering array and propose a new object, the variable strength covering array, which provides a more robust environment for software interaction testing. Initial results are presented suggesting that heuristic search techniques are more effective than some of the known greedy methods for finding smaller sized test suites. We present a discussion of an integrated approach for finding covering arrays and discuss how application of these techniques can be used to construct variable strength arrays. 1.
A Survey of Combinatorial Testing
, 2011
"... Combinatorial Testing (CT) can detect failures triggered by interactions of parameters in the Software Under Test (SUT) with a covering array test suite generated by some sampling mechanisms. It has been an active field of research in the last twenty years. This article aims to review previous work ..."
Abstract

Cited by 47 (1 self)
 Add to MetaCart
Combinatorial Testing (CT) can detect failures triggered by interactions of parameters in the Software Under Test (SUT) with a covering array test suite generated by some sampling mechanisms. It has been an active field of research in the last twenty years. This article aims to review previous work on CT, highlights the evolution of CT, and identifies important issues, methods, and applications of CT, with the goal of supporting and directing future practice and research in this area. First, we present the basic concepts and notations of CT. Second, we classify the research on CT into the following categories: modeling for CT, test suite generation, constraints, failure diagnosis, prioritization, metric, evaluation, testing procedure and the application of CT. For each of the categories, we survey the motivation, key issues, solutions, and the current state of research. Then, we review the contribution from different research groups, and present the growing trend of CT research. Finally, we recommend directions for future CT research, including: (1) modeling for CT, (2) improving the existing test suite generation algorithm, (3) improving analysis of testing result, (4) exploring the application of CT to different levels of testing and additional types of systems, (5) conducting more empirical studies to fully understand limitations and strengths of CT, and (6) combining CT with other testing techniques.
Combinatorial aspects of covering arrays
 LE MATEMATICHE (CATANIA
, 2004
"... Covering arrays generalize orthogonal arrays by requiring that ttuples be covered, but not requiring that the appearance of ttuples be balanced. Their uses in screening experiments has found application in software testing, hardware testing, and a variety of fields in which interactions among fact ..."
Abstract

Cited by 35 (9 self)
 Add to MetaCart
(Show Context)
Covering arrays generalize orthogonal arrays by requiring that ttuples be covered, but not requiring that the appearance of ttuples be balanced. Their uses in screening experiments has found application in software testing, hardware testing, and a variety of fields in which interactions among factors are to be identified. Here a combinatorial view of covering arrays is adopted, encompassing basic bounds, direct constructions, recursive constructions, algorithmic methods, and applications.
A Framework of Greedy Methods for Constructing Interaction Test Suites
 Intl. Conf. on Software Engineering (ICSE’05
, 2005
"... Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one test at a time. Within this framework are many instantiations of greedy methods generalizing those in the literature. Gre ..."
Abstract

Cited by 33 (8 self)
 Add to MetaCart
(Show Context)
Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one test at a time. Within this framework are many instantiations of greedy methods generalizing those in the literature. Greedy algorithms are popular when the time for test suite construction is of paramount concern. We focus on the size of the test suite produced by each instantiation. Experiments are analyzed using statistical techniques to determine the importance of the implementation decisions within the framework. This framework provides a platform for optimizing the accuracy and speed of "onetestatatime" greedy methods.
Factorcovering designs for testing software
 Technometrics
, 1998
"... Testing is a critical component of modern software development. The problem of designing a suite of test cases is superficially similar to that of designing an experiment to estimate main effects and interactions, but there are crucial differences. Additive models are unhelpful, and classical design ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
Testing is a critical component of modern software development. The problem of designing a suite of test cases is superficially similar to that of designing an experiment to estimate main effects and interactions, but there are crucial differences. Additive models are unhelpful, and classical design criteria are also. We propose a new class of models, and new measures of effectiveness. We compare several designs.
IPOG: A General Strategy for TWay Software Testing
"... Most existing work on tway testing has focused on 2way (or pairwise) testing, which aims to detect faults caused by interactions between any two parameters. However, faults can also be caused by interactions involving more than two parameters. In this paper, we generalize an existing strategy, cal ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
(Show Context)
Most existing work on tway testing has focused on 2way (or pairwise) testing, which aims to detect faults caused by interactions between any two parameters. However, faults can also be caused by interactions involving more than two parameters. In this paper, we generalize an existing strategy, called InParameterOrder (IPO), from pairwise testing to tway testing. A major challenge of our generalization effort is dealing with the combinatorial growth in the number of combinations of parameter values. We describe a tway testing tool, called FireEye, and discuss design decisions that are made to enable an efficient implementation of the generalized IPO strategy. We also report several experiments that are designed to evaluate the effectiveness of FireEye. 1.
Constructing strength three covering arrays with augmented annealing
, 2003
"... A covering array CA(N;t,k,v) is an N × k array such that every N × t subarray contains all ttuples from v symbols at least once, where t is the strength of the array. One application of these objects is to generate software test suites to cover all tsets of component interactions. Methods for con ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
(Show Context)
A covering array CA(N;t,k,v) is an N × k array such that every N × t subarray contains all ttuples from v symbols at least once, where t is the strength of the array. One application of these objects is to generate software test suites to cover all tsets of component interactions. Methods for construction of covering arrays for software testing have focused on two main areas. The first is finding new algebraic and combinatorial constructions that produce smaller covering arrays. The second is refining computational search algorithms to find smaller covering arrays more quickly. In this paper, we examine some new cutandpaste techniques for strength three covering arrays that combine recursive combinatorial constructions with computational search, augmented annealing. This method leverages the computational efficiency and optimality of size obtained through combinatorial constructions while benefiting from the generality of a heuristic search. We present a few examples of specific constructions and provide new bounds for some strength three covering arrays.