CS447 Lecture 4: L7.pdf
Document Summary
// (p could only be a su x of a non-extendable path; i"d use a tree:) if p is not a proper subpath of any simple path then primepaths+ = p end end. Next problem: nding test paths to tour all prime paths (to achieve prime path coverage). Usually you need far fewer test paths than prime paths. Book doesn"t present an algorithm, but suggests extending prime paths, starting from the longest prime paths. So far we"ve seen structure-based criteria which imposed test requirements solely based on the nodes and edges of a graph. These criteria have been oblivious to the contents of the nodes. However, programs mostly move data around, so it makes sense to propose some criteria based on the ow of data around a program. We"ll be talking about du-pairs, which connect de nitions and uses of variables. Let"s look at some graphs. n0: x = 5 n1: print(x)
