Multiple Mutation Testing from Finite State Machines with Symbolic Inputs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Multiple Mutation Testing from Finite State Machines with Symbolic Inputs

Résumé

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.
Fichier principal
Vignette du fichier
449632_1_En_7_Chapter.pdf (303.09 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01678962 , version 1 (09-01-2018)

Licence

Paternité

Identifiants

Citer

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⟩
90 Consultations
83 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More