Information Technology Reference
In-Depth Information
Row #5
For the 5
th
test case, the number for newly-covered target combinations in
π
is 0 for value 1 and 1 for value 2, so we choose value 2 and append it to the test
case, which now becomes
(
∗
,
2
,
1
,
2
)
. And then, we remove the newly-covered target
combinations from
π
, which now becomes:
π
={
(
2
,
−
,
−
,
2
),
(
−
,
1
,
−
,
2
)
}
.
After horizontal growth, the test suite is now:
⎛
⎝
⎞
⎠
1111
1222
2121
2221
∗
,
212
and
π
={
(
2
,
−
,
−
,
2
),
(
−
,
1
,
−
,
2
)
}
.
Now we enter the vertical growth stage:
(1) For target combination
(
2
,
−
,
−
,
2
)
, it satisfies the constraint. Although test
case
(
∗
,
2
,
1
,
2
)
can be modified to cover this combination, the resulting test
case
(
2
,
2
,
1
,
2
)
violates the constraint. So we have to add one more test case
to the test suite.
(2) For target combination
(
2
,
∗
,
∗
,
2
)
(
−
,
1
,
−
,
2
)
, it satisfies the constraint, and the new test
case
(
2
,
∗
,
∗
,
2
)
can be modified to cover the combination. The resulting test
case
also satisfies the constraint, so we accept this modification and
no new test case is added.
(
2
,
1
,
∗
,
2
)
After this iteration terminates, the covering array becomes:
⎛
⎞
1111
1222
2121
2221
∗
⎝
⎠
.
212
21
∗
2
The test suite is a covering array for all the four parameters.
To finalize, the don't-care values in the covering array needs to be assigned. Since
with the presence of constraints, the user may have no idea which value to fill in,
and it is possible after some values assigned to parameters with don't-care values,
the resulting test case violates the constraints. We again check the validity of each
Search WWH ::
Custom Search