Information Technology Reference
In-Depth Information
include the operating system (OS), web browser, whether Flash plugin is installed
and the proxy configurations. For simplicity, each parameter has two values. The
SUT model can be described as follows:
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 will be transformed to “ p 2 ==
For simplicity, we use p 1 ,
p 2 ,
p 3 ,
1
1”.
First, we start by randomly reordering the parameter. Suppose the reordered para-
meters are p 1 ,
p 1 ==
p 4 ,
p 2 ,
p 3 , which are denoted by
p 1 , ˆ
ˆ
p 2 , ˆ
p 3 , ˆ
p 4 , respectively. So
constraint “ p 2 =
1” accordingly. The
reason that we reorder the parameters in this way is to help explain how IPOG-C
deal with constraints.
Then we initialize the test suite as the set of all valid combinations of the first
two parameters. It is easy to see that all combinations of
1
p 1 =
1” is changed to “
p 3 =
ˆ
1
→ˆ
p 1 =
ˆ
ˆ
p 1 and
p 2 are valid, so the
initial test suite is:
.
11
12
21
22
Then, we enter the for-loop in line 3:
Column #3 For i
=
3, we extend the covering array for
p 3 . The set of combinations
ˆ
π
is as follows:
π ={ (
1
, ,
1
, ), (
1
, ,
2
, ), (
2
, ,
1
, ), (
2
, ,
2
, ),
( ,
1
,
1
, ), ( ,
1
,
2
, ), ( ,
2
,
1
, ), ( ,
2
,
2
, ) } .
Then, we enter the horizontal extension stage:
Row #1 For the first test case, the number for newly-covered target combinations in
π
is 2 for both value 1 and 2, so we choose value 1 and append it to the test case,
which now becomes
(
1
,
1
,
1
, )
. And then we remove the newly-covered target
combinations from
π
, so it becomes:
π ={ (
1
, ,
2
, ), (
2
, ,
1
, ), (
2
, ,
2
, ),
( ,
1
,
2
, ), ( ,
2
,
1
, ), ( ,
2
,
2
, ) } .
Search WWH ::




Custom Search