Branch testing requires a deep analysis of program structure in order to derive test data. A prototype tool which supports this analytic phase has been designed and is currently experimented at I.E.I. At first, the tool automatical1y produces the (block) control flow graph from the (C) program listing. Then, it looks for and signals "essential" branches, i.e. a minimal subset of program branches which would guarantee 100% coverage. Also, paths from program entry to each essential branch are suggested. The main requirement in the too1 design was its usability: in fact, the tool offers an easy X-Window interface. Further development should be integration with a coverage analyzer and direct individuation on the screen graph of unexercized branches.
Automated program structure analysis for branch testing
Bertolino A;Carlesi C;
1991
Abstract
Branch testing requires a deep analysis of program structure in order to derive test data. A prototype tool which supports this analytic phase has been designed and is currently experimented at I.E.I. At first, the tool automatical1y produces the (block) control flow graph from the (C) program listing. Then, it looks for and signals "essential" branches, i.e. a minimal subset of program branches which would guarantee 100% coverage. Also, paths from program entry to each essential branch are suggested. The main requirement in the too1 design was its usability: in fact, the tool offers an easy X-Window interface. Further development should be integration with a coverage analyzer and direct individuation on the screen graph of unexercized branches.File | Dimensione | Formato | |
---|---|---|---|
prod_447181-doc_161099.pdf
solo utenti autorizzati
Descrizione: Automated program structure analysis for branch testing
Tipologia:
Versione Editoriale (PDF)
Dimensione
3.13 MB
Formato
Adobe PDF
|
3.13 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.