Loading…
Transition coverage based test case generation from state chart diagram
State-based testing is a challenging area in the software testing field. This paper proposes a set of algorithms to generate test cases from a state chart diagram based on various coverage criteria. The objective is to find various types of state-based faults by covering states and transitions of an...
Saved in:
Published in: | Journal of King Saud University. Computer and information sciences 2022-03, Vol.34 (3), p.993-1002 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | State-based testing is a challenging area in the software testing field. This paper proposes a set of algorithms to generate test cases from a state chart diagram based on various coverage criteria. The objective is to find various types of state-based faults by covering states and transitions of an object. First, the state chart diagram is transformed into an intermediate graph, State Chart Intermediate Graph (SCIG). Then, for a given coverage criteria, traversing method is applied on SCIG to generate test cases. Different trees from SCIG based on various coverage criteria are extracted for test case generation. Various coverage criteria such as All Transition (AT), Round Trip Path (RTP) and All Transition Pair (ATP) are considered. We introduce algorithms for two most efficient state-based criteria, RTP and ATP. Two case studies, Stack Operation and Vending Machine Automation system, are discussed throughout the paper. We experimentally observed that (i) AT consumes the most test resources (ii) ATP can’t achieve 100% transition coverage (iii) test cases generated based on RTP is efficient, and it overcomes the transition explosion problem of AT. This analysis is beneficial in the area of semi-automatic test case generation in model-based testing. |
---|---|
ISSN: | 1319-1578 2213-1248 |
DOI: | 10.1016/j.jksuci.2019.05.005 |