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
2 LIGM - Laboratoire d'Informatique Gaspard-Monge

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.

Domaines: Génie logiciel [cs.SE]

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