DocumentCode :
2352301
Title :
Deriving Exhaustive Test Suits for Nondeterministic FSMs w.r.t. Non-separability Relation
Author :
Akenshina, E. ; Shabaldina, N. ; Yevtushenko, N.
Author_Institution :
Tomsk State Univ., Tomsk, Russia
fYear :
2010
fDate :
6-10 April 2010
Firstpage :
46
Lastpage :
53
Abstract :
In this paper we consider test suite derivation for nondeterministic Finite State Machines (FSM) w. r. t. the non-separability relation. The improvement to the existing algorithms is proposed for exhaustive test derivation without the explicit enumeration of all possible implementations. One algorithm can be applied when the set of possible implementations is the set of all complete nondeterministic submachines of a given mutation machine. Another algorithm is applied when only the upper bound on the number of states of an IUT is known. As usual, when executing such test suites against an implementation FSM the requirement of "all weather conditions" is not needed.
Keywords :
finite state machines; program testing; deriving exhaustive test suits; finite state machines; mutation machine; nondeterministic FSM; nonseparability relation; test derivation; Automata; Controllability; Flow graphs; Genetic mutations; Observability; Protocols; Software testing; Unified modeling language; Upper bound; exhaustive test suites; non-separability relation; testing nondeterministic FSMs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software Testing, Verification, and Validation Workshops (ICSTW), 2010 Third International Conference on
Conference_Location :
Paris
Print_ISBN :
978-1-4244-6773-0
Type :
conf
DOI :
10.1109/ICSTW.2010.29
Filename :
5463714
Link To Document :
بازگشت