Counting for Random Testing - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Counting for Random Testing

(1, 2)
1
2

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.
Fichier principal
Vignette du fichier
978-3-642-24580-0_1_Chapter.pdf (206.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01583925 , version 1 (08-09-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
129 View
59 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More