RepOK-based reduction of bounded exhaustive testing

Autores
Bengolea, Valeria Susana; Aguirre, Nazareno Matias; Marinov, Darko; Frias, Marcelo Fabian
Año de publicación
2014
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
While the effectiveness of bounded exhaustive test suites increases as one increases the scope for the bounded exhaustive generation, both the time for test generation and the time for test execution grow exponentially with respect to the scope. In this article, a set of techniques for reducing the time for bounded exhaustive testing, by either reducing the generation time or reducing the obtained bounded exhaustive suites, is proposed. The representation invariant of the software under test's input, implemented as a repOK routine, is exploited for these reductions in two ways: (i) to factor out separate representation invariants for disjoint structures of the inputs; and (ii) to partition valid inputs into equivalence classes, according to how these exercise the repOK code. The first is used in order to split the test input generation process, as disjoint substructures can be independently generated. The second is used in order to reduce the size of a bounded exhaustive test suite, by removing from the suite those tests that are equivalent to some tests already present in the suite.
Fil: Bengolea, Valeria Susana. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Aguirre, Nazareno Matias. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Computación; Argentina
Fil: Marinov, Darko. University of Illinois at Urbana; Estados Unidos
Fil: Frias, Marcelo Fabian. Instituto Tecnológico de Buenos Aires. Facultad de Ingeniería. Departamento de Informática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Materia
AUTOMATED TEST GENERATION
BOUNDED EXHAUSTIVE TESTING
TEST SUITE REDUCTION
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/98656
Acceder
id CONICETDig_b63d98461cdb1ee4cd5d01778428ee5e
oai_identifier_str oai:ri.conicet.gov.ar:11336/98656
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling RepOK-based reduction of bounded exhaustive testingBengolea, Valeria SusanaAguirre, Nazareno MatiasMarinov, DarkoFrias, Marcelo FabianAUTOMATED TEST GENERATIONBOUNDED EXHAUSTIVE TESTINGTEST SUITE REDUCTIONhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1While the effectiveness of bounded exhaustive test suites increases as one increases the scope for the bounded exhaustive generation, both the time for test generation and the time for test execution grow exponentially with respect to the scope. In this article, a set of techniques for reducing the time for bounded exhaustive testing, by either reducing the generation time or reducing the obtained bounded exhaustive suites, is proposed. The representation invariant of the software under test's input, implemented as a repOK routine, is exploited for these reductions in two ways: (i) to factor out separate representation invariants for disjoint structures of the inputs; and (ii) to partition valid inputs into equivalence classes, according to how these exercise the repOK code. The first is used in order to split the test input generation process, as disjoint substructures can be independently generated. The second is used in order to reduce the size of a bounded exhaustive test suite, by removing from the suite those tests that are equivalent to some tests already present in the suite.Fil: Bengolea, Valeria Susana. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Aguirre, Nazareno Matias. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Computación; ArgentinaFil: Marinov, Darko. University of Illinois at Urbana; Estados UnidosFil: Frias, Marcelo Fabian. Instituto Tecnológico de Buenos Aires. Facultad de Ingeniería. Departamento de Informática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaJohn Wiley & Sons Ltd2014-12info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/98656Bengolea, Valeria Susana; Aguirre, Nazareno Matias; Marinov, Darko; Frias, Marcelo Fabian; RepOK-based reduction of bounded exhaustive testing; John Wiley & Sons Ltd; Software Testing, Verification & Reliability; 24; 8; 12-2014; 629-6550960-0833CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1002/stvr.1547info:eu-repo/semantics/altIdentifier/url/https://onlinelibrary.wiley.com/doi/abs/10.1002/stvr.1547info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-22T11:20:29Zoai:ri.conicet.gov.ar:11336/98656instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-22 11:20:29.257CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv RepOK-based reduction of bounded exhaustive testing
title RepOK-based reduction of bounded exhaustive testing
spellingShingle RepOK-based reduction of bounded exhaustive testing
Bengolea, Valeria Susana
AUTOMATED TEST GENERATION
BOUNDED EXHAUSTIVE TESTING
TEST SUITE REDUCTION
title_short RepOK-based reduction of bounded exhaustive testing
title_full RepOK-based reduction of bounded exhaustive testing
title_fullStr RepOK-based reduction of bounded exhaustive testing
title_full_unstemmed RepOK-based reduction of bounded exhaustive testing
title_sort RepOK-based reduction of bounded exhaustive testing
dc.creator.none.fl_str_mv Bengolea, Valeria Susana
Aguirre, Nazareno Matias
Marinov, Darko
Frias, Marcelo Fabian
author Bengolea, Valeria Susana
author_facet Bengolea, Valeria Susana
Aguirre, Nazareno Matias
Marinov, Darko
Frias, Marcelo Fabian
author_role author
author2 Aguirre, Nazareno Matias
Marinov, Darko
Frias, Marcelo Fabian
author2_role author
author
author
dc.subject.none.fl_str_mv AUTOMATED TEST GENERATION
BOUNDED EXHAUSTIVE TESTING
TEST SUITE REDUCTION
topic AUTOMATED TEST GENERATION
BOUNDED EXHAUSTIVE TESTING
TEST SUITE REDUCTION
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv While the effectiveness of bounded exhaustive test suites increases as one increases the scope for the bounded exhaustive generation, both the time for test generation and the time for test execution grow exponentially with respect to the scope. In this article, a set of techniques for reducing the time for bounded exhaustive testing, by either reducing the generation time or reducing the obtained bounded exhaustive suites, is proposed. The representation invariant of the software under test's input, implemented as a repOK routine, is exploited for these reductions in two ways: (i) to factor out separate representation invariants for disjoint structures of the inputs; and (ii) to partition valid inputs into equivalence classes, according to how these exercise the repOK code. The first is used in order to split the test input generation process, as disjoint substructures can be independently generated. The second is used in order to reduce the size of a bounded exhaustive test suite, by removing from the suite those tests that are equivalent to some tests already present in the suite.
Fil: Bengolea, Valeria Susana. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Aguirre, Nazareno Matias. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Río Cuarto. Facultad de Ciencias Exactas Fisicoquímicas y Naturales. Departamento de Computación; Argentina
Fil: Marinov, Darko. University of Illinois at Urbana; Estados Unidos
Fil: Frias, Marcelo Fabian. Instituto Tecnológico de Buenos Aires. Facultad de Ingeniería. Departamento de Informática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
description While the effectiveness of bounded exhaustive test suites increases as one increases the scope for the bounded exhaustive generation, both the time for test generation and the time for test execution grow exponentially with respect to the scope. In this article, a set of techniques for reducing the time for bounded exhaustive testing, by either reducing the generation time or reducing the obtained bounded exhaustive suites, is proposed. The representation invariant of the software under test's input, implemented as a repOK routine, is exploited for these reductions in two ways: (i) to factor out separate representation invariants for disjoint structures of the inputs; and (ii) to partition valid inputs into equivalence classes, according to how these exercise the repOK code. The first is used in order to split the test input generation process, as disjoint substructures can be independently generated. The second is used in order to reduce the size of a bounded exhaustive test suite, by removing from the suite those tests that are equivalent to some tests already present in the suite.
publishDate 2014
dc.date.none.fl_str_mv 2014-12
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/98656
Bengolea, Valeria Susana; Aguirre, Nazareno Matias; Marinov, Darko; Frias, Marcelo Fabian; RepOK-based reduction of bounded exhaustive testing; John Wiley & Sons Ltd; Software Testing, Verification & Reliability; 24; 8; 12-2014; 629-655
0960-0833
CONICET Digital
CONICET
url http://hdl.handle.net/11336/98656
identifier_str_mv Bengolea, Valeria Susana; Aguirre, Nazareno Matias; Marinov, Darko; Frias, Marcelo Fabian; RepOK-based reduction of bounded exhaustive testing; John Wiley & Sons Ltd; Software Testing, Verification & Reliability; 24; 8; 12-2014; 629-655
0960-0833
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1002/stvr.1547
info:eu-repo/semantics/altIdentifier/url/https://onlinelibrary.wiley.com/doi/abs/10.1002/stvr.1547
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv John Wiley & Sons Ltd
publisher.none.fl_str_mv John Wiley & Sons Ltd
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846781696311033856
score 13.167486

Publicaciones similares