Please enable JavaScript.

Coggle requires JavaScript to display documents.

Integration Testing - Coggle Diagram

- - - - Considera el sistema completo como un subsistema , Testea todos los modulos en una misma sesion , Solo una integration testing session
    - - Requiere pocos recursos, No requiere codeo extra
    - - No es sistematico, Dificil de localizar problemas, Dificil creacion de casos de prueba.
  - - - Integracion empieza en el programa principal , Se mueve de modulos de alto nivel a los de bajo nivel , Tiene Nnodes - Nleaves + Nedges sesiones de testeo de integracion
    - - Early SUT prototype , Interleaves design and implementation
    - - Throw-away code programming, Late interaction tests between the main program,
        the application layer and the hardware , Difficult to create test cases
  - - - Start at the leaves of the functional decomposition tree , Work toward to the higher level, to the root of the tree, Has nnodes − nleaves + nedges number of integration testing sessions
    - - Less throw-away code programming,Easy to create testing environments , Easy exceptions handling
    - - No prototype , Main program tested last , Late to identify design errors , High error correction cost
  - - - Combines top-down approach and bottom-up approach, Generally, higher level modules use a top-down approach (stub), Normally, lower level modules use a bottom-up approach (driver), Testing converges to the middle, Number of integration sessions can vary, The maximum number of sessions is the number of subtrees of the system
    - - Top and bottom layers can be done in parallel, Less stubs and drivers needed, Easy to contruct test cases , Better coverage control, Integration is done as soon a component is implemented
    - - Still requires throw-away code programming, Partial big bang integration , Hard to isolate problems
- - - - Each test session is restricted to only a pair of modules , Module pairing is based on the edges of the call graph , The number of integration testing sessions is the number of edges
    - - Stub and driver need is eliminated , Use of real code
    - - Many test sessions
  - - - Modules are grouped as neighbourhoods , A neighbour module is a module that is the immediate successor or predecessor of another unit, The number of integration testing sessions is nnodes − nsinknodes
    - - Stub and driver need is eliminated, Use of real code , Reduction of test sessions
    - - Hard to isolate faults