Foundations of Software Testing: Fundamental Algorithms and Techniques

Test Generation

c

0

c

1

c

2

c

3

c

4

c

5

c

6

c

7

s

0

s

1

s

0

s

1

s

0

s

1

s

0

s

1

s

0

s

1

s

0

s

1

1

3

2

56

4

Fig. 2.8

c

0

through

c

7

are the eight characters in

txt

starting at the leftmost position 0.

s

0

s

1

is the input string

s

. Shown here is the positioning of

s

with respect to

txt

at the two boundaries, labeled 1 and 2, and at four points near the boundary,

labeled 3 through 6.

The following tests, added to T, satisfy the four conditions listed

above.

t

6

:(

s

= “Laughter”,

txt

= “Laughter is good for the heart.”,)

t

7

:(

s

= “heart”,

txt

= “Laughter is good for the heart.”,)

t

8

:(

s

= “gLaughter”,

txt

= “Laughter is good for the heart.”),

t

9

:(

s

= “ heard.”,

txt

= “Laughter is good for the heart.”.)

We now have a total of nine ...