This preview shows pages 1–2. 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 8 — January 20, 2010 Patrick Lam version 1 Building on the notion of a defclear path: Definition 1 A dupath with respect to v is a simple path that is defclear with respect to v from a node n i , such that v is in def ( n i ) , to a node n j , such that v is in use ( n j ) . (This definition could be easily modified to use edges e i and e j ). Note the following three points about dupaths: • • • Coverage criteria using dupaths We next create groups of dupaths. Consider again the following doublediamond graph D : n 5 : x = 5 u : use( x ) n 9 : x = 9 u 1 n 3 : x = 3 n : use( x ) u 2 : use( x ) We will define two sets of dupaths: • defpath sets: fix a def and a variable, e.g. – du( n 5 ,x ) = – du( n 3 ,x ) = • defpair sets: fix a def, a use, and a variable, e.g. du( n 5 ,n,x ) = These sets will give the notions of alldefs coverage (tour at least one dupath from each defpath set—a weak criterion); alluses coverage (tour at least one...
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