Novel Strategy Generating Variable-Length State Machine Test Paths

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG44__%2F23%3A00558425" target="_blank" >RIV/60162694:G44__/23:00558425 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21230/22:00360011

Výsledek na webu

<a href="https://arxiv.org/pdf/2207.12172.pdf" target="_blank" >https://arxiv.org/pdf/2207.12172.pdf</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1142/S0218194022500474" target="_blank" >10.1142/S0218194022500474</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Novel Strategy Generating Variable-Length State Machine Test Paths

Popis výsledku v původním jazyce

Finite State Machine is a popular modeling notation for various systems, especially software and electronic. Test paths (TPs) can be automatically generated from the system model to test such systems using a suitable algorithm. This paper presents a strategy that generates TPs and allows to start and end TPs only in defined states of the finite state machine. The strategy also simultaneously supports generating TPs only of length in a given range. For this purpose, alternative system models, test coverage criteria, and a set of algorithms are developed. The strategy is compared with the best alternative based on the reduction of the test set generated by the established N-switch coverage approach on a mix of 171 industrial and artificially generated problem instances. The proposed strategy outperforms the compared variant in a smaller number of TP steps. The extent varies with the used test coverage criterion and preferred TP length range from none to two and half fold difference. Moreover, the proposed technique detected up to 30% more simple artificial defects inserted into experimental SUT models per one test step than the compared alternative technique. The proposed strategy is well applicable in situations where a possible TP starts and ends in a state machine needs to be reflected and, concurrently, the length of the TPs has to be in a defined range.

Název v anglickém jazyce

Novel Strategy Generating Variable-Length State Machine Test Paths

Popis výsledku anglicky

Finite State Machine is a popular modeling notation for various systems, especially software and electronic. Test paths (TPs) can be automatically generated from the system model to test such systems using a suitable algorithm. This paper presents a strategy that generates TPs and allows to start and end TPs only in defined states of the finite state machine. The strategy also simultaneously supports generating TPs only of length in a given range. For this purpose, alternative system models, test coverage criteria, and a set of algorithms are developed. The strategy is compared with the best alternative based on the reduction of the test set generated by the established N-switch coverage approach on a mix of 171 industrial and artificially generated problem instances. The proposed strategy outperforms the compared variant in a smaller number of TP steps. The extent varies with the used test coverage criterion and preferred TP length range from none to two and half fold difference. Moreover, the proposed technique detected up to 30% more simple artificial defects inserted into experimental SUT models per one test step than the compared alternative technique. The proposed strategy is well applicable in situations where a possible TP starts and ends in a state machine needs to be reflected and, concurrently, the length of the TPs has to be in a defined range.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

International Journal of Software Engineering and Knowledge Engineering

ISSN

0218-1940

e-ISSN

1793-6403

Svazek periodika

32

Číslo periodika v rámci svazku

8

Stát vydavatele periodika

SG - Singapurská republika

Počet stran výsledku

32

Strana od-do

1247-1278

Kód UT WoS článku

000848724700001

EID výsledku v databázi Scopus

2-s2.0-85136515598