C4 Flashcards
(8 cards)
1
Q
reach(n)
A
nodes of the subgraph that can be reached from n
2
Q
test path
A
a path that starts in an initial node and ends at a final node
represent execution of test cases
- some test cases cannot be executed by any tests
- some test cases can be executed by many tests
3
Q
SESE graphs
A
all test paths start at a single node and end at another node
single-entry, single-exit
4
Q
syntactic reach
A
a subpath exists in the graph
5
Q
semantic reach
A
a test exists that can execute that subpath
6
Q
tour
A
a test path p tours a path q if q is a subpath of p
7
Q
structural coverage criteria
A
defined on a graph just in terms of nodes and edges
8
Q
data flow coverage criteria
A
requires a graph to be annotated with references to variables
