On the Use of Uniform Random Generation of Automata for Testing

Frédéric Dadeau 1 Pierre-Cyrille Héam 1 Jocelyn Levrey 2
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Developing efficient and automatic testing techniques is one of the major challenges facing software validation community. In this paper, we show how a uniform random generation process of finite automata, developed in a recent work by Bassino and Nicaud, is relevant for many faces of automatic testing. The main contribution is to show how to combine two major testing approaches: model-based testing and random testing. This leads to a new testing technique successfully experimented on a realistic case study. We also illustrate how the power of random testing, applied on a Chinese Postman Problem implementation, points out an error in a well-known algorithm. Finally, we provide some statistics on model-based testing algorithms.
Type de document :
Article dans une revue
Electronic Notes in Theoretical Computer Science, Elsevier, 2009, Proceedings of Fifth Workshop on Model Based Testing (MBT 2009), 253 (2), pp.37-51. 〈10.1016/j.entcs.2009.09.050〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00429236
Contributeur : Frédéric Dadeau <>
Soumis le : lundi 2 novembre 2009 - 10:32:57
Dernière modification le : vendredi 6 juillet 2018 - 15:06:10

Lien texte intégral

Identifiants

Citation

Frédéric Dadeau, Pierre-Cyrille Héam, Jocelyn Levrey. On the Use of Uniform Random Generation of Automata for Testing. Electronic Notes in Theoretical Computer Science, Elsevier, 2009, Proceedings of Fifth Workshop on Model Based Testing (MBT 2009), 253 (2), pp.37-51. 〈10.1016/j.entcs.2009.09.050〉. 〈inria-00429236〉

Partager

Métriques

Consultations de la notice

246