Cargando…
Optimal path test data generation based on hybrid negative selection algorithm and genetic algorithm
Path testing is the basic approach of white box testing and the main approach to solve it by discovering the particular input data of the searching space to encompass the paths in the software under test. Due to the increasing software complexity, exhaustive testing is impossible and computationally...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7703959/ https://www.ncbi.nlm.nih.gov/pubmed/33253281 http://dx.doi.org/10.1371/journal.pone.0242812 |
_version_ | 1783616726706946048 |
---|---|
author | Mohi-Aldeen, Shayma Mustafa Mohamad, Radziah Deris, Safaai |
author_facet | Mohi-Aldeen, Shayma Mustafa Mohamad, Radziah Deris, Safaai |
author_sort | Mohi-Aldeen, Shayma Mustafa |
collection | PubMed |
description | Path testing is the basic approach of white box testing and the main approach to solve it by discovering the particular input data of the searching space to encompass the paths in the software under test. Due to the increasing software complexity, exhaustive testing is impossible and computationally not feasible. The ultimate challenge is to generate suitable test data that maximize the coverage; many approaches have been developed by researchers to accomplish path coverage. The paper suggested a hybrid method (NSA-GA) based on Negative Selection Algorithm (NSA) and Genetic Algorithm (GA) to generate an optimal test data avoiding replication to cover all possible paths. The proposed method modifies the generation of detectors in the generation phase of NSA using GA, as well as, develops a fitness function based on the paths’ prioritization. Different benchmark programs with different data types have been used. The results show that the hybrid method improved the coverage percentage of the programs’ paths, even for complicated paths and its ability to minimize the generated number of test data and enhance the efficiency even with the increased input range of different data types used. This method improves the effectiveness and efficiency of test data generation and maximizes search space area, increasing percentage of path coverage while preventing redundant data. |
format | Online Article Text |
id | pubmed-7703959 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2020 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-77039592020-12-03 Optimal path test data generation based on hybrid negative selection algorithm and genetic algorithm Mohi-Aldeen, Shayma Mustafa Mohamad, Radziah Deris, Safaai PLoS One Research Article Path testing is the basic approach of white box testing and the main approach to solve it by discovering the particular input data of the searching space to encompass the paths in the software under test. Due to the increasing software complexity, exhaustive testing is impossible and computationally not feasible. The ultimate challenge is to generate suitable test data that maximize the coverage; many approaches have been developed by researchers to accomplish path coverage. The paper suggested a hybrid method (NSA-GA) based on Negative Selection Algorithm (NSA) and Genetic Algorithm (GA) to generate an optimal test data avoiding replication to cover all possible paths. The proposed method modifies the generation of detectors in the generation phase of NSA using GA, as well as, develops a fitness function based on the paths’ prioritization. Different benchmark programs with different data types have been used. The results show that the hybrid method improved the coverage percentage of the programs’ paths, even for complicated paths and its ability to minimize the generated number of test data and enhance the efficiency even with the increased input range of different data types used. This method improves the effectiveness and efficiency of test data generation and maximizes search space area, increasing percentage of path coverage while preventing redundant data. Public Library of Science 2020-11-30 /pmc/articles/PMC7703959/ /pubmed/33253281 http://dx.doi.org/10.1371/journal.pone.0242812 Text en © 2020 Mohi-Aldeen et al http://creativecommons.org/licenses/by/4.0/ This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. |
spellingShingle | Research Article Mohi-Aldeen, Shayma Mustafa Mohamad, Radziah Deris, Safaai Optimal path test data generation based on hybrid negative selection algorithm and genetic algorithm |
title | Optimal path test data generation based on hybrid negative selection algorithm and genetic algorithm |
title_full | Optimal path test data generation based on hybrid negative selection algorithm and genetic algorithm |
title_fullStr | Optimal path test data generation based on hybrid negative selection algorithm and genetic algorithm |
title_full_unstemmed | Optimal path test data generation based on hybrid negative selection algorithm and genetic algorithm |
title_short | Optimal path test data generation based on hybrid negative selection algorithm and genetic algorithm |
title_sort | optimal path test data generation based on hybrid negative selection algorithm and genetic algorithm |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7703959/ https://www.ncbi.nlm.nih.gov/pubmed/33253281 http://dx.doi.org/10.1371/journal.pone.0242812 |
work_keys_str_mv | AT mohialdeenshaymamustafa optimalpathtestdatagenerationbasedonhybridnegativeselectionalgorithmandgeneticalgorithm AT mohamadradziah optimalpathtestdatagenerationbasedonhybridnegativeselectionalgorithmandgeneticalgorithm AT derissafaai optimalpathtestdatagenerationbasedonhybridnegativeselectionalgorithmandgeneticalgorithm |