Derivation of test cases for model-based testing of software product line with hybrid heuristic approach
In Model-based testing (MBT) for Software Product Lines (SPLs), many algorithms have been proposed for test case generation. The test case is generated based on a test model which aims to achieve optimization. The heuristic search algorithm is one of the techniques that can be used to traverse the t...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2020
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/93439/ http://dx.doi.org/10.1007/978-3-030-33582-3_19 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In Model-based testing (MBT) for Software Product Lines (SPLs), many algorithms have been proposed for test case generation. The test case is generated based on a test model which aims to achieve optimization. The heuristic search algorithm is one of the techniques that can be used to traverse the test model with a good quality of solutions. This paper describes our experience in using three types of search algorithm, which are Floyd’s Warshall, Branch and Bound algorithm and Best First Search (FWA-BBA-BFS) which were integrated and hybridized in order to fully explore the test model. In this paper, this algorithm is validated based on test case results measured according to coverage criteria, generation time and size of test suite. Based on the experimental results, it is established that our proposed algorithm can generate test cases with reasonable cover-age, minimal execution time and appropriate size of test suite. |
|---|