Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, September 8, 2017 - 10:05:36 AM
Last modification on : Thursday, July 8, 2021 - 3:49:53 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Marie-Claude Gaudel. Counting for Random Testing. 23th International Conference on Testing Software and Systems (ICTSS), Nov 2011, Paris, France. pp.1-8, ⟨10.1007/978-3-642-24580-0_1⟩. ⟨hal-01583925⟩



Les métriques sont temporairement indisponibles