|
|
| Coverage | Input | Coverage | Desired | Observed |
| C0: | 5,2 | ACF (TT) | 1,2 | 1,2 |
| 8,6 | ADE (FF) | 7,8 | 7,8 | |
| C1: | 2,5 | BCF (TT) | 1,2 | 1,2 |
| C2: | 4,4 | BDF (TF) | 4,4 | 1,2 |
| 7,5 | ADE (FT) | 6,7 | 1,2 | |
| C7: | 4,8 | BDE (TF) | 6,8 | 1,2 |
| 9,7 | ADF (FF) | 7,8 | 7,8 | |
![]() | (TT), (FF), (FT), and (TF) specify the boolean values
of the two conditions within the (faulty) second if statement.
|
![]() | C0 tries to cover all statements but not the empty
else clauses, i.e. B is not included.
|
![]() | C1 adds a test case for B.
|
![]() | C2 completes the set of possible boolean values
(there were just (TT) and (FF) so far).
|
![]() | C7 adds BDE and ADF which were missing from the set
of 6 possible paths. Note that ACE and BCE are impossible
because if C is taken, E can no longer be reached.
|
|
| Copyright © 2001, 2002 Andreas Borchert, converted to HTML on February 21, 2002 |