Black Box Testing Graphs and Relations

1
Black Box TestingGraphs and Relations

• Boris Beizer

2
Terms

• Graphs
• collection of objects
• Types of Graphs
• Control Flow Graphs
• Data Flow Graphs
• Trees
• Finite State Machine Graphs
• Transaction Flow Graphs
• Relations
• Association between objects

3
Terms - 2

• Nodes are objects in a graph
• Node Weight cost of crossing a node
• Link joins between nodes
• Directed Graph can only proceed in one
  direction
• Entry Node where the graph is entered
• Exit Node where you exit the graph

4
Terms - 3

• Path order of the nodes that are crossed
• Path Length how many nodes
• Loops a repeated path
• Loop Free Path

5
Graphs and Testing

• Graph is a generic model of testing
• Transaction Flow Model
• Objects - the steps in processing
• Relation is followed by the next step
• Links the steps follow each other

6
Graphs and Testing-2-

• Finite State model
• Objects - menus/word
• Relation - can directly reach
• Links - only one link between every choice

7
Graphs and Testing-3-

• Data Flow Model
• Objects data objects of interest
• Relations is used to calculate
• Links - direction of data flow
• Timing Model
• Objects sequence
• Relations is followed by
• Links time spots

8
Graphs and Testing-4-

• General
• Relations have properties
• Transitive and Intransitive Relations
• Transitvie
• Node1-gtNode2-gtNode3
• Intransitive
• Node1 -gt cannot get to node 2

9
Graphs and Testing-5-

• Symmetric and Asymmetric Relations
• Symmetric can always get there and return
• Asymetric cannot return or sometimes one way
• Reflexive and Irreflexive Relations
• Is there are return loop or not
• Equivalence Relation
• Is the relation Symetric, Transitive and
  Reflexive