DocumentCode :
2893941
Title :
Checking Sequence Construction Using Adaptive and Preset Distinguishing Sequences
Author :
Hierons, Robert M. ; Jourdan, Guy-Vincent ; Ural, Hasan ; Yenigun, Husnu
Author_Institution :
Sch. of Inf. Syst., Brunel Univ., Uxbridge, UK
fYear :
2009
fDate :
23-27 Nov. 2009
Firstpage :
157
Lastpage :
166
Abstract :
Methods for testing from finite state machine-based specifications often require the existence of a preset distinguishing sequence for constructing checking sequences. It has been shown that an adaptive distinguishing sequence is sufficient for these methods. This result is significant because adaptive distinguishing sequences are strictly more common and up to exponentially shorter than preset ones. However, there has been no study on the actual effect of using adaptive distinguishing sequences on the length of checking sequences. This paper describes experiments that show that checking sequences constructed using adaptive distinguishing sequences are almost consistently shorter than those based on preset distinguishing sequences. This is investigated for three different checking sequence generation methods and the results obtained from an extensive experimental study are given.
Keywords :
finite state machines; formal specification; adaptive distinguishing sequence; checking sequences; finite state machine-based specifications; preset distinguishing sequences; sequence construction; Automata; Circuit faults; Circuit testing; Fault detection; Mathematics; Object oriented modeling; Polynomials; Sequential analysis; Software engineering; System testing; Adaptive Distinguishing Sequences; Checking Sequences; Finite State Machine Based Testing; Preset Distinguishing Sequences;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software Engineering and Formal Methods, 2009 Seventh IEEE International Conference on
Conference_Location :
Hanoi
Print_ISBN :
978-0-7695-3870-9
Type :
conf
DOI :
10.1109/SEFM.2009.12
Filename :
5368099
Link To Document :
بازگشت