Using spanning sets for coverage testing
Authors:
- 17 November 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 29 (11) , 974-984
Abstract
A test coverage criterion defines a set E/sub r/ 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 E/sub r/, such that a test suite covering the entities in this subset is guaranteed to cover every entity in E/sub r/. 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.Keywords
This publication has 16 references indexed in Scilit:
- Reducing and estimating the cost of test coverage criteria2002
- An empirical study of the effects of minimization on the fault detection capabilities of test suites2002
- A case study in branch testing automationJournal of Systems and Software, 1997
- How many paths are needed for branch testing?Journal of Systems and Software, 1996
- Unconstrained duals and their use in achieving all-uses coverage1996
- Automatic generation of path covers based on the control flow analysis of computer programsIEEE Transactions on Software Engineering, 1994
- Dominators, super blocks, and program coverage1994
- A methodology for controlling the size of a test suiteACM Transactions on Software Engineering and Methodology, 1993
- Unconstrained edges and their application to branch analysis and testing of programsJournal of Systems and Software, 1993
- A fast algorithm for finding dominators in a flowgraphACM Transactions on Programming Languages and Systems, 1979