Brunel University Research Archive (BURA) >
Research Areas >
Computer Science >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/3406

Title: Mutation testing from probabilistic finite state machines
Authors: Hierons, RM
Merayo, MG
Publication Date: 2007
Publisher: IEEE
Citation: Third Workshop on Mutation Analysis (Mutation 2007): 141-150, Sep 2007
Abstract: Mutation 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.
URI: http://bura.brunel.ac.uk/handle/2438/3406
DOI: http://dx.doi.org/10.1109/TAIC.PART.2007.20
Appears in Collections:B-SERC Research Papers
School of Information Systems, Computing and Mathematics Research Papers
Computer Science

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.

 


Library (c) Brunel University.    Powered By: DSpace
Send us your
Feedback. Last Updated: September 14, 2010.
Managed by:
Hassan Bhuiyan