Skip to Main Content
Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson
book

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

by Aditya P. Mathur
May 2024
Intermediate to advanced content levelIntermediate to advanced
765 pages
21h 57m
English
Pearson India
Content preview from Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson
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:
"
×
#
= \
B
,
C
|
B
"
,
C
#
^ (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

Effective Software Testing, Video Edition

Effective Software Testing, Video Edition

Mauricio Aniche

Publisher Resources

ISBN: 9781299486720