Checking Experiments for Finite State Machines with Symbolic Inputs

Abstract : There exists a significant body of work in the theory of checking experiments devoted to test generation from FSM which guarantees complete fault coverage for a given fault model. Practical applications require nevertheless methods for fault-model driven test generation from Extended FSMs (EFSM). Traditional approaches for EFSM focus on model coverage, which provides no characterization of faults that can be detected by the generated tests. Only few approaches use fault models, and we are not aware of any result in the theory of checking experiments for extended FSMs. In this paper, we lift the theory of checking experiments to EFSMs, which are Mealy machines with predicates defined over input variables treated as symbolic inputs. Considering this kind of EFSM, we propose a test generation method that produces a symbolic checking experiment, adapting the well-known HSI method. We then present conditions under which arbitrary instances of a symbolic checking experiment can be used for testing black-box implementations, while guaranteeing complete fault coverage.
Type de document :
Communication dans un congrès
Khaled El-Fakih; Gerassimos Barlas; Nina Yevtushenko. 27th IFIP International Conference on Testing Software and Systems (ICTSS), Nov 2015, Sharjah and Dubai, United Arab Emirates. Lecture Notes in Computer Science, LNCS-9447, pp.3-18, 2015, Testing Software and Systems. 〈10.1007/978-3-319-25945-1_1〉
Liste complète des métadonnées

Littérature citée [39 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01470154
Contributeur : Hal Ifip <>
Soumis le : vendredi 17 février 2017 - 10:25:47
Dernière modification le : dimanche 17 décembre 2017 - 06:54:05
Document(s) archivé(s) le : jeudi 18 mai 2017 - 13:54:34

Fichier

385214_1_En_1_Chapter.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Alexandre Petrenko, Adenilso Simao. Checking Experiments for Finite State Machines with Symbolic Inputs. Khaled El-Fakih; Gerassimos Barlas; Nina Yevtushenko. 27th IFIP International Conference on Testing Software and Systems (ICTSS), Nov 2015, Sharjah and Dubai, United Arab Emirates. Lecture Notes in Computer Science, LNCS-9447, pp.3-18, 2015, Testing Software and Systems. 〈10.1007/978-3-319-25945-1_1〉. 〈hal-01470154〉

Partager

Métriques

Consultations de la notice

34