# Graph Coverage Flashcards Preview

## ASE > Graph Coverage > Flashcards

Flashcards in Graph Coverage Deck (18)
1
Q
• Syntactic reach:
A

o Subpath exists in the graph

2
Q
• Semantic reach:
A

o A test exists that can execute that subpath

3
Q
• Deterministic software
A

o Test always executes the same test path – many to one

4
Q
• Non-deterministic software
A

o Test can execute different test paths – many to many

5
Q
• (NC)
A
• Node Coverage
o Contains each reachable node
o TR = {0,1,2}
o Test Path = [0,1,2]
6
Q
• (EC)
A
```- Edge Coverage
o	Each reachable path of length up to 1
o	TR = {(0,1) , (0,2) , (1,2)}
o	Test Path = [0,1,2], [0,2]
o	Every TR must be covered in Test Path```
7
Q
• (EPC)
A
• Edge Pair Coverage
o Each reachable path of length up to 2
o TR = { [0,1,2], [0,2,3], [0,2,4], [1,2,3], [1,2,4], [2,3,6], [2,4,5], [2,4,6], [4,5,4], [5,4,5], [5,4,6] }
o Test Paths: [ 0, 1, 2, 3, 6 ], [ 0, 1, 2, 4, 6 ], [ 0, 2, 3, 6 ], [ 0, 2, 4, 5, 4, 5, 4, 6 ]
8
Q
• Simple Path
A

o No node appears more than once, except possibly the first and last nodes

9
Q
• Prime Path
A

o Not appear as a proper subpath of any other simple path

10
Q
• Sidetrips
A

o Edges in same order
0 -> 2 -> 3 -> 4 -> 5
I
1

11
Q
• Detours
A

o Node in same order
0 | 2 -> 3 -> 4 -> 5
I ->
1

12
Q
• DU pair
A

o Variable is defined at i and used j

13
Q
• Def-clear
A

o Variable is not given another value in the path

14
Q
• Reach
A

o If there is a def-clear, the def reaches the use

15
Q
• Du path
A

o Simple subpath that is def-clear from a def to a use

16
Q
A

o Every def reaches a use

17
Q
• AUC
A
• All-uses coverage (AUC)

o Every def reaches all possible uses

18
Q