Statement Coverage

• Achieved when all statements in a method have been executed at least once
• Faults cannot be discovered if the parts containing them are not executed
• Equivalent to covering all nodes in Control Flow Graphs
• Executing a statement is a weak guarantee of correctness

$\text{statement coverage}=\frac{\text{\# of executed statements}}{\text{total \# of statements}}$

This is the most used in industry and typical targets are 80-90%.

Some problems include:

• Predicate may be tested for only one value
• Loop bodies may only be iterated once
• Statement coverage can be achieved without branch coverage