Analysis of mutation operators for FSM testing
Mutation analysis is being extensively used for testing from a finite state machine (FSM); it consists in seeding a fault in the model using a mutation operator. There is still a lot that we need to know about mutation fault for FSM so that we can adequately use them in software testing or in software testing experiments. In this paper, we report on results from an empirical experiment during which we compared different mutation operators used to generate mutants from an FSM. We randomly generated multiple FSMs along with all the possible mutants from a relatively complete set of mutation operators. We then generated test suites using transition trees which are then executed on the FSM and its mutants to measure the mutation score for each mutation operator using different types of oracles. In doing so we report on how easy, or difficult, mutants generated from specific mutation operators can be. We have developed a tool that automates the whole process of this experiment.
Sun 16 AprDisplayed time zone: Dublin change
11:00 - 12:30 | |||
11:00 30mTalk | Analysis of mutation operators for FSM testing Mutation | ||
11:30 30mTalk | A Tool for Mutation Analysis in Racket Mutation Bambi Zhuang Northeastern University, James Perretta Northeastern University, Arjun Guha Northeastern University and Roblox Research, Jonathan Bell Northeastern University | ||
12:00 30mTalk | The Inversive Relationship Between Bugs and Patches: An Empirical Study Mutation Pre-print |