2008 Sixth International Conference on Software Engineering Research, Management and Applications Finding Narrow Input/Output (NIO) Sequences by Model Checking August 20-August 22 ISBN: 978-0-7695-3302-5
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SERA.2008.42
Conformance test sequences for communicationprotocols specified by finite state machines (FSM)often use unique input/output (UIO) sequences todetect state transition transfer faults. Since a UIOsequence may not exist for every state of an FSM, inthe previous research, we extended UIO sequence tointroduce a new concept called narrow input/output(NIO) sequence. The general computation of NIOsequences may lead to state explosion when an FSM isvery large. In this paper, we present an approach tofind NIO sequences using symbolic model checking.Constructing a Kripke structure and a computationtree logic (CTL) formula for such a purpose isdescribed in detail. We also illustrate the methodusing a model checker SMV.
Index Terms:
Communication protoocls, protocol testing, protocol engineering, model checking
Citation:
Tao Huang, Anthony Chung, "Finding Narrow Input/Output (NIO) Sequences by Model Checking," sera, pp.283-289, 2008 Sixth International Conference on Software Engineering Research, Management and Applications, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||