L5 - Software Testing Quality Assurance and Maintenance...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Software Testing, Quality Assurance and Maintenance Winter 2010 Lecture 5 — January 13, 2010 Patrick Lam version 2 Let’s consider an example of a test set which satisfies node coverage on D , the double-diamond graph from last time. Start with a test case t 1 ; assume that executing t 1 gives the test path path( t 1 ) = p 1 = [ n ,n 1 ,n 3 ,n 4 ,n 6 ] . Then test set { t 1 } does not give node coverage on D , because no test case covers node n 2 or n 5 . If we can find a test case t 2 with test path path( t 2 ) = p 2 = [ n ,n 2 ,n 3 ,n 5 ,n 6 ] , then the test set T = { t 1 ,t 2 } satisfies node coverage on D . What is another test set which satisfies node coverage on D ? Here is a more verbose definition of node coverage. Definition 1 Test set T satisfies node coverage on graph G if and only if for every syntactically reachable node n ∈ N , there is some path p in path ( T ) such that p visits n . A second standard criterion is that of edge coverage....
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.

Page1 / 4

L5 - Software Testing Quality Assurance and Maintenance...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online