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 def-clear path: Definition 1 A du-path with respect to v is a simple path that is def-clear 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 du-paths: • • • Coverage criteria using du-paths We next create groups of du-paths. Consider again the following double-diamond 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 du-paths: • def-path sets: fix a def and a variable, e.g. – du( n 5 ,x ) = – du( n 3 ,x ) = • def-pair sets: fix a def, a use, and a variable, e.g. du( n 5 ,n,x ) = These sets will give the notions of all-defs coverage (tour at least one du-path from each def-path set—a weak criterion); all-uses 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