We present a general method to contruct a set of test paths satisfying a selected criterio within a family of control flow data flow-based coverage criteria. The method is based on the recent concept of a "spanning set" of enties, wich is minimum subset of program enties (e.g., branches or definition-use associations guaranteeeing full coverage.
A general path generation algorithm for coverage testing
Bertolino A;
1997
Abstract
We present a general method to contruct a set of test paths satisfying a selected criterio within a family of control flow data flow-based coverage criteria. The method is based on the recent concept of a "spanning set" of enties, wich is minimum subset of program enties (e.g., branches or definition-use associations guaranteeeing full coverage.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_409353-doc_143892.pdf
solo utenti autorizzati
Descrizione: A general path generation algorithm for coverage testing
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.88 MB
Formato
Adobe PDF
|
1.88 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.
