Citation Context

...no forbidden configuration, and this is a basic necessary condition for the construction of a test suite. This is a “constraint satisfaction” problem, and these are known to be NP-complete in general =-=[19]-=-. Even when we treat only pairwise coverage and assume that every factor takes on only three values, it is NP-complete to decide whether there is even a single test that violates none of the constrain...

Citation Context

...When testers specify that certain interactions are of higher priority, it is desirable to include them in the earliest tests of a test suite. A test case prioritization problem is formally defined in =-=[21]-=-. Given: • T, a test suite, • Π, the set of all test suites obtained by permuting the tests of T, and • f, a function from Π to the real numbers. Problem: Find π ∈ Π such that ∀π ′ ∈ Π, f(π) ≥ f(π ′ )...

Citation Context

...erage of weight. Covering arrays have been extensively studied [8]. Specifically, combinatorial constructions appear in [14] and therein; heuristic search in [7] and therein; and greedy algorithms in =-=[4,5]-=- and therein. The main criteria for evaluation of these techniques have been the size of the test suites and the execution time. However consideration has also been given to other practical concerns: ...

Citation Context

...ritization may be based upon code coverage, cost estimate (i.e., how much execution time a test incurs), areas of recent changes, areas that testers believe to be particularly fault-prone, and others =-=[12,13,21]-=-. Prioritization may even be based on user profiles, operational profiles, or specification based usage modeling to generate stochastic models of sequences [24,25]. In any case, prioritization techniq...

Citation Context

... and yi together, for i ∈ {0, 1, 2}. A test violating no constraints is equivalent in this way to a proper 3-vertex-colouring of G, and determining 3-colourability is a well-known NP-complete problem =-=[23]-=-. 4 An Algorithm for Prioritization We consider the construction of a test suite with k factors, adapting the Deterministic Density Algorithm (DDA) [4,9]. We first describe DDA at a high level and the...

Citation Context

...tio in identifying defects. Interaction testing may offer a benefit when used to complement current testing methods. For instance, Interaction testing has been applied in numerous instances including =-=[1,10,11,17,18,26]-=-. Interaction testing implements a model based testing approach using combinatorial design. In this approach, all t-tuples of interactions in a system are incorporated into a test suite. Indeed, inter...

Citation Context

...pirical studies that suggest that while some prioritization techniques may perform better than others, even their least sophisticated technique improved the rate of fault detection. Srivastava et al. =-=[22]-=- apply prioritization based on changes that have been made to a system for regression testing; they are able to expose defects early. Elbaum et al. [12] suggest which prioritization techniques may wor...

Citation Context

...tio in identifying defects. Interaction testing may offer a benefit when used to complement current testing methods. For instance, Interaction testing has been applied in numerous instances including =-=[1,10,11,17,18,26]-=-. Interaction testing implements a model based testing approach using combinatorial design. In this approach, all t-tuples of interactions in a system are incorporated into a test suite. Indeed, inter...

Citation Context

... the first ℓ tests yield a large total coverage of weight. Covering arrays have been extensively studied [8]. Specifically, combinatorial constructions appear in [14] and therein; heuristic search in =-=[7]-=- and therein; and greedy algorithms in [4,5] and therein. The main criteria for evaluation of these techniques have been the size of the test suites and the execution time. However consideration has a...

Citation Context

...tio in identifying defects. Interaction testing may offer a benefit when used to complement current testing methods. For instance, Interaction testing has been applied in numerous instances including =-=[1,10,11,17,18,26]-=-. Interaction testing implements a model based testing approach using combinatorial design. In this approach, all t-tuples of interactions in a system are incorporated into a test suite. Indeed, inter...

Citation Context

...tio in identifying defects. Interaction testing may offer a benefit when used to complement current testing methods. For instance, Interaction testing has been applied in numerous instances including =-=[1,10,11,17,18,26]-=-. Interaction testing implements a model based testing approach using combinatorial design. In this approach, all t-tuples of interactions in a system are incorporated into a test suite. Indeed, inter...

Citation Context

...ritization may be based upon code coverage, cost estimate (i.e., how much execution time a test incurs), areas of recent changes, areas that testers believe to be particularly fault-prone, and others =-=[12,13,21]-=-. Prioritization may even be based on user profiles, operational profiles, or specification based usage modeling to generate stochastic models of sequences [24,25]. In any case, prioritization techniq...

Citation Context

...tio in identifying defects. Interaction testing may offer a benefit when used to complement current testing methods. For instance, Interaction testing has been applied in numerous instances including =-=[1,10,11,17,18,26]-=-. Interaction testing implements a model based testing approach using combinatorial design. In this approach, all t-tuples of interactions in a system are incorporated into a test suite. Indeed, inter...

Citation Context

...ticularly fault-prone, and others [12,13,21]. Prioritization may even be based on user profiles, operational profiles, or specification based usage modeling to generate stochastic models of sequences =-=[24,25]-=-. In any case, prioritization techniques strive to increase a test suite’s rate of fault detection by trying to identify faults early in the testing process. When defects are found sooner, there is mo...

Citation Context

...e larger total benefit. Although precise, this definition should be seen as a goal rather than a requirement. Finding an ℓ-biased covering array is NP-hard, even when all benefits for pairs are equal =-=[9]-=-. Worse yet, the value of ℓ is rarely known in advance. For these reasons, we use the term biased covering array to mean a covering array in which the tests are ordered, and for every ℓ, the first ℓ t...

Citation Context

...he tests are ordered, and for every ℓ, the first ℓ tests yield a large total coverage of weight. Covering arrays have been extensively studied [8]. Specifically, combinatorial constructions appear in =-=[14]-=- and therein; heuristic search in [7] and therein; and greedy algorithms in [4,5] and therein. The main criteria for evaluation of these techniques have been the size of the test suites and the execut...

Citation Context

...biased covering array to mean a covering array in which the tests are ordered, and for every ℓ, the first ℓ tests yield a large total coverage of weight. Covering arrays have been extensively studied =-=[8]-=-. Specifically, combinatorial constructions appear in [14] and therein; heuristic search in [7] and therein; and greedy algorithms in [4,5] and therein. The main criteria for evaluation of these techn...

Citation Context

...erage of weight. Covering arrays have been extensively studied [8]. Specifically, combinatorial constructions appear in [14] and therein; heuristic search in [7] and therein; and greedy algorithms in =-=[4,5]-=- and therein. The main criteria for evaluation of these techniques have been the size of the test suites and the execution time. However consideration has also been given to other practical concerns: ...

Citation Context

...tio in identifying defects. Interaction testing may offer a benefit when used to complement current testing methods. For instance, Interaction testing has been applied in numerous instances including =-=[1,10,11,17,18,26]-=-. Interaction testing implements a model based testing approach using combinatorial design. In this approach, all t-tuples of interactions in a system are incorporated into a test suite. Indeed, inter...

Citation Context

... of interactions in a system are incorporated into a test suite. Indeed, interaction testing measures interactions versus detecting interactions; the goal is to cover pairs rather than avoid aliasing =-=[16]-=-. Higher order interactions are not included in this paper. Our research extends the software interaction testing paradigm to provide both coverage of interactions, and also prioritization of the orde...

Citation Context

...n can be saved through more effective testing. There is a need for Email address: {rcbryce,colbourn}@asu.edu (Renée C. Bryce and Charles J. Colbourn). 1 A preliminary version of this paper appears in =-=[3]-=-. Preprint submitted to Elsevier Science 20 January 2006sadvanced software testing techniques that offer an effective cost-benefit ratio in identifying defects. Interaction testing may offer a benefit...

Citation Context

...ticularly fault-prone, and others [12,13,21]. Prioritization may even be based on user profiles, operational profiles, or specification based usage modeling to generate stochastic models of sequences =-=[24,25]-=-. In any case, prioritization techniques strive to increase a test suite’s rate of fault detection by trying to identify faults early in the testing process. When defects are found sooner, there is mo...

Citation Context

...ariety of parameters; permitting seeds, or user specified tests; and blocking avoids that are not to be covered, to name a few. Recently, constructions that also provide prioritized ordering of tests =-=[2]-=- have been considered. The algorithm to be presented here constructs pair-wise covering arrays while covering the most important values early. This work may be extended to t-way coverage. 3 Practical ...