CAPESA is an Inria “Associated Team”,
- Principal investigator (Inria): Laure Gonnord, CASH.
- Principal investigator (Partner institution): Sébastien Mosser, Département d’informatique, UQAM (Canada)
- Other participants:] Ludovic Henrio (CNRS, CASH, LIP), Matthieu Moy (University Claude Bernard Lyon 1, CASH, LIP), Jean Privat (UQAM, Canada)
In this project we propose to study code transformation in terms of
“semantic diff”. This notion will be defined thanks to code
intermediate representations such as Abstract Syntax Trees (AST) or
the control flow graph, not by textual representation. The objective
is not only to compute but also to manipulate these “diffs” in several
contexts: being able to reapply a diff on another program than the one
it comes from, quantify the interference between two diffs, and more
generally to study the composability of several diffs. The approach
will be experimentally validated on problems coming from the domain of
expertise of both teams of the cooperation: compiler pass analyses
(expertise of CASH), and git commits (expertise of UQAM). The
complementarity of the analysis and compilation approaches of the CASH
team and the expertise on software engineering of the UQAM member will
ensure the success and the originality of the project.
static analysis, compilation, software engineering, software
evolution, code transformation, semantics
We are pleased to announce that Gabriel Radanne and Yannick Zakowski are joining the team in the fall of 2020. Welcome !
CASH, PLUME and ARIC teams are coorganising the famous “École Jeunes Chercheurs en Algorithmique et Programmation”, a summer school from the GDR GPL, in Lyon. More info: https://ejcp2018.sciencesconf.org/
Amaury Graillat, from Verimag (Grenoble) is invited today. His seminar is code generation from synchronous dataflow to the Kalray’s MPPA.
Ludovic Henrio co-organizes the inter-team “LSC Seminar”:
- Next is December 18th, 2018
The program can be found here.
Note: Laure Gonnord was organizing the LSC seminar until October 2018
(funded by the National French Agency, 2018-2022, PI: Laure Gonnord)
The context of the proposal is the increasing need for methods and tools that are able to deal with the massive parallelism now faced by the programmers. So far, methods and tools based on the polyhedral model (a powerful representation for capturing the flow and the data of a program at the same time) suffer from their lack of expressivity.
The objective of the proposal is to invent a way to reason about more general programs and data structures (e.g., trees). We will explore adapting and extending the existing efficient scheduling techniques that have
been developed since the advent of the polyhedral model. The ambition is to develop a new framework with new ideas that may come from other communities such as abstract interpretation, and rewriting systems.
The website of the project is: http://codas.ens-lyon.fr