Skip to Main content Skip to Navigation
Conference papers

Multiple Mutation Testing from Finite State Machines with Symbolic Inputs

Abstract : Recently, we proposed a mutation-testing approach from a classical finite state machine (FSM) for detecting nonconforming mutants in a given fault domain specified with a so-called mutation machine. In this paper, we lift this approach to a particular type of extended finite state machines called symbolic input finite state machine (SIFSM), where transitions are labeled with symbolic inputs, which are predicates on input variables possibly having infinite domains. We define a well-formed mutation SIFSM for describing various types of faults. Given a mutation SIFSM, we develop a method for evaluating the adequacy of a test suite and a method for generating tests detecting all nonconforming mutants. Experimental results with the prototype tool we have developed indicate that the approach is applicable to industrial-like systems.
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01678962
Contributor : Hal Ifip <>
Submitted on : Tuesday, January 9, 2018 - 3:39:42 PM
Last modification on : Friday, March 27, 2020 - 3:18:23 PM
Long-term archiving on: : Saturday, May 5, 2018 - 11:14:59 AM

File

449632_1_En_7_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Omer Nguena Timo, Alexandre Petrenko, S. Ramesh. Multiple Mutation Testing from Finite State Machines with Symbolic Inputs. 29th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2017, St. Petersburg, Russia. pp.108-125, ⟨10.1007/978-3-319-67549-7_7⟩. ⟨hal-01678962⟩

Share

Metrics

Record views

337

Files downloads

607