We study the coefficients of algebraic functions∑ n≥ 0fnzn. First, we recall the too-little-
known fact that these coefficients fn always admit a closed form. Then we study their …

For software testing to be effective the test data should cover a large and diverse range of
the possible input domain. Boltzmann samplers were recently introduced as a systematic …

The theory of combinatorial species, although invented as a purely mathematical formalism
to unify much of combinatorics, can also serve as a powerful and expressive language for …

Abstract Ambiguous Context Free Grammars (CFGs) are problematic for programming
languages, as they allow inputs to be parsed in more than one way. In this paper, we …

This paper studies the coefficients of algebraic functions. First, we recall the too-little-known
fact that these coefficients f_n have a closed form. Then, we study their asymptotics, known …

Since the last two decades huge systems (such as giant graphs, big data structures,...) have
played a central role in computer science, and with the technology improvements, those …

Boltzmann samplers, introduced by Duchon et al. in 2001, make it possible to uniformly draw
approximate size objects from any class which can be specified through the symbolic …

In program verification, constraint-based random testing is a powerful technique which aims
at generating random test cases that satisfy functional properties of a program. However, on …

The present work analyzes the redundancy of sets of combinatorial objects produced by a
weighted random generation algorithm proposed by Denise et al. This scheme associates …

We propose an automated testing framework based on constraint programming techniques.
Our framework allows the developer to attach a numerical constraint to a type that restricts its …