PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Marrč M., Bertolino A. Using Spanning Sets for Coverage Testing. Published in: IEEE Transaction on Software Engineering, vol.29 n. 11 Link The document has been submitted to Journal IEEE Transactions on Software Engineering, Technical report, 2003.
 
 
Abstract
(English)
A test coverage criterion defines a set Ec of entities of the program flowgraph and requires that every entity in this set is covered under some test case. Coverage criteria are also used to measure the adequacy of the executed test cases. In this paper, we introduce the notion of spanning sets of entities for coverage testing. A spanning set is a minimum subset of Ec, such that a test suite covering the entities in this subset is guaranteed to cover every entity in Ec. When the coverage of an entity always guarantees the coverage of another entity, the former is said to subsume the latter. Based on the subsumption relation between entities, we provide a generic algorithm to find spanning sets for control flow and data flow-based test coverage criteria. We suggest several useful applications of spanning sets: They help reduce and estimate the number of test cases needed to satisfy coverage criteria. We also empirically investigate how the use of spanning sets affects the fault detection effectiveness.
Subject Control flow
coverage criteria
data flow
ddgraph
spanning sets
D.2 SOFTWARE ENGINEERING
D.2.5 Testing and Debugging



Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional