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
BIBLIOGRAPHIC NOTES
BIBLIOGRAPHIC NOTES
Combinatorial designs are used in a variety
of fields, such as behavioral science,
biology, and agriculture, for the design of
experiments. Their use in software testing
was first proposed in 1985 by Mandl [305]
who showed how Latin squares can be
used in the design of tests for a compiler. A
few years later, Brownlie et al. [58] used
combinatorial designs in the testing of the
AT&T PMX/StarMAIL application.
Design of tests using orthogonal arrays has
also been proposed by Phadke [396, 397]
and Sherwood [440].
A concise publication by Dalal and
Mallows [107] and the development of a
commercial tool named Automatic
Efficient ...
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