Counting for random testing

  • Authors:
  • Marie-Claude Gaudel

  • Affiliations:
  • Université Paris-Sud 11, LRI, Orsay, and CNRS, Orsay

  • Venue:
  • ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.