Foundations of Software Testing: Fundamental Algorithms and Techniques

Basics of Software Testing

Start

1

4

8

End

2

true

false

false

true

3

false

5

6

7

9

true

Fig. 1.17 Flow graph representation of Program P1.2. A complete path is shown us-

ing bold edges and a subpath using a dashed line.

The next two paths of lengths 4 and 5 are incomplete. The first of

these two paths is shown by a dashed line in Figure 1.17.

p

3

= (5, 7, 8, 9)

p

4

= (6, 5, 7, 9, End)

The next two paths of lengths 11 and 8 are complete but

infeasible.

p

5

= (Start, 1, 3, 4, 5, 6, 5, 7, 8, 9, End)

p

6

= (Start, 1, 2, 4, 5, 7, 9, End)

Finally, the next two paths are invalid as they do not satisfy the

sequence condition stated earlier.

p

7

= (Start, 1, 2, 4, 8, 9, End)

p

8

= (Start, 1,