Scribd
Upload
1K views8 pages

Call Graph Based: Integration

Call graph based integration uses the call graph of a program instead of the decomposition tree for integration testing. The call graph shows the calling relationships between program units like methods. Pairwise integration restricts testing to pairs of units that call each other based on the call graph edges. Neighborhood integration tests groups of interconnected units within a radius of one edge from a central unit. Call graph integration aims to reduce stubs and drivers but can have faults isolation and redundancy issues for large neighborhoods of units.

Uploaded by

Ananya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
1K views8 pages

Call Graph Based: Integration

Call graph based integration uses the call graph of a program instead of the decomposition tree for integration testing. The call graph shows the calling relationships between program units like methods. Pairwise integration restricts testing to pairs of units that call each other based on the call graph edges. Neighborhood integration tests groups of interconnected units within a radius of one edge from a central unit. Call graph integration aims to reduce stubs and drivers but can have faults isolation and redundancy issues for large neighborhoods of units.

Uploaded by

Ananya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

CALL GRAPH BASED

INTEGRATION

PREPARED BY,
ANANYA ASHOK NAIK
4CB18IS002
Contents

 Call graph based integration


 Pairwise Integration
 Neighbourhood Integration
 Pros and cons of call graph based integration
CALL GRAPH BASED INTEGRATION

o The basic idea is to use the call graph instead of the decomposition tree
o The call graph is a directed, labeled graph
Vertices are program units; e.g. methods
A directed edge joins calling vertex to the called vertex
Adjacency matrix is also used
Do not scale well, although some insights are useful
The basic idea is to use the call graph instead of the decomposition tree
o Nodes of high degree are critical
CALL GRAPH BASED INTEGRATION:

Call graph of Calendar Program

Call graph based top-down integration of Calendar program


PAIRWISE INTEGRATION:
o The idea behind Pair-Wise integration testing
 Eliminate need for developing stubs / drivers
 Use actual code instead of stubs/drivers
o In order not to deteriorate the process to a big-bang strategy
 Restrict a testing session to just a pair of units in the call graph
 Results in one integration test session for each edge in the call graph
o Pair-wise integration session example

Three pairs for pairwise integration


NEIGHBOURHOOD INTEGRATION:

o The neighborhood of a node in a graph


 The set of nodes that are one edge away from the given node
o In a directed graph
 All the immediate predecessor nodes and all the immediate successor nodes of a given node
o Neighborhood Integration Testing
 Reduces the number of test sessions
 Fault isolation is more difficult
o Neighborhood integration example

Three neighbourhoods of radius 1 for Neighbourhood Integration Graph


Pros and Cons of Call-Graph Integration:

o Aim to eliminate / reduce the need for drivers / stubs


 Development effort is a drawback
o Closer to a build sequence
o Neighborhoods can be combined to create “villages”
o Suffer from fault isolation problems
 Specially for large neighborhoods
o Redundancy
 Nodes can appear in several neighborhoods
o Assumes that correct behaviour follows from correct units and correct interfaces
 Not always the case
o Call-graph integration is well suited to devising a sequence of builds with which to
implement a system
THANK YOU

You might also like