1 / 14

Structural (White-Box) Testing

Structural (White-Box) Testing. Software Testing Module Dr. Samer Hanna. Outline. Path Testing Control Flow Graph DD-Path Fraph Questions. Path testing. Structural testing method Based on the source code / pseudocode of the program or the system, and NOT on its specification.

kamali
Download Presentation

Structural (White-Box) Testing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Structural (White-Box) Testing Software Testing Module Dr. Samer Hanna

  2. Outline • Path Testing • Control Flow Graph • DD-Path Fraph • Questions

  3. Path testing • Structural testing method • Based on the source code / pseudocode of the program or the system, and NOT on its specification

  4. Example: Find the Control Flow Graph (CFG) for the Triangle Problem

  5. CFG

  6. CFG

  7. DD – Path Graph • A CFG can be broken into DD-paths • The resulting graph is called a DD-path graph of the program

  8. DD – Path Graph DD: Decision – to – Decision path • A DD-path is a sub-path in a program graph fulfilling one of the conditions below: 1. It consists of a single node with indeg = 0 2. It consists of a single node with outdeg = 0 3. It consists of a single node with indeg ≥ 2 or outdeg ≥ 2 4. It consists of a single node with indeg = 1 and outdeg = 1 5. It is a maximal chain of length ≥ 1

  9. DD – Path Graph

  10. CFG to DD-Path

  11. Independent (basis) paths Independent path is a path through a DD-path graph of the program which cannot be reproduced from other paths by – Addition (i.e. one path following another) – Repetition (e.g. loop)

  12. Independent (basis) paths

  13. Independent (basis) paths

  14. Questions ?

More Related