Foundations of Software Testing: Fundamental Algorithms and Techniques

Test Generation

3.8.6 TEST GENERATION

Let M = (X, Y, Q, q

1

, ‰, O) be an FSM from which we need to generate

tests to test an implementation for conformance. Let E denote the set

of core edges in M. m is the total number of core edges in M. Recall

that edges corresponding to a reset input in each state are included in

E. The following procedure is used to construct a total of m tests, each

corresponding to the tour of an edge:

1. Find the UIO for each state in M.

2. Find the shortest path from the initial state to each of the remain-

ing states. As mentioned earlier, the shortest path from the initial

state q

1

to any other state q

i

∈ Q is denoted by P

i

(q

1

).

3. Construct an edge tour for each edge in M. Let TE(e) denote a

subsequence that generates a tour f ...