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 metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01583925
Contributor : Hal Ifip <>
Submitted on : Friday, September 8, 2017 - 10:05:36 AM
Last modification on : Tuesday, April 24, 2018 - 1:38:21 PM

File

978-3-642-24580-0_1_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

161

Files downloads

35