All-pairs Testing

In computer science, all-pairs testing or pairwise testing is a combinatorial method of software testing that, for ''each pair'' of input parameters to a system (typically, a software algorithm), tests all possible discrete combinations of those parameters. Using carefully chosen test vectors, this can be done much faster than an exhaustive search of all combinations of all parameters, by "parallelizing" the tests of parameter pairs.

Rationale

The most common bugs in a program are generally triggered by either a single input parameter or an interaction between pairs of parameters. Bugs involving interactions between three or more parameters are both progressively less common and also progressively more expensive to find---such testing has as its limit the testing of all possible inputs. Thus, a combinatorial technique for picking test cases like all-pairs testing is a useful cost-benefit compromise that enables a significant reduction in the number of test cases without drastically compromising functional coverage.

More rigorously, if we assume that a test case has $N$ parameters given in a set $\ = \$.
The range of the parameters are given by $R(P_i)= R_i$.
Let's assume that $, R_i, = n_i$.
We note that the number of all possible test cases is a $\prod n_i$. Imagining that the code deals with the conditions taking only two parameters at a time, might reduce the number of needed test cases.

To demonstrate, suppose there are X,Y,Z parameters.
We can use a predicate of the form $P(X,Y,Z)$ of order 3, which takes all 3 as input, or rather three different order 2 predicates of the form $p(u,v)$. $P(X,Y,Z)$ can be written in an equivalent form of $p_(X,Y) , p_(Y,Z) , p_(Z,X)$ where comma denotes any combination. If the code is written as conditions taking "pairs" of parameters,
then the set of choices of ranges $X = \$ can be a multiset, because there can be multiple parameters having same number of choices.

$max(S)$ is one of the maximum of the multiset $S$
The number of pair-wise test cases on this test function would be:-
$T = max(X) \times max ( X \setminus max(X) )$

Therefore, if the $n = max(X)$ and $m = max ( X \setminus max(X) )$ then the number of tests is typically O(''nm''), where ''n'' and ''m'' are the number of possibilities for each of the two parameters with the most choices, and it can be quite a lot less than the exhaustive $\prod n_i$·

N-wise testing

N-wise testing can be considered the generalized form of pair-wise testing.

The idea is to apply sorting to the set $X = \$ so that $P = \$ gets ordered too.
Let the sorted set be a $N$ tuple :-

$P_s = < P_i > \; ; \; i < j \implies , R(P_i), < , R(P_j),$

Now we can take the set $X(2) = \$ and call it the pairwise testing.
Generalizing further we can take the set $X(3) = \$ and call it the 3-wise testing.
Eventually, we can say $X(T) = \$ T-wise testing.

The N-wise testing then would just be, all possible combinations from the above formula.

Example

Consider the parameters shown in the table below.

'Enabled', 'Choice Type' and 'Category' have a choice range of 2, 3 and 4, respectively. An exhaustive test would involve 24 tests (2 x 3 x 4). Multiplying the two largest values (3 and 4) indicates that a pair-wise tests would involve 12 tests. The pairwise test cases, generated by Microsoft's "pict" tool, are shown below.

See also

* Software testing
* Orthogonal array testing

Notes

External links

Pairwise testing

Pairwise and generalized t-way combinatorial testing

Pairwise Testing in the Real World: Practical Extensions to Test-Case Scenarios

{{DEFAULTSORT:All-Pairs Testing
Software testing
Combinatorics
Design of experiments