Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/4120
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHierons, RM-
dc.contributor.authorJourdan, GV-
dc.contributor.authorUral, H-
dc.contributor.authorYenigun, H-
dc.date.accessioned2010-02-19T12:08:58Z-
dc.date.available2010-02-19T12:08:58Z-
dc.date.issued2009-
dc.identifier.citationSoftware Engineering and Formal Methods, 2009 Seventh IEEE International Conference on, Hanoi, November 2009. pp. 157-166en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/4120-
dc.description.abstractMethods 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.en
dc.language.isoenen
dc.publisherIEEEen
dc.titleChecking sequence construction using adaptive and preset distinguishing sequencesen
dc.typeConference Paperen
dc.identifier.doihttp://dx.doi.org/10.1109/SEFM.2009.12-
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
Fulltext.pdf345.66 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.