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
Let us first review the following two definitions of set products. The
product of two finite sets A and B, denoted as A × B, is defined as
follows:
A
×
B
= {(
a
,
b
)|
a
A
,
b
B
} (2.1)
We need another set product in order to be able to generate minimal sets
of constraints. The onto set product operator, written as , is defined as
follows; For finite sets A and B, A B is a minimal set of pairs (u,v)
such that u A,v B, and each element of A appears at least once as
u and each element of B appears at least once as v. Note that there are
several ways to compute A B when both A and B contain two or more
elements.
Example 2.26: Let A ={t, =,>} and B ={f,< }. Using the defini-
tions of set product and the onto product, we get the f
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