Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson

Test Generation from Requirements

Output: A set of constraints S

E

that guarantees the detection of

missing or extra NOT operator fault in a faulty version

of E.

Procedure: .*$4&5

Step 1 For each term e

i

, 1 ≤ i ≤ n, construct T

e

i

as the set of con-

straints that make e

i

true.

Step 2 Let TS

e

i

= T

e

i

−∪

n

j=1,i = j

T

e

j

. Note that for i = j, TS

e

i

∩

TS

e

j

= Ø.

Step 3 Construct S

t

E

by including one constraint from each

TS

e

i

, 1 ≤ i ≤ n. Note that for each constraint c ∈ S

t

E

, p(c) =

USVF.

Step 4 Let e

j

i

denote the term obtained by complementing the j

th

literal in term e

i

,for1≤ i ≤ n and 1 ≤ j < l

j

. We count the

literals in a term from left to right, the leftmost literal being

the first. Construct F

e

j

i

as the set of constraints that make e

j

i

true.

Step 5 Let FS

e

j

i

= F

e

j

i

−∪

n

k=1