Counting for Random Testing

Abstract : The seminal works of Wilf and Nijenhuis in the late 70s have led to efficient algorithms for counting and generating uniformly at random a variety of combinatorial structures. In 1994, Flajolet, Zimmermann and Van Cutsem have widely generalised and systematised the approach. This paper presents several applications of these powerful results to software random testing, and random model exploration.
Type de document :
Communication dans un congrès
Burkhart Wolff; Fatiha Zaïdi. 23th International Conference on Testing Software and Systems (ICTSS), Nov 2011, Paris, France. Springer, Lecture Notes in Computer Science, LNCS-7019, pp.1-8, 2011, Testing Software and Systems. 〈10.1007/978-3-642-24580-0_1〉
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01583925
Contributeur : Hal Ifip <>
Soumis le : vendredi 8 septembre 2017 - 10:05:36
Dernière modification le : mardi 24 avril 2018 - 13:38:21

Fichier

978-3-642-24580-0_1_Chapter.pd...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Marie-Claude Gaudel. Counting for Random Testing. Burkhart Wolff; Fatiha Zaïdi. 23th International Conference on Testing Software and Systems (ICTSS), Nov 2011, Paris, France. Springer, Lecture Notes in Computer Science, LNCS-7019, pp.1-8, 2011, Testing Software and Systems. 〈10.1007/978-3-642-24580-0_1〉. 〈hal-01583925〉

Partager

Métriques

Consultations de la notice

147

Téléchargements de fichiers

12