University of Twente Student Theses
Test case shrinking for Model Based Testing on Symbolic Transition Systems
Meijer, L. (2021) Test case shrinking for Model Based Testing on Symbolic Transition Systems.
|
PDF
1MB |
| Abstract: | Test case shrinking is the process of reducing the size of failing test case to make them easier to analyse and debug. This thesis sets out to evaluate the effectiveness of shrinking algorithms such as Delta Debugging minimisation on failing test case derived from STSs. The five tested algorithms are: The Element Elimination Shrinking algorithm, the Binary Elimination Shrinking Algorithm and the Cycle Shrinking algorithm, all first introduced by Koopman et al. The other two algorithms have not yet been used test cases derived from state based models as STSs. They are the Location Cycle Shrinking algorithm, based on the Cycle Shrinking algorithm and the Delta Debugging shrinking algorithm based on the ddmin algorithm by Andreas Zeller. These five algorithms were tested in two experiments. One based on the experiment by Koopman et al. on a simple vending machine. The second experiment tested shrinking on a real system-world system provided by Axini. The best way to shrink test case derived from STSs depends on the system and the type of bug. In general the Cycle Shrinking algorithm or Location Cycle Shrinking algorithm is the best algorithm to start the shrinking process. |
| Item Type: | Essay (Master) |
| Clients: | Axini B.V., Amsterdam, Netherlands |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 54 computer science |
| Programme: | Computer Science MSc (60300) |
| Link to this item: | https://purl.utwente.nl/essays/85919 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page