| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [19 references]
https://hal.inria.fr/hal-01583925
Contributor : Hal Ifip <>
Submitted on : Friday, September 8, 2017 - 10:05:36 AM
Last modification on : Wednesday, September 16, 2020 - 5:00:55 PM
Contributor : Hal Ifip <>
Submitted on : Friday, September 8, 2017 - 10:05:36 AM
Last modification on : Wednesday, September 16, 2020 - 5:00:55 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