Foundations of Software Testing: Fundamental Algorithms and Techniques

Test Generation

is its direct descendant. S

N

1

and S

N

2

are the BRO-constraint

sets for nodes N

1

and N

2

, respectively. For each nonleaf node

N, compute S

N

as per Steps 2.1, 2.2, and 2.3 in Procedure

BRO-CSET.

Step 3 The constraint set for the root of AST(p

r

) is the desired BRO-

constraint set for p

r

.

End of Procedure BRO-CSET

Example 2.29: Let us construct the BRO-constraint set for

predicate p

r

:(a + b) < c ∧¬p ∨ (r > s). Figure 2.19 shows the

abstract syntax tree for p

r

with nodes labeled by the corrspond-

ing BRO-constraint sets. Let us derive these sets using Procedure

BRO-CSET.

First, the leaf nodes are labeled with the corresponding BRO-

constraint sets depending ...