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 Adequacy Assessment
Table 6.11 MC/DC adequacy and the growth in the least number of
tests required for a condition with n simple conditions
Minimum tests Time to execute all tests
n MC MC/DC MC MC/DC
12 2 2ms 2ms
4 16 5 16 ms 5 ms
8 256 9 256 ms 9 ms
16 65,536 17 65.5 s 17 ms
32 4,294,967,296 33 49.5 days 33 ms
6.2.10 DEFINITION OF MC/DC COVERAGE
We now provide a complete definition of the MC/DC coverage. A test set
T for program P written to meet requirements R is considered adequate
with respect to the MC/DC-coverage criterion if upon execution of P on
each test in T, the following requirements are met:
1. Each block in P has been covered.
2. Each simple ...
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