http://www.cnr.it/ontology/cnr/individuo/prodotto/ID43679

Using spanning sets for coverage testing (Articolo in rivista)

Type

Label

Anno

Alternative label

Bertolino A., Marrè M. (2003)
Using spanning sets for coverage testing
in IEEE transactions on software engineering
(literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

Pagina inizio

Pagina fine

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume

Rivista

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note

Note

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

Titolo

Abstract

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. (literal)

Prodotto di