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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
| Series: | Труды Института системного программирования РАН |
| Subjects: | |
| Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/863 |
| Summary: | 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). |
|---|---|
| ISSN: | 2079-8156 2220-6426 |