C5

Question 1

simple paths

Answer 1

no node appears more than once, except possibly the first and last => no internal loops

Question 2

prime path

Answer 2

A simple path that does not appear as a proper subpath of any other simple path

Question 3

tour

Answer 3

a test path p tours a path q if q is a subpath of p

Question 4

tour with sidetrips

Answer 4

A test path p tours subpath q with sidetrips iff every edge in q is also in p in the same order => can include a sidetrip if it comes back to the same node

Question 5

tour with detours

Answer 5

A test path p tours subpath q with detours iff every edge in q is also in p in the same order => can include a detour from node n, if it comes back to the prime path at a successor of n

Question 6

best effort touring

Answer 6

• satisfy as many test requirements as possible without sidetrips
• allow sidetrips to try and satisfy unsatisfied test requirements

Question 7

DU pair

Answer 7

a pair of locations (l_i, l_j) such that a variable v is defined at l_i and used at l_j
NB: def before use in a loop does not count as DU pair

Question 8

Def-clear

Answer 8

a path from l_i to l_j is def-clear with respect to variable v if v is not used along the path except l_i, that is v is not given another value on any of the other nodes or edges in the path

Question 9

reach

Answer 9

if there is a def-clear path from l_i to l_j with respect to v, the def of v at l_i reaches the use at l_j

Question 10

du-path

Answer 10

a simple path that is def-clear with respect to v from a def of v to a use of v

Question 11

data flow test criteria

Answer 11

1. we make sure every def reaches a use => all-defs coverage (ADC)
2. make sure every def reaches all possible uses => all-uses coverage (AUC)
3. cover all the paths between defs and uses => all-du-paths coverage (ADUPC)