Combinatorial Black Hole Algorithm: A Metaheuristic Approach for Combinatorial Testing

Combinatorial Testing (CT) is a software testing technique that aims to identify defects in complex systems by covering as many combinations of input parameters as possible within a given time and resource constraint. The black hole algorithm (BHA) is a metaheuristic approach that has been used in...

全面介紹

Saved in:
書目詳細資料
Main Authors: Ibrahim, Izrulfizal Saufihamizal, Ibrahim, Rosziati, Mat Rejab, Mazidah
格式: Article
語言:English
出版: 2023
主題:
在線閱讀:http://eprints.uthm.edu.my/9509/1/J16037_80b1fdd9516c0f8ee033d23cfb119b29.pdf
http://eprints.uthm.edu.my/9509/
https://doi.org/10.14445/22315381/IJETT-V71I4P203
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
實物特徵
總結:Combinatorial Testing (CT) is a software testing technique that aims to identify defects in complex systems by covering as many combinations of input parameters as possible within a given time and resource constraint. The black hole algorithm (BHA) is a metaheuristic approach that has been used in multiple problems involving optimization. In this paper, a new approach called the Combinatorial Black Hole Algorithm (CBHA) is presented for CT that combines the strengths of CT and BHA. The effectiveness of this approach is demonstrated through experiments on a series of real-world computer programs. The findings indicate that the method is feasible in identifying defects with fewer test cases and in less time needed compared to the current technology in CT techniques. The approach can also handle larger and more complex systems more effectively. This study contributes to the software testing field with a way of providing a new and efficient approach for CT that practitioners and researchers can use