Information Technology Reference
In-Depth Information
OS: Windows, Linux
Browser: IE, Firefox
Flash_Installed: Yes, No
Proxy: None, HTTP
Besides, we know the Internet Explorer (IE) browser can only be installed on
Windows, so the following constraint is specified:
Browser=="IE" -> OS=="Windows"
p
4
to represent the four parameters, and use
1 and 2 to represent their values. The constraint is transformed into “
p
2
For simplicity, we use
p
1
,
p
2
,
p
3
,
==
1
→
1”.
In this example, we use the AETG-SAT algorithm [
7
,
9
] for illustration.
As the first step, the algorithm initializes the set of target combinations. Here, we
use the vector form to represent parameter combinations. Suppose we have a combi-
nation
p
1
==
σ
={
(
p
i
1
,
v
i
1
), (
p
i
2
,
v
i
2
),...,(
p
i
l
,
v
i
l
)
}
. Its vector form is
(
ˆ
v
1
,
ˆ
v
2
,...,
ˆ
v
k
)
,
where for 1
≤
u
≤
k
,
v
i
j
,
if there exists some 1
≤
j
≤
l
, such that
u
=
i
j
v
u
=
ˆ
.
−
,
otherwise
For the above SUT, the combination
{
(
p
1
,
1
), (
p
3
,
2
)
}
can be represented by
(
1
,
−
,
.
Now the set of all two-way parameter combinations is as follows:
2
,
−
)
{
( 1 , 1 , - , - ) ,
( 1 , 2 , - , - ) ,
///////////////////////////
(2,1,-,-),
(2,2,-,-),
(1,-,1,-),
(1,-,2,-),
(2,-,1,-),
(2,-,2,-),
(1,-,-,1),
(1,-,-,2),
(2,-,-,1),
(2,-,-,2),
(-,1,1,-),
(-,1,2,-),
(-,2,1,-),
(-,2,2,-),
(-,1,-,1),
(-,1,-,2),
(-,2,-,1),
(-,2,-,2),
(-,-,1,1),
(-,-,1,2),
(-,-,2,1),
(-,-,2,2)
}
.
It is easy to see that target combination
(
2
,
1
,
−
,
−
)
is invalid so it is excluded
from the set of target combinations.
Now we show how the covering array is generated. For simplicity, the number of
candidate test cases
M
is set as 2.
Table 3.1
Number of occurrences of parameter-value pairs (1st iteration)
p
1
p
2
p
3
p
4
1
2
1
2
1
2
1
2
6
5
5
6
6
6
6
6
Search WWH ::
Custom Search