Mutation Testing of "Go-Back" Functions Based on Pushdown Automata
Authors:
- Fevzi BelliFBFevzi Belli
- Mutlu BeyazitMBMutlu Beyazit
- Tomohiko TakagiTTTomohiko Takagi
- Zengo FurukawaZFZengo Furukawa
- 1 March 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 249-258
Abstract
A go-back (GB) function for canceling recent user or system operations and going back to and resuming of previous state(s) is very often used regardless of the application domain. Therefore, faulty handling of them can cause severe damages in those applications. This paper proposes a mutation-based approach to testing GB functions modeled by pushdown automata. Novel mutation operators, recent coverage criteria, and a new algorithm for test case generation are introduced. A case study validates the approach and discusses its characteristics.Keywords
This publication has 18 references indexed in Scilit:
- Decreasing the cost of mutation testing with second‐order mutantsSoftware Testing, Verification and Reliability, 2008
- Test minimization for human-computer interactionApplied Intelligence, 2006
- Basic Operations for Generating Behavioral Mutants2006
- Finite state testing and analysis of graphical user interfaces2005
- Challenging formal specifications by mutation: a CSP security example2004
- Mutation Testing Applied to Validate SDL Specifications2004
- Applying Mutation Analysis to SDL Specifications2003
- Interface Mutation: an approach for integration testingIEEE Transactions on Software Engineering, 2001
- Mutation operators for specifications2000
- Software unit test coverage and adequacyACM Computing Surveys, 1997