Abstract
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).
Highlights
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
Based on the set of considered faults corresponding sequences of the l-equivalent are included into a test suite
Summary
Методы тестирования на основе модели детерминированного конечного автомата включают в себя этап построения как можно более компактного набора входных (тестовых) последовательностей, позволяющих обнаружить любую программную реализацию из заданного класса, не эквивалентную спецификации, т.е. программную реализацию, которая имеет отличное от спецификации поведение на некоторой входной последовательности.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Institute for System Programming of RAS
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
