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
or a power of prime. Such methods are beyond the scope of this book.
There is no general method available to construct the largest possible
MOLS(n)forn that is not a prime or a power of prime. The CRC
Handbook of Combinatorial Designs (see the Bibliographic Notes section
of this chapter) lists a large set of MOLS for various values of n.
4.6 PAIRWISE DESIGN: BINARY FACTORS
We now introduce techniques for selecting a subset of factor combina-
tions from the complete set. First, we focus on programs whose config-
uration or input space can be modeled as a collection of factors where
each factor assumes one or two values. We are interested in selecting a
subset from the complete set of factor combinations such that all pairs
of factor lev ...
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