Using Spanning Sets for Coverage Testing

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 e...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Marré, Martina
Publicado:	2003
Materias:	Control flow Coverage criteria Data flow Ddgraph Spanning sets Subsumption Data flow analysis Fault tolerant computer systems Flowcharting Heuristic methods Optimal systems Random processes Set theory Fault detection Software engineering
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00985589_v29_n11_p974_Marre http://hdl.handle.net/20.500.12110/paper_00985589_v29_n11_p974_Marre
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	paper:paper_00985589_v29_n11_p974_Marre
record_format	dspace
spelling	paper:paper_00985589_v29_n11_p974_Marre2023-06-08T15:09:56Z Using Spanning Sets for Coverage Testing Marré, Martina Control flow Coverage criteria Data flow Ddgraph Spanning sets Subsumption Data flow analysis Fault tolerant computer systems Flowcharting Heuristic methods Optimal systems Random processes Set theory Fault detection Spanning sets Software engineering 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 entitles for coverage testing. A spanning set is a minimum subset of E c, 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. Fil:Marré, M. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2003 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00985589_v29_n11_p974_Marre http://hdl.handle.net/20.500.12110/paper_00985589_v29_n11_p974_Marre
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Control flow Coverage criteria Data flow Ddgraph Spanning sets Subsumption Data flow analysis Fault tolerant computer systems Flowcharting Heuristic methods Optimal systems Random processes Set theory Fault detection Spanning sets Software engineering
spellingShingle	Control flow Coverage criteria Data flow Ddgraph Spanning sets Subsumption Data flow analysis Fault tolerant computer systems Flowcharting Heuristic methods Optimal systems Random processes Set theory Fault detection Spanning sets Software engineering Marré, Martina Using Spanning Sets for Coverage Testing
topic_facet	Control flow Coverage criteria Data flow Ddgraph Spanning sets Subsumption Data flow analysis Fault tolerant computer systems Flowcharting Heuristic methods Optimal systems Random processes Set theory Fault detection Spanning sets Software engineering
description	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 entitles for coverage testing. A spanning set is a minimum subset of E c, 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.
author	Marré, Martina
author_facet	Marré, Martina
author_sort	Marré, Martina
title	Using Spanning Sets for Coverage Testing
title_short	Using Spanning Sets for Coverage Testing
title_full	Using Spanning Sets for Coverage Testing
title_fullStr	Using Spanning Sets for Coverage Testing
title_full_unstemmed	Using Spanning Sets for Coverage Testing
title_sort	using spanning sets for coverage testing
publishDate	2003
url	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00985589_v29_n11_p974_Marre http://hdl.handle.net/20.500.12110/paper_00985589_v29_n11_p974_Marre
work_keys_str_mv	AT marremartina usingspanningsetsforcoveragetesting
_version_	1768544172861554688

Using Spanning Sets for Coverage Testing

Ejemplares similares