6 citations
- Institut national de recherche en sciences et technologies du numériqueFR3 papers
- École Nationale Supérieure de Techniques AvancéesFR2 papers
- Laboratoire des Sciences de l'Ingénieur, de l'Informatique et de l'ImagerieFR2 papers
- Centre d'études et de recherche en informatique et communicationsFR1 paper
- Collège de FranceFR1 paper
- École Nationale Supérieure d’Informatique pour l’Industrie et l’EntrepriseFR1 paper
- Institute of Foreign LanguagesRU1 paper
- Institut Universitaire de FranceFR1 paper
- Laboratoire de Recherche en InformatiqueFR1 paper
- Laboratoire d’Informatique et SystèmesFR1 paper
- Laboratory Preuves, Programmes et SystèmesFR1 paper
- Living Independently Now CenterUS1 paper
7 papers
Automatic task-based parallelization of C++ applications by source-to-source transformations
Garip Kusoglu, Berenger Bramas, Stephane Genaud
Currently, multi/many-core CPUs are considered standard in most types of computers including, mobile phones, PCs or supercomputers. However, the parallelization of applications as…
On the improvement of the in-place merge algorithm parallelization
Berenger Bramas, Quentin Bramas
In this paper, we present several improvements in the parallelization of the in-place merge algorithm, which merges two contiguous sorted arrays into one with an O(T) space complex…
Generic Programming in OCaml
Florent Balestrieri, Michel Mauny
We present a library for generic programming in OCaml, adapting some techniques borrowed from other functional languages. The library makes use of three recent additions to OCaml:…
Liveness-Driven Random Program Generation
Gergö Barany
Randomly generated programs are popular for testing compilers and program analysis tools, with hundreds of bugs in real-world C compilers found by random testing. However, existing…
Introducing Context Awareness in Unmodified, Context-unaware Software
Markus Raab, Gergö Barany
Software tends to be highly configurable, but most applications are hardly context aware. For example, a web browser provides many settings to configure printers and proxies, but n…
A Certified Universal Gathering Algorithm for Oblivious Mobile Robots
Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil +1
We present a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any initial configuration that is not bivalent, using any number o…