Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/3406
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHierons, RM-
dc.contributor.authorMerayo, MG-
dc.coverage.spatial10en
dc.date.accessioned2009-06-10T11:30:01Z-
dc.date.available2009-06-10T11:30:01Z-
dc.date.issued2007-
dc.identifier.citationThird Workshop on Mutation Analysis (Mutation 2007): 141-150, Sep 2007en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/3406-
dc.description.abstractMutation testing traditionally involves mutating a program in order to produce a set of mutants and using these mutants in order to either estimate the effectiveness of a test suite or to drive test generation. Recently, however, this approach has been applied to specifications such as those written as finite state machines. This paper extends mutation testing to finite state machine models in which transitions have associated probabilities. The paper describes several ways of mutating a probabilistic finite state machine (PFSM) and shows how test sequences that distinguish between a PFSM and its mutants can be generated. Testing then involves applying each test sequence multiple times, observing the resultant output sequences and using results from statistical sampling theory in order to compare the observed frequency of each output sequence with that expected.en
dc.format.extent388949 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherIEEEen
dc.titleMutation testing from probabilistic finite state machinesen
dc.typeConference Paperen
dc.identifier.doihttp://dx.doi.org/10.1109/TAIC.PART.2007.20-
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
Mutation Testing from Probabilistic Finite State Machines.pdf379.83 kBAdobe PDFView/Open


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