This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Software Testing, Quality Assurance and Maintenance Winter 2010 Lecture 6 January 15, 2010 Patrick Lam version 3 Prime Path Coverage versus Complete Path Coverage. n n 1 n 2 n 3 Prime paths: path( t 1 ) = path( t 2 ) = T 1 = { t 1 ,t 2 } satisfies both PPC and CPC. q q 1 q 3 q 4 q 2 Prime paths: path( t 3 ) = path( t 4 ) = T 1 = { t 3 ,t 4 } satisfies both PPC but not CPC. 1 Specifying versus meeting test requirements. Consider this graph. n n 1 n 2 n 3 The following simple (and loopfree) path is, in fact, prime: p = PPC includes this path as a test requirement. The test path meets the test requirement induced by p even though it is not prime. Note that a test path may satisfy the prime path test requirement even though it is not prime. Sidetrips and Detours Lets expand the notion of a tour. Recall that our definition of tour is strict: for path p to tour subpath p = [ n 1 ,n 2 ,n 3 ], p must contain exactly the sequence n 1 n 2 n 3...
View
Full
Document
This note was uploaded on 03/19/2010 for the course CS 447 taught by Professor Lam during the Winter '10 term at Waterloo.
 Winter '10
 Lam

Click to edit the document details