Path coverage

• Path coverage requires that all paths through the control flow graph be exercised

• For the last example, we’d need four cases

  • {x=-1,z=-1;x=1,z=1;x=-1,z=1;x=1,z=-1}

• The problem with path coverage is that loops are intractable

  • It’s generally impossible to ensure that all possible paths are taken in a program with a loop

• Also, not all paths are feasible

Previous slide

Next slide

Back to first slide

View graphic version