Skip to Main Content
Foundations of Software Testing: Fundamental Algorithms and Techniques
book

Foundations of Software Testing: Fundamental Algorithms and Techniques

by Aditya P. Mathur
March 2007
Intermediate to advanced content levelIntermediate to advanced
709 pages
20h 23m
English
Pearson India
Content preview from Foundations of Software Testing: Fundamental Algorithms and Techniques
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: MI-CSET
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) =
true.
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
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

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

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

Aditya P. Mathur
Fundamentals of Computer Programming and IT by Pearson

Fundamentals of Computer Programming and IT by Pearson

Ashok Namdev Kamthane, Rohit Khurana

Publisher Resources

ISBN: 9788131707951