Metaheuristic Algorithm for State-Based Software Testing
This article presents a metaheuristic algorithm for testing software, especially web applications, which can be modeled as a state transition diagram. We formulate the testing problem as an optimization problem and use a simulated annealing (SA) metaheuristic algorithm to generate test cases as sequ...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2018
|
| Online Access: | http://hdl.handle.net/10725/10208 https://doi.org/10.1080/08839514.2018.1451222 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://www.tandfonline.com/doi/abs/10.1080/08839514.2018.1451222 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This article presents a metaheuristic algorithm for testing software, especially web applications, which can be modeled as a state transition diagram. We formulate the testing problem as an optimization problem and use a simulated annealing (SA) metaheuristic algorithm to generate test cases as sequences of events while keeping the test suite size reasonable. SA evolves a solution by minimizing an energy function that is based on testing objectives such as coverage, diversity, and continuity of events. The suggested method includes a “significance weight” assigned to events, which leads to important web pages and ensures coverage of relevant features by test cases. The experimental results demonstrate the effectiveness of simulated annealing and show that SA yields good results for testing web applications in comparison with other heuristics. |
|---|