Formulae and asymptotics for coefficients of algebraic functions
C Banderier, M Drmota - Combinatorics, Probability and Computing, 2015 - cambridge.org
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 …
known fact that these coefficients fn always admit a closed form. Then we study their …
Finding test data with specific properties via metaheuristic search
R Feldt, S Poulding - 2013 IEEE 24th international symposium …, 2013 - ieeexplore.ieee.org
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 possible input domain. Boltzmann samplers were recently introduced as a systematic …
Species and functors and types, oh my!
BA Yorgey - Proceedings of the third ACM Haskell symposium on …, 2010 - dl.acm.org
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 …
to unify much of combinatorics, can also serve as a powerful and expressive language for …
Detecting ambiguity in programming language grammars
N Vasudevan, L Tratt - International Conference on Software Language …, 2013 - Springer
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 …
languages, as they allow inputs to be parsed in more than one way. In this paper, we …
Coefficients of algebraic functions: formulae and asymptotics
C Banderier, M Drmota - Discrete Mathematics & Theoretical …, 2013 - dmtcs.episciences.org
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 …
fact that these coefficients f_n have a closed form. Then, we study their asymptotics, known …
[PDF][PDF] Pointed versus singular Boltzmann samplers: a comparative analysis
O Bodini, A Genitrini, N Rolin - Pure Mathematics and Applications, 2015 - sciendo.com
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 …
played a central role in computer science, and with the technology improvements, those …
Analytic samplers and the combinatorial rejection method
O Bodini, J Lumbroso, N Rolin - 2015 Proceedings of the Twelfth Workshop on …, 2014 - SIAM
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 …
approximate size objects from any class which can be specified through the symbolic …
Automatic Synthesis of Random Generators for Numerically Constrained Algebraic Recursive Types
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 …
at generating random test cases that satisfy functional properties of a program. However, on …
Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models
D Gardy, Y Ponty - arXiv preprint arXiv:1012.1129, 2010 - arxiv.org
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 …
weighted random generation algorithm proposed by Denise et al. This scheme associates …
Automated Random Testing of Numerical Constrained Types
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 …
Our framework allows the developer to attach a numerical constraint to a type that restricts its …