L11 - 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 11 January 27, 2010 Patrick Lam version 1 Data Flow Graph Coverage for Design Elements The structural coverage criteria for design elements were not very satisfying: basically we only had call graphs. Lets instead talk about data-bound relationships between design elements. First, some terms. caller: unit that invokes the callee; actual parameter: value passed to the callee by the caller; and formal parameter: placeholder for the incoming variable. Illustration. caller: ... foo(actual1, actual2); ... callee: void foo(int formal1, int formal2) { ... } We want to define du-pairs between callers and callees. Heres an example. 1: x=5 2: x=4 3: x=3 4: B(x) 11: B(int y) 12: z=y 13: t=y 14: print(y) Well say that the last-defs are 2, 3; the first-uses are 12, 13. We formally define these notions: Definition 1 (Last-def) . The set of nodes N that define a variable x for which there is a def-clear path from a node n N through a call to a use in the other unit....
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 / 3

L11 - 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