Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/343
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHierons, RM-
dc.coverage.spatial21en
dc.date.accessioned2006-11-06T09:33:39Z-
dc.date.available2006-11-06T09:33:39Z-
dc.date.issued2006-
dc.identifier.citationAutomated Software Engineering, 13(2): 283-301, Apr 2006en
dc.identifier.urihttp://www.ingentaconnect.com/content/klu/ause/2006/00000013/00000002/00007739en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/343-
dc.description.abstractFinite state machines have been used to model a number of classes of system and there has thus been much interest in the automatic generation of test sequences from finite state machines. Many finite state machine based test techniques utilize sequences that check the final states of transitions, the most general such sequence being a separating sequence: an input sequence that distinguishes between two states of an FSM. When using such techniques the test sequence length can be reduced by utilizing overlap. This paper investigates overlap for separating sequences and shows how this can be incorporated into test sequence generation.en
dc.format.extent681582 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherSpringeren
dc.subjectTest sequence generationen
dc.subjectFinite state machineen
dc.subjectSeparating sequenceen
dc.subjectCharacterizing seten
dc.subjectOverlapen
dc.titleSeparating sequence overlap for automated test sequenceen
dc.typeResearch Paperen
dc.identifier.doihttp://dx.doi.org/10.1007/s10515-006-7739-3-
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
Separating Sequence 2006.pdf665.61 kBAdobe PDFView/Open


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