Question: Consider a program ?ow diagram as a directed graph in which the diamonds and boxes of the program are nodes, and the logic ?ow arrows
Consider a program ?ow diagram as a directed graph in which the diamonds and boxes of the program are nodes, and the logic ?ow arrows between them are directed edges.
Prove that statement testing of a program is equivalent to ?nding a path in the graph that contains all nodes of the graph. Prove that branch testing is equivalent to ?nding the set of paths whose union covers the edges.
Finally, prove that path testing is equivalent to ?nding all possible paths through the graph.
Step by Step Solution
3.50 Rating (153 Votes )
There are 3 Steps involved in it
To address the problem of relating software testing methods to coverage in program flow diagrams depicted as directed graphs we will prove the equival... View full answer
Get step-by-step solutions from verified subject matter experts
