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
Test adequacy: The notion of test
adequacy, which we sometimes refer to as
test completeness, is as ancient as software
testing. While referring to the 1963
publication of Miller and Maloney [329],
Page and Balkovich write, “The goal of this
type of testing is to consider conditions
such that every path will be traversed at
least once.” [383]. Obviously, Page and
Balkovich were recommending a test
completeness criterion, that of complete
path coverage. Realizing the possibility of
an infinite number of paths in the
presence of loops, they further write,
“Loops may be tested in two ways,
depending on whether the number of ...
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