Test derivation based on tree FSMs and tree automata

Test derivation based on tree FSMs and tree automata

In this paper, an approach for testing software implementations of telecommunication protocols based on tree finite state machines (FSM) is proposed. The first step is the extraction of the specification Extended FSM from an informal protocol description. The next step is to derive a corresponding E...

Full description

Bibliographic Details
Main Author: Maria Forostyanova
Format: Article
Language:English
Published: Ivannikov Institute for System Programming of the Russian Academy of Sciences 2018-10-01
Series:Труды Института системного программирования РАН
Subjects:
telecommunication protocols
extended finite state machine
tcp
l-equivalent
Online Access:https://ispranproceedings.elpub.ru/jour/article/view/863
id doaj-48e2a0a05db8461eb46e16c8d5036d3b
record_format Article
spelling doaj-48e2a0a05db8461eb46e16c8d5036d3b2020-11-25T01:20:05Zeng Ivannikov Institute for System Programming of the Russian Academy of SciencesТруды Института системного программирования РАН2079-81562220-64262018-10-01266677610.15514/ISPRAS-2014-26(6)-6863Test derivation based on tree FSMs and tree automataMaria Forostyanova0Томский государственный университетIn this paper, an approach for testing software implementations of telecommunication protocols based on tree finite state machines (FSM) is proposed. The first step is the extraction of the specification Extended FSM from an informal protocol description. The next step is to derive a corresponding EFSM l-equivalent that is a tree FSM. Based on the set of considered faults corresponding sequences of the l-equivalent are included into a test suite. The proposed approach is illustrated by protocol TCP (Windows).https://ispranproceedings.elpub.ru/jour/article/view/863telecommunication protocolsextended finite state machinetcpl-equivalent
collection DOAJ
language English
format Article
sources DOAJ
author Maria Forostyanova
spellingShingle Maria Forostyanova
Test derivation based on tree FSMs and tree automata
Труды Института системного программирования РАН
telecommunication protocols
extended finite state machine
tcp
l-equivalent
author_facet Maria Forostyanova
author_sort Maria Forostyanova
title Test derivation based on tree FSMs and tree automata
title_short Test derivation based on tree FSMs and tree automata
title_full Test derivation based on tree FSMs and tree automata
title_fullStr Test derivation based on tree FSMs and tree automata
title_full_unstemmed Test derivation based on tree FSMs and tree automata
title_sort test derivation based on tree fsms and tree automata
publisher Ivannikov Institute for System Programming of the Russian Academy of Sciences
series Труды Института системного программирования РАН
issn 2079-8156
2220-6426
publishDate 2018-10-01
description In this paper, an approach for testing software implementations of telecommunication protocols based on tree finite state machines (FSM) is proposed. The first step is the extraction of the specification Extended FSM from an informal protocol description. The next step is to derive a corresponding EFSM l-equivalent that is a tree FSM. Based on the set of considered faults corresponding sequences of the l-equivalent are included into a test suite. The proposed approach is illustrated by protocol TCP (Windows).
topic telecommunication protocols
extended finite state machine
tcp
l-equivalent
url https://ispranproceedings.elpub.ru/jour/article/view/863
work_keys_str_mv AT mariaforostyanova testderivationbasedontreefsmsandtreeautomata
_version_ 1725135713773551616

Similar Items