Seed: an easy to use random generator of recursive data structures for testing

Pierre-Cyrille Heam 1 Cyril Nicaud 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, INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Random testing represents a simple and tractable way for software assessment. This paper presents the \seed tool that can be used for the uniform random generation of recursive data structures such as labelled trees and logical formulas. We show how \seed can be used in several testing contexts, from model based testing to performance testing. Generated data structures are defined by grammar-like rules, given in an XML format, multiplying \seed possible applications. Seed is based on combinatorial techniques, and can generate uniformly at random k structures of size $n$ with a time complexity in O(n^2+ kn\log n). Finally, \seed is available as a free Java application and a great effort has been made to make it easy-to-use.
Type de document :
Rapport
[Research Report] 2009, pp.18
Liste complète des métadonnées

https://hal.inria.fr/inria-00528585
Contributeur : Pierre-Cyrille Heam <>
Soumis le : vendredi 22 octobre 2010 - 11:02:08
Dernière modification le : mercredi 11 avril 2018 - 12:12:02
Document(s) archivé(s) le : dimanche 23 janvier 2011 - 02:46:16

Fichier

rr-lsv-2009-15.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00528585, version 1

Citation

Pierre-Cyrille Heam, Cyril Nicaud. Seed: an easy to use random generator of recursive data structures for testing. [Research Report] 2009, pp.18. 〈inria-00528585〉

Partager

Métriques

Consultations de la notice

1081

Téléchargements de fichiers

162