Dynamic generation of test cases with metaheuristics
- Autores
- La Battaglia, Juan Pablo; Lanzarini, Laura Cristina
- Año de publicación
- 2009
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- The resolution of optimization problems is of great interest nowadays and has encouraged the development of various information technology methods to attempt solving them. There are several problems related to Software Engineering that can be solved by using this approach. In this paper, a new alternative based on the combination of population metaheuristics with a Tabu List to solve the problem of test cases generation when testing software is presented. This problem is of great importance for the development of software with a high computational cost and which is generally hard to solve. The performance of the solution proposed has been tested on a set of varying complexity programs. The results obtained show that the method proposed allows obtaining a reduced test data set in a suitable timeframe and with a greater coverage than conventional methods such as Random Method or Tabu Search.
I Workshop Innovación en Sistemas de Software (WISS)
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Particle Swarm Optimization
Heuristic methods
Testing tools (e.g., data generators, coverage testing)
Algorithms - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/21338
Ver los metadatos del registro completo
id |
SEDICI_1ec5e084e184976ab914e66d867e78a3 |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/21338 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Dynamic generation of test cases with metaheuristicsLa Battaglia, Juan PabloLanzarini, Laura CristinaCiencias InformáticasParticle Swarm OptimizationHeuristic methodsTesting tools (e.g., data generators, coverage testing)AlgorithmsThe resolution of optimization problems is of great interest nowadays and has encouraged the development of various information technology methods to attempt solving them. There are several problems related to Software Engineering that can be solved by using this approach. In this paper, a new alternative based on the combination of population metaheuristics with a Tabu List to solve the problem of test cases generation when testing software is presented. This problem is of great importance for the development of software with a high computational cost and which is generally hard to solve. The performance of the solution proposed has been tested on a set of varying complexity programs. The results obtained show that the method proposed allows obtaining a reduced test data set in a suitable timeframe and with a greater coverage than conventional methods such as Random Method or Tabu Search.I Workshop Innovación en Sistemas de Software (WISS)Red de Universidades con Carreras en Informática (RedUNCI)2009-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf1267-1275http://sedici.unlp.edu.ar/handle/10915/21338enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:27:26Zoai:sedici.unlp.edu.ar:10915/21338Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:27:26.684SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Dynamic generation of test cases with metaheuristics |
title |
Dynamic generation of test cases with metaheuristics |
spellingShingle |
Dynamic generation of test cases with metaheuristics La Battaglia, Juan Pablo Ciencias Informáticas Particle Swarm Optimization Heuristic methods Testing tools (e.g., data generators, coverage testing) Algorithms |
title_short |
Dynamic generation of test cases with metaheuristics |
title_full |
Dynamic generation of test cases with metaheuristics |
title_fullStr |
Dynamic generation of test cases with metaheuristics |
title_full_unstemmed |
Dynamic generation of test cases with metaheuristics |
title_sort |
Dynamic generation of test cases with metaheuristics |
dc.creator.none.fl_str_mv |
La Battaglia, Juan Pablo Lanzarini, Laura Cristina |
author |
La Battaglia, Juan Pablo |
author_facet |
La Battaglia, Juan Pablo Lanzarini, Laura Cristina |
author_role |
author |
author2 |
Lanzarini, Laura Cristina |
author2_role |
author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas Particle Swarm Optimization Heuristic methods Testing tools (e.g., data generators, coverage testing) Algorithms |
topic |
Ciencias Informáticas Particle Swarm Optimization Heuristic methods Testing tools (e.g., data generators, coverage testing) Algorithms |
dc.description.none.fl_txt_mv |
The resolution of optimization problems is of great interest nowadays and has encouraged the development of various information technology methods to attempt solving them. There are several problems related to Software Engineering that can be solved by using this approach. In this paper, a new alternative based on the combination of population metaheuristics with a Tabu List to solve the problem of test cases generation when testing software is presented. This problem is of great importance for the development of software with a high computational cost and which is generally hard to solve. The performance of the solution proposed has been tested on a set of varying complexity programs. The results obtained show that the method proposed allows obtaining a reduced test data set in a suitable timeframe and with a greater coverage than conventional methods such as Random Method or Tabu Search. I Workshop Innovación en Sistemas de Software (WISS) Red de Universidades con Carreras en Informática (RedUNCI) |
description |
The resolution of optimization problems is of great interest nowadays and has encouraged the development of various information technology methods to attempt solving them. There are several problems related to Software Engineering that can be solved by using this approach. In this paper, a new alternative based on the combination of population metaheuristics with a Tabu List to solve the problem of test cases generation when testing software is presented. This problem is of great importance for the development of software with a high computational cost and which is generally hard to solve. The performance of the solution proposed has been tested on a set of varying complexity programs. The results obtained show that the method proposed allows obtaining a reduced test data set in a suitable timeframe and with a greater coverage than conventional methods such as Random Method or Tabu Search. |
publishDate |
2009 |
dc.date.none.fl_str_mv |
2009-10 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/21338 |
url |
http://sedici.unlp.edu.ar/handle/10915/21338 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
dc.format.none.fl_str_mv |
application/pdf 1267-1275 |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1842260111858335744 |
score |
13.13397 |