Prioritized Variable-length Test Cases Generation for Finite State Machines
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG44__%2F23%3A00558160" target="_blank" >RIV/60162694:G44__/23:00558160 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21230/22:00362862
Result on the web
<a href="https://ieeexplore.ieee.org/document/9787927" target="_blank" >https://ieeexplore.ieee.org/document/9787927</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/ICSTW55395.2022.00017" target="_blank" >10.1109/ICSTW55395.2022.00017</a>
Alternative languages
Result language
angličtina
Original language name
Prioritized Variable-length Test Cases Generation for Finite State Machines
Original language description
Model-based Testing (MBT) is an effective approach for testing when parts of a system-under-test have the characteristics of a finite state machine (FSM). Despite various strategies in the literature on this topic, little work exists to handle special testing situations. More specifically, when concurrently: (1) the test paths can start and end only in defined states of the FSM, (2) a prioritization mechanism that requires only defined states and transitions of the FSM to be visited by test cases is required, and (3) the test paths must be in a given length range, not necessarily of explicit uniform length. This paper presents a test generation strategy that satisfies all these requirements. A concurrent combination of these requirements is highly practical for real industrial testing. Six variants of possible algorithms to implement this strategy are described. Using a mixture of 180 problem instances from real automotive and defense projects and artificially generated FSMs, all variants are compared with a baseline strategy based on an established N-switch coverage concept modification. Various properties of the generated test paths and their potential to activate fictional defects defined in FSMs are evaluated. The presented strategy outperforms the baseline in most problem configurations. Out of the six analyzed variants, three give the best results even though a universal best performer is hard to identify. Depending on the application of the FSM, the strategy and evaluation presented in this paper are applicable both in testing functional and non-functional software requirements.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings 2022 IEEE 15th International Conference on Software Testing, Verification and Validation Workshops ICSTW 2022
ISBN
978-1-6654-9628-5
ISSN
2159-4848
e-ISSN
—
Number of pages
10
Pages from-to
11-20
Publisher name
IEEE COMPUTER SOC
Place of publication
Valencia
Event location
ELECTR NETWORK
Event date
Apr 4, 2022
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000861805200004