PDPierre Donat-Bouillud

Pierre Donat-Bouillud

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Pierre Donat-Bouillud has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    What Do R Benchmarks Measure

    by Matěj Kocourek, Filip Říha, Oliver Tušla, Pierre Donat-Bouillud, Filip KřIkava, Jan Vitek

  • Open Access

    Revisiting Row Polymorphism for Set-Theoretic Types

    by Mickaël Laurent, Pierre Donat-Bouillud, Filip KřIkava, Jan Vitek

    Set-theoretic types support expressive record types through unions, intersections, and negations, but they lack the row polymorphism needed to type operations that propagate unknown fields across records. Prior work addresses this by allowing Boolean combinations of rows in type substitutions, which complicates the formalism and prevents the tallying algorithm from being complete. We propose an alternative: instead of enriching substitutions, we allow Boolean combinations of row variables directly within record type constructors, where the tail of a record has the same shape as any field. This design keeps substitutions simple---a row variable maps to a single row---and yields a natural extension of the subtyping and tallying algorithms. Tallying is complete for all solutions whose rows are constant over labels not mentioned in the constraints. We implement our approach in the set-theoretic type library SSTT and the type checker MLsem, providing the first implementation of a type system that combines semantic subtyping with row polymorphism. We demonstrate the expressiveness of the system by encoding several data structures from the R programming language: heterogeneous lists, variadic function arguments, and class-based dispatch.


  • mutator: Mutation Testing

    by Pierre Donat-Bouillud, Assanali Amandykov

    Performs mutation testing for 'R' packages to assess the effectiveness of a test suite. It mutates source files, runs package tests against each mutant, and reports which mutants were killed, survived, or timed out. Parallel execution is supported for larger code bases. The optional 'imputesrcref' package, available from , improves source locations when installed.

  • Open Access

    Leveraging Copy-and-Patch JIT for Low-Overhead Dynamic Program Analysis

    by Matěj Kocourek, Filip KřIkava, Pierre Donat-Bouillud, Jan Vitek

    Copy-and-patch compilation is an approach for building baseline just-in-time compilers from AST or bytecode interpreters. It features very fast compilation times while generating good quality code. It has been used as a baseline tier for a number of languages including Lua, Python, and R. In this paper, we explore copy-and-patch as a foundation for dynamic program analysis, and implement four analyses on top of an existing copy-and-patch JIT for R: code instrumentation, code coverage, performance profiling, and native debugging. Two properties make copy-and-patch particularly well-suited for this purpose. First, since the code templates (stencils) are compiled by a standard C compiler, DWARF debug information is available as a by-product. This lets us reuse native tooling for profiling and debugging directly, with R and native code appearing in a single unified view. Second, analyses that operate at the bytecode level reduce to injecting stencils into the bytecode stream at JIT compile time, incurring minimal overhead. Our prototype evaluation yields instrumentation with no measurable overhead; code coverage that is faster than the existing solution while covering 17% more lines; and profiling that remains, on average, faster than GNU R.

  • Models, Analysis and Execution of Audio Graphs in Interactive Multimedia Systems

    by Pierre Donat-Bouillud

    Modélisation, analyse et éxécution de graphes audio dans les systèmes interactifs multimédia: Les Systèmes Interactifs Multimédia (SIM) sont utilisés en concert pour des spectacles interactifs, qui mêlent en temps-réel instruments acoustiques, instruments électroniques, des données issues de divers capteurs (gestes, interface midi, etc) et le contrôle de différents média (vidéo, lumière, etc). Cette thèse présente un modèle formel de graphe audio, via un système de types et une sémantique dénotationnelle, avec des flux de données bufferisés datés multipériodiques qui permettent de représenter avec plus ou moins de précisions l'entrelacement du contrôle (par exemple un oscillateur basse fréquence, des vitesses issues d’un accéléromètre) et des traitements audio dans un SIM. Une extension audio d’Antescofo, un SIM qui fait office de suiveur de partition et qui comporte un langage synchrone temporisé dédié, a motivé le développement de ce modèle. Cette extension permet de connecter des effets Faust et des effets natifs, à la volée, de façon sure. L’approche a été validée sur une pièce de musique mixte et un exemple d'interactions audio et vidéo. Enfin, cette thèse propose des optimisations hors-ligne à partir du rééchantillonnage automatique de parties d'un graphe audio à exécuter. Un modèle de qualité et de temps d'exécution dans le graphe a été défini. Son étude expérimentale a été réalisée grâce à un SIM prototype à partir de la génération automatique de graphes audio, ce qui a permis aussi de caractériser des stratégies de rééchantillonnage proposées pour le cas en ligne en temps-réel.

  • Open Access

    R4R: Reproducibility for R

    by Pierre Donat-Bouillud, Filip Křikava, Sebastian Krynski, Jan Vitek


  • Open Access

    What we eval in the shadows: a large-scale study of eval in R programs

    by Aviral Goel, Pierre Donat-Bouillud, Filip Křikava, Christoph M. Kirsch, Jan Vitek

    Most dynamic languages allow users to turn text into code using various functions, often named eval, with language-dependent semantics. The widespread use of these reflective functions hinders static analysis and prevents compilers from performing optimizations. This paper aims to provide a better sense of why programmers use eval. Understanding why eval is used in practice is key to finding ways to mitigate its negative impact. We have reasons to believe that reflective feature usage is language and application domain-specific; we focus on data science code written in R and compare our results to previous work that analyzed web programming in JavaScript. We analyze 49,296,059 calls to eval from 240,327 scripts extracted from 15,401 R packages. We find that eval is indeed in widespread use; R’s eval is more pervasive and arguably dangerous than what was previously reported for JavaScript.


  • Open Access

    Why We Eval in the Shadows (Dataset)

    by Aviral Goel, Pierre Donat Bouillud, Filip Krikava, Christoph Kirsch, Jan Vitek

  • Open Access

    Why We Eval in the Shadows (Dataset)

    by Aviral Goel, Pierre Donat Bouillud, Filip Krikava, Christoph Kirsch, Jan Vitek

  • PRL-PRG/evalr-experiment: OOPSLA 2021 artifact

    by Aviral Goel, Pierre Donat-Bouillud, Filip Krikava, Christoph Kirsch, Jan Vitek