Axiomatic test sequence generation for extended finite state machines

Author

Wang, Chang-Jia ; Liu, Ming T.

Author_Institution

Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA

fYear

1992

fDate

9-12 Jun 1992

Firstpage

252

Lastpage

259

Abstract

A test suite generation method is proposed for conformance testing of communication protocols to solve the problem of generating test sequences for protocol specification models that have memories. A program verification technique called axiomatic semantics, is used to test protocols specified by extended finite state machines (EFSMs). While an EFSM is verified by the technique, observable events are recorded. By carefully manipulating the execution path in EFSM, the observed events can be used to examine the correctness of the protocol implementations

Keywords

conformance testing; finite state machines; formal specification; program verification; protocols; axiomatic semantics; axiomatic test sequence generation; communication protocols; conformance testing; correctness; execution path; extended finite state machines; generating test sequences; program verification; protocol specification models; Automata; Computer network reliability; Contracts; Distributed computing; Flow graphs; Hardware; Information science; Protocols; Telecommunication network reliability; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on

Conference_Location

Yokohama

Print_ISBN

0-8186-2865-0

Type

conf

DOI

10.1109/ICDCS.1992.235085

Filename

235085