Laboratoire d`Informatique de l`X - LIX

Transcription

Dossier d’Evaluation d’une Unité de Recherche
Vague E: Campagne d’Evaluation 2013-2014
Laboratoire d’Informatique de l’X
LIX
UMR 7161
Ecole Polytechnique
91128 Palaiseau Cedex
http://www.lix.polytechnique.fr
Nom de l’unité:
Acronyme:
Nom du directeur pour le contrat en cours:
Nom du directeur pour le contrat à venir:
Laboratoire d’Informatique de l’X
LIX
Olivier Bournez
Olivier Bournez
Type de demande:
Renouvellement avec modifications
Choix de l’évaluation interdisciplinaire de l’unité de recherche:
Non.
2
Préambule
Ce document décrit les activités scientifiques et administratives du Laboratoire d’Informatique
de l’X (LIX), UMR 7161, Ecole Polytechnique - CNRS, pour la période allant du 1er janvier 2008
au 30 juin 2013, en les positionnant dans la perspective d’un nouveau mandat de l’unité.
Ce document s’accompagne d’un autre document, contenant les annexes, dans l’ordre suggéré
par le site de l’AERES. Plusieurs des informations dans ces annexes sont dupliquées dans ce
document, pour rendre ce document facilement lisible, en particulier, pour permettre une lecture
aisée des activités des équipes évitant les aller-retour entre documents.
La première partie de ce document présente l’unité, ses réalisations, les activités de l’unité
dans la formation dans la recherche, et des éléments de positionnement, stratégie et perspectives
pour le futur contrat.
Ce document se poursuit par un chapitre par équipe du laboratoire. Pour chaque équipe, on
présente la liste des membres et ses évolutions, un rapport sur les activités effectuées dans ce
mandat, et des éléments de perspective pour le mandat à venir, une fiche résumée, ainsi qu’une
liste des réalisations. Chaque équipe propose par ailleurs une auto-analyse AFOM (Atouts, Faiblesses, Opportunités, Menaces) (parfois aussi appelée SWOT).
On trouvera dans l’autre document reproduit les fiches résumées par équipe. On trouvera
par ailleurs un organigramme fonctionnel, copie du règlement intérieur de l’unité, et une liste
exhaustive des publications de chacune des équipes, et de leurs contrats. Il se termine par une
liste des thèses en cours et thèses soutenues, ainsi que par une liste de personnel 2013-2015.
Notre laboratoire a la chance de compter parmi ses membres de nombreuses nationalités: le
dernier recensement1 dénombrait 16 nationalités au LIX. Les langues les plus parlées quotidiennement dans nos équipes sont le français, l’anglais, l’allemand et l’italien. Pour la rédaction du
présent rapport, nous avons retenu le français et l’anglais pour que les auteurs de chaque équipe
puissent retranscrire au plus juste leur pensée.
Ce document n’aurait pas pu exister sans le travail de tout le laboratoire. Je remercie ici tous
ceux qui y ont pris part directement ou indirectement. Je voudrais en particulier remercier le
comité AERES, mis en en place au printemps, qui par ses réunions régulières a permis que ce
document soit ce qu’il est. Merci à Daniel Augot, Vincent Pilaud, Dominique Rossin, pour leur
aide quasi quotidienne, ainsi qu’à Catuscia Palamidessi et Benjamin Werner pour toute leur aide.
Les responsables d’équipe et les correspondants par équipe, en particulier Thomas Clausen, Miki
Hermann, Grégoire Lecerf, François Morain, Jean-Marc Notin, Yann Ponty, Antoine Rauzy, David
Savourey, Lutz Strasβurger, Frank Valencia ont été d’une aide précieuse, et un moyen de relais
incessant.
Je voudrais adresser des remerciements tout particuliers aux relecteurs, en particulier à Kaustuv Chaudhuri pour des retours très détaillés, à François Morain pour un énorme travail autour
de la bibliographie, en plus du reste, et à Grégoire Lecerf pour des propositions de formulation
souvent très fines et judicieuses de certaines parties.
Enfin, tout cela n’aurait pas pu exister sans le travail quotidien de James Régis, aux moyens
informatiques, et de Sylvie Jabinet, Valérie Lecomte, Christelle Liévin, et Evelyne Rayssac pour
obtenir toutes les données nécessaires. Merci à Sylvie et Evelyne en particulier pour leur patience
à produire et reproduire certaines données de multiples fois au gré des demandes pour permettre
à ce rapport d’être dans l’état où il est.
October 15, 2013
Olivier Bournez
Directeur du LIX
1 2009
3
Table des matières
I
Présentation du laboratoire
I.1
Le LIX
I.1.1
Présentation de l’unité . . . . . . . . . . . . . . . . . . . . .
I.1.1.1
Introduction . . . . . . . . . . . . . . . . . . . . . .
I.1.1.2
Structuration scientifique . . . . . . . . . . . . . . .
I.1.1.3
Photographie au 30 Juin 2013 . . . . . . . . . . . .
I.1.1.4
Vie scientifique de l’unité . . . . . . . . . . . . . . .
I.1.1.5
Effectifs du laboratoire . . . . . . . . . . . . . . . .
I.1.1.6
Gouvernance du laboratoire . . . . . . . . . . . . .
I.1.1.7
Administration et services . . . . . . . . . . . . . .
I.1.1.8
Moyens et évolutions . . . . . . . . . . . . . . . . .
I.1.2
Réalisations . . . . . . . . . . . . . . . . . . . . . . . . . . .
I.1.2.1
Production scientifique sur le mandat 2008-2013 .
I.1.2.2
Le LIX dans son environnement . . . . . . . . . . .
I.1.2.3
Animation . . . . . . . . . . . . . . . . . . . . . . .
I.1.2.4
Évolutions sur le mandat 2008-2013 . . . . . . . . .
I.1.3
Implication du LIX dans la formation par la recherche . .
I.1.3.1
Le Département d’Informatique de l’X . . . . . . .
I.1.3.2
Formation au niveau L3 . . . . . . . . . . . . . . . .
I.1.3.3
Formation en Master 1 . . . . . . . . . . . . . . . . .
I.1.3.4
Pilotage de Master 2. Enseignement en Master 2. .
I.1.3.5
Accueil de doctorants au LIX . . . . . . . . . . . . .
I.1.4
Stratégie et perspectives scientifiques pour le futur contrat
I.1.4.1
Axe: Algorithmes, Combinatoire, Modèles. . . . . .
I.1.4.2
Axe: Informatique distribuée et sécurité . . . . . .
I.1.4.3
Axe: Calcul symbolique et preuve . . . . . . . . . .
TYPICAL
SYSMO
PARSIFAL
MAX
HIPERCOM
CRYPTO
I.2
19
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
21
21
21
21
23
25
27
29
30
31
33
33
34
40
41
44
44
44
45
45
45
45
46
48
50
Analyse AFOM du laboratoire
53
Rapport et projet scientifique par équipe
57
II
59
Comète
COMBI
AMIB
AlCo
LIX
Équipe Algorithmique et Complexité (AlCo)
II.1 Liste des membres : Algorithmique et Complexité
II.1.1
Liste actuelle des membres . . . . . . . . . .
II.1.1.1
Membres permanents . . . . . . . . .
II.1.1.2
Doctorants et postdoctorants . . . . .
II.1.2
Anciens membres . . . . . . . . . . . . . . . .
II.1.2.1
Membres permanents . . . . . . . . .
II.1.2.2
Doctorants et postdoctorants . . . . .
II.1.2.3
Autres membres . . . . . . . . . . . .
4
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
61
61
61
61
61
61
61
62
TABLE DES MATIÈRES
5
II.2 Rapport scientifique : Algorithmique et Complexité
II.2.1
Thématique générale et principaux objectifs . . . . . . . . . . . .
II.2.1.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . .
II.2.1.2
Thémes de recherche . . . . . . . . . . . . . . . . . . . . .
II.2.1.3
Exemples de résultats significatifs . . . . . . . . . . . . . .
II.2.1.4
Animation scientifique, rayonnement, prix et récompenses
II.2.1.5
Fonctionnement interne . . . . . . . . . . . . . . . . . . . .
II.2.1.6
Formation par la recherche . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
63
63
63
63
65
65
66
66
II.3 Projet de recherche : Algorithmique et Complexité
II.3.1
Objectifs scientifiques . . . . . . . . . . . . . . . . . . .
II.3.1.1
Complexity of Constraint Satisfaction problems
II.3.1.2
Counting Complexity . . . . . . . . . . . . . . .
II.3.1.3
Computations over the continuum . . . . . . . .
II.3.2
Mise en oeuvre . . . . . . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
67
67
67
68
68
68
II.4
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Analyse AFOM : Algorithmique et Complexité
II.5 Fiche résumé : Algorithmique et Complexité
II.5.1
Membres . . . . . . . . . . . . . . . . .
II.5.2
Résultats scientifiques . . . . . . . . . .
II.5.3
Production scientifique . . . . . . . . .
II.5.3.1
Publications . . . . . . . . . . . .
II.5.3.2
Rayonnement . . . . . . . . . . .
II.5.3.3
Actions de formation . . . . . .
69
.
.
.
.
.
.
71
71
71
71
71
72
72
.
.
.
.
.
.
.
.
73
73
73
73
76
79
80
80
80
II.7 Annexes : Algorithmique et Complexité
II.7.1
Participations à la communauté scientifique et responsabilités administratives
II.7.1.1
Responsabilités de projets internationaux . . . . . . . . . . . . . . . . .
II.7.1.2
Responsabilités de projets nationaux . . . . . . . . . . . . . . . . . . .
II.7.1.3
Participation à des projets internationaux . . . . . . . . . . . . . . . . .
II.7.1.4
Participation à des projets nationaux . . . . . . . . . . . . . . . . . . .
II.7.2
Administration de la recherche . . . . . . . . . . . . . . . . . . . . . . . . . . .
II.7.2.1
Activités éditoriales . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
II.7.2.2
Gestion scientifique de conférences . . . . . . . . . . . . . . . . . . . .
II.7.2.3
Organisation d’événements scientifiques . . . . . . . . . . . . . . . . .
II.7.2.4
Participation à des comités et jurys scientifiques . . . . . . . . . . . . .
II.7.3
Activités de formation, encadrement et évaluation . . . . . . . . . . . . . . . .
II.7.3.1
Liste des thèses et HDR soutenues . . . . . . . . . . . . . . . . . . . . .
II.7.3.2
Liste de rapports de thèses et HDR . . . . . . . . . . . . . . . . . . . . .
II.7.3.3
Enseignements dispensés . . . . . . . . . . . . . . . . . . . . . . . . . .
II.7.4
Autres éléments de visibilité . . . . . . . . . . . . . . . . . . . . . . . . . . . .
II.7.4.1
Invitations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
II.7.4.2
Prix et distinctions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
81
81
81
82
82
82
83
83
83
84
84
85
85
85
86
87
87
88
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
TYPICAL
SYSMO
PARSIFAL
II.6 Production scientifique : Algorithmique et Complexité
II.6.1
Livres et chapitres de livres . . . . . . . . . . . . .
II.6.2
Documents pédagogiques . . . . . . . . . . . . . .
II.6.3
Revues internationales . . . . . . . . . . . . . . . .
II.6.4
Conférences internationales . . . . . . . . . . . . .
II.6.5
Conférences nationales . . . . . . . . . . . . . . .
II.6.6
Conférences invitées . . . . . . . . . . . . . . . . .
II.6.7
Thèses . . . . . . . . . . . . . . . . . . . . . . . . .
II.6.8
Habilitation à diriger des recherches . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
MAX
HIPERCOM
CRYPTO
Comète
COMBI
AMIB
AlCo
LIX
6
III
Équipe Bio-Informatique (AMIB)
89
III.1 Liste des membres : Bio-Informatique
III.1.1
Liste actuelle des membres . . . . .
III.1.1.1
Membres permanents . . . .
III.1.1.2
Doctorants et postdoctorants
III.1.1.3
Visiteurs et autres membres
III.1.2
Anciens membres . . . . . . . . . . .
III.1.2.1
III.1.2.2
III.1.2.3
Autres membres . . . . . . .
TYPICAL
SYSMO
PARSIFAL
MAX
HIPERCOM
CRYPTO
Comète
COMBI
AMIB
AlCo
LIX
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
91
91
91
91
91
91
91
91
92
III.2 Rapport scientifique : Bio-Informatique
III.2.1
III.2.1.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . .
III.2.1.2
Thèmes de recherche . . . . . . . . . . . . . . . . . . . . .
III.2.1.3
III.2.1.4
III.2.1.5
III.2.1.6
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
93
93
93
93
96
97
97
97
III.3 Projet de recherche : Bio-Informatique
III.3.1
Objectifs scientifiques . . . . . . . . . . . . . . . . . . . . . . .
III.3.1.1
Sequences : combinatorics and algorithms . . . . . . .
III.3.1.2
RNA structures . . . . . . . . . . . . . . . . . . . . . . .
III.3.1.3
3D modeling of macromolecules and their interactions
III.3.1.4
Cell metabolism . . . . . . . . . . . . . . . . . . . . . .
III.3.2
Mise en oeuvre . . . . . . . . . . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
99
99
100
101
102
103
103
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
III.4 Analyse AFOM : Bio-Informatique
III.5 Fiche résumé : Bio-Informatique
III.5.1
Membres . . . . . . . . . . .
III.5.2
Résultats scientifiques . . . .
III.5.3
Production scientifique . . .
III.5.3.1
Publications . . . . . .
III.5.3.2
Rayonnement . . . . .
III.5.3.3
Actions de formation
105
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
III.6 Production scientifique : Bio-Informatique
III.6.1
Livres et chapitres de livres . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
III.6.2
Revues internationales . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
III.6.3
Conférences internationales . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
III.6.4
Conférences nationales . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
III.6.5
Conférences invitées . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
III.6.6
Thèses . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
III.6.7
Rapports techniques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
III.6.8
Logiciels . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
III.6.8.1
VARNA – Visualizing and editing RNA secondary structure . . . . . .
III.6.8.2
GenRGenS – Generation of Random Genomic Sequences . . . . . . . .
III.6.8.3
ESBTL (Easy Structural Biology Template Library) . . . . . . . . . . . .
III.6.8.4
DiMoVo - DIscriminate between Multimers and MOnomers by VOronoi
tessellation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
III.6.8.5
VorScore - Voronoi Scoring Function Server . . . . . . . . . . . . . . . .
107
107
107
107
107
108
108
109
109
109
112
113
114
114
114
114
114
114
115
115
115
7
III.7 Annexes : Bio-Informatique
III.7.1
III.7.1.1
III.7.1.2
III.7.1.3
Participation à des projets locaux . . . . . . . . . . . . . . . . . . . . . .
III.7.2
III.7.2.1
III.7.2.2
III.7.2.3
III.7.2.4
III.7.3
III.7.3.1
III.7.3.2
III.7.3.3
III.7.4
III.7.4.1
Rencontres scientifiques sur invitation . . . . . . . . . . . . . . . . . .
III.7.4.2
Invitations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
117
117
117
118
119
119
119
119
120
120
121
121
121
122
123
123
123
III.8 Références externes
125
TYPICAL
IV
127
SYSMO
Équipe Combinatoire (COMBI)
IV.1 Liste des membres : Combinatoire
IV.1.1
IV.1.1.1
IV.1.1.2
IV.1.1.3
IV.1.2
Anciens membres . . . . . . . . . . .
IV.1.2.1
IV.1.2.2
IV.1.2.3
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
129
129
129
129
129
130
130
130
130
.
.
.
.
.
.
131
131
131
134
135
135
136
PARSIFAL
MAX
HIPERCOM
IV.2 Rapport scientifique : Combinatoire
IV.2.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . .
IV.2.2
Thèmes de recherche . . . . . . . . . . . . . . . . . . . . . .
IV.2.3
IV.2.4
IV.2.4.1
Fonctionnement interne . . . . . . . . . . . . . . . .
IV.2.4.2
Formation par la recherche . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
IV.3 Projet de recherche : Combinatoire
137
IV.3.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137
IV.3.2
Objectifs scientifiques et mise en œuvre . . . . . . . . . . . . . . . . . . . . . . 137
IV.4 Analyse AFOM : Combinatoire
141
IV.5 Fiche résumé : Combinatoire
IV.5.1
Membres . . . . . . . . . . .
IV.5.2
IV.5.3
IV.5.3.1
IV.5.3.2
IV.5.3.3
143
143
143
143
143
144
144
CRYPTO
Comète
COMBI
AMIB
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
AlCo
LIX
8
IV.6 Production scientifique : Combinatoire
IV.6.1
Livres et chapitres de livres . . . . . . . . . . . . . . . . .
IV.6.2
Revues internationales . . . . . . . . . . . . . . . . . . . .
IV.6.3
Conférences internationales . . . . . . . . . . . . . . . . .
IV.6.4
Thèses . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
IV.6.5
Autres . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
IV.6.6
Communications à des conférences nationales sans actes
TYPICAL
SYSMO
PARSIFAL
MAX
HIPERCOM
.
.
.
.
.
.
147
147
147
151
156
156
156
IV.7 Annexes : Combinatoire
IV.7.1
Participations à la communauté scientifique et responsabilités administrative
IV.7.1.1
IV.7.1.2
IV.7.1.3
IV.7.1.4
IV.7.1.5
IV.7.2
IV.7.2.1
IV.7.2.2
IV.7.2.3
IV.7.2.4
IV.7.3
IV.7.3.1
IV.7.3.2
IV.7.3.3
IV.7.4
IV.7.4.1
Exposés invités en conférences . . . . . . . . . . . . . . . . . . . . . . .
IV.7.4.2
Participation à des workshops sur invitations . . . . . . . . . . . . . . .
IV.7.4.3
Invitations à l’étranger . . . . . . . . . . . . . . . . . . . . . . . . . . .
IV.7.4.4
Exposés en séminaires . . . . . . . . . . . . . . . . . . . . . . . . . . . .
IV.7.4.5
157
157
157
157
157
158
158
159
159
159
160
160
161
161
161
162
162
162
162
163
163
164
V
165
V.1
CRYPTO
Comète
COMBI
V.2
AMIB
AlCo
V.3
LIX
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Équipe Concurrency, Mobility and Transactions (Comète)
Liste des membres : Concurrency, Mobility and Transactions
V.1.1
Liste actuelle des membres . . . . . . . . . . . . . . . . .
V.1.1.1
Membres permanents . . . . . . . . . . . . . . . .
V.1.1.2
Doctorants et postdoctorants . . . . . . . . . . . .
V.1.1.3
Visiteurs et autres membres . . . . . . . . . . . .
V.1.2
Anciens membres . . . . . . . . . . . . . . . . . . . . . . .
V.1.2.1
Membres permanents . . . . . . . . . . . . . . . .
V.1.2.2
Doctorants et postdoctorants . . . . . . . . . . . .
V.1.2.3
Autres membres . . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
167
167
167
167
167
168
168
168
169
Rapport scientifique : Concurrency, Mobility and Transactions
V.2.1
V.2.1.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . .
V.2.1.2
V.2.1.3
V.2.1.4
V.2.1.5
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
171
171
171
171
172
175
175
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Projet de recherche : Concurrency, Mobility and Transactions
177
V.3.1
Objectifs scientifiques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 177
V.3.1.1
V.3.1.2
V.3.1.3
V.4
V.5
V.6
V.7
9
Objectif 1: Privacy protection in trace-based services . . . . . . . . . . 177
Objectif 2: Extending the Theory of Quantitative Information Flow . . 177
Objectif 3: Epistemic and Spatial Reasoning for Distributed Systems
with Applications to Social Networks . . . . . . . . . . . . . . . . . . . 178
Analyse AFOM : Concurrency, Mobility and Transactions
Fiche résumé : Concurrency, Mobility and Transactions
V.5.1
Membres . . . . . . . . . . . . . . . . . . . . . . . .
V.5.2
Résultats scientifiques . . . . . . . . . . . . . . . . .
V.5.3
Production scientifique . . . . . . . . . . . . . . . .
V.5.3.1
Publications . . . . . . . . . . . . . . . . . . .
V.5.3.2
Rayonnement . . . . . . . . . . . . . . . . . .
V.5.3.3
Actions de formation . . . . . . . . . . . . .
183
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
185
185
185
186
186
187
187
Production scientifique : Concurrency, Mobility and Transactions
V.6.1
Livres et chapitres de livres . . . . . . . . . . . . . . . . . . . .
V.6.2
Revues internationales . . . . . . . . . . . . . . . . . . . . . . .
V.6.3
Conférences internationales . . . . . . . . . . . . . . . . . . . .
V.6.4
Conférences invitées . . . . . . . . . . . . . . . . . . . . . . . .
V.6.5
Thèses . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
V.6.6
Rapports techniques . . . . . . . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
189
189
190
191
196
197
197
Annexes : Concurrency, Mobility and Transactions
V.7.1
V.7.1.1
V.7.1.2
V.7.1.3
V.7.1.4
V.7.1.5
Contrats et bourses . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
V.7.2
V.7.2.1
V.7.2.2
V.7.2.3
V.7.2.4
V.7.3
V.7.3.1
V.7.3.2
V.7.3.3
V.7.4
V.7.4.1
Invited Presentations . . . . . . . . . . . . . . . . . . . . . . . . . . . .
V.7.4.2
Participations sur invitation à des rencontres scientifiques . . . . . . .
V.7.4.3
199
199
199
200
200
201
201
201
201
202
206
207
207
207
208
209
210
210
211
212
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
TYPICAL
SYSMO
PARSIFAL
MAX
HIPERCOM
CRYPTO
Comète
COMBI
VI
Équipe Cryptographie (CRYPTO)
213
AMIB
VI.1 Liste des membres : Cryptographie
VI.1.1
VI.1.1.1
VI.1.1.2
VI.1.1.3
VI.1.2
Anciens membres . . . . . . . . . . .
VI.1.2.1
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
215
215
215
215
215
215
215
AlCo
LIX
10
VI.1.2.2
VI.1.2.3
TYPICAL
Doctorants et postdoctorants . . . . . . . . . . . . . . . . . . . . . . . . 216
Autres membres . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 216
VI.2 Rapport scientifique : Cryptographie
VI.2.1
VI.2.1.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . .
VI.2.1.2
VI.2.1.3
VI.2.1.4
VI.2.1.5
Local positionning . . . . . . . . . . . . . . . . . . . . . . .
VI.2.1.6
VI.2.1.7
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
217
217
217
217
220
220
220
221
221
VI.3 Projet de recherche : Cryptographie
VI.3.1
Objectifs scientifiques . . . . . . . . . . . . . . . .
VI.3.1.1
Basic Number Theory . . . . . . . . . . . .
VI.3.1.2
Isogeny and Endomorphism Computations
VI.3.1.3
Algebraic Geometry Codes . . . . . . . . .
VI.3.1.4
Unique, List and Local Decoding . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
223
223
223
223
224
224
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
VI.4 Analyse AFOM : Cryptographie
SYSMO
PARSIFAL
MAX
HIPERCOM
CRYPTO
Comète
COMBI
AMIB
AlCo
LIX
VI.5 Fiche résumé : Cryptographie
VI.5.1
Membres . . . . . . . . . . .
VI.5.2
VI.5.3
VI.5.3.1
VI.5.3.2
VI.5.3.3
VI.5.3.4
Software . . . . . . . .
227
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
229
229
229
230
230
230
230
230
VI.6 Production scientifique : Cryptographie
VI.6.1
Livres et chapitres de livres . . . . . . . . . .
VI.6.2
Documents pédagogiques . . . . . . . . . . .
VI.6.3
Revues internationales . . . . . . . . . . . . .
VI.6.4
Conférences internationales . . . . . . . . . .
VI.6.5
Conférences nationales . . . . . . . . . . . .
VI.6.6
Vulgarisation . . . . . . . . . . . . . . . . . .
VI.6.7
Logiciel . . . . . . . . . . . . . . . . . . . . .
VI.6.7.1
Multiprecision . . . . . . . . . . . . .
VI.6.7.2
Integer Factorization . . . . . . . . . .
VI.6.7.3
Elliptic curves over finite fields: SEA
VI.6.7.4
Coding theory . . . . . . . . . . . . .
VI.6.8
Thèses . . . . . . . . . . . . . . . . . . . . . .
VI.6.9
Brevets . . . . . . . . . . . . . . . . . . . . . .
VI.6.10 Rapports techniques . . . . . . . . . . . . . .
VI.6.11 Autres . . . . . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
231
231
231
231
232
234
234
235
235
235
236
236
236
237
237
237
VI.7 Annexes : Cryptographie
VI.7.1
VI.7.1.1
VI.7.1.2
VI.7.1.3
Contrats bilatéraux . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
VI.7.2
239
239
240
240
241
241
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
11
VI.7.2.1
Activités éditoriales . . . . . . . . . . . . . . . .
VI.7.2.2
Gestion scientifique de conférences . . . . . . .
VI.7.2.3
Organisation d’événements scientifiques . . . .
VI.7.2.4
Participation à des comités et jurys scientifiques
VI.7.3
Activités de formation, encadrement et évaluation . . .
VI.7.3.1
Liste des thèses et HDR soutenues . . . . . . . .
VI.7.3.2
Liste de rapports de thèses et HDR . . . . . . . .
VI.7.3.3
Enseignements dispensés . . . . . . . . . . . . .
VI.7.4
Autres éléments de visibilité . . . . . . . . . . . . . . .
VI.7.4.1
Invitations . . . . . . . . . . . . . . . . . . . . .
VI.7.4.2
Prix et distinctions . . . . . . . . . . . . . . . . .
VII
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Équipe High-Performance Communications (Hipercom)
VII.1 Liste des membres : High-Performance Communications
VII.1.1 Liste actuelle des membres . . . . . . . . . . . . . .
VII.1.1.1 Membres permanents . . . . . . . . . . . . .
VII.1.1.2 Doctorants et postdoctorants . . . . . . . . .
VII.1.2 Anciens membres . . . . . . . . . . . . . . . . . . . .
VII.1.2.1 Membres permanents . . . . . . . . . . . . .
VII.1.2.2 Doctorants et postdoctorants . . . . . . . . .
VII.1.2.3 Autres membres . . . . . . . . . . . . . . . .
241
241
242
242
243
243
243
244
246
246
247
249
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
251
251
251
251
251
251
251
252
VII.2 Rapport scientifique : High-Performance Communications
VII.2.1 Thématique générale et principaux objectifs . . . . . . . . . . . .
VII.2.1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . .
VII.2.1.2 Thèmes de recherche . . . . . . . . . . . . . . . . . . . . .
VII.2.1.3 Exemples de résultats significatifs . . . . . . . . . . . . . .
VII.2.1.4 Animation scientifique, rayonnement, prix et récompenses
VII.2.1.5 Fonctionnement interne . . . . . . . . . . . . . . . . . . . .
VII.2.1.6 Formation par la recherche . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
253
253
253
253
253
256
257
257
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
TYPICAL
SYSMO
PARSIFAL
MAX
HIPERCOM
VII.3 Fiche résumé : High-Performance Communications
VII.3.1 Membres . . . . . . . . . . . . . . . . . . . . .
VII.3.2 Résultats scientifiques . . . . . . . . . . . . . .
VII.3.3 Production scientifique . . . . . . . . . . . . .
VII.3.3.1 Publications . . . . . . . . . . . . . . . .
VII.3.3.2 Rayonnement . . . . . . . . . . . . . . .
VII.3.3.3 Actions de formation . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
259
259
259
260
260
260
261
VII.4 Production scientifique : High-Performance Communications
VII.4.1 Livres et chapitres de livres . . . . . . . . . . . . . . . . .
VII.4.2 Revues internationales . . . . . . . . . . . . . . . . . . . .
VII.4.3 Conférences internationales . . . . . . . . . . . . . . . . .
VII.4.4 Thèses . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
VII.4.5 Normalisation - Ratified Standards . . . . . . . . . . . . .
VII.4.6 Normalisation - Contributions . . . . . . . . . . . . . . .
VII.4.7 Rapports techniques . . . . . . . . . . . . . . . . . . . . .
VII.4.8 Autres . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
263
263
263
264
266
266
267
273
275
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
CRYPTO
Comète
COMBI
AMIB
AlCo
VII.5 Annexes : High-Performance Communications
277
VII.5.1 Participations à la communauté scientifique et responsabilités administrative 277
VII.5.1.1 Responsabilités de projets internationaux . . . . . . . . . . . . . . . . . 277
LIX
12
VII.5.1.2 Responsabilités de projets nationaux . . .
VII.5.2 Administration de la recherche . . . . . . . . . . .
VII.5.2.1 Activités éditoriales . . . . . . . . . . . . .
VII.5.2.2 Organisation d’événements scientifiques .
VII.5.3 Activités de formation, encadrement et évaluation
VII.5.3.1 Enseignements dispensés . . . . . . . . . .
VII.5.4 Autres éléments de visibilité . . . . . . . . . . . .
VII.5.4.1 Invitations . . . . . . . . . . . . . . . . . .
VIII
TYPICAL
SYSMO
PARSIFAL
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Équipe Modélisation Algébrique et Calcul Symbolique (MAX)
278
278
278
279
279
280
280
280
283
VIII.1Liste des membres : Modélisation Algébrique et Calcul Symbolique
VIII.1.1 Liste actuelle des membres . . . . . . . . . . . . . . . . . . . . .
VIII.1.1.1 Membres permanents . . . . . . . . . . . . . . . . . . . .
VIII.1.1.2 Autres membres . . . . . . . . . . . . . . . . . . . . . . .
VIII.1.2 Anciens membres . . . . . . . . . . . . . . . . . . . . . . . . . . .
VIII.1.2.1 Doctorants et postdoctorants . . . . . . . . . . . . . . . .
VIII.1.2.2 Autres membres . . . . . . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
285
285
285
285
285
285
285
VIII.2Rapport scientifique : Modélisation Algébrique et Calcul Symbolique
VIII.2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
VIII.2.2 Thèmes de recherche . . . . . . . . . . . . . . . . . . . . . . . . . .
VIII.2.3 Logiciels . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
VIII.2.4 Exemples de résultats significatifs . . . . . . . . . . . . . . . . . .
VIII.2.5 Animation scientifique, rayonnement, prix et récompenses . . . .
VIII.2.6 Fonctionnement interne . . . . . . . . . . . . . . . . . . . . . . . .
VIII.2.7 Formation par la recherche . . . . . . . . . . . . . . . . . . . . . .
VIII.2.8 Création d’entreprise . . . . . . . . . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
287
287
287
290
290
290
291
291
291
MAX
HIPERCOM
CRYPTO
Comète
COMBI
AMIB
AlCo
LIX
VIII.3Projet de recherche : Modélisation Algébrique et Calcul Symbolique
VIII.3.1 Objectifs scientifiques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
VIII.3.1.1 Algorithmes fondamentaux pour le calcul formel . . . . . . . . . . . .
VIII.3.1.2 Algorithmes fondamentaux pour le calcul analytique . . . . . . . . . .
VIII.3.1.3 Résolution de systèmes polynomiaux invariants sous un groupe . . . .
VIII.3.1.4 Résolution réelle des systèmes polynomiaux . . . . . . . . . . . . . . .
VIII.3.1.5 Résolution des systèmes différentiels . . . . . . . . . . . . . . . . . . .
VIII.3.1.6 Développement de méthodes diverses en automatique et traitement du
signal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
VIII.3.1.7 Refondation de la théorie des séries temporelles . . . . . . . . . . . . .
VIII.3.1.8 Logiciels de calcul formel et analytique . . . . . . . . . . . . . . . . . .
VIII.3.1.9 Plateforme d’édition et de calcul scientifiques . . . . . . . . . . . . . .
VIII.3.2 Mise en œuvre . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
293
293
293
293
293
294
294
VIII.4Analyse AFOM : Modélisation Algébrique et Calcul Symbolique
297
VIII.5Fiche résumé : Modélisation Algébrique et Calcul Symbolique
VIII.5.1 Membres . . . . . . . . . . . . . . . . . . . . . . . . . . . .
VIII.5.2 Résultats scientifiques . . . . . . . . . . . . . . . . . . . . .
VIII.5.3 Production scientifique . . . . . . . . . . . . . . . . . . . .
VIII.5.3.1 Publications . . . . . . . . . . . . . . . . . . . . . . .
VIII.5.3.2 Rayonnement . . . . . . . . . . . . . . . . . . . . . .
VIII.5.3.3 Actions de formation . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
VIII.6Production scientifique : Modélisation Algébrique et Calcul Symbolique
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
294
294
294
295
295
299
299
299
299
299
300
300
301
VIII.6.1
VIII.6.2
VIII.6.3
VIII.6.4
VIII.6.5
VIII.6.6
VIII.6.7
VIII.6.8
VIII.6.9
VIII.6.10
VIII.6.11
Livres et chapitres de livres
Documents pédagogiques .
Revues internationales . . .
Conférences internationales
Conférences nationales . .
Conférences invitées . . . .
Brevets . . . . . . . . . . . .
Thèses . . . . . . . . . . . .
Logiciels . . . . . . . . . . .
Rapports techniques . . . .
Autres . . . . . . . . . . . .
13
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
301
301
301
304
307
307
308
308
309
309
310
VIII.7Annexes : Modélisation Algébrique et Calcul Symbolique
VIII.7.1 Participations à la communauté scientifique et responsabilités administratives
VIII.7.1.1 Responsabilités de projets internationaux . . . . . . . . . . . . . . . . .
VIII.7.1.2 Responsabilités de projets nationaux . . . . . . . . . . . . . . . . . . .
VIII.7.1.3 Participation à des projets internationaux . . . . . . . . . . . . . . . . .
VIII.7.1.4 Participation à des projets nationaux . . . . . . . . . . . . . . . . . . .
VIII.7.2 Administration de la recherche . . . . . . . . . . . . . . . . . . . . . . . . . . .
VIII.7.2.1 Activités éditoriales . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
VIII.7.2.2 Gestion scientifique de conférences . . . . . . . . . . . . . . . . . . . .
VIII.7.2.3 Organisation d’événements scientifiques . . . . . . . . . . . . . . . . .
VIII.7.2.4 Participation à des comités et jurys scientifiques . . . . . . . . . . . . .
VIII.7.3 Activités de formation, encadrement et évaluation . . . . . . . . . . . . . . . .
VIII.7.3.1 Liste des thèses et HDR soutenues . . . . . . . . . . . . . . . . . . . . .
VIII.7.3.2 Liste de rapports de thèses et HDR . . . . . . . . . . . . . . . . . . . . .
VIII.7.3.3 Enseignements dispensés . . . . . . . . . . . . . . . . . . . . . . . . . .
VIII.7.4 Autres éléments de visibilité . . . . . . . . . . . . . . . . . . . . . . . . . . . .
VIII.7.4.1 Invitations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
VIII.7.4.2 Prix et distinctions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
311
311
311
311
312
312
312
312
313
313
314
314
314
314
315
316
316
319
IX
321
Équipe Parsifal (PARSIFAL)
IX.1 Liste des membres : Parsifal
IX.1.1
IX.1.1.1
IX.1.1.2
IX.1.1.3
IX.1.2
Anciens membres . . . . . . . . . . .
IX.1.2.1
IX.1.2.2
IX.1.2.3
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
323
323
323
323
323
323
323
324
324
IX.2 Rapport scientifique : Parsifal
IX.2.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . .
IX.2.2
Research Themes . . . . . . . . . . . . . . . . . . . . . . . .
IX.2.3
Software . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
IX.2.4
IX.2.5
IX.2.6
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
325
325
325
327
327
329
329
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
IX.3 Projet de recherche : Parsifal
331
IX.3.1
TYPICAL
SYSMO
PARSIFAL
MAX
HIPERCOM
CRYPTO
Comète
COMBI
AMIB
AlCo
LIX
14
IX.3.1.1
IX.3.1.2
IX.3.1.3
IX.3.1.4
IX.3.1.5
IX.3.1.6
IX.3.1.7
Proof Certificates . . . . . . . . . . . . . . . . . . . .
Focused proof systems for arithmetic . . . . . . . .
Instantiation of variables beyond first-order logic .
Extending and enhancing our computational tools .
Deep Inference . . . . . . . . . . . . . . . . . . . . .
Proof Complexity . . . . . . . . . . . . . . . . . . .
Geometry of Rewriting . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
IX.4 Analyse AFOM : Parsifal
IX.5 Fiche résumé : Parsifal
IX.5.1
Membres . . . . . . . . . . .
IX.5.2
IX.5.3
IX.5.3.1
IX.5.3.2
IX.5.3.3
TYPICAL
SYSMO
PARSIFAL
MAX
HIPERCOM
CRYPTO
Comète
COMBI
AMIB
331
331
332
332
332
333
333
335
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
337
337
337
338
338
338
338
IX.6 Production scientifique : Parsifal
IX.6.1
Livres et chapitres de livres . . . . .
IX.6.2
Revues internationales . . . . . . . .
IX.6.3
Conférences internationales . . . . .
IX.6.4
Conférences invitées . . . . . . . . .
IX.6.5
Logiciel . . . . . . . . . . . . . . . .
IX.6.6
Thèses . . . . . . . . . . . . . . . . .
IX.6.7
Habilitation à diriger des recherches
IX.6.8
Rapports techniques . . . . . . . . .
IX.6.9
Autres . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
341
341
341
342
347
347
347
348
348
349
IX.7 Annexes : Parsifal
IX.7.1
IX.7.1.1
IX.7.1.2
IX.7.1.3
IX.7.1.4
IX.7.2
IX.7.2.1
IX.7.2.2
IX.7.2.3
IX.7.2.4
IX.7.3
IX.7.3.1
IX.7.3.2
IX.7.3.3
IX.7.4
IX.7.4.1
Invitations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
IX.7.4.2
351
351
351
352
352
353
353
353
354
356
356
357
357
357
358
359
359
360
X
361
Équipe Sysmo (Sysmo)
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
AlCo
LIX
X.1 Liste des membres : Sysmo
363
X.1.1
Liste actuelle des membres . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 363
X.1.1.1
Membres permanents . . . . . . . . . . . . . . . . . . . . . . . . . . . . 363
15
X.1.1.2
X.1.1.3
X.1.2
Anciens membres . . . . . . . . . . .
X.1.2.1
X.1.2.2
X.1.2.3
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
363
364
364
364
364
365
X.2 Rapport scientifique : Sysmo
X.2.1
X.2.1.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . .
X.2.1.2
Research themes . . . . . . . . . . . . . . . . . . . . . . . .
X.2.1.3
X.2.1.4
X.2.1.5
X.2.1.6
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
367
367
367
367
369
370
372
372
X.3 Projet de recherche : Sysmo
X.3.1
Objectifs scientifiques . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
X.3.1.1
Formal Definition and Modelling of Complex Industrial Systems
X.3.1.2
Optimization of Complex Industrial Systems . . . . . . . . . . . .
X.3.1.3
Safety Assessment of Complex Industrial Systems . . . . . . . . .
X.3.1.4
Data Science and Mining . . . . . . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
373
373
373
373
374
374
X.4
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Analyse AFOM : Sysmo
X.5 Fiche résumé : Sysmo
X.5.1
Membres . . . . . . . . . . .
X.5.2
X.5.3
X.5.3.1
X.5.3.2
X.5.3.3
TYPICAL
SYSMO
377
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
379
379
379
379
379
379
379
.
.
.
.
.
.
.
.
.
.
.
.
381
381
382
383
383
388
388
396
398
398
398
399
399
.
.
.
.
.
.
401
402
402
404
405
405
405
PARSIFAL
MAX
HIPERCOM
X.6 Production scientifique : Sysmo
X.6.1
Livres et chapitres de livres . . . . . . . . . . . . . .
X.6.2
Édition de livres et de numéros spéciaux de revues
X.6.3
Documents pédagogiques . . . . . . . . . . . . . . .
X.6.4
Revues internationales . . . . . . . . . . . . . . . . .
X.6.5
Revues nationales . . . . . . . . . . . . . . . . . . .
X.6.6
Conférences internationales . . . . . . . . . . . . . .
X.6.7
Conférences nationales . . . . . . . . . . . . . . . .
X.6.8
Brevets . . . . . . . . . . . . . . . . . . . . . . . . . .
X.6.9
Vulgarisation . . . . . . . . . . . . . . . . . . . . . .
X.6.10 Thèses . . . . . . . . . . . . . . . . . . . . . . . . . .
X.6.11 Rapports techniques . . . . . . . . . . . . . . . . . .
X.6.12 Autres . . . . . . . . . . . . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
CRYPTO
Comète
COMBI
AMIB
X.7
Annexes : Sysmo
X.7.0.1
Responsabilités de projets internationaux
X.7.0.2
Responsabilités de projets nationaux . .
X.7.0.3
Participation à des projets internationaux
X.7.0.4
Participation à des projets nationaux . .
X.7.0.5
Participation à des projets locaux . . . . .
X.7.1
Administration de la recherche . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
AlCo
LIX
16
X.7.1.1
Activités éditoriales . . . . . . . . . . . . . . . .
X.7.1.2
Gestion scientifique de conférences . . . . . . .
X.7.1.3
Organisation d’événements scientifiques . . . .
X.7.1.4
X.7.2
Activités de formation, encadrement et évaluation . . .
X.7.2.1
Liste des thèses et HDR soutenues . . . . . . . .
X.7.2.2
Liste de rapports de thèses et HDR . . . . . . . .
X.7.2.3
Enseignements dispensés . . . . . . . . . . . . .
X.7.3
Autres éléments de visibilité . . . . . . . . . . . . . . .
X.7.3.1
Invitations . . . . . . . . . . . . . . . . . . . . .
X.7.3.2
Prix et distinctions . . . . . . . . . . . . . . . . .
XI
TYPICAL
SYSMO
PARSIFAL
MAX
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Équipe Typical (Typical)
405
407
409
410
410
410
411
411
413
413
415
417
XI.1 Liste des membres : Typical
XI.1.1
XI.1.1.1
XI.1.1.2
XI.1.2
Anciens membres . . . . . . . . . . .
XI.1.2.1
XI.1.2.2
XI.1.2.3
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
419
419
419
419
419
419
420
420
XI.2 Rapport scientifique : Typical
XI.2.1
XI.2.1.1
Current Context . . . . . . . . . . . . . . . . . . . . . . . .
XI.2.1.2
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . .
XI.2.1.3
XI.2.1.4
XI.2.1.5
Logiciels . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
XI.2.1.6
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
423
423
423
423
424
426
426
427
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
HIPERCOM
CRYPTO
Comète
COMBI
AMIB
AlCo
LIX
XI.3 Projet de recherche : Typical
429
XI.3.1
XI.3.1.1
Better numbers in Coq . . . . . . . . . . . . . . . . . . . . . . . . . . . . 430
XI.3.1.2
Formal Computer Algebra . . . . . . . . . . . . . . . . . . . . . . . . . 430
XI.4 Fiche résumé : Typical
XI.4.1
Membres . . . . . . . . . . .
XI.4.2
XI.4.3
XI.4.3.1
XI.4.3.2
XI.4.3.3
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
433
433
433
433
433
434
434
XI.5 Production scientifique : Typical
XI.5.1
XI.5.2
Documents pédagogiques .
XI.5.3
Revues internationales . . .
XI.5.4
XI.5.5
Conférences nationales . .
XI.5.6
Logiciels . . . . . . . . . . .
XI.5.7
Thèses . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
435
435
435
435
436
440
441
441
.
.
.
.
.
.
.
XI.5.8
XI.5.9
XI.5.10
17
Habilitation à diriger des recherches . . . . . . . . . . . . . . . . . . . . . . . . 442
Rapports techniques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 442
Autres . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 442
XI.6 Annexes : Typical
XI.6.1
XI.6.1.1
XI.6.1.2
XI.6.1.3
XI.6.1.4
XI.6.1.5
XI.6.2
XI.6.2.1
XI.6.2.2
XI.6.2.3
XI.6.2.4
XI.6.3
XI.6.3.1
XI.6.3.2
XI.6.3.3
XI.6.4
XI.6.4.1
Invitations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
443
443
443
443
443
443
444
445
445
445
446
447
447
447
448
448
450
450
18
I Présentation du laboratoire
19
I.1 Le LIX
I.1.1
Présentation de l’unité
I.1.1.1
Introduction
Le sigle LIX désigne le Laboratoire d’Informatique de l’École Polytechnique, la lettre X désignant
l’École polytechnique dans la tradition française. À ce titre, le LIX se doit d’être une vitrine de
la recherche en informatique dans la compétition internationale académique, être une vitrine
du monde de la recherche pour les élèves de la formation d’ingénieur de l’école, et d’être à la
hauteur du prestige et des fonctions occupées par certains de ses anciens.
Cela nécessite une palette d’activités aussi large que possible, une recherche de qualité indiscutable, des contacts internationaux nombreux, des relations industrielles solides, et enfin, une
vision claire de la place du laboratoire dans le paysage informatique de demain.
Être un acteur visible et reconnu dans chacune de ces directions et couvrir l’ensemble de ce
spectre mène parfois le laboratoire à des activités qui peuvent paraı̂tres orthogonales, à la fois
liées à une recherche académique de premier plan, des relations fortes avec le monde industriel
et partenarial, et des activités de développement logiciel fortes.
Le Laboratoire d’Informatique de l’X (LIX) est une unité mixte de recherche (UMR 7161) de
l’École polytechnique et du Centre National de la Recherche Scientifique (CNRS).
Le CNRS est en 2013 le principal employeur des chercheurs et enseignants-chercheurs du
laboratoire. Le LIX relève de l’Institut National des Sciences de l’Information et de leurs Interactions
(INS2I) du CNRS. Les thèmes présents au laboratoire relèvent pour leur énorme majorité de la
section 06 du Comité National du CNRS. Certaines activités relèvent de la section 41 (ex section
01), et de la section 07.
L’École polytechnique est organisée en départements enseignement-recherche. Le Département
d’Informatique est nommé DIX pour Département d’Informatique de l’X. DIX et LIX entretiennent
des liens très étroits car le LIX est le seul laboratoire contenu dans le DIX d’une part, et d’autre
part les membres du LIX sont des membres de droit du DIX1 .
Les chercheurs du LIX entretiennent historiquement des liens étroits avec INRIA. Le LIX
compte en 2013 en effet 4 Equipes Projets Communes (EPC) avec INRIA.
Le LIX a été crée le 28 juin 1988. Il a été associé au CNRS et à l’INRIA à partir de 1989.
Le LIX est localisé sur le campus de l’École polytechnique. Il occupe depuis septembre 2012
le bâtiment Alan-Turing. Il garde quelques bureaux dans ses anciens locaux dans l’aile 0 de l’aile
des laboratoires de l’École polytechnique.
Direction La direction du laboratoire sur la période du 1er janvier 2008 à 2013 a été exercée
successivement par Philippe Baptiste (Directeur adjoint: Gilles Dowek) jusqu’au 1ier mars 2010,
puis par Olivier Bournez (Directrice adjointe: Catuscia Palamidessi). Le changement de directeur
et de directrice adjointe à fait suite au départ de Philippe Baptiste pour la direction de l’Institut
National des Sciences de l’Information et de leurs Interactions (INS2I) du CNRS.
I.1.1.2
Structuration scientifique
La structuration du laboratoire en juin 2013 est pour l’essentielle celle du mandat 2008-2013:
elle s’organise autour de trois thèmes: l’algorithmique, les réseaux, et les méthodes formelles.
• Le thème Algorithmes est composé des équipes:
– Algorithmes et Complexité, surnommée AlCo, dirigée par Miki Hermann.
1 Concrètement, le DIX est constitué des membres du LIX et des enseignants à temps partiels en informatique à l’École
polytechnique.
21
CHAPTER I.1. LE LIX
22
–
–
–
–
* Cette équipe s’intéresse aux problèmes de satisfaction de contraintes et à leur
complexité, aux modèles de calculs et dans une vision plus large aux questions
d’algorithmique et de théorie de la complexité.
Bio-Informatique, surnommée AMIB, dirigée par Mireille Régnier.
* Cette équipe s’intéresse à la biologie structurale: les protéines, l’ARN et leurs interactions, et aux problèmes combinatoires liés au séquençage de nouvelle génération.
Elle étudie la modélisation du métabolisme du cycle cellulaire.
Modèles Combinatoires, surnommée COMBI, dirigée par Gilles Schaeffer.
* Cette équipe s’intéresse aux descriptions combinatoires de structures géométriques,
couvrant des problèmes issus de contextes variés (physique statistique, compression de données, topologie énumérative, etc...), et une méthodologie relevant principalement de l’algorithmique discrète et de la combinatoire énumérative.
Modèles Algébriques et Calculs Symboliques, surnommée MAX, dirigée par Marc
Giusti.
* Cette équipe s’intéresse aux calculs symboliques (résolution de systèmes algébriques
ou différentiels algébriques), aux applications à la théorie du contrôle, à l’analyse
complexe effective, et au développement logiciel.
Modèles et Systèmes, surnommée SYSMO, dirigée par Antoine Rauzy.
* Cette équipe s’intéresse à l’étude des systèmes industriels complexes. Organisée
scientifiquement autour de quatre axes (l’architecture, l’optimisation et la sûreté
de fonctionnement des systèmes industriels complexes d’une part, la fouille de
données d’autre part), elle se caractérise scientifiquement par l’utilisation d’outils
formels issus de l’informatique théorique pour aborder des problèmes industriels
concrets via de nombreux partenariats académiques et hors-académiques.
• Thème Réseaux composé des équipes:
– Hipercom, dirigée par Thomas Clausen.
* Cette équipe s’intéresse à la conception et à l’optimisation d’algorithmes pour
les télécommunications pour obtenir les meilleures performances du medium de
communication sans fil.
– Cryptologie, surnommée CRYPTO, dirigée par Daniel Augot.
* Cette équipe s’intéresse: aux algorithmes de base sur les entiers (primalité, factorisation) et sur les courbes algébriques (courbes elliptiques ou hyperelliptiques);
aux cryptosystèmes basés sur la théorie algorithmique des nombres; aux codes
correcteurs algébriques. En théorie algorithmique des nombres, elle produit des
logiciels rapides permettant d’établir des records.
• Thème Méthodes formelles composé des équipes:
– Comète, dirigée par Catuscia Palamidessi.
* Cette équipe s’intéresse aux fondements du calcul distribué, au développement
de méthodes pour la protection de la vie privée, l’anonymat et du secret dans les
systèmes d’informations.
– Parsifal, dirigée par Dale Miller.
* Cette équipe s’intéresse à l’exploration des fondements logiques de la programmation et de la vérification, à la théorie de la preuve, avec l’objectif d’applications
à la conception d’outils de preuve et à leur possibilité de partage de preuves en
confiance entre outils.
– Typical, dirigée par Benjamin Werner.
* Cette équipe vise à contribuer aux formalismes logiques qui permettent la preuve
formelle d’assertions mathématiques, avec l’objectif de preuve assistée de démonstrations
mathématiques complexes.
I.1.1. PRÉSENTATION DE L’UNITÉ
I.1.1.3
23
Photographie au 30 Juin 2013
Visibilité scientifique académique
Le LIX est un laboratoire très visible sur le plan scientifique et académique:
• Il a publié 372 articles dans des revues internationales, et 508 articles dans des conférences
internationales sur la période du 1ier janvier 2008 au 30 juin 20132 .
• Il héberge des chercheurs et enseignants-chercheurs très visibles dans la compétition de
recherche internationale. Par exemple, Dale Miller, titulaire d’une ERC “Advanced Grant”,
Gilles Schaeffer, et Manuel Bodirksy titulaires chacun d’une ERC “Starting Grant”.
• Ses membres sont très actifs dans la communauté scientifique, et prennent part à des
comités éditoriaux de journaux réputés, de nombreux comités de programmes, et aux instances de pilotage des plus grands organismes de recherche.
Par exemple:
– Marc Giusti est rédacteur en Chef exécutif (”Managing Editor-in-Chief”) du journal
AAECC (Applicable Algebra in Engineering, Communication and Computing). Léo Liberti
est rédacteur en chef de 4OR. Dale Miller est rédacteur en chef de ACM Transactions
on Computational Logic (Juin 2009 – Mai 2015).
– Le LIX participe via ses membres aux comités éditoriaux des revues suivantes: ACM
Transactions on Computational Logic, Annals of IHP: Combinatorics- Physics and Application, Central European Journal of Computer Science, Computability, Computational Management Science, Data Mining and Knowledge Discovery, Discrete Applied Mathematics,
Discrete Mathematics and Theoretical Computer Science, EURO Journal of Computational
Optimization, Electronic Notes of Theoretical Computer Science, Forum Mathematicum3 ,
Intelligent Data Analysis - An International Journal, International Transactions in Operational Research, Journal of Combinatorial Theory - Series A, Journal of Applied Logic,
Journal of Applied Mathematics, Journal of Automated Reasoning, Journal of Global Optimization, Journal of Logic and Computation, Journal of Systems and Software Engineering, Journal of Virology, Machine Learning, Mathematical Structures in Computer Science,
RAIRO - Theoretical Informatics and Applications, Techniques et Science Informatique,
The Programming Languages Column of EATCS bulletin, Theory and Practice of Logic
Programming, Undergraduate Topics in Computer Science, Programs and Proofs series .
Relations partenariales et industrielles
Le LIX est un laboratoire avec des relations partenariales et industrielles fortes avec le monde
non-académique:
• Sur la période 2008 à 2013, il a entrenu en particulier des relations et des contrats avec
l’ADEME, la DIRIF, les sociétés ou entreprises CIAT, EADS, EDF, ERDF, FRANCAISE DES
JEUX, FUJITSU, HITACHI, IBM, IGPDE, IFPEN, GOOGLE, MEDIAMOBILE, MICROSOFT,
PSA, QUALCOMM, SAGEMCOM, RENAULT, TOYOTA, VALEO, ZODIAC AEROSPACE.
• Le LIX participe à deux dispositifs Carnot. Il participe, via ses EPC INRIA, au Carnot
INRIA. Il est membre dans son intégralité du Carnot Telecom & Société du Numérique.
• Le LIX contribue de façon très visible et notable à des actions de transfert de technologie,
et en particulier de normalisation autour des réseaux de télécommunications. Cela se manifeste par une participation active dans groupes de travail de l’IETF. Sur la période 2008 à
2013, 8 standards IETF internationaux ratifiés ont pour auteur des membres du LIX, et certains de ses enseignants-chercheurs (Thomas Clausen) sont extrêmement visibles à l’IETF.
2 Ce qui fait près de 3,68 publications par an et par chercheurs+enseignant-chercheurs, le nombre de permanent
moyen étant fixé à sa moyenne sur la période, soit 43,42.
3 Jusqu’en 2011.
CHAPTER I.1. LE LIX
24
• Les travaux issus du LIX sont aussi à l’origine de création de startup et d’entreprises.
En particulier, la société AL.I.E.N. (acronyme de ALgèbre pour Identification et Estimation
Numériques), spin-off de l’École polytechnique et de l’Université de Lorraine a été fondée à
la toute fin de l’année 2011 par Cédric Join (Université de Lorraine) et Michel Fliess (LIX).
La société AL.I.E.N. a obtenu en 2011 le prix OSEO en catégorie “émergence”.
• Le LIX est aussi à l’origine de brevets4 Par exemple, ses collaborations avec EDF et la DIRIF
ont conduit à deux brevets dont l’École polytechnique est partie prenante. Le brevet avec
EDF a obtenu le prix de l’innovation en 2010, catégorie brevet.
• Le LIX participe par ailleurs via ses membres et le DIX à deux chaires industrielles.
´
– La chaire Ingéniérie des systèmes complexes, qui est une chaire Ecole
polytechnique
– ENSTA ParisTech – Telecom ParisTech – Dassault Aviation – DCNS – DGA –
Thalès, coordonnée par Daniel Krob.
´
– La chaire Optimisation et développement durable, qui est une chaire Ecole
polytechnique – MICROSOFT – CNRS, coordonnée successivement sur la période 2008 à 2013
par Philippe Baptiste et Léo Liberti.
• Le LIX, via sa chaire Ingéniérie des systèmes complexes est aussi à l’origine des séries de
conférences Complex Systems Design & Management (CSD&M) et Digital Enterprise Design
& Management (DED&M) lieu de la rencontre de 50% de contributions industrielles et 50%
de contributions académiques autour des systèmes industriels complexes, avec un comité
de programme à parité.
Développement logiciel
Le LIX est un laboratoire avec une activité forte de productions en logiciels, ou contributions
logicielles.
• Il développe5 ou contribue au développement par exemple de Abella, Altarica, Bedwyr,
CADO-NFS, Coq, Decoding, Dedukti, DiMoVo, ECPP, ESBTL, GenRGenS, Gnu TEXmacs,
HOL-Coq, Level 0/1, Mathemagix, MPC, MPFRCX, Profound, Psyche, Quintix, SEA,
SMT-Coq, SSReflect, Teyjus, TIFA, TLAPS, Varna, VorScore: on trouvera une liste des
outils logiciels développés par le laboratoire et des détails dans les détails des contributions
de chacune de nos équipes.
• Certains sont des prototypes, spécialisés et focalisés, et d’autres sont des systèmes plus
impactants, en dehors de la seule communauté de recherche concernée, et consécutifs à
plusieurs années de développement. On peut citer par exemple
– GNU TEXmacs présent par défaut dans la grande majorité des distributions Linux.
Des paquets binaires pour Windows et Mac OS X sont disponibles depuis nos sites
Internet.
– Le logiciel Varna est très populaire parmi les acteurs de la bioinformatique des ARN,
et est mis en avant dans le rapport annuel du CNRS en 2011.
– Le système de preuve COQ ou Altarica utilisés et bien connus dans le monde industriel.
4 11 familles de brevets récents, dont 4 sur la période 2008 à 2013.
5 6 dépôts APP avec l’École polytechnique et CNRS.
25
La période 2009-2010
En 2013, la situation au laboratoire est calme. Cependant, l’histoire du laboratoire sur la période
2008 à 2013 reste marquée par une période de fortes turbulences liées à une période de conflit
explicite sur la période de 2009 à mi-2010. Les origines de ce conflit semblent anciennes, mais
le déclencheur semble avoir été la succession à la présidence du département d’informatique.
Cette période de crise a eu des effets directs et indirects qui se sont manifestés par le départ de
plusieurs cadres, chercheurs et enseignants chercheurs du laboratoire. A la fin de cette période
le département d’informatique de l’école polytechnique et le LIX avaient changé respectivement
de président et directeur.
Les tutelles, et en particulier le CNRS et son comité national ont su aider à cette situation en
permettant l’arrivée de plusieurs nouveaux jeunes chercheurs, et à faire qu’en 2013 le principal
employeur au laboratoire soit le CNRS.
Cependant, une des conséquences directe ou indirecte mesurables de cet état de fait est d’une
part une population relativement différente entre le début et la fin du mandat, et d’autre part,
une pyramide des âges assez différente. En 2013 le LIX souffre d’un déficit clair d’agents entre
40 et 50 ans, ce qui se manifeste au quotidien par un déficit de cadres.
Pyramide des âges.
Janvier 2008
Pyramide des âges.
Juin 2013
Locaux Le LIX, qui est LE laboratoire d’informatique de l’École polytechnique, est situé sur
le campus de l’École polytechnique. Le mandat 2008-2013 a vu son déménagement en 2012
pour partie dans ses nouveaux locaux, situés dans le bâtiment Alan Turing du campus de l’École
polytechnique. Nous écrivons pour partie, car malheureusement, en juin 2013, le LIX est scindé
physiquement en deux parties: il occupe pour majorité le bâtiment Alan Turing, mais il garde des
bureaux dans ses anciens locaux situés aile 0 de l’aile des laboratoires de l’École polytechnique.
Ce déménagement a cependant clairement permis un gain de surface global pour le laboratoire.
Les travaux pour l’extension du bâtiment Alan Turing devraient débuter dans l’année qui
vient (2014) et permettre au LIX de retrouver son unité physique et mettre fin à un problème de
locaux freinant sa croissance ou son accueil de personnels.
I.1.1.4
Vie scientifique de l’unité
Séminaires
La vie scientifique du laboratoire est essentiellement centrée autour de la vie de ses équipes de
recherche et des séminaires hebdomadaires du laboratoire. Il est à noter que les séminaires sont
parfois transverses à la notion formelle d’équipe, ou communs à des laboratoires du plateau de
Saclay ou de la région parisienne, et qu’ils sont tous ouverts à la libre participation de tous6
Les séminaires réguliers incluent:
• Le séminaire d’algorithmique et de complexité du plateau de Saclay. Ce séminaire commun au LIX, LRI, PRISM, SUPELEC se réunit au minimum une fois toutes les 2 semaines
6 Hors séminaire des doctorants où les permanents ne sont pas autorisés, sauf autorisation exceptionnelle.
CHAPTER I.1. LE LIX
26
en période scolaire. Le lieu du séminaire alterne entre les laboratoires chaque année. Le
LIX a accueilli les exposés pendant l’année scolaire 2012-2013. Il est animé par Manuel
Bodirsky du LIX, Johanne Cohen et Yannis Manoussakis.
• Un séminaire commun de l’équipe AMIB se réunit chaque semaine, généralement au LRI,
en alternant les exposés internes et les invitations. L’équipe participe au séminaire biannuel
BioNumeo, réunissant les acteurs du plateau en sciences du vivant.
• L’équipe COMBI organise un séminaire hebdomadaire au LIX, essentiellement constitué
de présentations de résultats récents par des chercheurs extérieurs au LIX. Ce séminaire
est aussi un lieu de rencontre et de réflexion pour les chercheurs de l’équipe. Par ailleurs,
plusieurs membres de l’équipe COMBI assistent régulièrement à d’autres séminaires de
combinatoire de la région parisienne.
• Le séminaire Comète-PARSIFAL qui a lieu régulièrement depuis 2004. Ce séminaire accueille aussi bien des orateurs locaux qui présentent leur travail en cours comme les visiteurs nombreux de ces équipes. Ce séminaire a été le lieu d’échange et de fertilisation
croisée des idées entre les deux équipes puisque la logique computationnelle et la théorie
de la concurrence jouent un rôle important dans les fondements de leurs recherches.
• Les équipes MAX et CRYPTO organisent de façon ponctuelle des exposés de séminaire
réunissant les membres de ces deux équipes. Ils assistent également aux exposés du séminaire
“Computations and Proofs” organisé par l’équipe SpecFun 7 dans le bâtiment Alan Turing.
• Un séminaire des doctorants a lieu deux fois par mois. Il permet des présentations scientifiques entre doctorants. Les chercheurs permanents ne peuvent pas y assister. Ce
séminaire est animé en juin 2013 par J.-P. Meline, qui a succédé à Claire Lucas qui a contribué à sa mise en place en 2012. De février 2008 à juillet 2009, un séminaire mensuel
de calcul formel pour doctorants appelé Cal4Doc réunissait les doctorants et post-docs des
equipes CRYPTO et MAX.
Le laboratoire est aussi animé régulièrement par des exposés spontanés qui ne sont pas couverts formellement par ces séminaires. L’annonce de tous les séminaires se fait par les listes de
courriers du laboratoire, un affichage sur le site du laboratoire, et parfois via les téléviseurs du
bâtiment Alan Turing, partagés avec INRIA.
Colloque annuel
Le laboratoire organise chaque année8 à l’automne son LIX colloquium, qui vise à rendre très
visible l’une des thématiques du laboratoire. Cet événement, public, visible et attractif, met en
avant chaque année un sujet ou un groupe de personnes au laboratoire.
Les derniers LIX colloquium ont été:
• 2013: The theory and application of formal proofs
• 2011: MaGiX@LiX.
• 2010: Bioinformatics.
• 2009: Reachability Problems (RP’09).
• 2008: Emerging Trends in Visual Computing (ETVC’08).
• 2007: Complex Industrial Systems: Modelling, Verification and Optimization.
• 2006: Emerging Trends in Concurrency Theory.
7 Équipe INRIA Saclay dirigée par F. Chyzak, non rattachée au LIX mais située dans le bâtiment Alan Turing.
8 L’édition 2012 initialement prévue a du être annulée.
27
Le LIX colloquium a lieu chaque année sur le site du laboratoire. Pour l’organisation d’événements ou de séminaires, une des difficultés du LIX est cependant qu’il est en région parisienne,
mais pas facilement joignable en un temps raisonnable depuis la capitale, en particulier pour
des invités étrangers, ou pour des visiteurs pour un événement sur le site. Une des explications9
étant l’absence de logements et de vraie vie sociale à proximité à proposer aux invités ou visiteurs. L’École polytechnique offre toutefois un hotel, permettant de s’épanouir scientifiquement
en soirée sur le site.
Appel à postdoc QUALCOMM-CARNOT
Le laboratoire a bénéficié pendant le mandat 2008-2013 d’un don généreux de la société américaine
QUALCOMM (500.000 $ US), fléché pour le LIX pour du ressourcement scientifique et des postdoctorants sur les thèmes du laboratoire.
Le LIX émet chaque année un appel compétitif international à candidats post-doctorant sur
toutes ses thématiques, financé par ce don. La sélection se fait sur une base compétitive basée sur
l’excellence. Cet événement fait clairement partie de la visibilité du laboratoire à l’international
et de sa vie scientifique.
Le ressourcement obtenu par le CARNOT Telecom & Société du Numérique vient maintenant
en complément de la donation QUALCOMM qui arrive à épuisement.
Le laboratoire recrute de 1 à 2 postdoctorants par an par ce moyen, en plus des nombreux
autres financements provenant de contrats ou projets du laboratoire permettant des recrutements
plus ciblés.
I.1.1.5
Effectifs du laboratoire
En Juin 2013, le laboratoire est constitué de 127 membres, se décomposant en 43 chercheurs et
enseignants chercheurs, 10 ingénieurs et techniciens administratifs, 2 émérites, 17 post-doctorants,
40 doctorants, et 15 autres (visiteurs, stagiaires). Sa population chercheur et enseignant-chercheur
se décompose en 19 chercheurs CNRS, 11 chercheurs INRIA, et 11 enseignants-chercheurs de
l’École polytechnique. Les 2 émérites sont respectivement 1 professeur émérite et 1 directeur de
recherche émérite.
La population du LIX est jeune: l’âge moyen des permanents est de 41 ans en juin 2013.
Le CNRS est en 2013 le principal employeur des permanents du laboratoire (44% des chercheurs/
enseignants-chercheurs permanents10 ). Les autres employeurs sont INRIA (25%), et l’École polytechnique (25%).
Il est à noter qu’en 2008, le rapport entre employeurs n’était pas le même: le tableau suivant
reprend les évolutions en terme de pourcentages arrondis à l’entier inférieur.
Fin
Chercheurs CNRS
Enseignants-Chercheurs X
Chercheurs INRIA
2007
35%
25%
35%
2008
34%
28%
34%
2009
38%
25%
31%
2010
39%
25%
31%
2011
40%
22%
32%
2012
40%
22%
30%
Juin 2013
44%
25%
25%
Le laboratoire a considérablement évolué sur la période 2008-2013, avec une phase d’expansion
claire, qui s’est suivie plutôt d’une décroissance, décroissance s’expliquant au moins pour partie
par des effets directs ou indirects des turbulences en 2009-2010 déjà évoquées (et avec un effet
de retard prévisible vu la gestion administrative des mutations).
9 Cet état de fait explique aussi que beaucoup d’événements organisés par le LIX ou ses membres, sont à Paris ou
ailleurs, et ne sont pas toujours par conséquent aussi perçus en tant que tel, la référence au LIX ne correspondant au plus
qu’à un logo pour un visiteur lambda.
10 Les 2 émérites ne sont pas comptés dans ces pourcentages.
CHAPTER I.1. LE LIX
28
Sur une fenêtre de vision plus large, il est à noter que la phase d’expansion évoquée n’a pas
été amorcée en 2008, mais qu’elle était déjà très forte dans le mandat précédent. La projection
des effectifs en 2008 est déjà très fortement en progression par rapport à 2007 et 2006.
Fin
Chercheurs ou Enseignants Chercheurs
PostDoc
Doctorants
Ingénieurs Techniciens Administratifs
Autre (Visiteur, Stagiaires)
Total
2007
31
7
45
8
6
97
2008
38
14
46
9
11
118
2009
44
19
46
9
11
129
2010
48
21
42
9
22
142
2011
50
21
56
13
24
164
Graphiquement:
Pour les chercheurs et enseignants-chercheurs (décompte hors émérites):
2012
50
25
56
11
20
162
Juin 2013
43
17
42
10
15
127
Fin
Total Chercheurs
Enseignants-Chercheurs
Dont chercheurs CNRS
Enseignants-Chercheurs X
Chercheurs INRIA
Autre
I.1.1.6
29
2007
2008
2009
2010
2011
2012
Juin 2013
31
38
44
48
50
50
43
11
8
11
1
13
11
13
1
17
11
14
1
19
12
15
1
20
11
16
1
20
11
15
2
19
11
11
2
Gouvernance du laboratoire
Situation actuelle
La direction du laboratoire est assurée par son directeur, Olivier Bournez, assisté d’une directrice
adjointe Catuscia Palamidessi.
Le LIX a été historiquement construit autour du concept d’équipes, souvent portées par une
personnalité très visible, souvent avec une taille réduite. Depuis sa création, le LIX fonctionne
sans conseil de direction, avec un conseil de laboratoire ou l’ensemble des responsables d’équipes
sont membres de droit.
Le nombre d’équipes, et donc de membres de droit, ramenés au nombre de candidats potentiels pour être élu en conseil de laboratoire fait que le conseil de laboratoire a un fonctionnement
en pratique proche de celui normalement associé aux assemblées générales.
Le laboratoire convoque toutefois sur une base au minimum annuelle des assemblées générales,
conformément à son règlement intérieur. Ce règlement intérieur, mis en place début 2012, fixe
pour l’essentiel11 des règles conformes au fonctionnement usuel du laboratoire.
Le transfert d’informations s’effectue en pratique soit par l’intermédiaire de points d’informations
en conseil de laboratoire, conseils de laboratoire qui fonctionnent souvent sur un mode d’assemblée
générale mensuelle, soit pour l’essentiel via des messages électroniques via les différentes listes
de diffusion du laboratoire, organisées par équipe, et type de personnels.
Evolutions envisagées pour le nouveau mandat
Le directeur a proposé à l’Assemblée Générale (AG) du laboratoire le 14 mai 2013 la mise en
place d’un conseil de direction. Après un exposé du directeur expliquant les raisons l’invitant à
faire cette proposition, l’Assemblée Générale a voté à 87% pour la mise en place de ce conseil de
direction (55 voix pour, 8 voix contre, et 0 absentions).
La composition en terme de personnes du conseil de direction n’a pas été soumise au vote en
assemblée générale.
Sur toute la période 2008-2013, le laboratoire était organisé en 3 thèmes, chaque thème contenant des équipes. La notion de thème est essentiellement utilisée pour présenter le laboratoire.
Le laboratoire et son directeur, en accord et sur invitation des tutelles, après consultation
des responsables d’équipes, à proposé vers fin mai 2013 d’organiser dorénavant le laboratoire
en axes, avec une notion plus forte d’axe, permettant une meillleure gouvernance du collectif.
Chaque axe possédant un coordinateur d’axe.
Après consultation des responsables d’équipes, le directeur a proposé un découpage en trois
axes (présenté plus loin), dont les coordinateurs sont respectivement Daniel Augot, Dale Miller,
et Gilles Schaeffer. Ce découpage a été présenté en conseil de laboratoire et aux responsables
d’équipes.
Le directeur propose que le conseil de direction, qui sera mise en place d’ici la fin 2013,
contiendra le directeur, la directrice adjointe, le président de département d’informatique de
l’École polytechnique, et les responsables d’axes.
Le fonctionnement proposé est le suivant. Chaque axe est constitué d’équipes. Chaque membre du laboratoire est membre d’une équipe, et donc d’un axe. Le rôle des coordinateurs d’axe
11 En créant cependant formellement l’assemblée des responsables d’équipes.
CHAPTER I.1. LE LIX
30
est de contribuer au pilotage du laboratoire via le conseil de direction et la définition, en accord
avec les responsables d’équipes, du projet scientifique du laboratoire et des axes.
Le conseil de direction, qui vise à se réunir chaque semaine, a pour but d’aider le directeur
pour la prise de décisions à échéances rapides, en complément de l’assemblée des responsables
d’équipes ou du conseil de laboratoire qui se réunit sur une base mensuelle.
Un des rôles des responsables d’axes et du conseil de direction proposé est d’aider à la diffusion d’informations ascendantes et descendantes, et à l’interface avec les sollicitations nombreuses extérieures.
Le directeur souhaite soumettre à l’approbation en assemblée générale le fonctionnement
adopté dès que possible. Plusieurs éléments sont encore à préciser, ou en discussions au moment
où ces lignes sont écrites.
On trouvera un organigramme fonctionnel dans le document contenant les annexes (Annexe
4).
I.1.1.7
Administration et services
Le laboratoire dispose d’un secrétariat, composé de Sylvie Jabinet (CNRS) et d’Evelyne Rayssac
(École polytechnique), ainsi que Valérie Lecomte et Christelle Liévin, Assistantes d’Equipes de
Recherche (AER) INRIA.
Chaque équipe du laboratoire se voit affecter une de ces quatre assistantes. L’assistante
d’équipe est l’interlocutrice privilégiée des membres de l’équipe. En pratique, Sylvie Jabinet
et Evelyne Rayssac assurent la supervision respectivement CNRS et X de l’unité, en plus de la
gestion des équipes qui leur sont affectées12 .
Le service informatique du LIX est constitué en juin 2013 d’une unique personne, James
Régis. Un poste d’IE CNRS au concours va permettre de revenir à une situation tolérable normalement au 1er décembre 2013. En 2008, le service informatique du LIX contenait trois ingénieurs.
Il a principalement en charge la gestion du réseau, des terminaux légers, la gestion de serveurs et
des sauvegardes, du site web du laboratoire, la formation et l’aide aux utilisateurs, dont en particulier les demandes de devis pour l’achat de matériel individuels. Une des fonctions principales
est de faire évoluer l’architecture systèmes du laboratoire en fonction des besoins des équipes
administratives et de recherche du laboratoire. Le système d’information du LIX doit aussi être
disponible 24h/24, 7jours/7 pour permettre aux nombreux membres de se connecter, quelles
que soient leurs localisations.
Le LIX possède également un ensemble de commissions en charge de questions spécifiques:
La commission en charge de la sélection des postdocs Qualcomm/Carnot. Le directeur nomme
chaque année en conseil de laboratoire une personne chargée de superviser la sélection des
postdocs. Cette personne doit mettre en place un comité de sélection, réprésentant les
domaines variés de recherche au LIX. Le comité de sélection propose un classement des
meilleurs candidats au directeur du LIX, après approbation par le conseil du laboratoire.
La commission des utilisateurs des moyens informatiques. Cette commission a pour mission
de recueillir les besoins des utilisateurs des moyens informatiques du laboratoire, et d’assurer
l’interface et le relais avec le service informatique. Ses missions incluent en particulier de
fixer les priorités, le suivi des projets en cours avec le service informatique, et de veiller à
la diffusion de l’information, et à détecter les besoins en formation des utilisateurs.
La commission en charge de l’affectation des bureaux. Cette commission réduite à une personne,
a en charge l’affectation des bureaux. Dans nos nouveaux locaux, les membres d’une même
équipe sont à proximité. La plupart de nos membres permanents ont un bureau seul ; une
minorité est dans des bureaux partagés (deux par bureau). Les post-doctorants et doctorants sont installés dans des bureaux partagés (trois par bureau). Grâce au travail de cette
12 Valérie Lecomte et Christelle Liévin ont par ailleurs régulièrement des sollicitations venant de leur organisme employeur pour des tâches non-couvertes par le LIX.
31
commission pendant ce mandat, la gestion des bureaux est en 2013 partiellement automatisée: lorsqu’un nouvel arrivant arrive au LIX, leur chef d’équipe ou assistante dépose une
demande de bureau via un formulaire web. Sous réserve de disponibilité des bureaux, un
bureau lui est proposé. La commission a en charge de proposer des solutions au mieux
pour les cas qui ne peuvent pas être gérés directement. La commission a eu par ailleurs
un travail ponctuel, mais substantiel, lors du déménagement partiel du laboratoire dans le
bâtiment Alan Turing.
Concernant l’hygiène et sécurité, le LIX possède un assistant de prévention. L’assistant de
prévention (James Régis en juin 2013) contribue à la mise en œuvre de la politique de santé
et de sécurité au travail dans le laboratoire. Sa mission est d’assister et d’alerter le directeur
d’unité dans la démarche d’évaluation des risques, dans la mise en œuvre d’une politique de
prévention des risques et dans la mise en place des règles de sécurité et d’hygiène au travail.
Depuis notre arrivée dans le bâtiment Alan Turing en copropriété avec INRIA, le travail de
l’assistant de prévention du LIX se fait en coordination avec l’assistant de prévention INRIA
du bâtiment, dans la mesure du possible. L’École polytechnique possède par ailleurs un comité
hygiène et sécurité, commun avec le CNRS, qui assure un suivi de l’ensemble des questions reliées
sur le site, et avec lequel nous travaillons en relation directe.
I.1.1.8
Moyens et évolutions
Le budget du laboratoire dépend essentiellement des sources de financement suivant: les tutelles
CNRS et École polytechnique, l’ANR, la Commission Européenne et des contrats industriels directs.
Cas particulier des EPC INRIA Les équipes projets communes (EPC) avec INRIA reçoivent
par ailleurs des financements via INRIA: le directeur ne possédant pas toutes les informations13
requises pour en parler avec le même niveau de détails que les autres financements, il fait le
choix de discuter des ressources hors ressources gérées par INRIA dans la suite de cette section.
Ressources hors INRIA Concernant les ressources hors INRIA et hors salaires des permanents,
on obtient les figures suivantes:
Figure I.1.1: Recettes (à gauche) et Dépenses (à droite) de 2008 à 2012. Ces données sont hors
salaires des permanents, et hors financements gérés par INRIA.
Les figures suivantes présentent l’évolution de nos ressources et dépenses.
13 Il ne les reçoit pas spontanément. Il en a fait la demande le 27 Septembre 2013. A la date du 15 Octobre 2013, il
estime ne pas avoir suffisemment d’informations pour donner de vrais détails.
32
CHAPTER I.1. LE LIX
Figure I.1.2: Ressources de 2008 à juin 2013 (en euros). Ces données sont hors salaires des
permanents, et hors financements gérés par INRIA. Les données 2013 ne correspondent pas à
une année complète et sont donc difficiles à interpréter.
Figure I.1.3: Dépenses de 2008 à juin 2013 (en euros). Ces données sont hors salaires des permanents, et hors financements gérés par INRIA. Les données 2013 ne correspondent pas à une
année complète et sont donc difficiles à interpréter.
Comme nous l’avons déjà écrit, le LIX a bénéficié de façon notable d’une donation de la société
QUALCOMM sur la période 2008-2013. Il a utilisé cette ressource pour le recrutement de postdocs et de missions reliées.
Le laboratoire n’impose pas ses équipes sur leurs contrats. Le Carnot Telecom & Société du
Numérique permet cependant un retour sur les activités partenariales de ses équipes. Les subventions directes des tutelles, le don QUALCOMM et l’argent résultant des retours Carnot constituent donc les uniques ressources pour le fonctionnement du laboratoire proprement dit.
Ce budget est utilisé pour couvrir toutes les dépenses relevant du fonctionnement global
du laboratoire: fournitures, achats de serveurs, d’ordinateurs, photocopies, etc. Une partie des
ressources est affectée par le directeur aux équipes pour subvenir essentiellement aux besoins
des membres du laboratoire ne disposant pas facilement de ressources propres ou ne pouvant
abonder aux ressources propres de leur équipe.
I.1.2. RÉALISATIONS
I.1.2
Réalisations
I.1.2.1
Production scientifique sur le mandat 2008-2013
33
On trouvera un détail des réalisations sur le mandat 2008-2013 dans les fiches de chacune des
équipes: en particulier, on trouvera une fiche résumée présentant une synthèse volontairement
très courte.
Nous ne reprendrons pas ici les éléments déjà mis en avant dans ce document. Voici quelques
éléments macroscopiques non encore cités:
Bilan quantitatif
Bilan quantitatif du mandat 2008-Juin 2013:
Livres, chapitres de livres, numéros spéciaux, édition d’actes
Documents pédagogiques
Revues internationales
Revues nationales
Conférences nationales
Logiciels
Brevets
Normalisation (RFC)
Normalisation (Contributions)
Thèses
HDR
Conférences Invitées
Rapports techniques
Autres
83
9
372
10
508
26
22
5
9
80
53
4
27
65
49
Figure I.1.4: Bilan quantitatif Janvier 2008-Juin 2013.
Distinctions et prix
• 2013:
– L’ANR GAIA, dans laquelle Frank Nielsen était largement impliqué, a reçu en 2013 le
grand prix ANR du numérique.
• 2012:
– Dale Miller a reçu la très prestigieuse ERC Advanced Grant pour la période 2012-2016
pour son projet ProofCert.
– Romain Lebreton a remporté le prix du meilleur article étudiant à la conférence internationale ISSAC’12, et le prix du meilleur poster de la part du Fachgruppe Computer
Algebra à ISSAC’12.
– Léo Liberti a terminé en 2ème position dans la section Modularity Clustering Quality
Challenge du 10ème DIMACS Implementation Challenge en 2012.
• 2011:
– Dale Miller a remporté le LICS Test-of-Time Award en 2011 pour un article co-écrit avec
Joshua Hodas dans LICS 1991.
CHAPTER I.1. LE LIX
34
– Ben Smith a reçu avec ses coauteurs le Asiacrypt 2011 best paper award pour son travail
sur le comptage de points de courbes de genre 2 avec multiplication réelle.
• 2010:
– Vincent Jost et David Savourey et leur équipe ont remporté le challenge ROADEFEURO-EDF dans la catégorie Senior en 2010.
– Michel Fliess a reçu le Prix de l’innovation de l’École polytechnique 2010, catégorie
brevet, pour un brevet sur les aménagements hydroélectriques.
– Claudia D’Ambrosio a reçu le prestigieux European Doctoral Dissertation Award en
2010 qui détermine la meilleure thèse en Europe.
– François Morain est détenteur de plusieurs records mondiaux avec fastECCP, qu’il
améliore de façon continue, à partir de programe de preuve de primalité ECPP développé
dès le début des années 1990. Son record personnel est à environ 25000 chiffres,
présenté à la conférence ECC2010, pour les 25 ans de la cryptographie à courbes elliptiques.
• 2009:
– Le travail de Léo Liberti en reformulation en programmation mathématique a reçu le
2ième prix ROADEF Robert Faure en 2009 (prix décerné tous les 3 ans par la société
Française de recherche operationelle ).
– Luca De Feo a reçu le SIGSAM Distinguished Student Paper Award à ISSAC’09.
– La thèse d’ Alexis Saurin a remporté le Prix de thèse de l’École polytechnique et le Prix
de thèse ASTI 2009.
– Christoph Dürr a obtenu le prix du meilleur article dans la conférence European Symposium on Algorithms (ESA) en 2009.
– G. Chapuy a obtenu le prix du meilleur article étudiant à la conférence FPSAC 2009
pour son article A new combinatorial identity for unicellular maps, via a direct bijective
approach.
• 2008:
– Ben Smith a reçu comme seul auteur le Eurocrypt 2008 best paper award.
– Konstantinos Chatzikokolakis, doctorant au LIX, a reçu l’accessit du Prix de thèse Gilles
Kahn en Novembre 2008.
– Andreas Enge a reçu le Selfridge Prize of the Number Theory Foundation pour le meilleur
article présenté à ANTS-VIII, 2008.
I.1.2.2
Le LIX dans son environnement
L’École polytechnique
Le DIX Le LIX est le laboratoire d’informatique de l’École polytechnique qui compte 20 laboratoires. Nous détaillons ci-après la part importante prise par le LIX dans la formation par la
recherche. Plus généralement, l’enseignement à l’École polytechnique est, pour une large part,
effectué par des enseignants à temps partiel, le plus souvent titulaires d’un emploi principal
de chercheur (CNRS, INRIA. . . ) et d’enseignants-chercheurs en université. C’est la politique
actuelle du département que de favoriser l’implication des chercheurs du LIX dans l’enseignement
et donc d’augmenter la proportion de membres du LIX parmi les enseignants. D’une part parce
les enseignants résidents sont naturellement plus proches des élèves, et d’autre part pour favoriser l’attractivité du LIX.
Un peu moins de 20 membres permanents du LIX sont titulaires d’un contrat d’enseignant ou
d’enseignant-chercheur, à temps plein ou à temps partiel, avec l’École polytechnique. Un nombre
35
comparable de membres du LIX interviennent dans les enseignements de l’École (de L3 à M2)
comme vacataires.
Les membres du LIX sont aussi structurants pour le département (DIX):
• Benjamin Werner est président du DIX, Olivier Bournez et François Morain en sont viceprésidents.
• Dominique Rossin, Stéphane Lengrand, Luca Castelli et Philippe Chassignet sont membres
du comite enseignement-recherche du département.
• Jean-Marc Steyaert et Stéphane Lengrand sont membres de la commission des thèses de
l’EDX (École Doctorale de l’X).
• Gilles Schaeffer représente l’École polytechnique à la commission des études du MPRI, Leo
Liberti joue un rôle similaire au MPRO, Daniel Krob anime le Master COMASIC.
• etc. . .
Les laboratoires de l’École polytechnique Les laboratoires de l’École polytechnique avec lesquels
le LIX entretient au jour le jour le plus de contacts scientifiques sont le CMAP, laboratoire de
mathématiques appliquées de l’École, ainsi que le CMLS, laboratoire de mathématiques pures,
et le LOB, laboratoire d’optique et biosciences, avec lequel il entretient principalement des collaborations sur les aspects biologie/bio-informatique.
Les réunions mensuelles des directeurs de laboratoires permettent des échanges réguliers sur
la vie et la stratégie scientifique de l’École Polytechnique, et sur les évolutions de notre environnement en particulier dans le contexte de l’Université Paris Saclay.
Le LIX bénéficie grandement de l’efficacité de membres du service des relations industrielles
et partenariales (DRIP) de l’École polytechnique (tout particulièrement Sylvie Tonda) dans le
cadre de ses interactions avec le monde non académique.
L’École polytechnique a mis en place plus récemment une direction de l’innovation et de
l’entrepreneuriat qui nous attire de nouveaux contacts industriels.
Les doctorants du LIX sont pour leur énorme majorité inscrits à l’École Doctorale de l’X (EDX)
qui offre les avantages d’une école doctorale pluridisciplinaire et de taille raisonnable.
Le CNRS
Le LIX dont son ensemble est fortement impliqué dans la vie scientifique et administrative du
CNRS.
Du point de vue du pilotage des instances du CNRS:
• Philippe Baptiste, ancien directeur du LIX a contribué à mettre en place l’Institut National
des Sciences de l’Information et de leurs Interactions (INS2I) du CNRS. Il l’a dirigé de 2010 à
2013.
• Dominique Rossin est membre du conseil scientifique de l’INS2I.
• Plusieurs membres du LIX participent au comité national du CNRS: Yann Ponty est membre élu du comité national du CNRS, en Sciences de l’information : fondements de l’informatique,
calculs, algorithmes, représentations, exploitations (section 6) et Modélisation et analyse des
données et des systèmes biologiques : approches informatiques, mathématiques et physiques (CID
51). Dominique Rossin a été membre du comité national du CNRS en section 07.
Le LIX est par ailleurs très actif dans plusieurs GdR du CNRS.
• Gilles Schaeffer a été responsable du pôle Algorithmique et combinatoire du GdR Informatique Mathématique du CNRS. Stéphane Graham-Lengrand est responsable du groupe de
travail Logique, Algèbre, Calcul du même GdR.
CHAPTER I.1. LE LIX
36
• Yann Ponty est animateur de l’axe Structure et interactions des macromolécules du GDR 3003
Bioinformatique Moléculaire.
Plus généralement, de nombreux membres du LIX participent à des jurys ou commissions du
CNRS.
INRIA
Les membres du LIX entretiennent des relations très étroites et actives avec INRIA. En particulier, en 2008, 7 des équipes sur 10 étaient, ou étaient en passe de devenir, ou hébergeaient des
Equipes Projets Communes (EPC) INRIA. Actuellement, 4 équipes du LIX sont, ou hébergent
une partie d’une EPC INRIA. À savoir:
• l’équipe Comète correspond à l’EPC du même nom;
• l’équipe PARSIFAL correspond à l’EPC du même nom;
• l’équipe CRYPTO correspondait à l’EPC TANC, qui a donné naissance à l’EPC GRACE;
• l’équipe AMIB héberge une partie de l’EPC AMIB répartie sur le LIX et le LRI.
Par ailleurs, l’équipe TYPICAL a hébergé l’EPC du même nom qui prenait la suite de l’EPC
LOGICAL. Elle s’est arrêtée au 31/12/2012. L’équipe MAX hébergeait une partie de l’EPC
ALIEN répartie sur le LIX et le LAGIS (École Centrale Lille). Cette EPC s’est arrêtée au 31/12/2010.
L’équipe HIPERCOM hébergeait une partie d’une EPC répartie sur le LIX, le LRI et le centre
INRIA-Rocquencourt. Cette EPC s’est arrêtée au 31/12/2012.
Depuis plusieurs années, de nombreux membres du LIX sont impliqués dans différents comités
et instances de l’INRIA. On signalera entre autres, au niveau local (pour le centre Saclay-Île-deFrance), les participations de D. Augot, M. Régnier, D. Miller et C. Palamidessi au comité des
projets, de B. Smith comme membre élu du comité de centre et de D. Augot à la direction du suivi
doctoral. Au niveau national, C. Palamidessi est depuis 2007 membre du Comité d’Orientation Scientifique et Technique, O. Bournez a siégé en 2011 au membre du jury d’admission CR et B. Werner
a été membre du conseil scientifique de 2008 à 2011.
Depuis 2012, le LIX est dans le bâtiment Alan Turing qui est en copropriété avec INRIA,
qui en assure la gestion. Cette présence géographique a clairement pour effet une meilleure
connaissance mutuelle et plus d’échanges scientifiques et sociaux. Stratégiquement, plusieurs
projets d’équipes communes avec INRIA sont envisageables, dépassant le seul cadre du LIX.
Le directeur du LIX avoue cependant déplorer une difficulté de cogestion avec la gouvernance
INRIA, INRIA ne reconnaissant pas clairement la notion d’UMR, et donc le rôle du directeur
d’unité. Les accords récents INRIA/CNRS, et la déclinaison locale pour le LIX avec l’École polytechnique devraient être des avancées dans ce sens14 .
Le CEA
L’équipe MeASI était en 2008 en partie commune avec le CEA. Seule la partie relevant strictement du LIX apparaissait dans le rapport d’activité, en raison des termes de l’accord régissant le
statut de cette équipe avec le CEA.
Nous continuons à entretenir des liens forts avec l’équipe du CEA-List dirigée par Eric Goubault,
que nous nommerons dans ce paragraphe ERC MeASI (ERC signifie Equipe de Recherche Commune dans le jargon du CEA).
Les collaborations de L’ERC MeASI avec le LIX sont nombreuses et transverses à la structuration en équipes (et en thèmes) du LIX. On peut citer par exemple:
• des publications communes avec l’équipe SYSMO, un projet ANR ASOPT et un projet
OMTE DIGITEO communs avec SYSMO;
14 Même si depuis qu’un projet de texte est discuté, il n’y a plus de réunions de site entre X, CNRS et INRIA. La dernière
réunion de site remonte à mars 2011.
37
• le projet ANR PANDA et le projet ANR CPP communs avec l’équipe Comète et l’équipe
PARSIFAL;
• et un projet DIGITEO PASO commun avec les équipes SYSMO et TYPICAL;
• et plus généralement beaucoup d’échanges scientifiques aussi bien sur la sémantique du
parallélisme que sur l’analyse probabiliste.
Par ailleurs, L’ERC MeASI entretient des liens forts avec le LIX via le DIX: L’ERC MeASI
participe activement aux cours a l’École polytechnique, avec un professeur à temps partiel et un
chargé d’enseignement partiel et de nombreux vacataires, avec en particulier des cours en L3,
M1 et la responsabilité d’une filière du M2 COMASIC.
L’ERC MeASI a également accueilli en stage des élèves polytechniciens (Michael Buchet et
Alex Lang en 2010, prix de stage de recherche (prix d’option) chacun d’eux). Les doctorants de
l’ERC MeASI ont été systématiquement été inscrits à l’École Doctorale de l’École polytechnique,
avec notablement Olivier Bouissou (2ème prix Gilles Kahn 2009) et Xavier Allamigeon (1er prix
Gilles Kahn 2010).
L’université de Paris Saclay
L’UPSay L’ensemble des établissements et des laboratoires du plateau de Saclay (et donc le LIX)
sont impliqués dans la construction de l’université de Paris-Saclay (UPSay).
Il s’agit d’un projet extrêmement ambitieux, visant à construire une université des premiers
rangs mondiaux, construite par la collaboration de 23 établissements partenaires. Le campus
Paris-Saclay est une fondation de coopération scientifique (FCS) en charge de ce projet.
Les 23 partenaires de la Fondation de Coopération Scientifique Campus Paris-Saclay.
Le projet de l’UPSay est un gigantesque chantier très ambitieux, nécessitant de faire coopérer
différents organismes et entités au fonctionnement à priori assez différents.
Grâce à l’initiative IDEX, un financement important soutient la création de l’UPSay: un capital de 900 Meuros est détenu par la fondation, dont les intérêts vont à l’UPSay.
Les partenaires évoqués précédemment du LIX, à savoir l’École polytechnique, le CNRS et
l’INRIA, et le CEA en sont des partenaires. En considérant l’informatique en général, Télécom
ParisTech, l’ENS Cachan, le CEA, l’université Paris-Sud, et l’université de Versailles–Saint-Quentin
en Yvelines sont aussi partenaires.
Les objectifs identifiés comme devant concourir à la création de l’UPSay sont: un unique
diplôme de doctorat, des diplômes de master avec des cours en anglais, des publications scientifiques signées par des scientifiques s’affiliant à l’université de Paris-Saclay, un campus attractif
rapidement mis en place, pour les étudiants, les enseignants et les chercheurs, des services de
soutien à l’accueil des étrangers.
On parle ici de 30000 étudiants et de 12000 chercheurs (ordre de grandeur / les chiffres sont
variables suivant les sources).
CHAPTER I.1. LE LIX
38
Création de l’UPSay Pour réaliser ces objectifs, et pour encourager, organiser la communauté,
les structures suivantes ont été créées ou existent déjà à ce jour:
• un comité exécutif;
• un sénat académique;
• 11 laboratoires d’excellences (LABEX) ont été sélectionnés dont le LABEX Digicosme, qui est
celui consacré au STIC, voir plus bas;
• différents outils: des chaires, des projets exploratoires et de soutien (PEPS), des projets
phares. . .
Quand l’UPSay verra le jour (printemps 2014, première année académique démarrant en
septembre 2015), elle devrait être structurée comme suit:
• onze schools pour l’enseignement, dont une intitulée school for Engineering, Information Science and Technology;
• 17 écoles doctorales15 . Une grande école doctorale (900 étudiants), ED-STIC, sera consacrée aux STIC. Cette école rassemblera et unifiera des écoles doctorales déjà présentes
sur plusieurs sites: l’EDITE (UPMC and Télécom ParisTech), celles de l’ENS Cachan,
´
de l’Ecole
Centrale Paris, l’école doctorale en informatique de l’université Paris´
Sud et de Supélec, de l’École polytechnique, de l’université d’Evry–val-d’Essonne,
de
l’université Versailles–Saint-Quentin.
• Le Labex Digicosme, voir plus bas.
• Des départements pour la recherche, parmi lesquels un département STIC. Le RTRA Digiteo (voir plus bas) a vocation à construire le département STIC, et le Labex Digicosme à
représenter un périmètre plus étroit dans ce département.
• Un Equipex Digiscope pour la visualisation à base de calcul à haute performance, dont le
LIX n’est pas partenaire, qui sera au sein du département STIC.
• Un institut de la société du numérique, porté par l’INRIA, est en train de se mettre en
place, pour aborder les questions sociétales liées à la diffusion massive des technologies
numériques dans la société. Il sera dans le département STIC. D’autres instituts existent en
dehors de nos domaines.
• Un Institut de recherche technologique, l’IRT SystemX. Il est dédié à l’ingénierie numérique
des systèmes du futur. Ses deux programmes de recherche “ Systèmes de systèmes” et
“Technologies & outils d’ingénierie numérique” sont dédiés aux priorités technologiques
que sont l’énergie, les transports et la mobilité, les télécommunications, et la sécurité et
la défense. Rassemblant d’ores et déjà 44 partenaires dont 35 industriels, l’IRT SystemX a
comme rôle de faciliter le transfert de technologies et de compétences vers l’industrie. Il
se veut un véritable accélérateur d’innovation pour les produits et services des entreprises
partenaires, leur permettant ainsi d’améliorer leurs performances socio-économiques et
s’appuiera sur les trois instituts Carnot leaders dans le numérique : CEA, INRIA et Institut
Mines-Telecom.
Le LIX participe à sa hauteur à cette construction. En particulier, via sa représentation à
différents groupes de travail, à la construction de l’ED-STIC, la construction du département
STIC, ou sa participation au sénat académique (le directeur du LIX est membre élu du collège des
directeurs de ce sénat / Eric Goubault de l’ERC MEASI est membre élu du collège des chercheurs
de ce sénat).
15 Alors que 24 existent maintenant.
39
Il est très difficile d’énumérer les différents groupes de travail à ce jour, et le LIX participe
à plusieurs d’entres eux. Par exemple, Julie Bernauer représente l’INRIA dans le groupe de travail Biologie de l’IDEX, et Benjamin Werner représente l’informatique dans le groupe de travail
formation et dans le groupe de travail masters.
Le RTRA Digiteo Le RTRA Digiteo est un cluster en STIC, dont le domaine scientifique couvre
la théorie, la conception, le développement et la vérification de systèmes logiciels. C’est une fonction de coopération scientifique créée par les acteurs principaux du plateau de Saclay dans le domaine: à l’origine le CEA, le CNRS, l’INRIA, l’École polytechnique, Supélec et l’université ParisSud, rejoints ensuite par l’ENS Cachan, l’École Centrale de Paris, l’ENSTA Paris-Tech, Mines
ParisTech, TelecomParisTech and l’UVSQ. Ces institutions sont représentées dans le comité de
pilotage, dirigé par M. Robin. Digiteo a aussi géré les fonds de l’Île-de-France alloué au DIM
SLC: domaine d’intérêt majeur en logiciel et systèmes complexes.
Il possède un comité de pilotage auquel le LIX est représenté par Olivier Bournez et Benjamin
Werner, et un comité de programme en charge de sélectionner les demandes de financement, dont
Daniel Augot et Mireille Régnier font partie.
Un objectif visible de ce réseau est d’attirer des jeunes chercheurs. En sus des financements
de post-doctorants, de doctorants, et d’invitations courtes, Digiteo a financé onze chaires accueillant des scientifiques étrangers séjournant au moins trois mois par an dans un laboratoire
membre de Digiteo. Le LIX a été partenaire de cinq chaires, dont un des bénéficiaires, M. Vazirgiannis, a finalement été recruté par l’École polytechnique en 2013. Digiteo vise aussi à animer
la collectivité, en organisant des journées thématiques, un séminaire http://www.digiteo.fr/
-digiteo-seminar-, un forum annuel et un soutien aux manifestations scientifiques.
Digiteo accomplit aussi une mission de valorisation à travers le dispositif des opérations
de maturation technique et économique (OMTE) visant à amplifier le transfert des technologies abouties issues de la recherche. Ce dispositif est à l’origine de la proposition d’une société
d’accélération de transfert de technologies (SATT) dans l’université de Paris-Saclay.
Un partenariat privilégié avec le pôle de compétitivité Systematic a conduit à la création de
l’Institut de Recherche Technologique SystemX dans le cadre de l’UPSay.
Le Labex Digicosme Le LABEX Digicome est un laboratoire d’excellence sélectionné dans l’appel
LABEX. Il s’agit de la proposition de LABEX qui a émané de la communauté STIC du plateau
de Saclay. Par rapport au RTRA Digiteo, il est plus restrictif sur ses domaines de couverture
et vise à créer une organisation cohérente et visible de la recherche et de l’enseignement dans
nos disciplines. Digicosme diffère de Digiteo principalement dans deux aspects: le labex est
plus ciblé scientifiquement à travers trois tâches (SciLex, ComEx, DataSense), et s’investit de
manière nette dans l’enseignement. Les trois tâches ciblées par Digiteo sont: Scilex (sécurité et
sémantique), ComEx (réseaux et télécoms), DataSense (données et visualisation).
Toutes les équipes du LIX prennent part à DigiCosme: AlCo, Comète, CRYPTO, MAX, PARSIFAL, SYSMO relativement à la tâche SciLex, HIPERCOM à la tâche Comex, et AMIB, COMBI à
la tâche DataSense.
Les moyens proposés par Digicosme pour renforcer l’intégration de la recherche en informatique dans l’UPSay sont pour l’instant: une conférence annuelle, des écoles de jeunes chercheurs,
et des journées industrielles. Un autre moyen d’action dont s’est doté Digicosme pour une part
importante de son budget est le financement d’étudiants étrangers pendant leurs deux années
de master, ainsi que des thèses. Le processus d’attribution des financements de thèse est partagé
avec celui de Digiteo, dont les classements issus du comité de programme sont utilisés par Digicosme. Le labex soutiendra aussi des initiatives pédagogiques comme des mini-cours par des professeurs invités, l’accès à des plateformes de recherche, et des projets de transfert, d’innovation
et d’entrepreneuriat.
Sa coordinatrice est Christine Paulin-Mohring (LRI). Il possède un comité exécutif, un conseil
des tutelles, un conseil scientifique, une commission recherche et innovation, et une commission
formation. Cette commission de formation a déjà établi un programme commun d’enseignement
CHAPTER I.1. LE LIX
40
en informatique au niveau L3 devant être adopté par tous les établissements d’enseignement de
l’UPSay.
Les laboratoires impliqués dans DigiCosme sont:
LRI
UMR 8623 U. Paris-Sud, CNRS
LIMSI/CHM
UPR 3251
CNRS
LIST
CEA
École Centrale Paris
MAS
EA 4037
UEI
ENSTA
LSV
UMR 8643 ENS Cachan, CNRS
LIX
UMR 7161 Polytechnique, CNRS
CRI Saclay–Île-de-France
INRIA
CRI Paris–Rocquencourt
INRIA
LTCI
UMR 5141 Télécom ParisTech, CNRS
SAMOVAR
UMR 5157 Télécom SudParis, CNRS
E3S
EA 4454
Supélec
L2S
UMR 8506 Supélec, U. Paris-Sud, CNRS
PRISM
UMR 8144 U. Versailles St-Quentin, CNRS
Laboratoires impliqués dans Digicosme.
Olivier Bournez est membre du comité de pilotage du labex Digicosme (le LIX est dans la
catégorie des membres fondateurs). Catuscia Palamidessi représente le LIX dans la commission
recherche et innovation de Digicosme. B. Werner (resp. D, Augot) représente le DIX (resp. INRIA)
dans la commission commission formation de Digicosme.
Environnement scientifique national
Les équipes du LIX collaborent avec de nombreuses autres équipes d’autres laboratoires français:
on peut mentionner par exemple des collaborations formalisées via des projets ANR ou autre
avec les laboratoires ELM, IRISA, LABRI, LIAFA, LIGM, LIP, LIP6, LIPN, LIRMM, LORIA, LSV
et PPS.
Nous ne reprendrons pas ici toutes les collaborations: celles-ci sont énumérées en annexe par
équipes, avec quelques lignes relatives au sujet de chacune.
Environnement scientifique International
Il serait très pénible d’énumérer ici toutes nos relations à l’international: elles sont décrites ou
peuvent se retrouver facilement à partir des parties relatives à chaque équipe. Par ailleurs, beaucoup de nos équipes sont constituées pour leur forte majorité d’étrangers et sont spontanément
internationales.
On peut toutefois citer plusieurs collaborations formalisées par des projets internationaux
avec l’Allemagne (Bonn, Bern, Sarrebruck), l’Argentine (Buenos Aires), l’Autriche (Vienne, Innsbruck), le Brésil (Sao Paulo), le Canada (Montréal McGill), la Colombie (Santiago de Cali), le
Chili (Santiago), la Chine (Hong Kong, Pékin, Shanghai), l’Italie (Bologne, Pise), le Portugal (Lisbonne), la Russie (Moscou), les USA (Stanford, Pittsburgh CMU, Univ. Minnesota).
I.1.2.3
Animation
Nationale
Le LIX est fortement impliqué dans la vie et l’animation des GdR du CNRS: voir le texte plus
haut pour le CNRS.
Le LIX est aussi fréquemment impliqué dans des missions classiques d’expertise au niveau
national pour le monde académique: comités ANR, comités d’évaluation DGA, ONERA, participation aux groupes de travail d’Allistène, participation à des comités scientifiques d’universités
ou d’écoles d’ingénieurs.
41
Hors du monde purement académique, il a aussi été impliqué dans des comités de normalisation, ou des convocations à des auditions par des missions de l’Assemblée nationale (concernant
la loi Hadopi et concernant les droits de l’individu dans la révolution numérique).
On retrouvera ces éléments détaillés par équipe.
Internationale
Outre sa participation à différents comités éditoriaux de revues internationales (voir section
I.1.1.3), les membres du LIX prennent aussi part à des comités de programme et/ou de pilotage
de conférences ou de société savantes, ou à l’organisation d’événements.
On peut par exemple citer:
Comités de programmes et/ou de pilotage de conférences ou sociétés savantes : AAAI, ANTS,
CADE, CSDM, CSL, CONCUR, CPP, DEDM, DISC, EATCS, ESOP, ETAPS, FCT, FOSSACS, FPSAC, ICALP, IJCAR, ISMB/ECCB, ISSAC, LICS, LPAR, MEGA, POST, SODA, STACS, TAMC, WCC
Organisation de conférences internationales : par exemple ANTS-IX, ICMS 2010, ECML/PKDD
2011, WCC 2011, ISSAC 2012, FPSAC 2013
Le LIX est aussi fréquemment impliqué dans des missions classiques d’expertise au niveau
international comme par exemple des comités d’évaluation d’universités étrangères, jury de prix
de thèses internationaux, jury de sélection de projets pour la commission européenne, jury internationaux de meilleurs papiers ou de prix internationaux.
Il intervient aussi pour des agences nationales étrangères comme par exemple pour les déclinaisons
des agences de recherche en Belgique, Canada, Italie, Grèce, Pays-Bas, Roumanie, Suisse et Taiwan.
On retrouvera ces éléments détaillés par équipe.
Vulgarisation et diffusion scientifiques
Les membres du LIX sont fortement impliqués dans la diffusion scientifique sous des formes
variées:
• Rédaction d’articles dans les revues et journaux de vulgarisation comme La recherche, Interstices ou interview pour des vidéos de vulgarisation.
• Intervention dans des écoles primaires, Lycées, ou devant des professeurs de lycée, ou dans
des salons comme Culture et jeux mathématiques ou au Festival PariScience.
• Intervention dans la nuit des chercheurs, événement annuel organisé sur le site de l’École
polytechnique, ou à la fête de la science chaque année.
• Participation à Unithé ou café, séminaire de vulgarisation de l’INRIA Saclay.
Les membres du LIX sont aussi régulièrement invités à faire des exposés invités à des conférences
internationales. Citons par exemple des invitations de membres du LIX à ANTS-8, ECC’9 à
ECC’13, LICS’2010, ICALP’2011.
I.1.2.4 Évolutions sur le mandat 2008-2013
Evolutions de structuration
La structuration du laboratoire en équipe a été modifiée en février 2010 juste avant le départ de
son précédent directeur (Philippe Baptiste) pour l’INS2I: la partie du LIX qui est désignée par
MEASI dans le rapport d’activité pour le précédent mandat, désigne l’union des équipes actuelles
AlCo et SYSMO du LIX. En 2008, MEASI était constituée en effet d’une partie du LIX (devenu
AlCo et SYSMO) et de l’équipe du CEA LIST dirigée par Eric Goubault.
CHAPTER I.1. LE LIX
42
Conformément aux textes régissant avec le CEA l’équipe du CEA LIST dirigée par Eric Goubault,
il n’avait pas été possible de faire figurer au rapport d’activité du LIX, l’ensemble de l’équipe
MEASI comme une seule équipe.
L’acronyme MeASI désigne de fait dorénavant l’équipe du CEA LIST dirigée par Eric Goubault.
Cette équipe, désignée par le vocable “équipe associée”, correspondant à une équipe qui n’est pas
membre du LIX au sens de notre rapport d’activités.
La structuration du laboratoire n’a pas été modifiée depuis 2010, même si plusieurs responsables d’équipes ont été changés.
Recrutements/Départs sur le mandat 2008-2013
Par équipe
Si l’on étudie l’évolution en termes d’effectifs chercheurs et enseignants-chercheurs des équipes,
on obtient le tableau suivant16
Fin 2007 2008 2009 2010 2011 2012 Juin 2013
AlCo 2
4
4
4
4
4
3
AMIB 3
3
5
6
6
5
6
COMBI 2
4
7
8
8
9
8
MAX 3
3
4
5
5
5
4
SYSMO 2
3
3
4
5
5
4
HIPERCOM 3
3
3
3
4
3
1
GRACE 3
4
4
4
4
5
5
Comète 3
3
3
3
4
4
4
PARSIFAL 4
4
5
5
5
5
5
TYPICAL 6
7
6
6
5
5
3
Exprimé en termes de pourcentages de l’effectif chercheurs/enseignants-chercheurs:
Fin
AlCo
AMIB
COMBI
MAX
SYSMO
HIPERCOM
GRACE
Comète
PARSIFAL
TYPICAL
2007
6%
9%
6%
9%
6%
9%
9%
9%
12%
19%
2008
10%
7%
10%
7%
7%
7%
10%
7%
10%
18%
2009
9%
11%
15%
9%
6%
6%
9%
6%
11%
13%
2010
8%
12%
16%
10%
8%
6%
8%
6%
10%
12%
2011
8%
12%
16%
10%
10%
8%
8%
8%
10%
10%
2012
8%
10%
18%
10%
10%
6%
10%
8%
10%
10%
Juin 2013
6%
13%
18%
9%
9%
2%
11%
9%
11%
6%
Graphiquement:
Janvier 2008
Juin 2013
16 Pour les équipes AlCo et SYSMO la lecture n’est pas aisée pour une année antérieure à 2010, en raison du
redécoupage évoqué en 2010. Le choix fait dans ce tableau est de considérer que chaque chercheur ou enseignantchercheur appartient sur l’ensemble du mandat à son équipe actuelle.
43
Sous forme de courbe d’évolution:
On peut y observer une stratégie de recrutement forte pour deux équipes: l’équipe BioInformatique (AMIB) et l’équipe Combinatoire (COMBI) en lien respectivement avec les volontés
de renforcer la bio-informatique et la combinatoire autour de l’ERC de Gilles Schaeffer, volontés
présentes dans le document rendu pour le précédent mandat.
Par contre, le départ de personnel INRIA à la tête d’équipes a entraı̂né une forte décroissante
des équipes Typical (TYPICAL), High-Performance Communications (HIPERCOM). La réduction
des forces en réseaux est contraire à la priorité affichée de développer les réseaux que l’on trouve
dans le document rendu pour le précédent mandat.
Par thème
Projeté sur les thèmes.
Fin
Thème Algorithmes
Thème Réseaux
Thème Méthodes formelles
2007
12
6
13
2008
17
7
14
2009
23
7
14
2010
27
7
14
2011
28
8
14
2012
28
8
14
Juin 2013
25
6
12
Soit en terme de pourcentage de l’effectif chercheur/enseignant-chercheur:
Fin
Thème Algorithmes
Thème Réseaux
Thème Méthodes formelles
Graphiquement:
2007
38%
19%
41%
2008
44%
18%
36%
2009
52%
15%
31%
2010
56%
14%
29%
2011
56%
16%
28%
2012
56%
16%
28%
Juin 2013
58%
13%
27%
CHAPTER I.1. LE LIX
44
Janvier 2008
Juin 2013
Observons que cette projection est relativement trompeuse pour ce qui concerne le thème
Réseaux, car la relative stabilité du thème Réseaux est surtout expliquée par la progression des effectifs de l’équipe Cryptographie (CRYPTO), sur des aspects au final non centrés sur les réseaux.
I.1.3
Implication du LIX dans la formation par la recherche
I.1.3.1
Le Département d’Informatique de l’X
Le LIX est l’unique laboratoire d’Informatique de l’École polytechnique, et correspond donc à
la composante recherche du Département d’Informatique (DIX). Il incombe au DIX de former à
l’informatique et à la recherche en informatique les 500 élèves qui constituent les promotions annuelles de l’École polytechnique, auxquels s’ajoutent les étudiants masters venant de l’extérieur.
Les élèves se spécialisant en informatique (en troisième année) sont de l’ordre de 60 étudiants
chaque année.
Donner une plus grande importance à la recherche dans la formation polytechnicienne est
une priorité de l’École polytechnique depuis plus de dix ans. Cela se traduit aussi bien en interne
dans l’offre faite aux étudiants, qu’en externe (l’importance de la recherche est par exemple mise
très en avant dans la communication pour les levées de fond de l’École polytechnique).
On peut noter qu’aujourd’hui un tiers des polytechniciens passent une thèse, et que cela approche
les 50% en informatique.
La plus grande part des enseignements du DIX sont effectués et pilotés par des membres du
LIX, qui contribue donc fortement à la formation par le recherche par ce moyen.
I.1.3.2
Formation au niveau L3
Ce niveau correspond à la 2e année de scolarité et est fortement pluri-disciplinaire. Elle est
composée d’une part par des cours structurants sur un modèle classique (cours magistraux, TDs,
projets) qui sont, pour l’informatique, largement assurés par des membres du LIX. En outre, et
malgré un emploi du temps chargé, cette année comporte un certain nombre d’ouvertures vers la
recherche, qui comptent parmi les réussites de l’enseignement de l’informatique à polytechnique.
Les Modules en Laboratoire sont un élément obligatoire de la scolarité polytechnicienne.
Le département propose de tels modules sur des sujets divers, comme les réseaux, l’image, la
bio-informatique, la préparation des olympiades ACM, la vérification et les langages et outils du
web.
L’offre du département d’Informatique est extrêmement populaire, puisqu’un tiers de chaque promotion demande à effectuer son module en Informatique. Cela est très important pour améliorer et
renouveler l’image de la discipline auprès des étudiants.
Les Projets Scientifiques Collectifs sont également un élément de la 2e année. Effectués
en équipe, ils laissent la voie libre à la créativité des élèves, sous la supervision d’un tuteur.
Plusieurs projets sont encadrés chaque année au LIX.
De manière générale, tradionnellement, les enseignements à l’École polytechnique, s’accompagnent
nécessairement de production de documents pédagogiques de qualité, et qui se doivent d’être de
I.1.4. STRATÉGIE ET PERSPECTIVES SCIENTIFIQUES POUR LE FUTUR CONTRAT
45
référence. Les membres du LIX/DIX produisent donc aussi des polycopiés de cours considérés
souvent comme références.
I.1.3.3
Formation en Master 1
La troisième année de scolarité à l’École polytechnique joue le rôle d’un master 1 spécialisé.
Elle accueille également des étudiants rejoignant l’école en master. On peut considérer que plus
de 50 polytechniciens suivent un M1 d’informatique à l’école. Ce master dispose d’une offre
d’une vingtaine de cours, dont plus de la moitié est assurée par des membres du LIX. Cette
année est cruciale, car c’est en général à ce moment que les étudiants polytechniciens décident
de poursuivre leur formation par un M2 et une thèse.
Il est possible aux étudiants de remplacer un cours par un projet personnel en laboratoire,
sous la supervision d’un chercheur du LIX. En 2013, 30 étudiants de M1 effectuent un tel projet. La
plupart au LIX.
Une autre particularité du M1 de polytechnique est que le 3e trimestre est consacré à un stage
de recherche. Un certain nombre de ces stages ont lieu au LIX. Plus généralement, l’organisation
et la supervision de ces stages, même lorsqu’il ont lieu dans d’autres laboratoires, est un travail
important entièrement effectué par les enseignants membres du LIX.
I.1.3.4
Pilotage de Master 2. Enseignement en Master 2.
Un vingtaine de chercheurs et enseignants-chercheurs du LIX interviennent en M2 dans le Master Parisien de Recherche en Informatique (MPRI), qui fait partie des formations en l’École polytechnique, et qui est également une source première de thésards de qualité pour le LIX. L’École
polytechnique, via le LIX, est membre fondateur de ce master.
Des membres du laboratoire interviennent également dans le Master Parisien de Recherche
Opérationnelle (MPRO), dont Polytechnique est un des porteurs, de même que le Master Bioinformatique et Statistiques (BIBS).
A travers Daniel Krob, l’École polytechnique joue un rôle crucial dans le master Comasic positionné à l’articulation entre recherche académique et industrielle dans le domaine des systèmes
complexes et particulièrement de la sûreté des logiciels embarqués critiques.
I.1.3.5
Accueil de doctorants au LIX
Le LIX accueille par ailleurs de nombreux doctorants, leur très grande majorité venant de l’extérieur17
(i.e. hors École polytechnique).
On trouvera la liste des thèses soutenues au LIX dans la période 2008-2013, et les thèses en
cours au 30 juin 2013 dans l’annexe 7.
Sur la période du 1ier janvier 2008 au 30 juin 2013, les membres du LIX ont fait soutenir 53
thèses. En juin 2013, la population doctorante s’élève à 40 personnes. La durée moyenne d’une
thèse au LIX est de 40,06 mois, si l’on met de côté le cas d’une unique thèse dans une situation
très particulière, et de 40,72 mois sinon.
I.1.4
Stratégie et perspectives scientifiques pour le futur contrat
Comme évoqué précédemment, nous proposons dans le cadre du futur mandat de l’unité:
1. une évolution de notre gouvernance avec la création d’un conseil de direction, et
2. une évolution de notre structuration pour une nouvelle structuration en trois axes.
17 Par exemple sur les 33 inscriptions à l’EDX (Ecole Doctorale de l’X) pour l’année 2012-2013, 3 ont pour établissement
d’origine déclaré l’École polytechnique.
CHAPTER I.1. LE LIX
46
L’idée de cette évolution vers des axes, n’est pas de se substituer aux projets scientifiques des
équipes, qui sont présentés plus loin par équipe, mais de les appuyer par une structuration.
La structuration que nous proposons est issue d’un débat et d’une concertation entre responsables d’équipes, et d’échanges au niveau du laboratoire avec ceux qui ont spontanément pris
part à ce débat.
Elle est au final basée sur une logique d’implication de notre recherche dans le tissu social
et économique et non pas seulement du point de vue des collaborations scientifiques effectives
durant la période concernée par cette évaluation.
Nous pensons qu’elle aidera en particulier à une logique d’explications et de présentation
vis-à-vis de nos partenaires, en particulier non académiques, qui ne comprennent pas toujours
spontanément les découpages fins de nos disciplines.
Comme expliqué dans la partie présentant la gouvernance, le rôle précis des coordinateurs
d’axes est encore pour partie en discussion. Il sera présenté en AG, et voté dès que possible.
Un rôle important des coordinateurs est d’aider à l’interface du laboratoire. Les coordinateurs
d’axe, plus disponibles que le seul directeur, auront une connaissance de chaque chercheur plus
approfondie que celle du directeur, et pourront mieux cibler en interne les sollicitations externes.
Par leur participation au conseil de direction, les coordinateurs d’axes permettront par ailleurs
de meilleures interactions entre les équipes et les interfaces extérieures du laboratoire, et un
meilleur suivi de la stratégie globale du laboratoire et des équipes.
Nous proposons en effet de structurer le laboratoire en trois axes. Chaque axe est constitué
par le regroupement d’équipes, chaque équipe étant dans l’un des trois axes. Un des rôles des
axes est de présenter une vitrine du travail effectué par ses équipes.
Ces axes seront cependant clairement conçus comme poreux, avec en particulier nos séminaires
déjà existants, basés souvent sur une logique de fondements scientifiques communs18 , qui continueront à compléter cette logique transverse d’axes, elle basée sur des domaines d’applications.
I.1.4.1
Axe: Algorithmes, Combinatoire, Modèles.
Coordinateur:
Gilles Schaeffer.
Présentation L’informatique a vu le développement depuis son avènement d’un socle d’outils
théoriques qui lui sont propres, tels que l’algorithmique discrète, la théorie des automates ou de
la complexité, ou qu’elle partage avec des disciplines connexes, tels que la combinatoire ou la
programmation mathématique, pour ne citer que ceux qui nous occupent.
Une part importante des interactions de l’informatique avec les autres disciplines scientifiques ou avec le monde industriel s’appuie sur l’idée que ces outils ont une portée au delà
de leur seule valeur pour la science informatique: les sciences naturelles, physique, biologie,
ou mathématiques, posent des questions qui, traduites dans le langage de l’informatique, sont
d’intéressants champs d’application ou défi pour nos outils, et on peut faire la même observation
pour de nombreux problèmes industriels.
18 Rappelons que beaucoup de nos séminaires sont dores et déjà transverses à la structuration en équipes.
47
Composition L’axe Algorithmes, Combinatoire, Modèles du LIX regroupe des équipes issues
du thème algorithmique et qui développent ainsi des travaux en forte interaction avec d’autres
disciplines:
• l’équipe AlCo se concentre sur les problèmes de satisfaction de contraintes et leur complexité et sur les modèles de calculs, en lien notamment avec des questions de logique et
d’analyse probabiliste.
• l’équipe AMIB construit une approche à la biologie structurale qui va la combinatoire des
séquences à l’analyse de structures tridimensionnelles, avec un intérêt particulier porté
aux interactions moléculaires. Elle possède un fort socle scientifique en combinatoire,
géométrie algorithmique et mathématiques discrètes. Son originalité réside dans la combinaison de stratégies classiques de biophysiques et de modélisatoin avec des stratégies
d’apprentissage automatique et de statistiques, ainsi que de pattern matching ou d’échantillonage. Dans le future, de nouvelles contraintes émergeant de technologies évoluant continuement devront être introduits dans les modèles et l’analyse. Le niveau de la cellule
sera étudié avec la simulation de cycles métaboliques, avec un accent particulier sur les
environnements cancéreux.
• L’équipe COMBI s’intéresse aux liens entre combinatoire et géométrie et applique des
méthodes algorithmiques et d’énumération à des problèmes issus de contextes variés, allant de la physique statistique, à la compression de données ou la topologie énumérative. Le
programme actuel de cette équipe est d’étendre son champs de compétence de la géométrie
2 dimensionnelles aux dimensions supérieures et à des problèmes combinatoires de nature
quasi-géométriques.
• L’équipe SYSMO s’intéresse à la modélisation et l’optimisation de systèmes industriels complexes ainsi qu’aux grandes données.
Les équipes de cet axe sont issues de l’équipe Algorithmique historique du LIX, et leurs membres
partagent pour la plupart une culture commune en informatique fondamentale “classique”. Il est
indéniable que la variété des champs d’interactions abordés conduit de fait à des trajectoires centrifuges mais un second point d’ancrage commun reste la notion de modèles: une partie de notre
travail est de faire entrer des objets d’études non informatique dans des cadres algorithmiques
ou formels de notre discipline. Cette amorce de cohésion est renforcée par de nombreux intérêts
communs bilatéraux plus concrets: l’aléa discret et la géométrie algorithmique pour Combi et
Bioinfo, la géométrie polyédrale et le traitement des grands graphes pour Combi et Sysmo, la
programmation mathématique pour AlCO et Sysmo, le repliement tridimensionnel des structures d’ANR pour BioInfo et Sysmo.
À côté de collaborations nationales et internationales variées, les équipes de cet axes sont
largement dans des actions autour du plateau de Saclay, et plus généralement en région parisienne:
• AMIB est une EPC INRIA jointe avec une équipe BioInfo au LRI. AMIB collabore aussi
étroitement avec les laboratoires d’informatique de l’UVSQ et de l’université d’Évry–Vald’Essonne, et les laboratoires de biologie du plateau (LOB à l’École polytechnique, l’IGM à
l’université Paris-Sud, ou à Paris avec l’université Paris-Diderot.
• L’équipe Combinatoire mène des collaborations active avec avec les labos de physiques
théoriques du plateau, à l’X, à Orsay et au CEA Saclay, ainsi qu’avec l’équipe Geometrica
de l’INRIA Saclay, et dans la région, avec le LIAFA à l’université Paris-Diderot.
• L’équipe AlCo collabore avec l’équipe de logique mathématique à Paris 7.
• L’équipe Sysmo est largement impliquée dans les deux chaires industrielles associées au
laboratoire.
CHAPTER I.1. LE LIX
48
I.1.4.2
Axe: Informatique distribuée et sécurité
Coordinateur:
Daniel Augot.
Présentation La sécurité, la protection de la vie privée, la sûreté et la fiabilité contribue à affermir la confiance que l’homme peut avoir dans un système, qu’il soit une machine, un système
centralisé, un système mobile et distribué, ou le réseau lui même. Maintenant qu’Internet et le
Web ont acquis une certaine maturité, mais que toutefois de nouvelles classes d’entités apparaissent, par exemple, l’Internet des objets, nous proposons de contribuer à établir ces propriétés
suivant les notions suivantes: la sécurité des systèmes (le système est-il protégé contre toute intrusion ?), une vision quantitative et sociologique de la vie privée (les humains semblent prêts
à tolérer un certain niveau de perte d’intimité en échange d’un plus haut niveau de service),
et l’étude de la tolérance aux fautes, pannes, désynchronisations (le système fonctionnera-t-il
correctement quand certains de ses composants tombent en panne ?).
Composition
Trois équipes sont regroupées au vu de ce large domaine d’application:
• Comète (Concurrency, Mobility and Transactions) définit des modèles venant des algèbres
de processus ou de la théorie de l’information pour les adapter à la sécurité et à la protection de la vie privée;
• GRACE (Geometry, aRithmetic, Algorithms, Codes, Encryption) est experte des mathématiques et algorithmes à la base de la cryptographie et de la théorie des codes;
• NETWORKS , ex-HIPERCOM, se concentre aussi bien sur les algorithmes et protocoles de
routage, que sur l’architecture de réseaux, très grands, très dynamiques ou encore contraints.
Les trois équipes ont déjà coopéré: GRACE et HIPERCOM ont mené une opération de maturation
technologique et économique Digiteo (OMTE CryptoNet), pour intégrer de la cryptographie à
base de courbes elliptiques dans la fameux protocole de routage OLSR. GRACE et Comète sont
très impliqués, au sein de l’université de Paris-Saclay, dans le montage de l’Institut de la société
du numérique notamment dans son volet portant sur la vie privée.
Bien sûr, ces équipes ont aussi une partie de leur activité qui n’est pas directement orientée
vers ces domaines d’application. Par exemple, GRACE a une part importante de son activité
portant sur la théorie algorithmique des nombres, Comète sur la théorie des modèles formels.
Dans les détails, l’équipe Comète étudie les problèmes des systèmes distribués et ubiquitaires, dont les réseaux sociaux, le fameux cloud, et les applications mobiles sont des exemples
frappants. La sécurité est un problème fondamental, et le respect de la vie privée est devenu
un objet de préoccupation majeur, depuis que les menaces pesant sur elle ont grandi en puissance de plusieurs ordres de grandeur. La méthodologie centrale de Comète est de construire
des formalismes, des méthodes de raisonnement et des outils, pour spécifier les systèmes et les
protocoles, et pour garantir qu’ils remplissent bien les propriétés de sécurité et de vie privée
souhaitées. Les recherches dans Comète peuvent être réparties dans quatre thèmes: l’étude probabiliste de la fuite d’information dans les flux de données, en utilisant la théorie de l’information,
plus particulièrement la min-entropie de Rényi; le model-checking pour vérifier des propriétés
qui combinent les probabilités, la mobilité et la sécurité; la programmation concurrente par
contrainte, concurrent constraint programming, augmentée d’un formalisme qui modèlise la notion de spatialité et d’information épistémique; les problèmes d’expressivité de ces modèles.
En algorithme distribuée, l’équipe étuide la correction d’algorithmes distribués sous des hypothèses d’asynchronisme et en présence d’erreurs; la conception et l’analyse de la complexité
d’algorithmes distribués assurant la coordination et la synchronisation d’agents lorsque la topologie du graphe d’interaction varie dans le temps du fait de pannes de transmission ou du fait de
la mobilité des agents.
Comète a par exemple généralisé la notion de differential privacy, à l’origine construite pour
la communauté des bases de données statistiques, et basée sur la distance de Hamming, à tous
49
les domaines pourvus de n’importe quelle distance. Cette notion a aussi été liée à celle de fuite
d’information. Ce cadre conceptuel a trouvé une application très pratique et facile à expliquer
pour protéger la vie privée dans les systèmes utilisant la géolocalisation.
GRACE s’est donné trois domaines de recherche: la théorie algorithmique des nombres, les
primitives cryptographiques et le codage algébrique. Au centre de ces trois domaines, le ciment
est l’arithmétique des courbes sur les entiers ou les corps finis: elle apparait dans le logiciel
fastECPP de preuve de primalité; dans la cryptographie à base de courbes elliptiques ou hyperelliptiques, et dans le codage algébrique (codes de Goppa géométriques). L’équipe a une tradition
de programmes rapides permettant d’établir des records en théorie des nombres: primalité, factorisation (en collaboration avec l’équipe CARAMEL du LORIA de Nancy). En codage algébrique,
le groupe construit de nouveaux bons codes, cherche à les décoder, mais aussi s’intèresse à leur
utilisation dans le système de cryptographie McEliece ou dans les algorithmes de chiffrements
par blocs.
Au nombre des succès de GRACE, on compte les attaques de B. Smith sur les courbes elliptiques de genre 3, son comptage de points de courbes à multiplication réelle (meilleurs papiers aux conférences Asiacrypt et Eurocrypt). En codage algébrique, A. Couvreur a élucidé les
phénomènes du code de sous-corps dans le contexte général des codes de Goppa géométriques.
F. Morain a présenté son dernier record de primalité à la conférence ECC2010.
NETWORKS, ex-HIPERCOM, s’intéresse particulièrement au routage, dont le rôle est de
garder Internet connexe, même face à la vague des nouveaux objets, nouveaux utilisateurs, et
nouveaux usages. Un enjeu qui émerge est celui de la transition vers les communications de
machine à machine, où par exemple le lave-vaisselle familial communiquera directement avec
le compteur d’électricité, pour être contrôlé à distance par la centrale nucléaire la plus proche,
pour optimiser et faire correspondre au mieux la consommation à la production. L’équipe a
développé de fortes collaborations bilatérales (avec financement) avec des industriels: des fournisseurs (EDF, ERDF); des fabricants d’équipement (Sagemcom, ST Micro); ce qui lui a permis de
développer des algorithmes et des protocoles qui sont devenus des standards industriels. Cette
voie de recherche se prolongera dans le projet ADEME SOGrid, qui commence en 2013 et dont
le LIX est un partenaire majeur. En coté de cette activité sur l’Internet des objets, l’équipe a
aussi un intérêt historique dans les réseaux dits MESH et MANET, et a développé le protocole de
routage dominant dans ce domaine, OLSR, utilisé à la fois dans le monde militaire par l’OTAN
comme standard de référence pour les réseaux tactiques, mais aussi dans le monde civil pour
établir des réseaux communautaires ou d’intervention d’urgence. Cette activité sera maintenue
dans la continuité, encore en coopération industrielle avec BAE systems et Hitachi.
Ces équipes ont notamment les collaborations locales et nationales suivantes:
• Comète collabore avec le LRI et d’autres laboratoires, soit informatiques, soit juridiques,
soit économiques, de l’Île-de-France, dans le contexte de l’action interdisciplinaire “Institut
de la Société du Numérique” au sein de l’IDEX Université de Paris-Saclay, sur le thème de la
protection de la vie privée. Au niveau national, Comète participe à l”’action d’envergure”
INRIA CAPPRIS, toujours sur la protection de la vie privée, qui réunit plusieurs laboratoires en France et aussi un en Belgique.
• GRACE collabore avec le laboratoire PRISM de l’UVSQ, le PRISM de Télécom ParisTech,
ainsi que le projet SECRET de l’INRIA Rocquencourt, au niveau de Saclay; et au niveau
national avec le projet Caramel de l’INRIA Nancy, et l’équipe ARITH du LIRMM de Montpellier.
• NETWORKS a des collaborations industrielles au niveau national, grâce à son implication importante dans le projet ADEME SOGrid, où sont impliqués EDF, ERDF, Nexans,
IGPN, Sagemcom, Landis+Gyr, Trialog, ST Microelectronics et Cap Gemini. Ce projet
vise à définir une architecture de communication pour une grille électrique nationale, et
d’intégrer un système complet implémantant cette architecture.
CHAPTER I.1. LE LIX
50
I.1.4.3
Axe: Calcul symbolique et preuve
Coordinateur:
Dale Miller.
Présentation Il est devenu banal de faire remarquer qu’une multitude de systèmes informatique jouent un rôle critique dans notre vie courante. Ces machines et leur logiciels contrôlent
une bonne part des infrastructures des sociétés occidentales: on peut penser à des exemples aussi
différents que les systèmes bancaires via la dématérialisation de la gestion des flux financiers, les
pilotes automatiques des avions, ou la régulation et la surveillance du réseau de distribution
électrique. Notre sécurité et la gestion de nos données privées sont prises en charge par les
logiciels de nos smartphones, web browsers, caméra digitales et autres voitures modernes: il est
fréquent que des erreurs dans les logiciels de bas niveau (telles que de simples débordements de
buffers) soient exploitées pour attaquer ces instruments. Bien qu’il y ait plusieurs approches pour
traiter ces questions de qualités du matériel et du logiciel, telles que par exemple la systématisation
du développement logiciel ou le test extensif, il y a peu d’espoir que le monde connaisse des
logiciels sûrs et corrects sans que de grands progrès soient fait dans l’utilisation de méthodes
formelles.
Composition L’axe Calcul Symbolique et Preuve du LIX réunit trois équipes dont la recherche
tend à contribuer à l’objectif général d’améliorer notre compréhension de la preuve et au
développement d’outils d’aide au raisonnement correct.
Ces équipes ont leur champs de compétence dans trois domaines reconnus et bien établis du
raisonnement formel en mathématique et informatique.
• MAX se concentre sur l’efficacité et la robustesse des algorithmes de calcul symbolique et des
outils pour l’algèbre, le calcul différentiel et la géométrie. L’importance de ces questions
pour la modélisation de systèmes physiques dans un large champs d’applications industrielles est reconnue de longue date. Cette équipe met à disposition TeXmacs et Mathemagix, deux outils pour la présentation et resolution des problemes mathematiques par l’
ordinateur.
• PARSIFAL développe et exploite la théorie des preuves, un sujet lancé par Gentzen dans les
années 30, réannimé par Girard dans les années 80 et 90 et maintenant appliqué largement
aux fondations de l’informatique.
• TYPICAL développe et exploite la théorie des types, un sujet lancé par de Bruijn et Martin-löf
dans les années 30 et pour lequel des systèmes tels que Coq ont été développés et employés
avec succès aussi bien dans la recherche académique que dans l’industrie ou à des fins
éducatives.
Ces trois équipes ont des profils en partie similaire en ce qu’elles portent un effort équitable
sur trois aspects de leur disciplines: les fondations théoriques, les applications pratiques, et le
développement d’outils informatiques. De fait, ces trois facettes interagissent largement. Ainsi
la fréquentation régulière de questions applicatives permet de comprendre quel genre d’outils il
est utile de développer. La mise au point et l’implantation effective de ces outils logiciels amène
de nouvelles considérations théoriques. Enfin, pour fermer la boucle, les progrès fondamentaux
rendent possible l’exploration de nouvelles applications à partir du coeur de compétence d’une
équipe.
Les thématiques scientifiques couvertes par ces trois équipes se chevauchent et ce chevauchement donne une cohérence naturelle à l’axe. Ainsi le calcul symbolique au sens de MAX nécessite
de faire certaines déductions formellement: par exemple, il peut s’avérer nécessaire de prouver
que le dénominateur d’une fraction n’est jamais nul ou que trois points dans l’espace ne sont pas
colinéaires. De la même manière, une grande part des déductions sont souvent des calculs (voire
même des calculs symboliques) et lorsqu’on cherche à créer des preuves vérifiables la séparation
entre calcul et déduction est une question subtile. Un autre aspect commun d’étude des trois
51
équipes sont les langages mis au point et utilisés par les matématiciens: ainsi les problématiques
autour des notions de parsing, printing, typesetting et du stockage de telles expressions linguistiques sont partagées par ces équipes.
Si chacunes des trois équipes cultive des collaborations internationnales, toutes trois bénéficient
aussi grandement de leur présence sur le plateau de Saclay et en région parisienne en général.
Nous terminons en listant quelques uns des principaux collaborateurs de l’axe dans ce proche
environnement.
• Le Microsoft Joint Lab: Une intense collaboration existe entre Typical et plusieurs groupes
au sein du Joint Lab. En particulier, mentionnons la collaboration entre Typical et l’équipe
Specfun et l’équipe Mathematical Components sur la formalisation des mathématiques.
Alors que les assistants de preuves interactifs TLA+ a été conçu par Leslie Lamport et
ses collègues, Parsifal a été impliqué dans l’implémentation et l’utilisation du système de
preuve TLA+.
• Le laboratoire PPS (Preuves, Programmes et Systèmes) de l’université Paris Diderot: des
membres aussi bien de Typical que de Parsifal interagissent fréquemment avec des membres de PPS, notamment au travers de séminaires, de ”groupes de travail”, et d’articles en
commun, voire de systèmes codéveloppés (tels que Coq).
• Le CEA (Saclay Plateau) aligne un large éventail de chercheurs dans tous les domaines de
l’informatique. Typical a eu des collaborations sur des sujets tels que les procédures de
décisions coopérative, l’analyse statique, l’optimisation globale. L’équipe Parisfal a collaboré avec le CEA-LIST à la preuve de robustesse de logiciel de calcul sur les réels.
• Le LRI (Laboratoire de Recherche en Informatique) contient plusieurs chercheurs et équipes
qui travaillent sur l’applications de méthodes formelles au calcul et à la déduction. En particulier les équipes ForTesSE (Test Formel et Exploration de Systèmes) et Toccata explorent
des sujets quelque peu liés à ceux de l’axe. Les séries de séminaires activement portées
par ces deux équipes (avec le soutien de Digiteo) attirent des visiteurs importants et sont
largement suivis par les personnels du LIX.
52
CHAPTER I.1. LE LIX
53
NEGATIF
M
en
ac
es
A F
O M
L
p es
LI oly étu
• ho X, tec dia
G rs m hn n
• à oul du ais iqu ts
Le ve ot m su e for
p s ni d o rt ne m
et ose act r su ’étr nde out vo és
• ne de nt ivi r l an a à nt à l
L p s su té es gl ca l’é p ’Eć
P a c ou pr r s p p em dé tr as ol
ex aris réa vo ofil que art rom en mi ang au e
te trê -S tio ns s s lq en ot t a qu er
m m ac n pa ur ue ar io ct e
ou
ps e la d s l s ia ns ue
le
et me y e e l’ re esq per les
c
n
t
U
s
u
s
en t t n ru e o re
én con un ive ter ls n nne er so ch rsi
ou s
gi m al té
s
e m le
at ng
eu e
r
en
s
té
ni
tu
or
pp
O
t .
y en c
la em et s
ac t E, n s
-S par SM tio re isris De O rac ut nv
Pa O, IGIC te s a é e
n
ité TE D i le it
rs GI X es ec im s
ve DI ABE eus av rox agé
ni
U RA , L br es à p vis
• RT TIC om fiqu es en
• S e n nti air et
D ie n es
sc arte abl
p ge
a
•
•
s
At
ou
ts
se
es
bl
•
•
•
fo
fo rt
fo rte e a
• lo rt s ct
• fo gic es a rel ivité
v rt ie c at
d
• br isib e p lles tivi ion e
té s pu
e
vi u ilit opu
p
s
b
• po sib x m é i la
en art lic
en at
ca ly ilit e nte tio
p
t
m
é
ro ar ion
m pa ec e b rn n
oy c hn t re at CN
du ia s
en ité iq at s io R
ct les
n
S
t
io
u
ne et e ra
al e
ns
ct
e t
au effi
I
iv
d
N
e R
ité
LI ca
no IA
X ci
de
té
m
l’é
de
co
tr
le
av
ai
l
i
Fa
s
t
de ls
e
e
et nti
e
gé
du
es te
ar
e
dr po
h
qu
ca res
rc
ifi
su
de d
nt
es
it ca
ie
ce
ip s
u
le nt
fic ou s an
sc
éq tail me
dé s é n ée é
t
r
g
i
e
u
e
r
e
en s e
ill
un dr ha uv tig né
n te nn e ta
• ca urc go fa ogé
io ti io ir e
s ne ois m LIX rat pe nct ato utr
u rf ho if tu ès fo or a
• pa n- ct uc tr u ab ne
no lle str de e a u l ’u
• co ne ois lié e d it d
u rf ie u ta
• pa ert riq il é
in isto qu’
h rs
lo
•
POSITIF
I.2 Analyse AFOM du laboratoire
Sous forme graphique:
INTERNE
EXTERNE
Figure I.2.1: Analyse AFOM du laboratoire: Atouts, Faiblesses, Opportunités, Menaces
Sous forme textuelle:
Atouts:
• Le LIX est un laboratoire extrêmement productif: avec 372 articles dans des revues internationales, et 508 articles dans des conférences internationales sur la période du 1ier janvier
2008 au 30 juin 2013, cela fait 3,68 publications par an et par chercheurs+enseignantschercheurs, ce qui est un taux extrêmement haut.
• Le LIX possède de nombreuses relations partenariales actives, participe à la création d’entreprises
et de start-ups, à des actions de normalisation, à la production de brevets, et via le DIX à
CHAPTER I.2. ANALYSE AFOM DU LABORATOIRE
54
des chaires industrielles.
• Le LIX est aussi très actif et visible pour le développement logiciel, en contribuant à des
prototypes spécialisés et focalisés, mais aussi à des outils grand public, ou à public hors
monde académique.
• Le nombre de chercheurs CNRS et INRIA est clairement une force du laboratoire.
• Beaucoup des membres du laboratoire sont des chercheurs très visibles dans la compétition
internationale de la recherche.
• La proximité de l’École polytechnique et les interactions avec la formation à la recherche
pour les étudiants de École polytechnique via le DIX est clairement une force visible, qui
est attractive à la fois pour nous attirer des contacts, des relations, et des étudiants.
• Enfin, même si cela est difficile à quantifier, force est de constater que la quantité de travail
des chercheurs et enseignants-chercheurs du LIX est très élevée.
Faiblesses:
• La pyramide des âges du LIX en 2013 fait que le LIX souffre d’un déficit clair de cadres ou
de cadres potentiels (en particulier sur la tranche 40-50 ans) pour un fonctionnement à la
hauteur de ce que doit être le laboratoire.
• Cet état de fait exerce au quotidien de la pression et de la fatigue pour un travail optimal
sur la gouvernance et les cadres présents au LIX.
• Contrairement à certains autres laboratoires, le LIX est constitué de plusieurs thématiques,
et n’est pas homogène thématiquement. Cela s’explique au moins en partie par la nécessité
pour faire fonctionner le DIX de couvrir thématiquement l’informatique pour les étudiants
de l’École polytechnique, avec des enseignants selectionnés parmi les meilleurs spécialistes
des domaines.
• Le LIX a bénéficié d’une très forte croissante sur les 10 dernières années. Il a été mis en
place avec un modèle basé sur la notion d’équipes de très petites tailles, souvent centrées
autour d’un scientifique très visible. Ce modèle souffre de défauts comme celui d’être très
sensible aux mouvements de personnel et d’induire une certaine inertie.
Opportunités:
• L’Université Paris-Saclay, en création, est clairement une force pour une visibilité encore
plus grande de notre travail, au sein d’une université de premier rang mondial.
• L’Université Paris-Saclay est d’ores et déjà munie de très nombreux outils pour développer
la recherche et les collaborations entre universités et à l’international: par exemple le RTRA
DIGITEO, le Département STIC en construction, le LABEX DIGICOSME, l’IRT Systemix,
etc. . . . Chacun de ces dispositifs permet clairement potentiellement de démultiplier nos
forces, et nous les utilisons. Ils offrent par ailleurs une très grande variété de sources de
financements.
• La création de cette université s’accompagne de nombreuses interactions entre partenaires
sur le plateau. Cela permet de renforcer ou de développer de multiples collaborations
scientifiques.
55
Menaces:
• Les membres du LIX sont fortement impliqués dans la formation par la recherche en particulier à l’École polytechnique. Cependant, la plupart des étudiants que nous formons ne
viennent pas dans les laboratoires d’informatique français d’une part, mais vont surtout au
final à l’étranger ou dans des carrières hors du monde académique. La France et le LIX ne
bénéficient donc pas autant qu’ils le devraient de ce travail.
• La pyramide des ages au laboratoire, avec un très grand nombre de chercheurs et enseignantschercheurs jeunes entraı̂ne déjà et va continuer à entraı̂ner un goulot d’étranglement pour
les promotions des membres du LIX.
• Le LIX est un laboratoire qui bénéficie et contribue beaucoup à des relations industrielles et
partenariales hors monde académique. La capacité à entretenir et développer des relations
avec le monde non académique repose en pratique sur quelques personnes et sur des profils
très particuliers. Les critères de recrutement de chercheurs et enseignants-chercheurs font
qu’il est extrêmement difficile de recruter de tels profils.
• Enfin, si la création de l’Université Paris-Saclay est source d’opportunités à terme, elle est à
court terme extrêmement consommatrice en temps et en énergie, et occupe l’énergie d’une
grande part de la direction, des cadres, des chercheurs et des enseignants-chercheurs du
LIX.
56
CHAPTER I.2. ANALYSE AFOM DU LABORATOIRE
Rapport et projet scientifique par équipe
57
II Équipe Algorithmique et Complexité (AlCo)
59
II.1 Liste des membres : Algorithmique et
Complexité
II.1.1
Liste actuelle des membres
II.1.1.1
Membres permanents
Nom
Manuel Bodirsky
Olivier Bournez
Miki Hermann
Sylvie Jabinet
II.1.1.2
Fonction
CR
Professeur
CR
Assistante
Employeur
CNRS
École Polytechnique
CNRS
CNRS
HDR
HDR
HDR
HDR
Arrivée
2008200820022011-
Doctorants
Nom
François Bossièrre
Jonas Lefèvre
Jean Philippe Meline
Amaury Pouly
Mikaël Rabie
Financement
ERC CSP-Complexity
AMN ENS-Lyon
ANR Alcoclan
Monge Ecole Polytechnique
AMN ENS-Lyon
Arrivée
20122010201220112011-
Encadrant
M. Bodirsky
O. Bournez
M. Hermann
O. Bournez
O. Bournez
Postdoctorants
Nom
Marcello Mamino
András Pongrácz
Financement
ERC CSP-Complexity
ERC CSP-Complexity
II.1.2
Anciens membres
II.1.2.1
Membres permanents
Nom
Florent Madelaine
Fonction
Délégation
CNRS
Christoph Dürr
Chercheur
II.1.2.2
Dates
09/201309/2012-
Employeur
Université
ClermontFerrand
CNRS
Responsable
M. Bodirsky
M. Bodirsky
HDR
HDR
Départ
09/201108/2012
Position actuelle
MdC
Université
Clermont-Ferrand
HDR
-2010
DR CNRS Paris 6
Doctorants
Nom
Xavier Kœgler
Financement
AMN ENS-Ulm
Départ
2008-2012
Encadrant
O. Bournez
Florian Richoux
Ecole Polytechnique
-2009
M. Hermann
Kim Thang Nguyen
Mathilde Durand
Ecole Polytechnique
Ecole Polytechnique
-2009
-2008
C. Dürr
C. Dürr
61
Position actuelle
Ingénieur (Computer
Scientist) chez Smart
AdServer
MdC Université de
Nantes
MdC Univ. Evry
Google Zurich
CHAPTER II.1. LISTE DES MEMBRES : ALGORITHMIQUE ET COMPLEXITÉ
62
Postdoctorants
Nom
Jan Foniok
Financement
ERC CSP-Complexity
Dates
01/01/2011-30/8/2011
Responsable
M. Bodirsky
Barnaby Martin
ANR Alcoclan
10/2012-12/2012
M. Hermann
Gustav Nordh
Egide
09/2007-08/2008
M. Hermann
Johan Thapper
ERC CSP-Complexity
01/10/2011-30/9/2012
M. Bodirsky
Johan Thapper
LIX-Qualcomm Fellowship
01/10/2010-30/9/2011
M. Bodirsky
II.1.2.3
Position actuelle
Postdoc
Queen’s
University
MdC à Middlesex
University, UK
MdC à l’Université
de Linköping
Paris-Est Marne-laVallée
Paris-Est Marne-laVallée
Autres membres
Stagiaires Master 2
Nom
Edouard Bonnet
François Bossière
Vincent Rudelli
Trung van Pham
Financement
MPRI
Master Logique Paris 7
MPRI
MPRI
Dates
2010
2012
2008
2010
Responsable
M. Bodirsky
M. Bodirsky
M. Hermann
M. Bodirsky
Position actuelle
Thésard au LAMSADE
Thésard au LIX
Professeur au lycée à Bordeaux
Thésard au Vietnam
Visiteurs de longue durée
Nom
Vı́ctor Dalmau
Hubie Chen
Pavol Hell
Michał Wrona
Financement
Ecole Polytechnique
ERC CSP-Complexity
ANR Alcoclan
DGA
Dates
11/2009-12/2009
03/2011-04/2011
04/2012
2/2011-4/2011 et 10/2010
Invitant
M. Bodirsky
M. Bodirsky
M. Hermann
M. Bodirsky
II.2 Rapport scientifique : Algorithmique
et Complexité
II.2.1
Thématique générale et principaux objectifs
II.2.1.1
Introduction
The main research themes of the group are in the field of complexity theory. We mainly focus on
algorithms and complexity of constraint satisfaction problems. When dealing with computations
over continuous domains, we focus on fundamental questions related to understanding suitable
models of computations, and suitable computation theories. As a supporting research for complexity of constraint satisfaction problems, we pursue also some research in universal algebra.
Other research themes are complexity in general, counting complexity, assignments in bipartite
structures, algorithmic game theory, and computability by distributed models.
II.2.1.2
Thémes de recherche
Complexity of Constraint Satisfaction Problems Constraint Satisfaction Problems (CSPs) are
computational problems that appear in many areas of theoretical computer science. The computational complexity of CSPs depends on the choice of the constraints that are allowed in the input,
often called the constraint language. One of the most fundamental and most fruitful questions
about CSPs is to determine their computational complexity depending on the constraint language. This question has lead to surprising connections with various mathematical disciplines,
e.g. with finite model theory, graph theory, and universal algebra. The link with universal algebra, now also called the universal algebraic approach, has been particularly fruitful, leading to
many central new results in universal algebra, with direct consequences for the complexity of
the CSP.
Many computational problems can only be modeled as constraint satisfaction problems when
the variables take values over an infinite domain. This topic is investigated by the ERC starting
grant of Manuel Bodirsky. The general goal of the project is to develop mathematical tools, in
particular the universal-algebraic approach, to classify the computational complexity of constraint satisfaction problems over infinite domains, and to apply those tools to CSPs that appear
in various areas of theoretical computer science.
Miki Hermann, together with Nadia Creignou, Andrei Krokhin, and Gernot Salzer, investigated the complexity of the satisfiability problem of constraints over finite totally ordered domains. In that context, a clausal constraint is a disjunction of inequalities of the form x ≥ d and
s ≤ d. They classified the complexity of constraints based on clausal patterns. A pattern abstracts
away from variables and contains only information about the domain elements and the type of
inequalities occurring in a constraint. Every finite set of patterns gives rise to a (clausal) constraint satisfaction problem in which all constraints in instances must have an allowed pattern.
They proved that every such problem is either polynomially decidable or NP-complete, and give
a polynomial-time algorithm for recognizing the tractable cases. Some of these tractable cases
are new and have not been previously identified in the literature.
Let Γ be a (not necessarily finite) structure with a finite relational signature. Manuel Bodirsky,
Miki Hermann, and Florian Richoux proved that deciding whether a given existential positive sentence holds in Γ is in LogSpace or complete for the class CSP(Γ )N P under deterministic polynomial-time manyone reductions. Here, CSP(Γ )N P is the class of problems that can be
reduced to the constraint satisfaction problem of Γ under non-deterministic polynomial-time
many-one reductions.
Miki Hermann, with Arnaud Durand and Gustav Nordh, studied the complexity of the propositional minimal inference problem. Although the complexity of this problem has been already
extensively studied before because of its fundamental importance in nonmonotonic logics and
commonsense reasoning, no complete classification of its complexity was found. They classified
the complexity of four different and well-studied formalizations of the problem in the version
63
64
CHAPTER II.2. RAPPORT SCIENTIFIQUE : ALGORITHMIQUE ET COMPLEXITÉ
with unbounded queries, proving that the complexity of theminimal inference problem for each
of them has a trichotomy (between P, coNP-complete, and Π2 P-complete). One of these results
finally settles with a positive answer the trichotomy conjecture of Kirousis and Kolaitis (Theory
Comput. Syst. 37(6):659-715, 2004).
Miki Hermann, with Nadia Creignou, Victor Chepoi, and Gernot Salzer, studied the problem
of satisfiability of Boolean formulas in conjunctive normal form whose literals have the form
v ∈ S and express the membership of values to sets S of a given set family S defined on a finite domain D. They established the following dichotomy result. They showed that checking
the satisfiability of such formulas (called S-formulas) with three or more literals per clause is
NP-complete except the trivial case when the intersection of all sets in S is nonempty. On the
other hand, the satisfiability of S-formulas containing at most two literals per clause is decidable
in polynomial time if S satisfies the Helly property, and is NP-complete otherwise. Deciding
whether a given set family S satisfies the Helly property can be done in polynomial time. They
also investigated several well-known examples of Helly families and discussed the consequences
of their result to such set families and its relationship with the previous work on the satisfiability
of signed formulas in multiple-valued logic.
Counting Complexity Abduction is an important method of non-monotonic reasoning with
many applications in artificial intelligence and related topics. Miki Hermann and Reinhard
Pichler concentrated on propositional abduction, where the background knowledge is given by
a propositional formula. Decision problems of great interest are the existence and the relevance
problems. The complexity of these decision problems has been systematically studied while the
counting complexity of propositional abduction has remained obscure. The goal of their work
was to provide a comprehensive analysis of the counting complexity of propositional abduction
in various settings.
Following the approach of Hemaspaandra and Vollmer, Miki Hermann and Reinhard Pichler
defined counting complexity classes #·C for any complexity class C of decision problems. In particular, the classes #·Πk P corresponding to all levels of the polynomial hierarchy, have thus been
studied. However, for a large variety of counting problems arising from optimization problems, a
precise complexity classification turns out to be impossible with these classes. In order to remedy
this unsatisfactory situation, Miki Hermann and Reinhard Pichler introduced a hierarchy of new
counting complexity classes #·Optk P and #·Optk P[log n]. They proved several important properties of these new classes, like closure properties and the relationship with the #·Πk P-classes.
Moreover, they established the completeness of several natural counting complexity problems
for these new classes.
Analog Computations Considering computations over continuous domains may yield very different computability and complexity theories. Computations where time may be continuous is
less understood as the classical theory of discrete time and space computation. Several models
have been proposed for discrete time computations over the reals, such as the Blum Shub Smale
model, or recursive analysis. There is no hope of a unification similar to what happened in classical complexity and computability theory with the Church Turing thesis, as these models are
known to compute not the same sets of functions. Several models have also been proposed for
models of analog continuous time models. This includes the General Purpose Analog Computer
(GPAC) model of Claude Shannon, as well as algebraically defined classes of functions. For continuous time models, a unification is maybe possible. A series of results relating these models
to classical discrete time models of computation have been obtained, in particular by Olivier
Bournez and some of his coauthors and students.
Whereas known results are currently mostly at the level of computability theory, we believe
that it might be possible to also relate the various models at the level of complexity theory. For
that purpose, we consider analog models of computation with various kinds of restrictions that
we relate to classical complexity theory. One goal is to obtain an analog characterization of
polynomial time. Another purpose is to provide a characterization of the hardness of natural
II.2.1. THÉMATIQUE GÉNÉRALE ET PRINCIPAUX OBJECTIFS
65
problems associated to these systems such as their verification.
Whereas some models are analog because they come from models of analog systems, like the
GPAC model which is built as a model of mechanical or electronic differential analysers, analog
models of computation over the continuum also appear naturally in various natural contexts:
models from competition in game theory often yield analog models; distributed systems may
yield analog models: indeed, when size become large, a thermodynamic view is often the appropriate way to model a distributed system. Hence, our study of understanding computations over
continuous domains also has implications for such models, relating them to classical models in
computability and complexity theory.
II.2.1.3
Exemples de résultats significatifs
Exemple 1 : An important theoretical result of the ERC-project of Manuel Bodirsky is that for
the large class of ω-categorical constraint languages the complexity of the corresponding CSP
only depends on the topological polymorphism clone (the higher-ary analog of the automorphism
group of the constraint language). This fundamental result it a great tool for classifying the
computational complexity of CSPs, and we plan to apply it to several large classes of CSPs from
various application areas (see Section II.3.1.1).
Exemple 2 : Polynomial Ordinary Differential Equations can be solved in polynomial time:
Computing the solution of an ordinary differential equation ẏ = p(y) with initial condition y(t0 ) =
y0 ∈ Rd at time t0 + T with precision e−µ where p is avector
of polynomials can be done in time
polynomial in the value of T , µ and Y = supt0 6u6T y(u)∞ . Contrary to existing results, our
algorithm works for any vector of polynomials p over any bounded or unbounded domain and
has a guaranteed complexity and precision.
II.2.1.4
Manuel Bodirsky is supported by an ERC Research Starting Grants, and was a program committee member of the following conferences:
• Fundamentals of Computation Theory (FCT 2009)
• Computer Science Logic (CSL 2010)
• International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
• Symposium on Logic in Computer Science (LICS 2012)
• Special Track on SAT and CSP Technologies at the 25th IEEE International Conference on
Tools with Artificial Intelligence (ICTAI 2013)
Olivier Bournez is a member of the editorial board of journal Computability, a member of the
board of Computability in Europe association, member of the steering committee of the conference
series Reachability Problems, and was a program committee member of the following conferences:
• Unconventional Computations & Natural Computation (UCNC 2013)
• Numerical Computations: Theory and Algorithms (NUMTA 2013)
• Unconventional Computations (UC 2009-2011)
• HyperNet 2011
• Physics and Computations (PC 2009-2011)
• Development of Computational Models (DCM 2010)
• Computability in Europe (CiE 2009, 2014)
CHAPTER II.2. RAPPORT SCIENTIFIQUE : ALGORITHMIQUE ET COMPLEXITÉ
66
Miki Hermann is an editor of the Central European Journal of Computer Science and was a program
committee member of the following conferences :
• 8th Annual Conference on Theory and Applications of Models of Computation (TAMC
2011), Tokyo (Japan), 23-25 May 2011.
• 17th conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR
2010), Yogyakarta (Indonesia), 10-15 October 2010.
• 24th conference on Artificial Intelligence (AAAI 2010), Atlanta (Georgia, USA), 11-15 July
2010.
• 22nd Conference on Automated Deduction (CADE 2009), Montreal (Canada), 2-7 August
2009.
II.2.1.5
Fonctionnement interne
The AlCo research group created and is involved in the Séminaire algorithmique du plateau de
Saclay, a joint algorithms and complexity seminar of the laboratories LIX, LRI, and PRISM. This
seminar was established in 2011. The first year the seminar took place at the LRI. During the
academic year 2012-2013 the seminar was organized in the Alan Turing building at Ecole Polytechnique. Our seminar is currently organized at Supelec.
Miki Hermann is the head of the French part of the international ANR project ALCOCLAN
(2012-2016) with TU Wien, Austria.
Manuel Bodirsky is the leader of an ERC Starting Grant, called CSP-Complexity (2011-2016).
This very competitive grant is of a very high importance for our research group.
Olivier Bournez is supported by several ANR and DGA projects related to models of computation or distributed computations.
II.2.1.6
Formation par la recherche
Olivier Bournez is a Professor of Computer Science at Ecole polytechnique and teaches theoretical computer science to 2nd year students. All members are involved in teaching in M2 courses at
MPRI (Master Parisien de Recherche en Informatique) or LMFI (Logique Mathématique et Fondements
de l’Informatique).
We are regularly involved in the supervision of PhDs and students. This includes:
• Nathan Grosshans, “Complexité des contraintes semi-algébriques convexes”, stage M1,
Ecole Polytechnique (2013)
• François Bossière, “Set CSPs: un autre cas limite”, stage M2, Paris 7 (2012).
• Hang Zhou, “Approximation for Maximum Surjective Constraint Satisfaction Problems”,
stage M1 MPRI, ENS Ulm (2011).
• Edouard Bonnet, “Les Opérations Binaires Idempotentes Commutatives sont-elles Tractables?”, stage M2 MPRI, supervision avec Michael Pinsker, ENS Cachan (2011).
• Levs Gondelmans, “Tractable Set Constraints’, stage L3, ENS Ulm (2011).
• Trung van Pham, “Phylogenetic Constraint Satisfaction Problems”, stage M2 MPRI, Paris 7
(2010).
• Vincent Rudelli, “How to Assign Papers to Referees”, stage M1, Ecole Polytechnique (2008).
II.3 Projet de recherche : Algorithmique
et Complexité
II.3.1
Objectifs scientifiques
II.3.1.1
Complexity of Constraint Satisfaction problems
In the research topic on CSP Complexity, we focus on several classes of CSPs. In each case, we
model the computational problems by appropriately choosing constraint languages, and we are
then heading for general complexity classifications.
1. Phylogeny Constraints. Leaf-based tree description constraints have applications for rooted
and unrooted phylogenetic reconstruction problems.
2. Tree Constraints. Vertex-based tree description constraints have applications in computational linguistics and reasoning about branching time in Artificial Intelligence.
3. Graph Constraints. Here, the variables denote the vertices in a graph, and the constraints
are Boolean combinations of literals that talk about edges and non-edges. Such problems
can be modeled as CSPs where the constraint language is first-order definable over the
countably infinite Random graph. These are important examples of ω-categorical constraint languages.
4. Set Constraints. Set constraints have applications in description logics, type inference for
programming languages, and spatial reasoning. We model those problems by choosing
constraint languages that are first-order definable over the atomless Boolean algebra.
5. Distance Constraints. Distance constraints form an elegant class of natural combinatorial puzzles; this sub-project is also motivated by the fact that these CSPs can (unlike the
previous four classes of CSPs) not be formulated with ω-categorical templates, but still the
universal-algebraic approach can be applied.
6. Algebraic constraints. These constraints have numerous applications in symbolic computing and operations research. Famous examples of algebraic constraints are linear inequalities over the reals, constraints from semidefinite programming, or linear equalities over
the integers.
7. Functional Constraints. Here, the constraint language is built upon a set of relations
{(x1 , . . . , xn , y) | f (x1 , . . . , xn ) = y}, where f : D n → D is a finite function upon a finite domain D. According to previous results from Kuznetsov, Danilchenko, and Burris with
Willard, we know that these constraints have a Galois correspondence with centralizer
clones, whose lattice – contrary to the classic case — is finite for any domain cardinality. According to the another result of Feder and Vardi, this formalism is equivalent to the
standard CSP. The drawback is that the proof of Burris and Willard is non-constructive and
that of Danilcenko for the three-element case, although constructive, is quite involved.
For the aformentioned problems we face several challenges. There exist powerful non-trivial
polynomial-time solvable CSPs, but to obtain a complete complexity classifications, we have to
identify the maximal tractable constraint languages. This either requires that we better understand the existing algorithmic techniques, or come up with entirely new algorithms. In the case
of functional CSPs, it requires a generalization of Danilchenko’s approach, with a considerable
effort to investigate centralizer clones in general, followed by a tedious analysis of polynomialtime and NP-complete cases.
The research on functional CSPs as well as CSPs upon finite domains is mainly investigated by
Miki Hermann. The research on CSPs upon infinite domains is investigated by Manuel Bodirsky.
67
68
II.3.1.2
CHAPTER II.3. PROJET DE RECHERCHE : ALGORITHMIQUE ET COMPLEXITÉ
Counting Complexity
Miki Hermann, together with co-authors, published several research papers on counting complexity. Counting complexity became a very important research topic in the recent years, even
if the concept has been know since the late 1970. This is well documented by the organization
of two Dagstuhl seminars, to which Miki Hermann contributed. The various results on counting
complexity are now spread around many articles. Some parts constitute a chapter in existing
books on computational complexity, but it never evolved in a textbook on its own.
Miki Hermann has an advanced text of approximately 130 pages, which constitutes a good
bases for a textbook on counting complexity. He has a project to finish the writing of this textbook
in one or two years. Moreover, he will pursue his activity on counting complexity issues, as they
appear to constitute several open problems, which should be solved upon the final edition of the
aforementioned textbook, for which already Birkhauser International manifested its interest to
publish it.
II.3.1.3
Computations over the continuum
Concerning models of computation over the continuum our research goal is to build a whole
theory of computability and complexity for such models. We already obtained some promising
first steps towards machine independent characterizations of the notion of computable functions
over the reals (in the sense of recursive analysis), both at the computability and complexity level.
We believe that it is indeed possible to develop the entire theory of computability over the reals
of recursive analysis in a totally Turing machine independent way, using only concepts from
analysis, without reference to discrete functions or machines. This allows in particular to express
natural questions from complexity theory (such as P=NP) as questions from analysis, and to
characterize the hardness of control or verification problems for dynamical systems over the
continuum.
We intend also to pursue the study of distributed models of computations and to understand
when and how such models can be described and related to a macroscopic description in terms
of dynamical systems over the continuum. In particular, we intend to consider natural models
coming from social networks or from competitions of agents involved in games in the sense of
game theory.
II.3.2
Mise en oeuvre
Miki Hermann’s research is funded by the international ANR ALCOCLAN in cooperation with
TU Wien. This project involves a PhD student, Jean Philippe Méline, since November 2012.
Manuel Bodirsky’s research is funded by by an ERC Starting Grant, called CSP-Complexity.
He has two post-doctoral researchers: András Pongrácz from Hungary (homogeneous structures
and Ramsey theory), and Marcello Mamino from Italy (algebraic CSPs), both financed by the
aforementioned ERC grant. Moreover, Manuel Bodirsky has the PhD student, François Bossièrre.
Olivier Bournez’s research is funded by the ANR DISPLEXITY and by DGA CALCULS project.
His project involves currently three PhD students: Jonas Lefèvre, Amaury Pouly, and Mikaë Rabie.
All members of the team are involved in strong international collaborations supporting the
proposed research directions.
Since October 2013 the research group will be enlarged by one permanent researcher — Benjamin Doerr, recruited as a professor at Ecole Polytechnique, as well as by a postdoc financed
by a Qualcomm grant, which has been attributed to Stefan Mengel. He plans to work with both
Miki Hermann and Manuel Bodirsky.
S
re ma
se ll
ar nu
ch m
er be
s ro
fp
er
m
•
an
en
t
A F
O M
NEGATIF
en
ac
es
ns
s
69
io
at
ic
bl
pu
es
ss
té
ni
tu
or
pp
O
ra
bo
la
ol
bo he
lc
lla n t
na
co s i
io
le m
at
ib a
rn
ss r te ea
te
po e r
in
d oth is a
ng
an th ar
ro
i P
St n ing w d
• tio ist ns an
Ex tio lay
ra ac
S
•
M
on
m
m
co
le
At
ou
ts
y
S
C tro
St om ng
• Co ro pu co
S n ng ta m
vi har str co tion mo
si e ai m a n
to d nt m l b
rs re S o Co ac
se at n m kg
ar isf ba pl ro
ch ac ck ex u
co tio gro ity nd
in
nt n un
ac Pr d
ts ob on
l
an em
d s
an
m
•
t
No
•
•
ib
Fa
POSITIF
II.4 Analyse AFOM : Algorithmique et Complexité
INTERNE
EXTERNE
Figure II.4.1: Analyse AFOM de l’équipe Algorithmique et Complexité : Atouts, Faiblesses, Opportunités, Menaces
70
CHAPTER II.4. ANALYSE AFOM : ALGORITHMIQUE ET COMPLEXITÉ
II.5 Fiche résumé : Algorithmique et Complexité
II.5.1
Membres
2008 : l’équipe de recherche a été créée en 2010 (par scission d’une équipe existante) donc indiquer la situation en 2008 est difficile ou non totalement pertinent1 .
2013 : 2 chercheurs (2 CNRS), 1 enseignant-chercheur, 1 postdoc, 6 doctorants
Départ de membres de l’équipe Christophe Dürr (DR à LIP6)
II.5.2
Résultats scientifiques
Résultat 1: Trichotomies in the complexity of minimal inference
Résultat 2 : Complexity of omega-categorical CSPs is captured by the topological polymorphism clone of the constraint language
Résultat 3 : A complete complexity classification for Graph-SAT problems: all the problems in
this large class are either in P or NP-complete.
Résultat 4: Ordinary differential equation with polynomial right hand side can be solved in
polynomial time
II.5.3
Production scientifique
II.5.3.1
Publications
Journaux : 37
Conférences internationales : 50
6 productions scientifiques marquantes:
• A. Durand. M. Hermann et G. Nordh. Trichotomies in the complexity of minimal inference.
Theory of Computing Systems, 50(3) : 446–491, 2012.
• M. Hermann et R. Pichler. Counting complexity of propositional abduction. Journal of
Computer and System Sciences, 76(7) : 634-649, 2010.
• A. Gil, M. Hermann, G. Salzer et B. Zanuttini. Efficient algorithms for constraint description problems over finite totally ordered domains. SIAM Journal on Computing, 38(3) : 922–
945, 2008.
• M. Bodirsky and H. Chen. Quantified equality constraints. SIAM Journal on Computing,
39(8) : 3682–3699, 2010.
• M. Bodirsky and J. Kára. The complexity of temporal constraint satisfaction problems.
Journal of the ACM, 57(2) : 1–41, 2009.
• Olivier Bournez, Daniel Graça and Emmanuel Hainry. Computation with perturbed dynamical systems. Journal of Computer System Science, 79(5):714-724. 2013.
1 Manuel Bodirsky et Olivier Bournez sont arrivés au LIX en février et septembre 2008 respectivement.
71
72
II.5.3.2
CHAPTER II.5. FICHE RÉSUMÉ : ALGORITHMIQUE ET COMPLEXITÉ
Rayonnement
Olivier Bournez is a member of the editorial board of journal Computability, is a member of the
board of the association Computability in Europe, is a member of the steering committee of the
conference on Reachability Problems since 2006. Olivier Bournez was a member of the program
committee of the conferences NUMTA 2013, Unconventional Computations & Natural Computation 2013 (UCNC), Unconventional Computations (UC) from 2009 till 2011, Hypernet 2011,
Physics and Computations from 2009 to 2011, Development of Computational Models 2010, and
Computability in Europe (CiE) in 2009 and 2014.
Miki Hermann is since 2010 an editor of the Central European Journal of Computer Science.
He was a member of the program committee of the following conferences: Theory and Applications of Models of Computation (TAMC) 2011, Logic for Programming, Artificial Intelligence
and Reasoning (LPAR) 2010, Artificial Intelligence (AAAI) 2010, and Conference on Automated
Deduction (CADE) 2009.
Manuel Bodirsky is supported by an ERC Starting Grant. He was a member of the program
committee of the following conferences: Fundamentals of Computation Theory (FCT) 2009,
Computer Science Logic (CSL) 2010, International Symposium on Theoretical Aspects of Computer Science (STACS) 2012, and Symposium on Logic in Computer Science (LICS) 2012.
Olivier Bournez was the chair of the organization committee of the conference on Reachability
Problems in 2009 and a co-chair of the organization committee of the conference on Physics and
Computation in 2009.
Olivier Bournez co-edited the special issue on Physics and Computation in the journal Natural Computing published by Springer, as well as, the special issue on Reachability Problems in
the International Journal of Unconventional Computation.
II.5.3.3
Manuel Bodirsky and Miki Hermann teach the course 2-31-1 on Algorithms and Complexity
of Constraint Satisfaction Problems in the Master de Recherche en Informatique de Paris (MPRI).
Olivier Bournez teaches and is leading the course 2-33-1 Theory of Computation in MPRI.
Olivier Bournez is professor of computer science in Ecole polytechnique: he taught in the
course INF421 entitled Fondements de l’algorithmique et de la programmation from 2008 to 2010
at Ecole Polytechnique. He taught in the course INF423 entitled Logiques, Modèles, Calculs from
2011 to 2013 at Ecole Polytechnique. He also taught in the course INF561 entitled Complexité in
2009 and 2010 at Ecole Polytechnique. He also took part in 2011 in the formation of professors
for the introduction of computer science in classe de terminale dans les lycées.
II.6 Production scientifique : Algorithmique et Complexité
Les publications [5], [6], et [20] sont des publications avec des auteurs dans des des équipes
différentes.
II.6.1
[1] F. Baader, S. Ghilardi, Miki Hermann, U. Sattler, and V. Sofronie-Stokkermans. Complexity, expressibility, and decidability in automated reasoning (CEDAR’08). In Proceedings 4th International Joint Conference on Automated Reasoning (IJCAR 2008), Sydney (Australia), August 2008.
[2] Manuel Bodirsky. Constraint satisfaction problems with infinite templates. In Heribert
Vollmer, editor, Complexity of Constraints (a collection of survey articles), volume 5250 of
Lecture Notes in Computer Science, pages 196–228. Springer, 2008.
[3] Manuel Bodirsky and Michael Pinsker. Reducts of Ramsey structures. AMS Contemporary Mathematics, vol. 558 (Model Theoretic Methods in Finite Combinatorics), pages 489–
519, 2011.
[4] Olivier Bournez and Manuel L. Campagnolo. New Computational Paradigms. Changing
Conceptions of What is Computable, chapter A Survey on Continuous Time Computations,
pages 383–423. Springer-Verlag, New York, 2008.
[5] Olivier Bournez and Gilles Dowek. Physics and computation special issue. Natural
Computing, 11(1):1, 2012.
[6] Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, and Sophie Tison. L’I.A. frontières et Applications, volume 3 of Panorama
de l’Intelligence Artificielle, chapter Informatique théorique : calculabilité, décidabilité et
logique. Cépaduès Editions, http://www.cepadues.com/, 2012.
[7] Olivier Bournez and Igor Potapov, editors. Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings, volume 5797 of Lecture Notes in Computer Science. Springer, 2009.
[8] Olivier Bournez and Igor Potapov. In Reachability Problems (RP 2009) Special Issue, volume 22 of International Journal of Foundations of Computer Science, 2011.
II.6.2
[9] Olivier Bournez. Algorithmes et Complexité. Polycopié du cours INF561 de l’Ecole Polytechnique. Ecole Polytechnique, 2010. 199 pages.
[10] Olivier Bournez. Fondements de l’Informatique: Logique, Modèles, Calculs. Polycopié du
cours INF423 de l’Ecole Polytechnique. Ecole Polytechnique, 2013. 234 pages.
II.6.3
[11] Konstantin Artiouchine, Philippe Baptiste, and Christoph Dürr. Runway scheduling
with holding loop. European Journal of Operational Research, 189(3):1254–1266, 2008.
[12] Guillaume Aupy andqOlivier Bournez. On the number of binary-minded individuals
required to compute 12 . Theoretical Computer Science, 411(22):2262–2267, 2011.
73
74
BIBLIOGRAPHY
[13] Dominique Barth, Olivier Bournez, Octave Boussaton, and Johanne Cohen. Distributed
learning of equilibria in a routing game. Parallel Processing Letters, 19:189–204, June
2009.
[14] Manuel Bodirsky and Hubie Chen. Relatively quantified constraint satisfaction. Constraints, 14(1):3–15, 2009.
[15] Manuel Bodirsky and Hubie Chen. Peek arc consistency. Theor. Comput. Sci., 411(2):445–
453, 2010.
[16] Manuel Bodirsky and Hubie Chen. Quantified equality constraints. SIAM Journal on
Computing, 39(8):3682–3699, 2010.
[17] Manuel Bodirsky, Hubie Chen, Jan Kára, and Timo von Oertzen. Maximal infinitevalued constraint languages. Theoretical Computer Science, 410:1684–1693, 2009.
[18] Manuel Bodirsky, Hubie Chen, and Michael Pinsker. The reducts of equality up to primitive positive interdefinability. Journal of Symbolic Logic, 75(4):1249–1292, 2010.
[19] Manuel Bodirsky and Vı́ctor Dalmau. Datalog and constraint satisfaction with infinite
templates. Journal on Computer and System Sciences, 79:79–100, 2013.
[20] Manuel Bodirsky, Éric Fusy, Mihyun Kang, and Stefan Vigerske. Boltzmann samplers,
Pólya theory, and cycle pointing. SIAM J. Comput., 40(3):721–769, 2011.
[21] Manuel Bodirsky, Clemens Gröpl, and Mihyun Kang. Generating unlabeled connected
cubic planar graphs uniformly at random. Random Struct. Algorithms, 32(2):157–180,
2008.
[22] Manuel Bodirsky, Miki Hermann, and Florian Richoux. Complexity of existential positive first-order logic. Journal of Logic and Computation, 23(4):753–760, 2012.
[23] Manuel Bodirsky and Martin Hils. Tractable set constraints. Journal of Artificial Intelligence Research, 45:731–759, 2012.
[24] Manuel Bodirsky, Martin Hils, and Barnaby Martin. On the scope of the universalalgebraic approach to constraint satisfaction. Logical Methods in Computer Science (LMCS),
8(3:13), 2012.
[25] Manuel Bodirsky, Peter Jonsson, and Timo von Oertzen. Horn versus full first-order: a
complexity dichotomy for algebraic constraint satisfaction problems. Journal of Logic and
Computation, 22(3):643–660, 2011.
[26] Manuel Bodirsky, Peter Jonsson, and Timo von Oertzen. Essential convexity and complexity of semi-algebraic constraints. Logical Methods in Computer Science, 8(4), 2012.
[27] Manuel Bodirsky and Markus Junker. ℵ0 -categorical structures: interpretations and
endomorphisms. Algebra Universalis, 64(3-4):403–417, 2011.
[28] Manuel Bodirsky and Jan Kára. The complexity of equality constraint languages. Theory
of Computing Systems, 3(2):136–158, 2008.
[29] Manuel Bodirsky and Jan Kára. The complexity of temporal constraint satisfaction problems. Journal of the ACM, 57(2):1–41, 2009.
[30] Manuel Bodirsky and Jan Kára. A fast algorithm and Datalog inexpressibility for temporal reasoning. ACM Transactions on Computational Logic, 11(3), 2010.
[31] Manuel Bodirsky and Daniel Král’. Limit behavior of locally consistent constraint satisfaction problems. SIAM J. Discrete Math., 25(2):916–933, 2011.
BIBLIOGRAPHY
75
[32] Manuel Bodirsky and Jens K. Mueller. Rooted phylogeny problems. LMCS, 7(4), 2011.
[33] Manuel Bodirsky, Gustav Nordh, and Timo von Oertzen. Integer programming
with 2-variable equations and 1-variable inequalities. Information Processing Letters,
109(11):572–575, 2009.
[34] Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, and Mikaël Rabie. Population protocols that correspond to symmetric games. International Journal of
Unconventional Computation, 9(1–2):5–36, 2013.
[35] Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin, and Xavier Koegler.
On the convergence of population protocols when population goes to infinity. Applied
Mathematics and Computation, 215(4):1340–1350, 2009.
[36] Olivier Bournez, Walid Gomaa, and Emmanuel Hainry. Algebraic characterizations of
complexity-theoretic classes of real functions. IJUC, 7(5):331–351, 2011.
[37] Olivier Bournez, Daniel S. Graça, and Emmanuel Hainry. Computation with perturbed
dynamical systems. Journal of Computer System Science, 79(5):714–724, 2013.
[38] V. Chepoi, N. Creignou, Miki Hermann, and G. Salzer. The Helly property and satisfiability of Boolean formulas defined on set families. European Journal of Combinatorics,
31(2):502–516, 2010.
[39] N. Creignou, Miki Hermann, A. Krokhin, and G. Salzer. Complexity of clausal constraints over chains. Theory of Computings Systems, 42(2):239–255, 2008.
[40] A. Durand and Miki Hermann. On the counting complexity of propositional circumscription. Information Processing Letters, 106(4):164–170, 2008.
[41] A. Durand, Miki Hermann, and G. Nordh. Trichotomies in the complexity of minimal
inference. Theory of Computings Systems, 50(3):446–491, 2012.
[42] Christoph Dürr and Mathilde Hurand. Finding total unimodularity in optimization
problems solved by linear programs. Algorithmica, 2009.
[43] A. Gil, Miki Hermann, G. Salzer, and B. Zanuttini. Efficient algorithms for constraint
description problems over finite totally ordered domains. SIAM Journal on Computing,
38(3):922–945, 2008.
[44] Miki Hermann.
On Boolean primitive positive clones.
308(15):3151–3162, 2007.
Discrete Mathematics,
[45] Miki Hermann and R. Pichler. Complexity of counting the optimal solutions. Theoretical
Computer Science, 410(38-40):3814–3825, 2009.
[46] Miki Hermann and R. Pichler. Counting complexity of propositional abduction. Journal
of Computer and System Sciences, 76(7):634–649, 2010.
[47] Florent R. Madelaine and Barnaby Martin. The complexity of positive first-order logic
without equality. ACM Transactions on Computational Logic, 13(1):5, 2012.
BIBLIOGRAPHY
76
II.6.4
[48] Dominique Barth, Olivier Bournez, Octave Boussaton, and Johanne Cohen. Distributed
learning of wardrop equilibria. In Unconventional Computation 2008, UC 2008, volume
5204 of Lecture Notes in Computer Science, pages 19–32, Vienna, Austria, August 25-28
2008. Springer.
[49] Dominique Barth, Olivier Bournez, Octave Boussaton, and Johanne Cohen. A dynamic approach for load balancing. In ACM Digital Library, editor, GameComm’09, 3rd
ICST/ACM International Workshop on Game Theory in Communication Networks, pages
60:1–60:7, Pisa, Italy, October 2009. ICST (Institute for Computer Sciences, SocialInformatics and Telecommunications Engineering).
[50] Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jež,
Łukasz Jež, and Grzegorz Stachowiak. Collecting weighted items from a dynamic queue.
In Proc. of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2009.
[51] Manuel Bodirsky and Hubert Chen. Qualitative temporal and spatial reasoning revisited. In Proceedings of CSL, pages 194–207, 2007.
[52] Manuel Bodirsky, Vı́ctor Dalmau, Barnaby Martin, and Michael Pinsker. Distance constraint satisfaction problems. In Petr Hlinený and Antonı́n Kučera, editors, Proceedings of
Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, pages
162–173. Springer Verlag, August 2010.
[53] Manuel Bodirsky and Martin Grohe. Non-dichotomies in constraint satisfaction complexity. In Ivan Damgard Luca Aceto, Leslie Ann Goldberg, Magnús M. Halldórsson,
Anna Ingólfsdóttir, and Igor Walukiewicz, editors, Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer
Science, pages 184 –196. Springer Verlag, July 2008.
[54] Manuel Bodirsky, Miki Hermann, and Florian Richoux. Complexity of existential positive first-order logic. In K. Ambos-Spies, B. Löwe, and W. Merkle, editors, Proceedings 5th
Conference on Computability in Europe (CiE 2009), Heidelberg (Germany), volume 5635 of
Lecture Notes in Computer Science, pages 31–36. Springer-Verlag, July 2009.
[55] Manuel Bodirsky, Martin Hils, and Alex Krimkevitch. Tractable set constraints. In Toby
Walsh, editor, Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI),
pages 510–515. AAAI, July 2011.
[56] Manuel Bodirsky, Martin Hils, and Barnaby Martin. On the scope of the universalalgebraic approach to constraint satisfaction. In Proceedings of the Annual Symposium on
Logic in Computer Science (LICS), pages 90–99. IEEE Computer Society, July 2010.
[57] Manuel Bodirsky, Peter Jonsson, and Timo von Oertzen. Semilinear program feasibility.
In Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas,
and Wolfgang Thomas, editors, Proceedings of the International Colloquium on Automata,
Languages and Programming (ICALP), Lecture Notes in Computer Science, pages 79–90.
Springer Verlag, July 2009.
[58] Manuel Bodirsky and Jan Kára. The complexity of temporal constraint satisfaction problems. In Cynthia Dwork, editor, Proceedings of the Annual Symposium on Theory of Computing (STOC), pages 29–38. ACM, May 2008.
[59] Manuel Bodirsky and Jens K. Mueller. Rooted phylogeny problems. In Luc Segoufin,
editor, Proceedings of the 13th International Conference on Database Theory (ICDT’10), ACM
International Conference Proceeding Series, pages 165–173. ACM, March 2010.
BIBLIOGRAPHY
77
[60] Manuel Bodirsky, Gustav Nordh, and Timo von Oertzen. Integer programming with
2-variable equations and 1-variable inequalities. In CTW, pages 261–264, 2009.
[61] Manuel Bodirsky and Michael Pinsker. Schaefer’s theorem for graphs. In Proceedings of
the Annual Symposium on Theory of Computing (STOC), pages 655–664, 2011.
[62] Manuel Bodirsky, Michael Pinsker, and Todor Tsankov. Decidability of definability. In
Proceedings of the Annual Symposium on Logic in Computer Science (LICS), pages 321–328,
2011.
[63] Manuel Bodirsky and Stefan Wölfl. RCC8 is tractable on instances of bounded treewidth.
In Toby Walsh, editor, Proceedings of International Joint Conferences on Artificial Intelligence
(IJCAI), pages 756–761. AAAI, July 2011.
[64] Manuel Bodirsky and Michal Wrona. Equivalence constraint satisfaction problems. In
Proceedings of Computer Science Logic, volume 16 of LIPICS, pages 122–136. Dagstuhl
Publishing, September 2012.
[65] Olivier Bournez, Jérémie Chalopin, Johanne Cohen, and Xavier Koegler. Playing with
population protocols. In The Complexity of a Simple Program, Cork, Irland, December
6-7th 2008.
[66] Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, and Mikaël Rabie.
Computing with Pavlovian populations. In Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings,
volume 7109 of Lecture Notes in Computer Science, pages 409–420. Springer, 2011.
[67] Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin, and Xavier Koegler.
On the convergence of a population protocol when population goes to infinity. In Physics
and Computations, Worshop of Unconventional Computation 2008, UC 2008, Vienna, Austria, August 25-28 2008.
[68] Olivier Bournez and Johanne Cohen. Learning equilibria in games by stochastic distributed algorithms. In Erol Gelenbe and Ricardo Lent, editors, Computer and Information
Sciences III, pages 31–38. Springer, 2013.
[69] Olivier Bournez, Nachum Dershowitz, and Evgenia Falkovich. Towards an axiomatization of simple analog algorithms. In Manindra Agrawal, S. Barry Cooper, and Angsheng Li, editors, Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings, volume 7287 of Lecture
Notes in Computer Science, pages 525–536. Spinger-Verlag, 2012.
[70] Olivier Bournez, Pierre Fraigniaud, and Xavier Koegler. Computing with large populations using interactions. In Branislav Rovan, Vladimiro Sassone, and Peter Widmayer,
editors, Mathematical Foundations of Computer Science, MFCS’12, Lecture Notes in Computer Science. Spinger-Verlag, 2012.
[71] Olivier Bournez, Daniel S. Graça, and Emmanuel Hainry. Robust computations with dynamical systems. In Petr Hlinený and Antonı́n Kucera, editors, Mathematical Foundations
of Computer Science, MFCS’2010, volume 6281 of Lecture Notes in Computer Science, pages
198–208. Springer, 2010.
[72] Olivier Bournez, Daniel S. Graça, and Amaury Pouly. On the complexity of solving
initial value problems. In Joris van der Hoeven and Mark van Hoeij, editors, ISSAC,
pages 115–121. ACM, 2012.
78
BIBLIOGRAPHY
[73] Olivier Bournez, Daniel S. Graça, and Amaury Pouly. Turing machines can be efficiently simulated by the general purpose analog computer. In T.-H. Hubert Chan, Lap Chi
Lau, and Luca Trevisan, editors, Theory and Applications of Models of Computation, 10th
International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings
(TAMC’2013), volume 7876, pages 169–180. Springer, 2013.
[74] Olivier Bournez, Daniel Graça, and Amaury Pouly. Solving analytic differential equations in polynomial time over unbounded domains. In Filip Murlak and Piotr Sankowski,
editors, Mathematical Foundations of Computer Science, MFCS’11, volume 6907 of Lecture
Notes in Computer Science, pages 170–181, 2011.
[75] Olivier Bournez, Daniel S. Graça, Amaury Pouly, and Ning Zhong. Computability
and computational complexity of the evolution of nonlinear dynamical systems. In
Paola Bonizzoni, Vasco Brattka, and Benedikt Löwe, editors, Computability in Europe
(CIE’2013), Lecture Notes in Computer Science, pages 12–21. Springer, 2013.
[76] Olivier Bournez, Jonas Lefèvre, and Mikaël Rabie. Trustful population protocols. In
International Symposium on Distributed Computing (DISC’2013), 2013.
[77] Olivier Bournez and Jonas Lefèvre. Population protocols on graphs: A hierarchy. In
Giancarlo Mauri, Alberto Dennunzio, Luca Manzoni, and Antonio E. Porreca, editors,
Spatial Computing Workship (SCW’2013). Springer, 2013.
[78] V. Chepoi, N. Creignou, Miki Hermann, and G. Salzer. Deciding the satisfiability of
propositional formulas in finitely-valued signed logics. In G. W. Dueck, editor, Proceedings 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), Dallas
(Texas, USA), pages 100–105. IEEE Computer Society, May 2008.
[79] Marek Chrobak, Christoph Dürr, Flavio Guı́ nez, Antoni Lozano, and Nguyen Kim
Thang. Tile packing tomography is NP-hard. In Proc. of the 16th Annual International
Computing and Combinatorics Conference (Cocoon), pages 254–263, 2010.
[80] Marek Chrobak, Christoph Dürr, Mathilde Hurand, and Julien Robert. Algorithms for
temperature-aware task scheduling in microprocessor systems. In Proc. of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM), 2008.
[81] A. Durand, Miki Hermann, and G. Nordh. Trichotomy in the complexity of minimal
inference. In Proceedings 24th Annual IEEE Symposium on Logic in Computer Science (LICS
2009), Los Angeles (California, USA), pages 387–396, August 2009.
[82] Christoph Dürr, Flavio Guı́nez, and Martı́n Matamala. Reconstructing 3-colored grids
from horizontal and vertical projections is NP-hard. In Proc. of the 17th Annual European
Symposium on Algorithms (ESA) - best paper award, 2009.
[83] Christoph Dürr, Łukasz Jež, and Nguyen Kim Thang. Online scheduling of bounded
length jobs to maximize throughput. In Proc. of the 7th Workshop on Approximation and
Online Algorithms (WAOA), 2009.
[84] Christoph Dürr and Nguyen Kim Thang. Non-clairvoyant scheduling games. In Proc. of
the 2nd International Symposium on Algorithmic Game Theory (SAGT), 2009.
[85] Pavol Hell, Miki Hermann, and M. M. Nevisi. Counting partitions of graphs. In KunMao Chao, Tsan sheng Hsu, and Der-Tsai Lee, editors, Proceedings 23rd International Symposium on Algorithms and Computation (ISAAC 2012), Taipei (Taiwan), volume 7676 of
Lecture Notes in Computer Science, pages 227–236. Springer-Verlag, December 2012.
II.6.5. CONFÉRENCES NATIONALES
79
[86] Miki Hermann and R. Pichler. Complexity of counting the optimal solutions. In X. Hu
and J. Wang, editors, Proceedings 14th International Conference on Computing and Combinatorics (COCOON 2008), Dalian (China), volume 5092 of Lecture Notes in Computer
Science, pages 149–159. Springer-Verlag, June 2008.
[87] Miki Hermann and R. Pichler. Counting complexity of minimal cardinality and minimal
weight abduction. In S. Hölldobler, C. Lutz, and H. Wansing, editors, Proceedings 11th
European Conference on Logics in Artificial Intelligence (JELIA 2008), Dresden (Germany),
volume 5293 of Lecture Notes in Artificial Intelligence, pages 206–218. Springer-Verlag,
2008.
[88] Miki Hermann and Florian Richoux. On the computational complexity of monotone
constraint satisfaction problems. In S. Das and R. Uehara, editors, Proceedings 3rd Annual
Workshop on Algorithms and Computation (WALCOM 2009), Kolkata (India), volume 5431
of Lecture Notes in Computer Science, pages 286–297. Springer-Verlag, February 2009.
[89] Miki Hermann and Florian Richoux. On the complexity of fuzzy boolean constraint
satisfaction problems with applications to intelligent digital photography. In 3rd IEEE
Pacific-Asia Conference on Circuits, Communications, and Systems (PACCS 2011), Wuhan
(China). IEEE Computer Society, July 2011.
[90] Miki Hermann and B. Sertkaya. On the complexity of computing generators of closed
sets. In R. Medina and S. Obiedkov, editors, Proceedings 6th International Conference on
Formal Concept Analysis (ICFCA 2008), Montreal (Canada), volume 4933 of Lecture Notes
in Computer Science, pages 158–168. Springer-Verlag, February 2008.
[91] Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö, and Michail Prilutskii, editors. Computer Science - Theory and Applications - 7th International Computer Science Symposium in
Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings, volume 7353 of
Lecture Notes in Computer Science. Springer, 2012.
[92] Peter Jonsson, Fredrik Kuivinen, and Johan Thapper. Min CSP on four elements: Moving
beyond submodularity. In Proceedings of the 17th International Conference on Principles and
Practice of Constraint Programming (CP’11), pages 438–453, 2011.
[93] Florent R. Madelaine and Barnaby Martin. Containment, equivalence and coreness from
CSP to QCSP and beyond. In CP, pages 480–495, 2012.
[94] Florent R. Madelaine and Barnaby Martin. QCSP on partially reflexive cycles - the wavy
line of tractability. CoRR, abs/1303.0041, 2013. Accepted at CSR’13.
[95] Florent R. Madelaine, Barnaby Martin, and Juraj Stacho. Constraint satisfaction with
counting quantifiers. In CSR, pages 253–265, 2012.
[96] Walid Gomaa Olivier Bournez and Emmanuel Hainry. Implicit complexity in recursive
analysis. In Logic and Computational Complexity, 2009.
[97] Johan Thapper and Stanislav Živný. The power of linear programming for valued CSPs.
In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science
(FOCS’12), pages 669–678. IEEE Computer Society, 2012.
II.6.5
[98] M. Hermann and F. Richoux. Sur la complexité algorithmique des problèmes de satisfaction de contraintes disjonctifs. In Actes 4ièmes Journées Francophones de Programmation
par Contraintes (JFPC 2008), Nantes (France), pages 209–218, June 2008.
BIBLIOGRAPHY
80
II.6.6
Conférences invitées
[99] Homogeneous structures, ramsey classes, and constraint satisfaction. In RaTLoCC (Ramsey Theory in Logic, Combinatorics and Complexity), Bertinoro, 2011.
[100] Manuel Bodirsky. Constraint satisfaction problems over the real numbers. In Dagstuhl
Seminar 09441: The Constraint Satisfaction Problem: Complexity and Approximability,
Schloß Dagstuhl (Allemagne), October 2009.
[101] Manuel Bodirsky. Constraint satisfaction: Finite model theory meets infinite model theory. In L’éritage d’Alan Turing : logique, calcul et complexité, Lyon, June 2012.
[102] Miki Hermann. The constraint satisfaction problem: Complexity and approximability.
In Séminaire 09441, Schloß Dagstuhl (Allemagne), October 2009.
[103] Miki Hermann. What makes minimal inference tractable. In International Workshop on
Tractability, Cambridge (Grande Bretagne), July 2010. Microsoft Research.
[104] Miki Hermann. SAT interactions. In Séminaire 12471, Schloß Dagstuhl (Allemagne),
November 2012.
[105] Miki Hermann. How hard it is to count easily. In Séminaire 13031 Computational Counting, Schloß Dagstuhl (Allemagne), January 2013.
II.6.7
Thèses
[106] Xavier Koegler. Population protocols, games, and large populations. PhD thesis, Paris 7,
2012.
[107] Florian Richoux. Toward a complexity classification of CSP through kernel width. PhD
thesis, Ecole Polytechnique, 2009.
II.6.8
[108] Manuel Bodirsky. Complexity classification in infinite-domain constraint satisfaction.
Mémoire d’habilitation à diriger des recherches, Université Diderot – Paris 7, 2012.
II.7 Annexes : Algorithmique et Complexité
II.7.1
Responsabilités administratives des membres de l’équipe incluants responsabilité de recherche
et d’enseignement
• Olivier Bournez
– est directeur du LIX (période 2008-).
– est membre élu du collège des directeurs d’unités du sénat académique de l’université
Paris Saclay (période 2013-).
– est membre du comité de pilotage du RTRA DIGITEO (période 2011-).
– est membre du comité de pilotage du LABEX DIGICOSME (période 2011-).
– est membre du bureau du réseau Computability in Europe
http://www.maths.leeds.ac.uk/∼pmt6sbc/cie.html. Il est coordinateur national pour
ce réseau. (période 2008-).
– est vice-président du Département d’informatique de l’Ecole Polytechnique (période
2010-).
– est membre du comité enseignement recherche du département d’Informatique de
l’Ecole Polytechnique. Il est responsable des stages de recherche de 3ième année pour
le département d’informatique (période 2009-).
• Christoph Dürr est responsable de l’équipe Algorithmique et Complexité (période 2009–
2010).
• Miki Hermann est responsable de l’équipe AlCo (période 2010-).
II.7.1.1
Projet ALCOCLAN (2012-2015) (Type: ANR Blanc International) Titre: Algorithmes et Complexité des Langages de Contraintes.
Partenaires: LIX et Université technique de Vienne.
Responsable: Miki Hermann. Montant de la collaboration pour le LIX: 231.238 euros.
PHC Amadeus (2009-2010) (Type: PHC Amadeus) Titre: Problèmes de satisfaction de contraintes.
Partenaires: LIX et Université Technique de Vienne. Responsable: Miki Hermann.
Montant de la collaboration pour le LIX: 5.500 euros.
ERC Starting grant (2011-2016) (Type: Starting grant of the European Research Council (ERC
FP7)) Titre: Constraint Satisfaction problems: Algorithms and Complexity.
Partenaires: LIX.
Responsable: Manuel Bodirsky. Montant de la collaboration pour le LIX: 830.316 euros.
Projet ComputR (2008-2010) (Projet Equipe associée INRIA) Titre: Analog Models of Computation. Partenaires: LIX, LORIA, et IST Lisbonne Portugal. Responsable: Olivier Bournez. Ce
projet a permis le financement de quelques missions entre France et Portugal.
81
82
II.7.1.2
CHAPTER II.7. ANNEXES : ALGORITHMIQUE ET COMPLEXITÉ
Responsabilités de projets nationaux
Projet SOGEA (2005-2009) (Type: Projet ANR) Titre: Security of Games, Equilibria and Distributed Algorithms.
Ce projet ANR visait à réunir plusieurs groupes français travaillant sur
la théorie algorithmique des jeux, dans des contextes différents (Complexité, Réseaux, Algorithmique Distribuée) pour la conception de jeux distribués aux propriétés garanties. http:
//sogea.loria.fr. Partenaires: LIX, PRISM, LRI. Responsable: Olivier Bournez. Montant de
la collaboration pour le LIX: 133470 euros (sur un montant total de 374735 euros).
Projet DGA Calculs (2011-2014) (Type: Financement DGA.)
Ce projet vise à étudier
plusieurs variantes et extensions des protocoles de populations. Partenaires: LIX. Responsable: Olivier Bournez. Montant de la collaboration pour le LIX: de l’ordre de 15000 euros
chaque année sur la durée d’existence du projet.
II.7.1.3
Projet franco-chilien (2010-2011) (Type: Projet ECOS) Titre: réalisation de graphes avec contraintes de degrés.
Partenaires: LIX, LIP, LIFO, DIM U.Chili. Responsable: Christoph Dürr.
Montant de la collaboration pour le LIX: 3 keuros.
II.7.1.4
Participation à des projets nationaux
ENUM (2008-2012) (Type: Projet ANR) Titre: Problèmes d’énumération dans les structures.
Partenaires: Equipe de Logique de Paris 7, LIX. Responsable: Miki Hermann.
ARS (2008–2011) (Type: Projet ANR) Titre: Automatic Reformulation Search.
Christoph Dürr.
Responsable:
Alpage (2005–2008) (Type: Projet ANR) Titre: ALgorithmique des Plates-formes A Grande
Echelle. http:// www.labri.fr/ perso/ obeaumon/ alpage.html .
Partenaires: LIX, LRI,
LaBRI, LIP, ID, IRISA. Responsable: Christoph Dürr. Montant de la collaboration pour le
LIX: 28000 euros.
DISPLEXITY (2011-2015) (Type: Projet ANR) Titre: Distributed Computing : computability
and complexity. Ce projet ANR vise à proposer une théorie de la calculabilité et la complexité
pour les systèmes distribués qui concilie différentes approches dans la communauté distribuée.
http://www.liafa.univ-paris-diderot.fr/˜displexity/Site/displexity.html. Partenaires:
LIX, LIAFA, LABRI, IRISA. Responsable: (local) Olivier Bournez. Montant de la collaboration
pour le LIX: quelques missions. Financement géré par IRISA.
SHAMAN (2009-2012) (Type: Projet ANR) Titre: SHAMAN (Self-organizing and Healing Architectures for Malicious and Adversarial Networks). Projet ANR autour de l’algorithmique distribuée en présence de pannes, d’anonymat et de joueurs malicieux. Les contributions du LIX
ont tournées autour d’études du cas où les joueurs jouent un jeux au sens de la théorie des jeux:
en l’occurence, une étude des protocoles de populations pavloviens. http://www-npa.lip6.fr/
shaman/. Partenaires: LIP6, LIAFA, IRISA, Ecole Polytechnique, Orange Labs. Responsable:
(local) Olivier Bournez. Montant de la collaboration pour le LIX: 64800 euros (sur un total de
989420 euros).
II.7.2. ADMINISTRATION DE LA RECHERCHE
II.7.2
Administration de la recherche
II.7.2.1
Activités éditoriales
83
Membres de comités éditoriaux
• Central European Journal of Computer Science (Versita) Miki Hermann (2010-). Voir
versita.com/cejcs/.
• Computability (Springer) Olivier Bournez (2011-). Voir http://www.computability.de/
journal/.
Edition de numéros spéciaux
• Natural Computing (Springer) Physics and Computation Special Issue Olivier Bournez and
Gilles Dowek
• International Journal of Unconventional Computation (Old City Publishing) Reachability Problems (RP’2009) Special Issue Olivier Bournez and Gilles Dowek
II.7.2.2
Gestion scientifique de conférences
Participation à des comités de pilotage
• RP (Reachability Problems) (2006-). Olivier Bournez.
Présidence de comités de programme
Participation à des comités de programme
• TAMC 2011 (8th conference on Theory and Applications of Models of Computation)
(2011). Miki Hermann.
• LPAR 2010 (17th conference on Logic for Programming, Artificial Intelligence and Reasoning) (2010). Miki Hermann.
• AAAI 2010 (24th conference on Artificial Intelligence) (2010). Miki Hermann.
• CADE 2009 (22nd Conference on Automated Deduction) (2009). Miki Hermann.
• FCT 2009 (Fundamentals of Computation Theory) (2009). Manuel Bodirsky.
• CSL 2010 (Computer Science Logic) (2010). Manuel Bodirsky.
• STACS 2012 (International Symposium on Theoretical Aspects of Computer Science)
(2012). Manuel Bodirsky.
• LICS 2012 (Symposium on Logic in Computer Science) (2012). Manuel Bodirsky.
• NUMTA2013 (Numerical Computations: Theory and Algorithms NUMTA’2013) (2013).
Olivier Bournez.
• UCNC 2013 (Unconventional Computations & Natural Computation 2013) (2013). Olivier
Bournez.
• UC 2009, 2010, 2011 (Unconventional Computations) (2009-2011). Olivier Bournez.
84
• Hypernet 2011 (HyperNet) (2011). Olivier Bournez.
• PC 2009, 2010, 2011 (Physics and Computations) (2009-2011). Olivier Bournez.
• DCM 2010 (Development of Computational Models) (2010). Olivier Bournez.
• CIE 2009,2014 (Computability in Europe 2009, 2014) (2009, 2014). Olivier Bournez.
• RP 2008, 2009, 2010, 2011 (Reachability Problems) (2008-2011). Olivier Bournez.
• ICTAI 2013 (Special Track on SAT and CSP Technologies at the 25th IEEE International
Conference on Tools with Artificial Intelligence) (2013). Manuel Bodirsky.
• WAOA (Workshop on Approximation and Online Algorithms) (2009). Christoph Dürr.
II.7.2.3
Organisation d’événements scientifiques
Présidence de comités d’organisation
• RP (Reachability Problems RP’2009) (2009). Olivier Bournez.
• PC (Physics and Computation PC’2009) (2009). Olivier Bournez et Gilles Dowek.
Participation à des comités d’organisation
• CTW (Cologne-Twente Workshop on Graphs and Combinatorial Optimization) (2009).
Christoph Dürr.
II.7.2.4
Au niveau international
• NTU/Paris Tech (2011-) Olivier Bournez. Membre du Joint PhD program de Nanyang
Technologcal University (Singapore) / ParisTech.
• Commission Européenne (2012) Olivier Bournez. Membre du pannel des experts de
l’appel “FP7-ICT-2011-Unconventional Computation” .
• Romanian research grant agency (2012) Manuel Bodirsky. Panel member for evaluation
process of Romanian research grant applications.
• Greece (2011) Manuel Bodirsky. Panel member for evaluation of postdoc candidates.
• Greece (2011) Manuel Bodirsky. Panel member for evaluation of Greek research projects.
Au niveau national
• LIFO (2011-) Olivier Bournez. Membre du comité scientifique du laboratoire d’Informatique
d’Orléans (LIFO), Université d’Orléans / ENSI de Bourges.
• FNRS (2010-) Olivier Bournez. Membre de la liste des experts du Fond National de la
Recherche Scientifique (Belgique). Participation à 4/5 expertises par an. .
• INRIA (2011) Olivier Bournez. Membre du jury d’admission INRIA.
II.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION
85
Commission de sélection
• Paris 12 (Olivier Bournez) 2011-2013
• Université d’Avignon (Olivier Bournez) 2013
• Paris 7 (Olivier Bournez) 2012
• Paris 7 (Manuel Bodirsky) 2012
• Université d’Orléans (Olivier Bournez) 2012
• Université d’Orléans (Olivier Bournez) 2009
• Université Paris 11, Orsay (Manuel Bodirsky) 2012
• Université de Marne la Vallée (Christoph Dürr) 2009
• Université de Paris-Sud (Christoph Dürr) 2009
• Université d’Evry (Christoph Dürr) 2010
II.7.3
Activités de formation, encadrement et évaluation
II.7.3.1
Liste des thèses et HDR soutenues
Habilitations à dirigers les recherches
• Manuel Bodirsky (January 2012). Complexity Classification in Infinite-Domain Constraint
Satisfaction
Théses de doctorat
• Mathilde Hurand (2008). A contribution to optimization for Scheduling and some other
problems. Encadrant: Christoph Dürr.
• Nguyen Kim Thang (2009). Pure Equilibria: Existence, Inefficiency and Online Auction.
Encadrant: Christoph Dürr.
• Florian Richoux (2009). Toward a Complexity Classification of CSP Through Kernel Width.
Encadrant: Miki Hermann.
• Xavier Koegler (2012). Olivier Bournez et Pierre Fraignaud. Encadrant: Population protocols: games, and large populations.
II.7.3.2
Liste de rapports de thèses et HDR
Rapports d’habilitations à dirigers les recherches
• Emmanuel Jeandel (2011). Propriétés structurelles et calculatoires des pavages. Rapporteur: Olivier Bournez.
• Sylvain Peyronnet (2010). Approximation and Verification. Rapporteur: Olivier Bournez.
• Nicolas Ollinger (2010). Programmation et indécidabilités dans les systèmes complexes.
Rapporteur: Olivier Bournez.
• Florent Madelaine (2012). Rapporteur: Manuel Bodirsky.
• Julia Kempe (2010). Calcul quantique. Rapporteur: Christoph Dürr.
86
Rapports de thèse
• Pierre Coucheney (2011). Université de Grenoble I. Rapporteur: Olivier Bournez.
• Mathieu Tracol (2010). LRI. Rapporteur: Olivier Bournez.
• Udi Boker (2009). Université de Tel Aviv, Israel. Rapporteur: Olivier Bournez.
• Mathieu Hoyrup (2010). ENS Paris. Rapporteur: Olivier Bournez.
• Johann Brault-Baron (2013). De la pertinence de l’énumeration.
Rapporteur: Manuel Bodirsky.
Université de Caen.
• Nina Runge (2008). Problèmes d’ordonnancement avance-retard avec et sans préemption.
Université Pierre et Maire Curie. Rapporteur: Christoph Dürr.
• Marc Kaplan (2009). Méthodes combinatoires et Algébriques en Complexité de la Communication. Université Paris-Sud. Rapporteur: Christoph Dürr.
Jurys de thèse
• Fabio Roda (2013). Président: Olivier Bournez.
• Alberto Costa (2012). Président: Olivier Bournez.
• Romain Testylier (2012). Président: Olivier Bournez.
• Pierre Coucheney (2011). Membre: Olivier Bournez.
• André Chailloux (2011). Membre: Olivier Bournez.
• Mathieu Tracol (2010). Membre: Olivier Bournez.
• Udi Boker (2009). Membre: Olivier Bournez.
• Chahinez Hamlaoui (2009). Membre: Olivier Bournez.
• Kim Thang Nguyen (2009). Membre: Olivier Bournez.
• Mathieu Hoyrup (2008). Membre: Olivier Bournez.
• Florian Richoux (2009). Membre: Manuel Bodrisky.
• Johann Brault-Baron (2013). Membre: Miki Hermann.
• Johann Brault-Baron (2013). Membre: Manuel Bodrisky.
II.7.3.3
Enseignements dispensés
Cours universitaires en M2
• Cours 2-31-1 Algorithmes et Complexité des Problèmes de Satisfaction des Contraintes du
MMPRI (Miki Hermann, Manuel Bodirsky)
• Cours 2-24-1 Ordonnancement du MPRI (Philippe Baptiste, Christoph Dürr, Vincent Jost,
Leo Liberti)
• Cours 2-33-1 Théorie des Calculs du MPRI (Olivier Bournez)
II.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ
87
Cours à l’Ecole Polytechnique
• Cours INF421 “Fondements de l’algorithmique et de la programmation” en 2008, 2009 et
2010 (Olivier Bournez).
• Cours INF423 “Logiques, Modèles, Calculs” 2011- 2013 (Olivier Bournez).
• Cours INF561 “Complexité” en 2009 et 2010 (Olivier Bournez).
Ecoles thématiques et cours spécialisés
• Winter school Lyon (Spring 2013) ER03: Problèmes de satisfaction de contraintes, one weak
research winter school at ENS Lyon (organised by Pascal Koiran), with Michael Pinsker.
• 2009, école d’été à Valparaiso (Chili), “Algorithmic game theory” (Christoph Dürr)
Vulgarisation
• M. Hermann et P. Lescanne. Le plus difficile des problèmes difficiles. Les Dossiers de La
Recherche, 37:54–57, trimestriel novembre 2009.
II.7.4
Autres éléments de visibilité
II.7.4.1
Invitations
Participation à des rencontres scientifiques sur invitation seulement
• Fields Institute Toronto (2011). Manuel Bodirsky.
• Dagstuhl (2008). Manuel Bodirsky.
• AIM (2008). Manuel Bodirsky.
• Leeds (2011). Manuel Bodirsky.
• Prague (2012). Manuel Bodirsky.
• Schloß Dagstuhl (13-18 janvier 2013). Miki Hermann. Séminaire 13031 Computational
Counting, Contribution: How Hard It Is To Count Easily.
• Schloß Dagstuhl (18-23 novembre 2012). Miki Hermann. Séminaire 12471 SAT Interactions.
• Microsoft Research, Cambridge (5-6 juillet 2010). Miki Hermann. International Workshop
on Tractability. Contribution: What Makes Minimal Inference Tractable..
• Schloß Dagstuhl (2009). 25-30 octobre 2009. Miki Hermann. Séminaire 09441 The Constraint Satisfaction Problem: Complexity and Approximability.
Séjours invités
• TU Wien (2009). Miki Hermann a été invité 1 mois pour un séjour scientifique.
88
II.7.4.2
Prix et distinctions
• Christoph Dürr a obtenu le prix du meilleur article dans la conférence “European Symposium on Algorithms” (ESA) en 2009
AlCoAlgorithmique et Complexité
III Équipe Bio-Informatique (AMIB)
89
III.1 Liste des membres : Bio-Informatique
III.1.1
III.1.1.1
Membres permanents
Nom
Julie Bernauer
Philippe Chassignet
Yann Ponty
Mireille Régnier
Jean-Marc Steyaert
Evelyne Rayssac
III.1.1.2
Fonction
CR, CHE
Maitre de conférence
CR
Directeur de recherche
Professeur
Assistant
Employeur
INRIA, École Polytechnique
CNRS
INRIA
HDR
HDR
HDR
Arrivée
2010
1984
2009
2009
1978
Doctorants
Nom
Antoine Soulé
Adrien Guilhot-Gaudeffroy
Daria Iakovishina
Erwan Bigan
Financement
McGill/X
UPSud
X
Arrivée
2012
2011
2011
2012
Encadrant
J.-M. Steyaert
J. Bernauer
M. Regnier
J.-M. Steyaert
Postdoctorants
Nom
Rasmus Fonseca
III.1.1.3
Financement
INRIA
Dates
2012
Responsable
J. Bernauer
Nom
Laurent Schwartz
Financement
AP-HP
Dates
2013
III.1.2
Anciens membres
III.1.2.1
Membres permanents
Nom
Pierre Nicodème
III.1.2.2
Fonction
Chargé de recherche
Invitant
J.-M. Steyaert
Employeur
CNRS
HDR
Départ
2011
Position actuelle
Retraité
Doctorants
Nom
Thuong Van Du Tran
Mahsa Behzadi
Audrey Sedano
Financement
2007
2007
2009
Départ
2011
2011
2013
91
Encadrant
J.-M. Steyaert
J.-M. Steyaert
J.-M. Steyaert
Position actuelle
Postdoc
PostDoc
on leave
CHAPTER III.1. LISTE DES MEMBRES : BIO-INFORMATIQUE
92
Postdoctorants
Nom
Saad Sheikh
Valentina Boeva
Balaji Raman
Loı̈c Paulevé
III.1.2.3
Financement
CNRS/INRIA
CNRS
X
X
Dates
2010-2011
2008-2009
2009-2011
2011-2012
Responsable
M. Régnier
M. Régnier
J.-M. Steyaert
M. Régnier
Position actuelle
Ingénieur R&D (Bing, Microsoft), USA
Chercheur, Institut Curie, France
Assistant professeur, IIT, Inde
CR2-CNRS, LRI, France
Autres membres
Stagiaires Master 2
Nom
Antoine Soulé
Alice Jacquot
Angela Yen
Moustadrani Saı̈d Ibrahim
Al Habib Ibrahim
Arax Martirosyan
Leonid Uroshlev
Financement
X
ENS
X/MIT
DIGITEO
Arabie Saoudite
INRIA
INRIA
Dates
2012
2010
2011
2010
2013
2012
2012
Responsable
J.-M. Steyaert/Y. Ponty
Y. Ponty
Y. Ponty
Y. Ponty
Ph. Chassignet
M. Régnier
J. Bernauer
Position actuelle
Thèse LIX/McGill
Thèse LIPN
Thèse MIT
Ingénierie
Ingénierie
Thèse IPCF- CNR
Thèse Université de Moscou
Nom
Robert Giegerich
Peter Clote
Vsevolod Makeev
Financement
DGAR
DIGITEO
DIGITEO
Dates
Mai 2012-Juin 2012
Juin 2009-Juin 2012
Septembre 2010
Invitant
Y. Ponty
J.-M. Steyaert
M. Regnier
Autres
Nom
Evgenia Furletova
Fonction
Co-adv. PhD
Financement
Univ. Moscou
Dates
2009-2012 (4 months)
Invitant
M. Regnier
III.2 Rapport scientifique : BioInformatique
III.2.1
III.2.1.1
Introduction
This project in bioinformatics is mainly concerned with the molecular levels of organization
in the cell, dealing principally with RNAs and proteins; we currently concentrate our efforts
on structure, interactions, evolution and annotation and aim at a contribution to protein engineering and RNA design. On the one hand, we study and develop methodological approaches
for dealing with macromolecular structures and annotation: the challenge is to develop abstract
models that are computationally tractable and biologically relevant. On the other hand, we apply
these computational approaches to several particular problems arising in fundamental molecular biology. These problems, described below, raise different computer science issues. To tackle
them, the project members rely on a common methodology for which our group has a significant
experience. The trade-off between the biological accuracy of the model and the computational
tractability or efficiency is to be addressed in a closed partnership with experimental biology
groups.
We investigate the relations between nucleotide sequences, 3D structures and, finally, biochemichal function. All protein functions and many RNA functions are intimately related to the
three-dimensional molecular structure. Therefore, we view structure prediction and sequence
analysis as an integral part of gene annotation that we study simultaneously and that we pursue
on a RNAomic and proteomic scale. Our starting point is the sequence either ab initio or with
knowledge such as a 3D structural template or experimental data. We are interested in deciphering the information organization in DNA sequences and identifying the role played by gene
products: proteins and RNA, including noncoding RNAs. A common toolkit of computational
methods is developed, that relies notably on combinatorial algorithms, mathematical analysis of
algorithms and machine learning. A specificity of Amib is its constructive focus, e.g. combinatorial schemes or asymptotic results are not the end product, but rather a preliminary step in
the design of efficient algorithms. One outcome is to provide software or platform elements to
predict structures, interactions and perform functional annotation.
III.2.1.2
Thèmes de recherche
Our approach is twofold, and puts a strong emphasis on the modeling of biological objects using classic formalisms in computer science (languages, trees, graphs...), occasionally decorated
and/or weighted to capture features of interest. To that purpose, we rely on the wide array of
skills present in our team in the fields of combinatorics, formal languages and discrete mathematics. The resulting models are usually designed to be amenable to a probabilistic analysis,
which can be used to assess the relevance of models, or test general hypothesis.
Once suitable models are established, our approach turns to their analysis, typically through
the design of specialized algorithms. Here, one typically aims at deriving new algorithms and
methods to efficiently compute properties of real biological objects. For instance, a by-product of
3D structure prediction for protein and RNA engineering is to allow to propose sequences with
admissible structures. Statistical software for structural annotation are included in annotation
tools developed by partners, notably our international partner Vigg. Tools of choice include
exact optimization, relying heavily on dynamic programming, simulations, machine learning
and discrete mathematics.
Models for biological objects and phenomena Combinatorial models for the structure of macromolecules. A focus of our team is on the prediction of how single-stranded macromolecules
fold. In principle, this problem could be addressed by simply simulating the underlying three93
94
CHAPTER III.2. RAPPORT SCIENTIFIQUE : BIO-INFORMATIQUE
dimensional process, guided by physical rules established by biochemistry. However, the fine
level of details required by such a study would hardly enable us to face the incoming rate of
novel molecules revealed by next-generation sequencing techniques.
Therefore, we study and design algorithmic solutions addressing the secondary structure,
an abstraction of the 3D conformation of a molecule, that only retains the contacts between its
residues. Although this representation may disregard some of the fine details of the molecule
conformation, it still retains the general architecture of molecules, and is especially useful in the
study of RiboNucleic Acids (RNAs) and transmembrane beta-barrel proteins (TMB). The latter
class of proteins accounts for 20 to 30% of identified proteins in a genome but, due to difficulties
with standard experimental techniques, they constitute only 2% of the RCSB Protein Data Bank.
As TMB perform many vital functions, the prediction of their structure is a challenge for life
sciences, while the small number of known structures prohibits knowledge-based methods for
structure prediction. As TMBs are strongly structured objects, model based methodologies [143]
are an interesting alternative to these conventional methods.
The resulting discrete and compact representations also help in the design of specialized algorithms to perform an extensive and well-defined study of the sequence/structure relationship.
Natural applications include the design of new molecules, the correction of sequencing errors,
or the impact of mutations on RNA folding, as illustrated by highlighted Examples 1 and 2.
3D modelling of biomolecules and their interactions.
The biological function of macromolecules such as proteins and nucleic acids relies on their
dynamic structural nature and their ability to interact with many different partners. This is
specially challenging as structure flexibility is key and multi-scale modelling [113, 124] and
efficient code are essential [131].
In our group, we are interested in developing strategies based on knowledge-based potentials
for structure prediction and scoring. Information lies mainly in binary contacts [164] and the sole
knowledge of pair distances can be sufficient to better discriminate for native structures [114].
However a good treatment of distances for the reference state is crucial for assessing results of
such potentials [140].
To better model complexes, one has to address various aspects of the scoring problem for
protein-protein docking [122]. We focus on developing new geometric constructions for that
purpose: e.g. the Laguerre tessellation. Related to the Voronoi construction, it was expected to
better represent the physico-chemical properties of the partners. In [150], we show the comparison between both constructions.
It is also of great interest to introduce a hierarchical analysis of the original complex threedimensional structures used for learning, obtained by clustering. A strong emphasis was recently
made on the design of efficient complex filters [116].
Systems biology. The activities along these themes are diverse in the Amib team, including signalling networks or synthetic biology. These themes have become popular during the past five
years since many crucial problems, coming from biology, medecine, pharmacology, are nowadays
stated in these terms: a great number of them are issued from the cancer phenomenon and the
will to enhance our understanding in order to propose more efficient therapeutic issues.
We present here the preliminary results in Lix group that should be considered more as exploratory than definite achievements.
It is now well established in the medical world that the metabolism of organs depends crucially of the way the calls consume oxygene, glucose and the various metabolites that allow them
to grow and duplicate. A particular variety of cells, the cancerous ones, is of major interest.
In collaboration with L. Schwartz (AP-HP) and biologists from Inserm-INRA Clermont-Theix we
have started a project aiming at identifying the important points in the metabolic machinery that
command the changes in behaviour. The main difficulties come from the fact that biologists have
listed dozens of concurrent cycles that can be activated alternatively or simultaneously, and that
the dynamic characteristic of the chemical reactions are not known accurately.
Even in the Kegg data base, it is not possible to get the informations that would allow accurate
simulations. In her PhD thesis, M. Behzadi [167, 112] has developed a methodology which helps
III.2.1. THÉMATIQUE GÉNÉRALE ET PRINCIPAUX OBJECTIFS
95
in studying the very large systems that we want to analyze; those systems consists of hundreds of
reactions over dozens of reactants, and they cannot be split into smaller ones, which would allow
separate evaluations. It is shown that most systems have very stable behaviours and that even
large variations of their chemical characteristics do not affect the nature of the equilibria. This
very general situation has been discovered by simulation but in some cases it is even possible to
prove it mathematically.
Algorithm design and models analysis We aim at enumerating or generating sequences that
are admissible, in the sense that, according to the modelling, the corresponding structures are
likely to possess some given biological property. Criteria to assess the likelihood can be mainly
statistic or rely on the optimisation of some biological parameter, such as an energy function or
an interaction potential.
Dynamic programming algorithms. It is standard practice in Bioinformatics that, once discrete
and tractable abstractions are deemed realistic, dynamic programming techniques are used to
solve prediction and analysis problems. Aside from historical reasons, the widespread adoption
of this technique in Bioinformatics is perhaps explained by its robustness to changes in the parameters. This property is indeed essential, for instance in the context of optimization problems
where the objective function depends on ever-evolving available data. In RNA folding, it allows for an efficient polynomial-time prediction through energy minimization, while enforcing
further restrictions on the level of intricacy of paired positions.
However, the actual practicality of the resulting algorithms typically depends on a highlynon trivial interplay between structural properties of the objective function and the extent of
the search space. The complexity theory in various settings may be known from preliminary
analyses. In difficult cases, one aims at achieving the best trade off between the level of generality
of the algorithms and their consumption. Typical algorithmic tools include parameter tractable
algorithms.
Through Van Du Tran’s thesis [169] we developed a methodology for compiling a given permutation of strands along the barrel into a dynamic programming scheme that may predict the
folding of sequences into the corresponding TMB secondary structure [141, 139]. Then, polynomial complexity upper bounds come from the calculated DP scheme and we also investigated
how better schemes are reached by the way of tree decompositions of the graph that expresses
constraints between strands in the barrel.
The structure/sequence alignement, i.e. the search for genomic instances of an extended
secondary structure of RNA, including pseudoknots and/or multiple interactions per position,
was revisited with similar techniques. A tree-decomposition algorithm, coupled with dynamic
programming, gave rise to a fixed-parameter algorithm for the problem.
Random sequences.
String searching and pattern matching is a classical area in computer science research, enhanced by potential applications to genomic sequences and even widened by the huge amount
of high throughput data. Our group specialized in a formalization based on languages, weighted
by a probabilistic model. This theoretical research on sequences and languages is subsequently
applied to works in structural biology or annotation.
A first originality in computational biology is the large use of grammars : secondary structures, random generation, Boltzman sampling. A second is the place of analytic combinatorics,
that were introduced by Ph. Flajolet and R. Sedgewick (Princeton U.) [177] . Third, biologydriven constraints, such as the non-uniformity in random generation, are systematically considered.
Motif detection in genomic sequences is a hot subject in computational biology that allows to
address some key questions such as chromosome dynamics or annotation. Molecular interactions
often involve specific motifs. One may cite protein-DNA (cis-regulation), protein-protein (docking), RNA-RNA (miRNA, frameshift, circularisation). Motif detection combines an algorithmic
search of potential sites and a significance assessment, that requires a quantitative criterium.
Our research aims at capturing combinatorial properties of words and provide a general scheme
96
of derivation of analytic formula for such criteria [109, 133, 115]. To design optimized dedicated
algorithms that take into account specificic constraints, we proposed counting graphs [109]
Random generation of sequences under constraints is a suitable alternative when no analytic
formula can be derived. The GenRGenS software, a collaborative work with A. Denise (Amib,
Lri), implements a declarative approach to specify complex models of sequences, and is getting increasingly popularity within the genomic community. Besides non-uniform distribution,
which are achieved through weighted grammars [120] or Markov-like models, complex compositional constraints can be captured using a multidimensional Boltzmann approach [145]. The
random sequences generated using with respect to such expressive models [120, 130] have been
used to tackle numerous problems in RNA computational biology, including the design of noncoding RNAs [129, 134, 162].
III.2.1.3
Exemple 1 : Pseudoknots are complex structural motifs that are usually ignored by popular
software for RNA prediction. In 2004, Condon and coauthors gave a hierarchical classification of
exact RNA structure prediction algorithms according to the generality of structure classes that
they handle. We completed this classification by adding two recent prediction algorithms [135].
More importantly, we precisely quantified the hierarchy by giving closed or asymptotic formulas
for the theoretical number of structures of given size n in all the classes but one. This allows to assess the trade off between the expressiveness and the computational complexity of RNA structure
prediction algorithms. The underlying decomposition strategies were then used to instantiate a
framework, based on hypergraphs, which helps the design of novel dynamic programming algorithms to fold RNAs and detect the presence of pseudoknots in RNA sequences [154]. Turning
to complexity aspects of RNA folding with general pseudoknots, we showed that the problem is
not only untractable (NP-hard), but also fully inapproximable (APX-hard) as soon as expressive,
yet realistic, energy models are considered [159]. Similar complexity results hold for the search
of pseudoknotted structures within genomic sequences, a situation that was addressed through
a design of fixed parameter tractable algorithms for the problem [157].
Exemple 2 : Dynamic-programming algorithms, routinely used to predict how RNA folds
at the secondary structure level, can also be extended to perform an exploration of the sequence/structure relationship. This idea, pioneered in an early collaboration initiated in 2005
between the Bioinfo team and Boston College, was successfully applied recently to study the evolution [161], the design [129, 156], and the correction of errors arising from next-generation sequencing technologies [155]. While the inclusion of (distance-parameterized) mutated sequences
in the DP scheme is not overly challenging, the derivation of ensemble properties and/or promising candidates for RNA design requires advanced sampling techniques (Boltzmann sampling),
and motivates new techniques coupling weighted dynamic programming and polynomial interpolation [161, 138]. The development of these tools and methods, and their applications to other
problems in RNA computational biology, is currently at the heart of our ongoing collaboration
with University McGill (Canada) that implies Amib team at Lri and Lix.
Exemple 3 : 3D modelling A protein-protein docking procedure traditionally consists in two
successive tasks: a search algorithm generates a large number of candidate solutions, and then a
scoring function is used to rank them in order to extract a native-like conformation. We demonstrated that using Voronoi constructions and a defined set of parameters, we could optimize an
accurate scoring function and interaction detection [172] . Another geometric construction was
also tested: the Laguerre tessellation. It also allows fast computation without losing the intrinsic
properties of the biological objects. Related to the Voronoi construction, it was expected to better
represent the physicochemical properties of the partners. In [150], we present the comparison
between both constructions. We also worked on introducing a hierarchical analysis of the original complex three-dimensional structures used for learning, obtained by clustering. Using this
III.2.1. THÉMATIQUE GÉNÉRALE ET PRINCIPAUX OBJECTIFS
97
clustering model, in combination with collaborative filtering, we can optimize the scoring functions and get more accurate solutions [116]. This work is done in collaboration with J. Azé (Lri,
Univ. Paris-Sud) and A. Poupon, Inra-Tours. We also decided to extend these techniques to the
analysis of protein-nucleic acid complexes. The first preliminary developments and tests were
performed by A. Guilhot.
Exemple 4 : Tries and suffix tries are a common data structure to search and sort words or
detect repetitions. The average values of suffix trees parameters under different constraints have
been studied for long [184] . Nevertheless, their distribution or profile remained unknown until the seminal paper [133]. In this joint work with a Lix alumni, H.K. Hwang (Taiwan Univ.),
P. Nicodème developed an original method in analytic combinatorics to address profiles issues.
Analytic formulae and asymptotic distribution for the profile of binary tries in uniformly distributed sequences are derived. High Throughput data enlarged their potential applications.
Typically, assembly algorithms need to detect long and approximate repeats : unique mappability of short reads strongly depends of the repetition of words of a given length in a trie or a
suffix tree. Since that publication, statistics for sequences with a biased GC content were given in
[176] . In a recent internship of J. Moussu, an extension to any alphabet size was proposed and
the applicability to GC-biased genomic sequences for an alphabet size 4 was tested on several
Archae genomes, studied by Lob partner at Ecole Polytechnique.
III.2.1.4
The project covers a large variety of biological problems and technical issues with a strong local collaboration network and long-term international relationships. Amib is involved in many
funded international collaborations : Stanford U., Vigg (Moscow), McGill U., U. of Montreal,
Hkust (Hong-Kong). The members of the team organized several international and national
conferences or workshops and are members of numerous program committees. Several software
are currently being developed and varna (a collaboration with Lri), was distinguished in Cnrs
annual report (2011). Amib has been involved in several scientific events for the “grand public”.
III.2.1.5
Amib est un projet Inria commun au Lix, au Lri et au CNRS : UMR 7161 et 8623. Il est bilocalisé
entre le Lix et le Lri.
Un séminaire commun de l’équipe se réunit chaque semaine, généralement au Lri, en alternant les exposé internes et les invitations.
Les principaux financement de l’équipe sur la période sont un contrat Digiteo (2008-2013)
impliquant le Lri et Boston College (81 859 Euros, une bourse post-doctorale de 3 ans et une
bourse de thèse), un contrat industriel (2006-2010) avec Philip Morris (150 000 euros) et des
contrats internationaux d’équipes associées d’Inria et du Mesr pour un total de 91 000 Euros.
S’y ajoutent un soutien Inria, un partenariat Anr (20 000 euros) et divers petits contrats ou
subventions. Deux bourses post-doctorales ont été financées par Inria.
III.2.1.6
Notre appartenance en tant que groupe d’enseignement à la communauté bioinformatique est
un atout certain. Nous avons et renforçons un groupe d’étudiants à compétences multidisciplinaires aux niveaux Master et PhD. Notre équipe est aussi très impliquée dans deux programmes d’études majeurs en France. Elle a contribué à la création du Master Bibs (Bioinformatique et Biostatistique) de l’ Université Paris-Sud, cohabilité par l’Ecole Polytechnique
depuis 2010, qui devrait devenir le Master de Bioinformatique de l’Université de Paris-Saclay.
Elle assure le parcours d’Approfondissement en Bioinformatique de l’Ecole Polytechnique. Des
échanges sont en cours pour favoriser des stages de Polytechniciens et d’étudiants de Master dans
des services opérationnels de l’ AP-HP.
98
Trois thèses ont été soutenues, avec des financements du Ministere et de l’Ecole Polytechnique
et quatre sont en préparation, dont une en co-tutelle avec l’Université de McGill. M. Régnier a coencadré à l’Université de Moscou la thèse d’E. Furletova et á l’Université Al-Farabi (Kazkhstan)
les thèses de G. Boldina (2008), A. Kabdullina (2010), A. Issabekova (2012), A. Bari (soutenance
en 2013) et O. Berillo (soutenance en 2014). J. Bernauer and M. Régnier suivent ou ont suivi la
thèse de deux doctorants de l’Université de Moscou, (E. Furletova (2012) et L. Uroshlev (2014)).
Deux post-doctorants Ercim ont été accueillis pour un mois par Amib, dans le cadre du cursus externe d’ Ercim. Trois étudiants ont été soutenus par Google dans le cadre du programme
Google summer of code pour intégrer notre logiciel Varna, et plus généralement des fonctionalités spécifiques à l’ARN, au sein du logiciel JalView, populaire éditeur d’alignements multiples.
Nous participons depuis 2013 à un réseau d’étudiants entre l’Univerité de McGill et ParisSud/Ecole Polytechnique. Ce partenariat franco-canadien soutient des stages co-encadrés (3-6
mois) et des cotutelles de thèses. Des stagiaires internationaux sont régulièrement accueillis dans
l’équipe (3/4 par an) dans le cadre des programmes internationaux de l’Ecole Polytechnique et
d’Inria.
III.3 Projet de recherche : BioInformatique
III.3.1
The biological function of macromolecules such as proteins and nucleic acids relies on their dynamic structural nature and their ability to interact with many different partners. Therefore,
folding and docking are still major issues in modern structural biology. Indeed, with the recent
development of molecular systems biology aiming to integrate different levels of information,
protein and nucleic acid assemblies studies should provide a better understanding on the molecular processes and machinery occurring in the cell. Our group combines several tools relying on
the genomic sequences.
Ever since the seminal work of Zuker and Stiegler, the field of RNA bioinformatics has been
characterized by a strong emphasis on the secondary structure. This discrete abstraction of the
3D conformation of RNA has opened the door for the development of quantitative approaches
in RNA computational biology, and led to unexpected connections between combinatorics and
molecular biology. Using our strong background in enumerative combinatorics, we have contributed generic and efficient algorithms, both for sampling and counting structures using dynamic programming. Our future research on RNA will be performed along three main axes :
structure prediction, inverse folding, i.e. the design of a sequence which preferentially folds into
a predetermined secondary structure, and molecular interactions. First, in order to circumvent
the predictive limitations of energy models, we plan to revisit the integration of experimental
data, namely the Shape accessibility profiles, through a comparative approach which relies on
controlled mutagenesis experiments. The second problem is dually motivated by its elusive algorithmic nature and its intensive usage in the nascent field of RNA synthetic biology. Promising
results arose from our preliminary works, based on weighted random generation and Boltzmann
sampling. We plan to study more general constraint systems and to extend our approach to
the design of interacting RNAs. The RNA function being largely determined by its molecular
interactions, this third problem is tightly related to 3D modelling.
The limits of structural experimental techniques or in silico studies and simulations are well
known : a limited size of molecules for the latter, and, for the former, a limited accuracy, particularly in predicting native like molecular structures of RNA molecules and their complexes
[179, 175] . Therefore, the modeling of folding and interactions from a structural perspective
(3D) has to be done in a multi-scale manner and RNA multi-scale modeling is a rapidly emerging trend in the community that could provide important insights for RNA therapeutics [124].
Despite the success of machine-learning only techniques such as the genetic algorithms and collaborative filtering techniques we have been using [173, 171, 172] ,[114, 116], physics based
techniques still prove sometimes more efficient for experimental behavior fine and accurate predictions [122].
One originality of our 3D project lies in the combination of classical biophysics/modeling,
that take into account the physics, with machine learning/statistics strategies. The goals are
basic prediction but also dynamics modeling. Focused primarily on RNA, its new application
field is wide and will possibly lead to a better understanding of RNA role in the cell. The RNA
ligase and NucS endonuclease examples developed below are two target applications that could
provide great insights on RNA circularization and DNA repair.
Next Generation Sequencing (NGS) techniques which arose in the last 5 years, provide great
tools to study DNA and RNA sequences at the cell level, but also at the organism level. Despite
the fact that the competing technologies associated with NGS each promise dramatic breakthroughs in both biology and medicine, the main bottleneck in NGS applications remains the
computational analysis of experimental data. The sheer amount of this data represents a serious
challenge that is further complicated by the sequencing errors the continuously arising technologies are prone to. These are of specific types for each technology. Therefore, devoted algorithms
are critically needed, and rigorous modeling and benchmarking are mandatory in order to determine the limits of their applicability.
99
100
CHAPTER III.3. PROJET DE RECHERCHE : BIO-INFORMATIQUE
Our group has expertise with 3D and geometric modeling for proteins [173, 171, 172] , statistical techniques for RNA and structure prediction, machine learning for biological problems and
motif detection. This wide range of skills is unique and the combination of this knowledge with
experts in biochemistry would definitely provide new models and generic tools. New constraints,
such as energy conditions, or sequencing errors and amplification bias that are technology dependent, must be introduced in the models. In general, in the future, an emphasis is to be made
on such constraints, in sampling methods and data analysis.
To adress the cell level, the simulation of metabolic cycles will be pursued with an emphasis
on cancerous environments. We expect to reinforce the partial results, both theoretical and experimental, already obtained by developing large scale simulations of the complex and intricate
metabolic cycles which intervene in the regulation of glycolysis, phospholipids synthesis and
mytosis.
III.3.1.1
Sequences : combinatorics and algorithms
Statistical software provide efficient solutions for searching biologically relevant motifs in sequences. Research for this key issue has been very active in the two last decades. Fast development of high throughput technologies generates new challenges and new constraints, a bottleneck being the computational analysis of experimental data. Additionnally, the recent discovery
of hundreds of new classes of functional non-coding RNAs (ncRNAs) has emphasized the need
for better models and tools to detect their presence within transcriptomic/metagenomic data.
The team has recent or long term collaborations with several groups.
One objective of our russian international partner at Vigg, and Inria project-team Magnome,
is the comparison of assembly algorithms, that recover a genome from high-throughput sequencing data. Indeed, significant differences are observed in the assembly of a given genome -or
closely related genomes- when different algorithms are run or when parameters settings are modified. This follows, partially, from strong constraints of the underlying technologies, leading to
different data (size, confidence,...). The result also depends of the structure of the genomic regions, notably the distribution of (approximately) repeated regions.
Second, Next Generation Sequencing opens new ways for the study of structural variants
in the genome. This topic is studied at Curie Institute, that was selected in 2012 for a “Projet
d’avenir”. Procedures based on the depth of coverage are very sensitive to data bias. Such a
bias has been observed systematically in high-throughput sequencing data and can dominate the
signal of interest. So far, no consensus exists on a method to remove it from samples but it is
generally admitted that PCR is the more important cause of the GC bias. Empirical evidence
supporting this assumption is provided in a recent work [170] that proposes a statistical model
to provide a correction. In a starting collaboration with V. Boeva [174] , we aim at defining a
bayesian model. Preliminary results show the relevance of this approach.
The Lob experimental group at Ecole Polytechnique studies key mechanisms of archae metabolism:
the DNA replication fork and replication restart, the NucS DNA endonuclease and the role of circular RNAs. A sequencing machine is being bought by Lob. New data characterizing replication
forks arrest and putatively circular RNA sites will be generated at the genome scale that may
change our current views on early mechanistic events of genome instability in archaea and eukarya. Methods and algorithms will be developed to analyze produced reads corresponding to (i)
the identification of circular RNAs in cells and (ii) DNA sequences interacting with two proteins
of interest in living cells. This second point mainly resorts to the methods presented in the next
sections on RNA and 3D modelling.
Strongly relying on analytic combinatorics, we will develop and extend our toolkit of combinatorial methods to address these problems.
The new challenge is the occurrence of many sequencing errors and technology dependent
data bias. A first objective is the derivation of a tractable and meaningful model that takes into
account the quality of data for the different technologies, their volume and specific constraints
of each problem. For example, a combinatorial model for errors, or misassembly, is needed that
takes into account the structural characteristics of genomic sequences. Characterizing repetitions
III.3.1. OBJECTIFS SCIENTIFIQUES
101
is crucial, as it is for unique mapping, a basic assumption in the detection of structural variants.
Similarly, a combinatorial approach to the variation of characteristic parameters, to be identified in a tight collaboration between Lob and Amib, is appealing. We plan to rely on analytic
combinatorics and introduce systematically this bias correction in statistical criteria, extending
theoretical formulae derived for biased distributions (Bernoulli, Markov, HMM) [184, 177] . Indeed, previous works on suffix trees by Flajolet, Devroye et al. [184] and recent work by the
team [133], assuming a uniform distribution of letters in the alphabet, and a recent work [176]
, studying the dependency to GC content for bacterial organisms, strongly suggest a general analytic relationship between the organism DNA distribution, the length of the genome and the
read length. Formal results should restrict the zone of uncertainty, the so-called twilight zone
of Pevzner and Tompa [178] . In this context, it would also be interesting to understand which
bias in their compositions push these RNAs to circularity: a purely combinatorial analysis might
give clues to this situation. A deeper data interpretation is needed to achieve the design of motif
detection algorithms for NGS data that is a second objective: taking advantage of combinatorial
properties of data should lead to the design of dedicated algorithms. Besides algorithms improvements, the ultimate goal is the definition of quantitative confidence criteria for the results,
the characterization of the domains of robustness and benchmarking.
We will also pursue our work on RNA design, relying heavily on constrained random generation principles. In particular, we will extend multidimensional Boltzmann sampling to support
new operators, and self-calibration procedures that would be applicable even in non-combinatorial
settings.
III.3.1.2
RNA structures
The quality of secondary structures predicted using RNA folding algorithms is intrinsically limited by the simplistic nature of both the energy model and conformational space. In the past, we
have dedicated a substantial amount of work to overcome the latter limitations, e.g. by including
pseudoknots and non-canonical interactions in DP schemes. However, overcoming the limitations of the energy model would require the derivation of new sets of thermodynamic energy
parameters, a tedious task which no biochemist seems willing to undertake at the moment.
Fortunately, previous studies [181] have shown that integrating comparative and low-resolution
experimental data within RNA folding algorithms sometimes allows to circumvent the limitations of energy models. Experimentally, chemical and enzymatic probing are currently the most
popular source of low-resolution data for RNA structure, with a special emphasis on the Shape
technology, which derives the accessibility (≈ probability of being unpaired) for each position
in the RNA sequence. We wish to develop an approach which would depart from the current
paradigm, i.e. the integration of Shape data as simple bonuses to increase the agreement between their prediction and the accessibility profile. Our new approach would consider a population of sequences obtained by performing random mutations in the sequence of interest, and for
which Shape profiles would be experimentally derived in a high-throughput manner. Such an
input would allow us to identify structurally homologous sequences (same accessibility profiles)
and highlight suspicious regions (disagreement between in silico predictions and experimental
data). Beside the computational challenge of folding multiple RNAs simultaneously, a new experimental protocol must be designed, including a controlled mutagenesis and the computation
of accessibility profiles in a high-throughput manner. We are currently starting this project in
collaboration with B. Sargueil’s team in biochemistry at Université Paris-Descartes (Pharmacie)
and A.Denise (Lri, Université Paris-Sud).
The inverse folding of RNA is also a challenging problem, dually motivated by its elusive algorithmic nature and its intensive usage in the nascent field of RNA synthetic biology [183]. In a
series of papers, we have investigated an original approach based on random generation, named
global sampling, which contrasts with the ubiquitous local search heuristics used by our competitors. We have shown that this approach lends itself conveniently to many types of constraints
(sequence composition, forbidden/mandatory motifs. . . ). The generic random generation principles and algorithms developed in the group capture these constraints in a probabilistic manner,
102
and have given rise to novel efficient algorithms which are not only polynomial, but can also be
implemented efficiently. Lately, we have started exploring a glocal approach, which uses local
search starting from sequences that are randomly generated using global sampling, with promising results. Our future contributions to RNA design will focus on providing support for more
general constraints, extending our approach for the design of interacting RNAs, and developing
experimental collaborations.
III.3.1.3
3D modeling of macromolecules and their interactions
As stated above, experimental and classical biophysics modeling techniques are often expensive
or limited in analyzing and predicting protein-nucleic acid interactions. The purpose of this
task is to provide a generic efficient 3D modeling framework that could be refined a through
iterative procedure involving experimentalists. Ideally this would lead to protein-RNA/DNA interaction prediction including thermodynamics and RNA sequence design based on knowledgebased strategies. This part is ambitious and may be limited by the scarcity of the experimental
data available and the expensive computations. We expect that intelligent machine learning
strategies, combined to expert biology knowledge would help to overcome these issues.
This part is organized around three main axes: multi-scale knowledge-based (KB) RNA structure minimization and stability studies, RNA junction and structure studies by KB dedicated
techniques for hierarchical modeling and protein-RNA 3D interaction prediction.
Large RNA molecules with junctions will be modeled and their dynamics sampled using a hierarchical extension of the previously described potentials. The parameters used for multi-level
scoring can be learned from basic junction simulations, using genetic algorithms for example.
This would be the first KB hierarchical modeling pipeline. It will greatly speed up the modeling
process and allow better insights into understanding larger flexible RNA molecules.
We also would like to tackle the fitting to experimental 3D data by extending the innovative, robotics-inspired Kino-Geometric Sampler conformational search algorithm (KGS [180] )
for proteins to nucleic acids and to include experimental data. KGS models a protein as a kinematic linkage and additionally considers hydrogen bonds that ‘close’ kinematic cycles. In closed
kinematic cycles rotatable bonds can no longer be deformed independently without breaking closure. KGS preserves all kinematic cycles, and thus hydrogen bonds, by sampling in a subspace of
conformational space defined by all closure constraints. KGS exhibits a singularly large search
radius and optimally reduces the number of free parameters. These unique features enable flexible ’docking’ of atomic models in the data while keeping moderate the risk of overfitting at low
resolution. Preliminary results show that KGS is capable of fitting a protein structure into experimental data starting from a structure an unprecedented 4.5Å RMSD away. The KGS procedure
can also accommodate knowledge-based potentials to improve evaluation of putative conformations and their interactions. Based on our previous work [114, 140] we plan to guide conformational search by a differentiable knowledge-based potential in both atomic and coarse-grained
levels of representation.
An extension of in-lab kinematics-based conformational sampling algorithm for loops could
be added to this project. It will use the potential of a kinematic model and knowledge-based
techniques. This development targets nucleic acids and protein/nucleic acid complexes with a
view towards improving structure determination of nucleic acids and their complexes and in
silico docking experiments of protein/RNA complexes.
The multi-level machine learning strategy offers different representations of the same complexes (from coarse grained level to atomic level). This specificity will allow us to develop an
active learning approach [182] . The main objective of such an approach is to learn predictive
models that can automatically select conformations that might be useful for an efficient improvement of the current model. The biological evaluation of selected conformations will give new
examples (positive or negative) and then the predictive model will be updated. Such a process
could be iteratively used to improve the model.
III.3.2. MISE EN OEUVRE
III.3.1.4
103
Cell metabolism
A number of these topics in systems biology will certainly continue to be developed and new
topics will become into consideration.
Our collaborators M. Israël and L. Schwartz have listed more than a hundred tentative such
bifurcations that we intend to study systematically. The PhD thesis of E. Bigan, co-directed
by S. Daoudi (Univ. Denis Diderot) and J.-M. Steyaert investigates the generic properties of
such complex systems and confirms that the ones we have already studied are not exceptions.
A preliminary study of the mitotic cycle with L. Paulevé has also put in evidence the strong
influence of the pH of the cell on its capacity to duplicate.
The activity on cancer metabolism is increasing; Pr. P. Icard (CHU Caen) is joining Ecole
Polytechnique; we intend to prove both formally and experimentally that medications based on
citrate and hydroxycitrate inhibit drastically the growth of tumor cells, which has already be
proved in vitro and on animal experiments.
III.3.2
Mise en oeuvre
Our project now benefits from three years of lifetime. This period was fruitful for people and
ideas to get to work together but also to better define where our strength and weakness lie.
We can now really develop combinatorics, sampling and multi-scale modelling at a faster pace,
having better targeted our goals.
The contacts and collaborations we started with experimentalists is not necessarily bound to
be successful. We however consider that most of our work is now mature enough to seriously
target wet lab collaborations. More developments will of course be needed and the assessment
of our investments might have to be reassessed over time. For that purpose, we initiated a close
collaboration with the Myllykalio group at LOB (CNRS/INSERM/École Polytechnique). Despite
an unsuccessful application to ANR last year, we intend to pursue in this direction and resubmit
a improved project this fall. We also have joint projects and applications under review with the
groups of Bruno Sargueil at Paris Diderot and Alain Denise at IGM (CNRS/Univ. Paris-Sud).
We have and we will go on having trained a group of good multi-disciplinary students both
at the Master and PhD level. Being part of this community as a serious training group is obviously an asset. Our project is also very much involved in two major student programs in France:
the Master BIBS (Bioinformatique et Biostatistique) at Université Paris-Sud/École Polytechnique
and the parcours d’Approfondissement en Bioinformatique at École Polytechnique. We are also
involved in a student partnership with McGill University (partenariat France Quebec offering
French and Canadian students co-supervised internships (short term -3 to 6 months- or long
term -part of the PhD studies-).
From a research perspective, our multi-disciplinary goals are supported by strong specialized backgrounds. We expect interesting results related to combinatorics in bioinformatics and
heuristics in computational biology. The overall visibility we benefit from in these fields will be
helpful in both collaboration network strengthening and student related attractivity. Our strong
local collaboration network and the long-term international relationships have led us to believe
our development will be nicely supported in the future.
To achieve all these goals we will need to recruit new young and experienced scientists: possibly a permanent researcher in combinatorics-related sequence analysis (CR2 or CR1), post-docs
and students. We already plan to have to Phd students funded by Inria Cordi and École Polytechnique in 2014. We want to increase our external funding potential e.g. ANR, international
bilateral funding, and welcoming foreign summer internships.
For the next four years, Jean-Marc Steyaert has mentioned his desire to maintain a scientific
activity within our group. Ideally, he would stay as a part-time emeritus, spending one or two
days a week in the lab.
104
s
M
E as
th vol se
ne ém uti cri
nt at on tiq
es iq ra ue
en ues pid
bi et e d
ol q e
og u s
ie est
io
n
•
pe
rt
i-
en
ac
es
A F
O M
NEGATIF
s
•
es
ss
M
le
At
ou
ts
•
•
In
R te
Pr ése rdis
M oj au cip
ta ét et
in li
ap nt hod Inr te nar
pl un es ia rna ité
ic e g AM t
at t é I io
io ra né B, na
ns ns ri c l
po qu om
si es m
tio , u
n per n L
à m RI
d’ et
au tr
es
•
•
•
té
ni
•
n
io
at
is
s
él
le
s
od
m s an
e nt t d
t d iva an
itu v n
st de on
in s is nt
n ce fo va
tio ien e vi
éa sc tèm du
Cr s ys s
de cos nce
E cie
s
tu
or
pp
O
•
105
es
un
ts mm c
an o ve
or s c a
ct on ns
do ati atio
de lic or s
e ub ab ste
qu p oll ali
an de c t
M u de en
• Pe eu rim
P xpé
e
•
ib
Fa
POSITIF
III.4 Analyse AFOM : Bio-Informatique
INTERNE
EXTERNE
Figure III.4.1: Analyse AFOM de l’équipe Bio-Informatique : Atouts, Faiblesses, Opportunités,
Menaces
106
CHAPTER III.4. ANALYSE AFOM : BIO-INFORMATIQUE
III.5 Fiche résumé : Bio-Informatique
III.5.1
Membres
2008 : 1 chercheur (1 CNRS, 0 INRIA), 2 enseignants-chercheurs, 1 postdoc, 2 doctorants
2013 : 3 chercheurs (1 CNRS, 2 INRIA), 2 enseignants-chercheurs, 1 postdoc, 3 doctorants
Départ de membres de l’équipe Pierre Nicodème (Actuellement Retraité)
Nouveaux membres M. Régnier (Mutation INRIA), Y. Ponty (Recrutement CR CNRS), J. Bernauer
(Mutation INRIA), L. Schwartz (Pr., mise à disposition AP-HP).
III.5.2
Résultat 1
We have contributed novel techniques for the efficient random generation of
weighted objects [120, 130] and the computation of ensemble properties in dynamic programming schemes [154], motivated by various applications in RNA bioinformatics. These applications include the design of structural RNAs [129, 162, 134, 162], the characterization of (un)structured regions in messenger RNAs [145], the detection of riboswitches [138, 158], the study
of the sequence/structure relationship [161, 144], and the correction of reads in next-generation
sequencing technologies [155, 134].
Résultat 2 Besides applications of analytic combinatorics to computational biology problems
[135, 118], the team addressed general combinatorial problems on words and fundamental issues
on languages and data structures. Analytic formula for tries profiles, to apply to repetitions in
genomic sequences and assembly issues have been derived in [133]. Works on combinatorics on
words [111, 115] led to the design of efficient counting automata [109].
Résultat 3 The main contribution of our group to modelling in structural biology and docking in particular was to show powerful data-driven and machine learning strategies can be in a
prediction setting. For RNA 3D conformation selection, we showed that differentiable knowledge based potential can be built [140]. The obtained potentials perform better than existing
procedures [114]. For docking, we have shown that using machine learning on a well-chosen set
of parameters derived from Voronoi-based construction, an accurate scoring function could be
designed and optimized [150]. In [116], we improved on this strategy by using a filtering scheme
based on ensemble learning. This new approach was applied to the CAPRI scoring ensembles in
a community-wide assessment experiment [122].
Résultat 4 J.-M. Steyaert and M. Behzadi have shown that it is possible to analyze the behaviour
of non trivial metabolic systems even when the exact values of the cinetic parameters are known
approximately. They have been able to interpret rigorously experimental results of biologists on
phospholipids synthesis.
III.5.3
III.5.3.1
Publications
Journaux : 34
107
CHAPTER III.5. FICHE RÉSUMÉ : BIO-INFORMATIQUE
108
• Statistics and knowledge-based strategies has shown to be an effective strategie for RNA
structure conformation selection. Our study outperformed the gold standard procedure
[114]. We also showed that well-built collaborative filters can be used with great efficiency
in the scoring of docking conformations [116].
• In collaboration with J. Waldispuhl (Univ. McGill), we contributed efficient tools and techniques to probe the structure/sequence structure in RNA. This contribution, presented at
the RECOMB’11 conference [144], introduced novel algorithmic principles for dynamic
programming algorithms (Multivariate Boltzmann sampling, interpolation), and laid the
foundation for many recent applications.
• Analytic combinatorics for tries and assembly [133]
• Analytic combinatorics on RNA structures with pseudoknots [135]
III.5.3.2
Rayonnement
• Amib has been a partner in two Inria associated teams (with Stanford and Vigg, Moscow).
Besides a two-years long partnership with Hkust, Amib (Lix and Lri) has set up a long-term
network to exchange students with McGill University and University of Montreal,
• Six invited presentations during the two last editions of the Benasque RNA computational
biology workshop, an event (organised by E. Rivas and E. Westhof) which gathers the main
players of the RNA computational biology community every three years.
• Popular software, frequently used by scientists in RNA biology/bioinformatics (Varna) and
genomic (GenRGenS).
• Amib participated in several popular events to present science.
III.5.3.3
• We have and we will go on having trained a group of good multi-disciplinary students both
at the Master and PhD level. Being part of this community as a serious training group is obviously an asset. Our project is also very much involved in two major student programs in
France: the Master BIBS (Bioinformatique et Biostatistique) at Université Paris-Sud/École
Polytechnique and the parcours d’Approfondissement en Bioinformatique at École Polytechnique. J.-M. Steyaert is involved in the development of an interdisciplinary cooperation
between Ecole Polytechnique and AP-HP.
• The team welcomes many foreign students : internships (two every year), co-advised theses. In a collaboration with Lri, the group has set up a network with McGill University
(partenariat France Quebec offering French and Canadian students co-supervised internships (short term – 3 to 6 months – or long term as part of their PhD studies).
• M. Régnier took an active part to the creation of Computer Science speciality at the French
”Agrégation de Mathématiques” in 2006 and has been a member of the committee until
2012.
III.6 Production scientifique : BioInformatique
III.6.1
[109] Mireille Regnier, Zara Kirakossian, Eugenia Furletova, and Mikhail Roytberg, A. A Word
Counting Graph. In Jacqueline W. Daykin Joseph Chan and M. Sohel Rahman, editors,
London Algorithmics 2008: Theory and Practice (Texts in Algorithmics), page 31 p. London
College Publications, June 2009.
[110] Stefanie Schirmer, Yann Ponty, and Robert Giegerich. Introduction to RNA Secondary
Structure Comparison. In Walter L. Gorodkin, Jan; Ruzzo, editor, RNA Sequence, Structure, and Function: Computational and Bioinformatic Methods, volume 1097 of Methods in
molecular biology, page 450pp. Springer, 2014.
III.6.2
[111] Frédérique Bassino, Julien Clément, and Pierre Nicodème. Counting occurrences for
a finite set of words: combinatorial methods. ACM Transactions on Algorithms (TALG),
8(3):1–28, 2012.
[112] Mahsa Behzadi, Aicha Demidem, Daniel Morvan, Schwartz Laurent, Georges Stepien,
and Jean-Marc Steyaert. A model of phospholipid biosynthesis in tumor in response to
an anticancer agent in vivo. Journal of Integrative Bioinformatics, 7(3), 2010.
[113] Julie Bernauer, Samuel Flores, Xuhui Huang, Seokmin Shin, and Ruhong Zhou. MULTISCALE MODELLING OF BIOSYSTEMS: FROM MOLECULAR TO MESOCALE - Session
Introduction. Pacific Symposium on Biocomputing, pages 177–80, 2011.
[114] Julie Bernauer, Xuhui Huang, Adelene Y L Sim, and Michael Levitt. Fully differentiable
coarse-grained and all-atom knowledge-based potentials for RNA structure evaluation.
RNA, 17(6):1066–75, June 2011.
[115] Jérémie Bourdon and Mireille Regnier. Large deviation properties for patterns. Journal
of Discrete Algorithms, JDA534, 2013. in press.
[116] Thomas Bourquard, Julie Bernauer, Jérôme Azé, and Anne Poupon. A collaborative filtering approach for protein-protein docking scoring functions. PLoS ONE, 6(4):e18541,
2011.
[117] Peter Clote, Feng Lou, and William A Lorenz. Maximum expected accuracy structural
neighbors of an RNA secondary structure. BMC Bioinformatics, 13 Suppl 5:S6, 2012.
[118] Peter Clote, Yann Ponty, and Jean-Marc Steyaert. Expected distance between terminal
nucleotides of RNA secondary structures. Journal of Mathematical Biology, 65(3):581–99,
September 2012.
[119] Kévin Darty, Alain Denise, and Yann Ponty. VARNA: Interactive drawing and editing of
the RNA secondary structure. Bioinformatics, 25(15):1974–5, August 2009.
[120] Alain Denise, Yann Ponty, and Michel Termier. Controlled non uniform random generation of decomposable structures. Theoretical Computer Science, 411(40-42):3527–3552,
2010.
[121] Lou Feng and Peter Clote. Thermodynamics of RNA structures by wang–landau sampling. Bioinformatics, 26:278–286, 2010.
109
110
BIBLIOGRAPHY
[122] Sarel J Fleishman, Timothy A Whitehead, Eva-Maria Strauch, Jacob E Corn, Sanbo Qin,
Huan-Xiang Zhou, Julie C Mitchell, Omar N A Demerdash, Mayuko Takeda-Shitaka,
Genki Terashi, Iain H Moal, Xiaofan Li, Paul A Bates, Martin Zacharias, Hahnbeom Park,
Jun-Su Ko, Hasup Lee, Chaok Seok, Thomas Bourquard, Julie Bernauer, Anne Poupon,
Jérôme Azé, Seren Soner, Sefik Kerem Ovali, Pemra Ozbek, Nir Ben Tal, Türkan Haliloglu,
Howook Hwang, Thom Vreven, Brian G Pierce, Zhiping Weng, Laura Pérez-Cano, Carles
Pons, Juan Fernández-Recio, Fan Jiang, Feng Yang, Xinqi Gong, Libin Cao, Xianjin Xu,
Bin Liu, Panwen Wang, Chunhua Li, Cunxin Wang, Charles H Robert, Mainak Guharoy,
Shiyong Liu, Yangyu Huang, Lin Li, Dachuan Guo, Ying Chen, Yi Xiao, Nir London, Zohar Itzhaki, Ora Schueler-Furman, Yuval Inbar, Vladimir Patapov, Mati Cohen, Gideon
Schreiber, Yuko Tsuchiya, Eiji Kanamori, Daron M Standley, Haruki Nakamura, Kengo
Kinoshita, Camden M Driggers, Robert G Hall, Jessica L Morgan, Victor L Hsu, Jian
Zhan, Yuedong Yang, Yaoqi Zhou, Panagiotis L Kastritis, Alexandre M J J Bonvin, Weiyi
Zhang, Carlos J Camacho, Krishna P Kilambi, Aroop Sircar, Jeffrey J Gray, Masahito Ohue,
Nobuyuki Uchikoga, Yuri Matsuzaki, Takashi Ishida, Yutaka Akiyama, Raed Khashan,
Stephen Bush, Denis Fouches, Alexander Tropsha, Juan Esquivel-Rodrı́guez, Daisuke Kihara, P Benjamin Stranges, Ron Jacak, Brian Kuhlman, Sheng-You Huang, Xiaoqin Zou,
Shoshana J Wodak, Joel Janin, and David Baker. Community-wide assessment of proteininterface modeling suggests improvements to design methodology. Journal of Molecular
Biology, 414(2):289–302, November 2011.
[123] Samuel Flores, Julie Bernauer, Xuhui Huang, Ruhong Zhou, and Seokmin Shin. MULTIRESOLUTION MODELING OF BIOLOGICAL MACROMOLECULES - Session Introduction. Pacific Symposium on Biocomputing, 15:201–204, 2010.
[124] Samuel C Flores, Julie Bernauer, Seokmin Shin, Ruhong Zhou, and Xuhui Huang. Multiscale modeling of macromolecular biosystems. Briefings in Bioinformatics, 13(4):395–405,
July 2012.
[125] Adeline Guais, Gérard Brand, Laurence Jacquot, Mélanie Karrer, Sam Dukan, Georges
Grévillot, Thierry Jo Molina, Jacques Bonte, Mireille Regnier, and Laurent Schwartz.
Toxicity of carbon dioxide: A review. Chemical Research in Toxicology, 24(12):2061–70,
December 2011.
[126] Assel Issabekova, Olga Berillo, Vladimir Khailenko, Shara Atambayeva, Mireille Regnier, and Anatoliy Ivashchenko, T. Characteristics of intronic and intergenic human
miRNAs and features of their interaction with mRNA. World Academy of Science, Engineering and Technology, 2011.
[127] Assel Issabekova, Olga Berillo, Mireille Regnier, and Anatoly Ivashchenko. Interactions
of intergenic microRNAs with mRNAs of genes involved in carcinogenesis. Bioinformation, 8(11):513–518, June 2012.
[128] Anatoly Ivashchenko, Galina Boldina, Aizhan Turmagambetova, and Mireille Régnier.
Using profiles based on hydropathy properties to define essential regions for splicing.
International Journal of Biological Sciences, 5:13–19, 2009.
[129] Alex Levin, Mieszko Lis, Yann Ponty, Charles W O’Donnell, Srinivas Devadas, Bonnie
Berger, and Jérôme Waldispühl. A global sampling approach to designing and reengineering RNA secondary structures. Nucleic Acids Research, 40(20):10041–52, November
2012.
[130] Andy Lorenz and Yann Ponty. Non-redundant random generation algorithms for
weighted context-free languages. Theoretical Computer Science, 502:177–194, September
2013.
BIBLIOGRAPHY
111
[131] Sébastien Loriot, Frederic Cazals, and Julie Bernauer. Esbtl: efficient pdb parser and
data structure for the structural and geometric analysis of biological macromolecules.
Bioinformatics, 26(8):1127–8, April 2010.
[132] Daniel Morvan, Jean-Marc Steyaert, Laurent Schwartz, Maurice Israel, and Aicha Demidem. Normal human melanocytes exposed to chronic insulin and glucose supplementation undergo oncogenic changes and methyl group metabolism cellular redistribution.
AJP - Endocrinology and Metabolism, 302(11):E1407–18, June 2012.
[133] Gayun Park, Hsien-Kuei Hwang, Pierre Nicodème, and Wojciech Szpankowski. Profile
of tries. SIAM Journal on Computing, 38(5):1821–1880, 2009.
[134] Vladimir Reinharz, Yann Ponty, and Jérôme Waldispühl. A weighted sampling algorithm for the design of RNA sequences with targeted secondary structure and nucleotide
distribution. Bioinformatics, 29(13):i308–i315, July 2013.
[135] Cédric Saule, Mireille Regnier, Jean-Marc Steyaert, and Alain Denise. Counting RNA
pseudoknotted structures. Journal of Computational Biology, 18(10):1339–1351, October
2011.
[136] Jennifer Schmidt, Chen Chien-Chi, Saad Sheikh, Mark Meekan, Bradley Norman, and
Shoou-Jeng Joung. Paternity analysis in a litter of whale shark embryos. Endangered
Species Research, 12(2):117–124, August 2010.
[137] Laurent Schwartz, Adeline Guais, Maurice Israël, Bernard Junod, Jean-Marc Steyaert,
Elisabetta Crespi, Gianfranco Baronzio, and Mohammad Abolhassani. Tumor regression
with a combination of drugs interfering with the tumor metabolism: efficacy of hydroxycitrate, lipoic acid and capsaicin. Investigational New Drugs, page epub ahead of print,
July 2012.
[138] Evan Senter, Saad Sheikh, Ivan Dotu, Yann Ponty, and Peter Clote. Using the fast fourier
transform to accelerate the computational search for RNA conformational switches. PLoS
ONE, 7(12):e50506, December 2012.
[139] Saad Sheikh, Phillippe Chassignet, Jean-Marc Steyaert, and Thuong Van Du Tran. A
graph-theoretic approach for classification and structure prediction of transmembrane
beta-barrel proteins. BMC Genomics, 2012.
[140] Adelene Y L Sim, Olivier Schwander, Michael Levitt, and Julie Bernauer. Evaluating
mixture models for building RNA knowledge-based potentials. Journal of Bioinformatics
and Computational Biology, 10(2):1241010, April 2012.
[141] Thuong Van Du Tran, Philippe Chassignet, and Jean-Marc Steyaert. Prediction of
super-secondary structure in α-helical and β-barrel transmembrane proteins. BMC Bioinformatics, 2009(10 (Suppl. 13)), October 2009.
[142] Thuong Van Du Tran, Philippe Chassignet, and Jean-Marc Steyaert. Supersecondary
structure prediction of transmembrane beta-barrel proteins. Methods in Molecular Biology
-Clifton then Totowa-, 932:277–94, 2013.
[143] Thuong Van Du Tran, Philippe Chassignet, and Jean-Marc Steyaert. On permuted
super-secondary structures of transmembrane β-barrel proteins. Theoretical Computer
Science, 2014. Accepted, to appear.
[144] Jérôme Waldispühl and Yann Ponty. An unbiased adaptive sampling algorithm for the
exploration of RNA mutational landscapes under evolutionary pressure. Journal of Computational Biology, 18(11):1465–79, November 2011.
BIBLIOGRAPHY
112
[145] Yang Zhang, Yann Ponty, Mathieu Blanchette, Eric Lecuyer, and Jérôme Waldispühl.
SPARCS: a web server to analyze (un)structured regions in coding RNA sequences. Nucleic Acids Research, 41(Web Server issue):W480–5, 2013.
III.6.3
[146] Patrick Amar and Loı̈c Paulevé. HSIM: an hybrid stochastic simulation system for systems biology. In The Third International Workshop on Static Analysis and Systems Biology
(SASB 2012), Deauville, France, September 2012.
[147] Cyril Banderier, Olivier Bodini, Yann Ponty, and Hanane Tafat. Biodiversity of pattern
distributions in combinatorial ecosystems. In Conrado Martinez and Hsien-Kuei Hwang,
editors, ANALCO - 12th SIAM Meeting on Analytic Algorithmics and Combinatorics - 2012,
pages 107–116, Kyoto, Japon, 2012. Society for Industrial and Applied Mathematics, Omnipress.
[148] Cyril Banderier and Pierre Nicodeme. Bounded discrete walks. In Michael Drmota and
Bernhard Gittenberger, editors, AOFA - 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms - 2010, volume 113 of
Discrete Mathematics and Theoretical Computer Science Proceedings, pages 35–48, Vienna,
Autriche, June 2010. Discrete Mathematics and Theoretical Computer Science.
[149] Olivier Bodini and Yann Ponty. Multi-dimensional boltzmann sampling of languages. In
Michael Drmota and Bernhard Gittenberger, editors, AOFA - 21st International Meeting on
Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms - 2010,
volume 113 of Discrete Mathematics and Theoretical Computer Science Proceedings, pages
49–64, Vienna, Autriche, 2010. Discrete Mathematics and Theoretical Computer Science.
[150] Thomas Bourquard, Julie Bernauer, Jérôme Azé, and Anne Poupon. Comparing voronoi
and laguerre tessellations in the protein-protein docking context. In F. Anton and J.
Andreas Bærentzen, editors, Sixth annual International Symposium on Voronoi Diagrams,
pages 225 – 232, Copenhagen, Danemark, June 2009. Technical University of Denmark,
IEEE Computer Society.
[151] Peter Clote, Lou Feng, and Alain Denise. A new approach to suboptimal pairwise sequence alignment. In CompBio 2011: IASTED International Conference on Computational
Bioscience, Cambridge, Royaume-Uni, 2011.
[152] Jérémie Du Boisberranger, Danièle Gardy, and Yann Ponty. The weighted words collector. In Broutin Nicolas and Devroye Luc, editors, AOFA - 23rd International Meeting on
Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms - 2012,
volume dmAQ01 of Discrete Mathematics and Theoretical Computer Science Proceedings,
pages 243–264, Montreal, Canada, 2012. Discrete Mathematics and Theoretical Computer Science.
[153] Feng Lou and Peter Clote. Maximum expected accurate structural neighbors of an RNA
secondary structure. In Proceedings of 1st IEEE International Conference on Computational
Advances in Bio and medical Sciences (ICCABS), pages 123–128, Orlando, États-Unis, 2011.
IEEE Computer Society.
[154] Yann Ponty and Cédric Saule. A combinatorial framework for designing (pseudoknotted)
RNA algorithms. In Teresa Przytycka and Marie-France Sagot, editors, Algorithms in
Bioinformatics (WABI), volume 6833 of Lecture Notes in Computer Science, pages 250–269,
Saarbrucken, Allemagne, 2011. Springer Berlin Heidelberg.
III.6.4. CONFÉRENCES NATIONALES
113
[155] Vladimir Reinharz, Yann Ponty, and Jérôme Waldispühl. A linear inside-outside algorithm for correcting sequencing errors in structured RNA sequences. In Fengzhu Sun
Minghua Deng, Rui Jiang and Xuegong Zhang, editors, Research in Computational Molecular Biology (RECOMB), volume 7821 of Lecture Notes in Computer Science, pages 199–211,
Beijing, Chine, 2013. Springer.
[156] Vladimir Reinharz, Yann Ponty, and Jérôme Waldispühl. A weighted sampling algorithm
for the design of RNA sequences with targeted secondary structure and nucleotides distribution. In Nir Ben-Tal, editor, ISMB/ECCB - 21st Annual international conference on Intelligent Systems for Molecular Biology/12th European Conference on Computational Biology
- 2013, volume 29 of Bioinformatics, pages i308–i315, Berlin, Allemagne, 2013. Oxford
University Press.
[157] Philippe Rinaudo, Yann Ponty, Dominique Barth, and Alain Denise. Tree decomposition
and parameterized algorithms for rna structure-sequence alignment including tertiary
interactions and pseudoknots. In Ben Raphael and Jijun Tang, editors, Algorithms in
Bioinformatics (WABI), volume 7534 of Lecture Notes in Computer Science, pages 149–164,
Ljubljana, Slovénie, 2012. University of Ljubljana, Springer.
[158] Evan Senter, Saad Sheikh, Ivan Dotu, Yann Ponty, and Peter Clote. Using the Fast
Fourier Transform to accelerate the computational search for RNA conformational
switches (extended abstract). In Fengzhu Sun Minghua Deng, Rui Jiang and Xuegong
Zhang, editors, Research in Computational Molecular Biology (RECOMB), volume 7821 of
Lecture Notes in Computer Science, pages 264–265, Beijing, Chine, 2013. Springer.
[159] Saad Sheikh, Rolf Backofen, and Yann Ponty. Impact of the energy model on the complexity of RNA folding with pseudoknots. In Juha Kärkkäinen and Jens Stoye, editors,
CPM - 23rd Annual Symposium on Combinatorial Pattern Matching - 2012, volume 7354 of
Lecture Notes in Computer Science, pages 321–333, Helsinki, Finlande, 2012. Springer.
[160] Thuong Van Du Tran, Philippe Chassignet, Saad Sheikh, and Jean-Marc Steyaert.
Energy-based classification and structure prediction of transmembrane beta-barrel proteins. In 1st IEEE International Conference on Computational Advances in Bio and medical
Sciences (ICCABS), pages 159–164, Orlando, FL, États-Unis, February 2011. IEEE Computer Society.
[161] Jérôme Waldispühl and Yann Ponty. An unbiased adaptive sampling algorithm for the
exploration of RNA mutational landscapes under evolutionary pressure. In Vineet Bafna
and S. Sahinalp, editors, RECOMB - 15th Annual International Conference on Research in
Computational Molecular Biology - 2011, volume 6577 of Lecture Notes in Computer Science,
pages 501–515, Vancouver, Canada, 2011. Springer Berlin / Heidelberg.
[162] Yu Zhou, Yann Ponty, Stéphane Vialette, Jérôme Waldispühl, Yi Zhang, and Alain Denise.
Flexible RNA design under structure and sequence constraints using formal languages.
In ACM-BCB - ACM Conference on Bioinformatics, Computational Biology and Biomedical
Informatics - 2013, Bethesda, Washigton DC, États-Unis, September 2013. ACM digital
libraries.
III.6.4
[163] Erwan Bigan, Jean-Marc Steyaert, and Stéphane Douady. Properties of random complex
chemical reaction networks and their relevance to biological toy models. In Proceedings of
Journées Ouvertes en Biologie, Informatique et Mathématiques (JOBIM’13), page à paraı̂tre,
Toulouse, France, 2013.
BIBLIOGRAPHY
114
[164] Sebastien Loriot, Frederic Cazals, Michael Levitt, and Julie Bernauer. A geometric
knowledge-based coarse-grained scoring potential for structure prediction evaluation.
In Eric Rivals and Irena Rusu, editors, Journées Ouvertes en Biologie, Informatique et
Mathématiques (JOBIM), pages 109–114, Nantes, France, July 2009. Société Française de
Bioinformatique.
III.6.5
[165] Yann Ponty. Exact ensemble properties in combinatorial dynamic programming
schemes. In Maxime Crochemore, Lila Kari, Mehryar Mohri, and Dirk Nowotka, editors,
Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081),
volume 1 of Dagstuhl Reports, page 58, Dagstuhl, Germany, 2011. Schloss Dagstuhl–
Leibniz-Zentrum fuer Informatik.
[166] Jérôme Waldispühl, Bonnie Berger, Srinivas Devadas, Peter Clote, and Yann Ponty. Efficient Algorithms to Explore the RNA Mutational Landscape. In DM - SIAM Conference
on Discrete Mathematics - 2012, Halifax, Canada, 2012. SIAM Activity Group on Discrete
Mathematics.
III.6.6
Thèses
[167] Mahsa Behzadi. Un modèle mathématique de la biosynthèse des phospholipides. These, Ecole
Polytechnique X, July 2011.
[168] Philippe Chassignet. Modelisation et analyse automatisée de la radiographie de la main de
l’enfant. These, Ecole Polytechnique X, November 2012.
[169] Thuong Van Du Tran. Modeling and predicting super-secondary structures of transmembrane
beta-barrel proteins. These, Ecole Polytechnique X, December 2011.
III.6.7
Rapports techniques
III.6.8
Logiciels
III.6.8.1
VARNA – Visualizing and editing RNA secondary structure
Authors: Y. Ponty & A. Denise (LRI, Paris XI)
A lightweight Java Applet dedicated to the quick drawing of an RNA secondary structure. VARNA
is open-source and distributed under the terms of the GNU GPL license. Automatically scales up
and down to make the most out of a limited space. Can draw multiple structures simultaneously.
Accepts a wide range of documented and illustrated options, and offers editing interactions. Exports the final diagrams in various file formats (svg,eps,jpeg,png,xfig)...
VARNA currently ships in its 3.8 version, and consists in ∼50 000 lines of code in ∼250 classes.
It has been downloaded ∼10 000 times and is cited by ∼150 research manuscripts (source: Google
Scholar).
Availability: Distributed under the GPL v3 licence since 2009 at http://varna.lri.fr
III.6.8.2
GenRGenS – Generation of Random Genomic Sequences
Authors: Y. Ponty & A. Denise (LRI, Paris XI)
A software dedicated to the random generation of sequences. Supports different classes of models, including weighted context-free grammars, Markov models, ProSITE patterns...
III.6.8. LOGICIELS
115
GenRGenS currently ships in its 2.0 version, and consists in ∼25 000 lines of code in ∼120
Java classes. It has been downloaded ∼5 000 times and is cited by ∼55 research manuscripts
(source: Google Scholar).
Availability: Distributed under the GPL v3 licence since 2006 at https://www.lri.fr/˜genrgens/
III.6.8.3
ESBTL (Easy Structural Biology Template Library)
Authors: J.Bernauer & S.Loriot (Inria Sophia Antipolis)
ESBTL (Easy Structural Biology Template Library) is a lightweight C++ library that allows the
handling of PDB data and provides a data structure suitable for geometric analysis and advanced
constructions. The parser and data model provided by this ready-to-use header-only library
allows adequate treatment of usually discarded information (insertion codes, atom occupancy...)
while still being able to detect badly formatted files. The template-based structure allows rapid
design of new computational structural biology applications and is fully compatible with the new
remediated PDB archive format. It also allows the code to be easy-to-use while being versatile
enough to allow advanced user developments.
Availability: Distributed under the GPL v3 licence since 2010 at http://esbtl.sourceforge.
net/
III.6.8.4
DiMoVo - DIscriminate between Multimers and MOnomers by VOronoi
tessellation
Authors: J.Bernauer
Knowing the oligomeric state of a protein is necessary to understand its function. This tool, accessible as a webserver and still used and maintained, provides a reliable discrimination function
to obtain the most favorable state of proteins. See Bernauer et al., Bioinformatics, 2008 24(5):652658
Availability: http://albios.saclay.inria.fr/dimovo/ (Since 2008)
III.6.8.5
VorScore - Voronoi Scoring Function Server
Authors: J.Bernauer
Scoring is a crucial part of a protein-protein procedure and having a quantitave function to evaluate conformations is mandatory. This server provides access to a geometric knowledge-based
evaluation function. It is still maintained and widely used. See Bernauer et al., Bioinformatics,
2007 23(5):555-562 for further details.
Availability: http://albios.saclay.inria.fr/vorscore/ (Since 2007)
116
BIBLIOGRAPHY
III.7 Annexes : Bio-Informatique
III.7.1
Responsabilités administratives des membres de l’équipe incluant responsabilités de recherche
et d’enseignement
• J. Bernauer
– Membre du Bureau du Comité des Projets (période 2012–2013).
– Correspondante INRIA au GT IDEX Biologie de l’Université Paris-Saclay (période
2012–2013).
• Y. Ponty
– Membre élu du comité national du CNRS en section 6 : Sciences de l’information :
fondements de l’informatique, calculs, algorithmes, représentations, exploitations (période
2012–2016).
– Membre élu du comité national du CNRS en CID 51 : Modélisation et analyse des
données et des systèmes biologiques : approches informatiques, mathématiques et physiques
(période 2012–2016).
– Animateur de l’axe Structure et interactions des macromolécules du GDR 3003 Bioinformatique Moléculaire (période 2013–2016).
– Membre suppléant du conseil de laboratoire, et membre de la commission système du
LIX (période 2012–2013).
• M. Régnier
– Responsable de l’équipe-projet Amib (période 2009–2013).
– Jury de l’agrégation de mathématiques (période 2008–2012).
• J.-M. Steyaert
– Correspondant à Polytechnique pour le master MPRI et membre du Comité de direction. (période 2009-2012).
– Co-responsable du master BIBS (BioInformatique et BioStatistiques), cohabilité ParisSud/Polytechnique depuis 2011. Y. Ponty, M. Régnier et J.-M. Steyaert sont co-responsables
des matières CASM (YP/MR/JMS) et AAO (JMS). (période 2008-2013).
– Président du Comité scientifiquede l’ESIEA (période 2013-).
III.7.1.1
Projet MIGEC (2007-2009) (Type: Equipe associée INRIA) Titre: Mathématiques et Informatique en GEnomique Comparative/Mathematics and Computer Science in Comparative Genomics.
This collaboration aims at developing analytic and statistic criteria to extract and analyse complex motifs distributions along sequences and applying them for full genome sequences. This
includes an experimental checking. Applications focus on the regulatory regions of high level
organisms, such as the man, the mouse or insects. A special interest is given to promoting sequences and CpG islands that control tissues differenciation and cancer development. Partenaires: INRIA/LIX et NII-Genetika (Moscow, Russia). Responsable: M. Régnier. Montant de la
collaboration pour le LIX: 50000/10000 euros.
117
118
CHAPTER III.7. ANNEXES : BIO-INFORMATIQUE
Projet CARNAGE (2012-2014) (Type: CNRS/Inria/Poncelet) Titre: Combinatoire de l’ARN
et Assemblage du GEnome/Combinatorial Algorithms for RNA and Genome assembly.
This collaborative work aims at modeling the structure of RNA molecules and of their interactions. It
extends Monte-Carlo reference states developed by VIGG for proteins for RNA structure and
ion binding position predictions. This project also addresses combinatorial issues arising from
Next Generation Sequencing data. Assembly problems are especially studied, and benchmark
tools are expected. https://team.inria.fr/amib/carnage/. Partenaires: INRIA/LIX, INRIA/MAGNOME et VIGG (Moscow, Russia). Responsable: M. Régnier. Montant de la collaboration pour le LIX: 25000/25000 euros.
Projet GNAPI (2009-2011) (Type: Equipe associée INRIA) Titre: Geometric and knowledgebased analysis for Nucleic Acid and Protein dynamics and Interactions. The project allowed the development of methods to combine both geometric and knowledge-based approaches for a better
prediction of protein and nucleic acid structures, their assemblies and dynamics. This goal was
indeed very ambitious and dealt with research on knowledge-based pair force-fields and extensions to geometric and multi-body interaction terms. These potentials were designed to describe
structures of nucleic acids, proteins but also their assemblies. That required being able to describe the water effects at the interface in a dynamic setting but also exploring the conformational
energy landscapes of these molecules. http://pages.saclay.inria.fr/julie.bernauer/EA_
GNAPI/. Partenaires: INRIA/LIX and Stanford University School of Medicine (USA). Responsable: J. Bernauer. Montant de la collaboration pour le LIX: 40 000/40 000 euros.
Projet ITSNAP (2012-2014) (Type: Equipe associée INRIA) Titre: Intelligent Techniques for
Structure of Nucleic Acids and Proteins. The project is organized around four main axes: multiscale knowledge-based (KB) RNA structure minimization and stability studies, RNA junction
and structure studies by KB dedicated techniques for hierarchical modeling, kinematics-based
conformational sampling and protein-RNA 3D interaction prediction. http://pages.saclay.
inria.fr/julie.bernauer/EA_ITSNAP/.
Partenaires: INRIA/LIX and Stanford University
School of Medicine/SLAC (USA). Responsable: J. Bernauer. Montant de la collaboration pour le
LIX: 40 000/40 000 euros.
Projet CompMiRNA (2012-2013) (Type: PHC Procore) Titre: Computational studies of conformational dynamics of the RNA-induced silencing complex and design of miRNAs to target oncogenes.
The project objectives are: 1- To understand conformational dynamics of the RNAinduced silencing complex (RISC). 2- To apply macromolecular docking strategies in a flexible setting to study miRNA binding to the RISC. 3- To develop knowledge-based potentials for
RNA and protein-RNA interactions to improve the docking scoring functions for miRNA docking. 4- To use specially designed machine learning techniques to design miRNA to target oncogenes by combining docking structural data with available high-throughput experimental data..
Partenaires: INRIA/LIX et Hong-Kong University of Science and Technology. Responsable: J.
Bernauer. Montant de la collaboration pour le LIX: 6000/6000 euros.
III.7.1.2
Projet MAGNUM (2008-2010) (Type: Projet ANR) Titre: Algorithmic methods for the nonuniform random generation: Models and applications. The Magnum project studies non uniform
models for the analysis of algorithms, including the random generation of combinatorial objects.
Our participation in this project is mostly interested in the behavior of random weighted combinatorial objects, and its outcome has mainly consisted in efficient RNA sampling algorithms.
Project homepage: http://www.lix.polytechnique.fr/˜rossin/ANR/Magnum/www/.
Partenaires: LIX, LIP6, INRIA, LIAFA, LIGM et LIPN. Responsable: Y. Ponty. Montant de la collaboration pour le LIX: 600 000 euros/20 000 euros.
III.7.2. ADMINISTRATION DE LA RECHERCHE
119
Projet Prométéines (2011) (Type: PEPS CNRS) Titre: Approches combinatoires pour la prédiction
des interactions ARN-protéines. This exploratory project investigated using random self-avoiding
walks models and algorithms to efficiently predict preferential regions of interactions in short
unpaired RNAs, using a combination of MCMC and color-coding techniques. Partenaires: LIX,
LRI (Paris XI), LIPN (Paris XIII) et IGM (Paris XI). Responsable: Y. Ponty. Montant de la collaboration pour le LIX: 20 000 euros/5 000 euros.
Projet HPC ProtRNA (2013) (Type: GENCI DARI) Titre: Optimizing protein-RNA 3D interaction scoring using machine learning. Partenaires: LIX, LRI (Paris XI), Inria AMIB. Responsable:
J. Bernauer. Montant de la collaboration pour le LIX: 575000 heures CPU.
III.7.1.3
Participation à des projets locaux
RNAomics (2008-2013) (Type: Digiteo grant (chair)) This chair (Peter Clote) aims at studying RNAomics with an emphasis on thermodynamics. Besides the amount below, Digiteo contract included the chair salary (112 000 euros), two PhD students, post-doctoral fellowships (36
months) and mini-cluster funds (35) [151, 135, 154]. Partenaires: LIX/LRI and Boston College.
Responsable: J.-M. Steyaert. Montant de la collaboration pour le LIX: 128 196 euros with 81 859
euros for the LIX.
Projet BioStat (2006-2011) (Type: Philip Morris) Titre: Statistical studies on the impact of nutrition and way of living on cancer and aging diseases. Besides the funds given below, this contract
supported a PhD student for one year. Partenaires: Lix and Paris-Dauphine. Responsable: J.-M.
Steyaert. Montant de la collaboration pour le LIX: 150000 euros.
III.7.2
III.7.2.1
• Journal of Virology (ASM) Jean-Marc Steyaert (2009-). Voir http://jvi.asm.org/.
III.7.2.2
• PSB (Session Multi-resolution Modeling of Biological Macromolecules) (2010,2011). J.
Bernauer.
• ISMB/ECCB (Intelligent Systems for Molecular Biology/European Conference on Computational Biology) (2013). Y. Ponty.
• MCCMB (Moscow conference in computational molecular biology) (2009,2011,2013).
M. Régnier.
• BICOB (Conference on Bioinformatics and Computational Biology) (2012, 2013). Y.
Ponty, M. Régnier, et J.-M. Steyaert.
• JOBIM (Journées Ouvertes en Biologie, Informatique et Mathématiques) (2011, 2012,
2013). Y. Ponty.
• WRSBS (Robustness and Stability of Biological Systems and Computational Solutions)
(2012). J. Bernauer, Y. Ponty et M. Régnier.
120
• CPM (Combinatorial Pattern Matching) (2011). M. Régnier.
• ISMB/ECCB (Intelligent Systems for Molecular Biology/European Conference on Computational Biology) (2009). J.Bernauer.
• Recomb-RG (Regulatory Genomics satellite worskhop of RECOMB) (2009). M. Régnier.
III.7.2.3
• IAMB Integrative Approaches for Modeling Biomolecular Complexes (Workshop in Nice
(in collaboration with McGill Univ and Nice Univ)) (2013). J. Bernauer.
• RNA structures : from genomes to nanotechnology (Invited special session at Ismb/Eccb,
organized by the Digiteo Chair) (2011). P. Clote.
• LIX Colloquium (Colloquium Bioinformatics du LIX) (2011). J. Bernauer, M. Régnier et
Y. Ponty.
• Bioinformatics after Next Generation Sequencing workshop (France-Russia year labellized event) (2010). M. Régnier et V. Makeev.
• MCCMB (Moscow conference on computational molecular biology) (2009,2011,2013).
M. Régnier.
• ALEA (Journées/Ecole thématique CNRS ALEA ) (2011). Y. Ponty.
• Models for Cell Metabolism (Journée d’exposés invités) (2012,2013). J. Bernauer, M.
Régnier et J.-M. Steyaert.
• ISMB/ECCB (Invited special session RNA structure: from genomes to nanotechnology)
(2011). P. Clote.
• ICBD (Biomolecular Dynamics: Experiment Meets Computation (at KAUST)) (2013). J.
Bernauer.
III.7.2.4
• Arbitrage appel à projet UEFISCDI (2011, 2013) Y. Ponty. Research Council Romania.
• Commission de recrutement (2013) M. Régnier. Université de Taiwan.
Au niveau national
• ANR (2009-2011) M. Régnier. Comité d’évaluation des projets..
• Digiteo (2011-2013) M. Régnier. Comité de programmation et d’évaluation des projets..
• Arbitrage appel à projet EMERGENCE(S) (2011) Y. Ponty. Mairie de Paris.
III.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION
121
• INRIA (J.Bernauer) Membre. Jury Recrutement CR2. 2013
• coCNRS (2012-2016) Y. Ponty. Membre élu du comité national du CNRS, à la fois en
section 6 (Sciences de l’information : fondements de l’informatique, calculs, algorithmes,
représentations, exploitations) et CID 51 (Modélisation et analyse des données et des systèmes
biologiques : approches informatiques, mathématiques et physiques)..
• IGR UFR, LIP6, Université Pierre et Marie Curie (Y. Ponty) 2013
• MCF UFR, PRISM, Université de Versailles/St Quentin (Y. Ponty) 2012
• MCF IUT, PRISM, Université de Versailles/St Quentin (Y. Ponty) 2011
• MCF UFR, LaBRI, Université de Bordeaux I (M. Régnier) 2012
• Chaire Inria-Paris XI (M. Régnier) 2010
• INRIA (M. Régnier) Représentation scientifique dans des recrutements administratifs.
Jury interne. 2010
• Postdoc QUALCOMM, LIX, Ecole Polytechnique (Y. Ponty) 2011
• Postdoc QUALCOMM, LIX, Ecole Polytechnique (J. Bernauer) 2012
III.7.3
III.7.3.1
Thèses de doctorat
• Thuong Van Du Tran (Décembre 2011). Modeling and predicting super-secondary structures of transmembrane beta-barrel proteins. Encadrant: J.-M. Steyaert.
• Mahsa Behzadi (Juillet 2011). Un modèle mathématique de la biosynthèse des phospholipides. Encadrant: J.-M. Steyaert.
• Philippe Chassignet (29 novembre 2012). Modélisation et analyse automatisée de la radiographie de la main de l’enfant. Encadrant: J.-M. Steyaert.
III.7.3.2
Jurys d’habilitations à diriger des recherches
• Jérémie Bourdon (5 Décembre 2012). Sources probabilistes des séquences aux systèmes.
Membre: Laboratoire d’informatique de Nantes-Atlantique (Lina). M. Régnier
Rapports de thèse
• Cédric Loi (31 Mai 2011). Inférence bayésienne Markov, Processus de Modèle de Markov
Caché Modèle de croissance de plantes Plantes – Croissance Processus stochastiques . Ecole
Centrale de Paris. Rapporteur: Mireille Régnier.
• Oumarou Abdou Arbi (30 septembre 2013). Etude de la variabilité des contributions de
nutriments à un réseau métabolique : modélisation, optimisation et application en nutrition. Université de Rennes 1. Rapporteur: Mireille Régnier.
122
Jurys de thèse
Y. Ponty, M. Régnier et Jean-Marc Steyaert ont participé à des jurys de thèse à l’Ecole Polytechnique, Paris-Sud, ESIEA, Clermont-Ferrand, Laval, Lille, Nancy et Nantes.
III.7.3.3
• Master BIBS, Paris XI/Ecole Polytechnique – 2009–2013. Cours : Combinatoire, Algorithmes, Séquences et Modélisation (CASM) (4×28h). Intervenant(s): Y. Ponty, M. Régnier
et J.-M. Steyaert
• Master BIBS, Paris XI/Ecole Polytechnique – 2009–2013. Cours : Advanced Algorithms and
Optimization (AAO) (4×28h). Intervenant(s): J.-M. Steyaert
• Master BIBS, Paris XI/Ecole Polytechnique – 2010–2013. Cours : Informatique théorique et
Programmation Python (20h). Intervenant(s): J. Bernauer
• Master BIM, Université Pierre et Marie Curie, Paris – 2009–2013. Cours : Modélisation et
bioinformatique de l’ARN (4×12h). Intervenant(s): Y. Ponty
• Programme doctoral, Al Farabi University (Almaty, Kazakhstan) – 2009,2012. Cours :
Bioinformatics (2× 20h). Intervenant(s): M. Régnier
• Master of Science Computational Biology, Université de Nice – 2009. Cours : Algorithmic
Problems in Computational Structural Biology (9h). Intervenant(s): J. Bernauer
Jury
• Agrégation de Mathématiques – Option Informatique (2009-2012). M. Régnier.
• Ecole Polytechnique Concours d’admission, validation de 3e et 4e année. J.-M. Steyaert.
• Formation professeurs des classes préparatoire, CIRM – 2011. Cours : Mots et motifs:
combinatoire et asymptotique” (5h). Intervenant(s): M. Régnier
• Retraite de l’IGM (Paris-Sud), Seillac – 2012. Cours : A brief tutorial on RNA folding
methods and resources... (2h). Intervenant(s): Y. Ponty
• EMBO Tutorial at VIZBI’12, EMBL Heidelberg – 2012. Cours : 2D & 3D Structures of RNA
(Yann Ponty & James Procter) (3h). Intervenant(s): Y. Ponty
• Tutorial, Pacific Symposium on Biocomputing, Hawaii, USA – 2010,2011. Cours : Multiresolution Modeling of Macromolecular Assemblies (3h). Intervenant(s): J. Bernauer
• Practical Course, Stanford-Sweden multiresolution Molecular simulation workshop, Uppsala Universitet, Sweden – 2011. Cours : Dock blaster tutorial (3h). Intervenant(s): J.Bernauer
Vulgarisation
• Lycée Blaise Pascal – 2013. Séminaire de vulgarisation (2h) en direction de ∼50 élèves de
terminales, autour du repliement et design de l’ARN, et co-organisé par l’Inria et l’académie de
Versailles. Intervenant(s): Y. Ponty
• Nuit des chercheurs, Ecole Polytechnique – 2012. Animation ARN Kezako ?, dédiée aux
repliement et design de l’ARN. Intervenant(s): J. Bernauer, Y. Ponty et M. Régnier
III.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ
123
• Interview sur le site Interstices – 2012. Titre: ”Mieux comprendre certaines molécules biologiques grâce à l’informatique”. Intervenant(s): Y. Ponty
• Évènement ”Unithé ou café” de l’Inria Saclay – Avril 2012. Présentation ”Faire danser
virtuellement des ARN”. Intervenant(s): Y. Ponty
• Fête de la science à Saclay – 2011. Animation du stand de l’Inria. Intervenant(s): J. Bernauer,
Y. Ponty et M. Régnier
• 12e Salon Culture et Jeux Mathématiques, Paris – 2011. Animation ”Construisons des
ARN !” à l’occasion de l’année de la chimie. Intervenant(s): J. Bernauer, Y. Ponty et M. Régnier
III.7.4
III.7.4.1
Rencontres scientifiques sur invitation
• TBI WinterSeminar (2013). Y. Ponty à participé à la retraite du Theoretical Biochemistry
Institute (Bled, Slovénie) et exposé Parameterized-complexity algorithms for the sequence/structure
alignment problem..
• VIZBI (2012). Y. Ponty a participé à la conférence VIZBI’12, consacrée à la visualisation de
données biologique. Présentation d’un tutorial invité 1/2/3D visualization of RNA avec Jim
Procter (Univ. Dundee, Ecosse) et d’un exposé long Visualizing 2D & 3D Structures of RNA.
• Benasque RNA meeting (2009 et 2012). Y. Ponty a été invité par E. Rivas et E. Westhof à
présenter ses travaux en bioinformatique des ARN (6 exposés au total répartis sur les des
deux éditions) lors de l’évènement.
• LPS&LAW (2012). M. Régnier a été invitée par L. Mouchard à présenter un exposé.
• Séminaire Dagstuhl Combinatorial and Algorithmic Aspects of Sequence Processing,
(Saarbrücken, Allemagne) (2011). Y. Ponty a été invité à présenter des travaux en algorithmique des séquences.
• Boston (2011). Jean-Marc Steyaert a présenté un mini-cours sur les méthodes asymptotiques en combinatoire des structures à une école d’été sur l’ARN.
• International Conference on Biomolecular Dynamics: Experiment Meet Computation,
KAUST, Saudi Arabia (2013). Julie Bernauer a présenté ses travaux sur le Knowledge-based
modelling of RNA molecules and their interactions..
• Computational Structural Biology workshop at HKUST, Hong-Kong (2012). Julie Bernauer
a présenté ses travaux sur le Multi-scale modelling for RNA structures: a challenge..
III.7.4.2
Invitations
• McGill University (2010, 2011, 2012). Y. Ponty a été invité (30 j. au total) dans le cadre
d’une collaboration avec J. Waldispühl.
124
III.8 Références externes
[170] Yuval Benjamini and Terence P. Speed. Summarizing and correcting the GC content bias
in high-throughput sequencing. Nucleic Acids Res, 40(10):e72, May 2012.
[171] J. Bernauer, J. Azé, J. Janin, and A. Poupon. A new protein-protein docking scoring
function based on interface residue properties. Bioinformatics, 23(5):555–562, Mar 2007.
[172] Julie Bernauer, Ranjit Prasad Bahadur, Francis Rodier, Joël Janin, and Anne Poupon.
DiMoVo: a Voronoi tessellation-based method for discriminating crystallographic and
biological protein-protein interactions. Bioinformatics, 24(5):652–8, March 2008.
[173] Julie Bernauer, Anne Poupon, Jérôme Azé, and Joël Janin. A docking analysis of the
statistical physics of protein-protein recognition. Phys Biol, 2(2):S17–S23, Jun 2005.
[174] Valentina Boeva, Andrei Zinovyev, Kevin Bleakley, Jean-Philippe Vert, Isabelle JanoueixLerosey, Olivier Delattre, and Emmanuel Barillot. Control-free calling of copy number alterations in deep-sequencing data using gc-content normalization. Bioinformatics,
27(2):268–269, 2011.
[175] Rhiju Das. Four small puzzles that Rosetta doesn’t solve. PLoS One, 6(5):e20044, 2011.
[176] Hugo Devillers and Sophie Schbath. Separating significant matches from spurious
matches in DNA sequences. Journal of Computational Biology, 19(1):1–12, 2012.
[177] Philippe Flajolet and Robert Sedgewick. Analytic combinatorics. cambridge University
press, 2009.
[178] Uri Keich and Pavel A. Pevzner. Subtle motifs: defining the limits of motif finding algorithms. Bioinformatics, 18(10):1382–1390, 2002.
[179] Marc F. Lensink and Shoshana J. Wodak. Docking and scoring protein interactions: Capri
2009. Proteins, 78(15):3073–3084, Nov 2010.
[180] D. Manocha, Y. Zhu, and W. Wright. Conformational analysis of molecular chains using
nano-kinematics. Comput Appl Biosci, 11(1):71–86, Feb 1995.
[181] David H. Mathews, Matthew D. Disney, Jessica L. Childs, Susan J. Schroeder, Michael
Zuker, and Douglas H. Turner. Incorporating chemical modification constraints into a
dynamic programming algorithm for prediction of RNA secondary structure. Proc Natl
Acad Sci U S A, 101(19):7287–7292, May 2004.
[182] Thahir P. Mohamed, Jaime G. Carbonell, and Madhavi K. Ganapathiraju. Active learning
for human protein-protein interaction prediction. BMC Bioinformatics, 11 Suppl 1:S57,
2010.
[183] Guillermo Rodrigo, Thomas E. Landrain, Eszter Majer, José-Antonio Daròs, and Alfonso
Jaramillo. Full design automation of multi-state RNA devices to program gene expression
using energy-based optimization. PLoS Comput Biol, 9(8):e1003172, Aug 2013.
[184] Wojciech Szpankowski. Average Case Analysis of Algorithms on Sequences. Wiley Series in
Discrete Mathematics and Optimization. Wiley-Interscience, 2001.
AMIBBio-Informatique
125
126
BIBLIOGRAPHY
IV Équipe Combinatoire (COMBI)
127
IV.1 Liste des membres : Combinatoire
IV.1.1
IV.1.1.1
Membres permanents
Nom
Gilles Schaeffer
Ekaterina Vassilieva
Luca Castelli-Aleardi
Éric Fusy
Marie Albenque
Dominique Rossin
Vincent Pilaud
Maks Ovsjanikov
Sylvie Jabinet
IV.1.1.2
Fonction
DR, PCC
CR
MdC
CR, CHE
CR
CR, PCC
CR
MDC
Assistant
Employeur
CNRS, École Polytechnique
CNRS
CNRS
CNRS
CNRS
HDR
HDR
HDR
Arrivée
200220042008200920092010201220122011-
Doctorants
Nom
Gwendal Collet
Olivier Schwander
Financement
AMN
AMN
Arrivée
20112009-
Encadrant
É. Fusy
F. Nielsen
Postdoctorants
Nom
Viorica Patraucean
IV.1.1.3
Financement
Qualcomm
Dates
2012-2013
Responsable
M. Ovsjanikov
Nom
Menelaos Karavelas
Financement
DIGITEO
Dates
Mar 2013-
Invitant
L. Castelli Aleardi
Stagiaires Master 2
Nom
Quentin de Mourgues
Financement
ANR Magnum
Dates
Juin-Aout 2013
Responsable
D. Rossin
Autres
Nom
Anatoly Kostrygin
Fonction
Stagiaire M1
Financement
129
Dates
Avril 2013-
Position actuelle
Etudiant en thèse
CHAPTER IV.1. LISTE DES MEMBRES : COMBINATOIRE
130
IV.1.2
Anciens membres
IV.1.2.1
Membres permanents
Nom
Frank Nielsen
Dominique Poulalhon
IV.1.2.2
Fonction
Professeur
MdC
Employeur
Paris 7
HDR
HDR
Départ
-2011
-2013
Position actuelle
Sony
Paris 7
Doctorants
Nom
Guillaume Chapuy
Financement
AMN
Départ
2009
Encadrant
G. Schaeffer
Position actuelle
CR CNRS au LIAFA
Postdoctorants
Nom
Axel Bacher
Sylvain Boltz
Chris Dowden
Juanjo Rué
Vincent Garcia
IV.1.2.3
Financement
ERC
Qualcomm
ERC
ERC
ANR
Dates
2011-2012
2009-2010
2009-2010
2009-2010
2008-2009
Responsable
G. Schaeffer
F. Nielsen
G. Schaeffer
G. Schaeffer
F. Nielsen
Position actuelle
Post-doc
Office européen des brevets
Post-doc
Post-doc
Ingénieur R&D
Autres membres
Nom
Alejandro H. Morales
Alain Goupil
Louis François Preville Ratelle
Michael Albert
Financement
ERC
ERC
NSERC
DIGITEO
Dates
Juin-Août 2008
Sept-Oct 2011
Nov 2011-Feb 2012
Oct 2012
Invitant
G. Schaeffer & E. Vassilieva
G. Schaeffer
G. Schaeffer & E. Vassilieva
D. Rossin
IV.2 Rapport scientifique : Combinatoire
IV.2.1
Introduction
Composante historique du LIX, l’équipe de Combinatoire s’est restructurée au début de la période
2008-2013 autour du projet ExploreMaps soutenu par l’ERC au titre des Research Starting Grants,
en se donnant comme thème principal de recherche, la combinatoire énumérative et l’algorithmique des cartes, ie des représentations combinatoires de plongements de graphes dans une
surface. Autrement dit, le projet initial de l’équipe était celui d’explorer une combinatoire de la
géométrie, avec un intérêt particulier pour les objets de nature essentiellement bidimensionnelle,
et à partir de compétences méthodologiques allant de l’énumération exacte et asymptotique à
l’analyse d’algorithmes ou la combinatoire algébrique, de la génération aléatoire à la conception
de structures de données succinctes et au dessin de graphe.
Au fil de l’extension de notre champs de recherche et de la croissance de l’équipe, nous
avons entrepris l’exploration d’autres facettes de la relation entre combinatoire et géométrie,
autour d’objets tels que les revêtements ramifiés ou les polytopes, et c’est finalement cette coloration géométrique/topologique de la combinatoire qui nous intéresse qui fait la spécificité de
notre équipe dans le paysage national et international. Au plan local, c’est aussi ce qui nous a
amené à abriter au sein de l’équipe des thèmes de recherche connexes autour de l’analyse de
données géométriques et de l’analyse géométrique de données: si les outils mis là en œuvre sont
différents, une partie des objets manipulés sont communs, ce qui permet une certaine convergence d’intérêts.
IV.2.2
La combinatoire bijective, les cartes Nous voyons les objets combinatoires fondamentaux tels
que les permutations, les arbres ordonnés ou les graphes comme les formes mathématiques élémentaires que peuvent prendre les structures discrètes. La combinatoire bijective peut être comprise
comme une façon d’aborder l’étude des propriétés premières de ces objets. Il est alors naturel
d’attendre que tout progrès significatif dans la compréhension des propriétés combinatoires de
ces objets ait en particulier des retombées en algorithmique, en mathématique, voire dans les
autres sciences naturelles qui utilisent des objets discrets pour leur modélisation, notamment la
physique statistique ou la génomique.
Notre intérêt pour les cartes procède de cette démarche. De même qu’on peut dire des arbres combinatoires qu’ils capturent les propriétés fondamentales des structures arborescentes,
les cartes sont l’outil de choix lorsqu’on veut comprendre combinatoirement des structures de
dimension deux. De ce fait nos travaux rencontrent, au delà de la combinatoire, un écho plus particulier en géométrie algorithique, en physique autour de questions de construction de modèles
de la gravité quantique, et en mathématique autour de questions de probabilités et de topologie
énumérative.
Dans ces travaux fondamentaux les questions d’énumération nous servent à la fois de motivation initiale et de guide pour avancer: lorsqu’un calcul montre l’existence d’une formule
d’énumération simple pour une famille d’objets combinatoires, nous l’interprétons comme la
trace d’une propriété structurelle sous-jacente encore à découvrir. Cette démarche, héritée de
la grande école bordelaise de combinatoire bijective, se révèle particulièrement fructueuse pour
l’étude des cartes.
Exploration de cartes, arbres et orientations Cette première direction de recherche est née
de l’observation par des membres de l’équipe au début des années 2000 qu’un certain nombre
d’algorithmes classiques d’exploration de graphes (parcours en largeur, parcours en profondeur,
parcours eulériens, etc) sont naturellement associés à des familles de cartes pour lesquelles ils
conduisent à des décompositions bijectives en terme de familles simples d’arbres.
131
132
CHAPTER IV.2. RAPPORT SCIENTIFIQUE : COMBINATOIRE
Ces résultats d’énumération bijective de cartes ont connu un retentissement certain, à la fois
pour leur élégance —il s’agit des premières preuves éclairantes de vieux résultats d’énumération
particulièrement simples et restés jusque là mystérieux— et pour les avancées qu’ils ont permis
dans des domaines connexes, en particulier l’algorithmique du dessin de graphes ou le codage
compact de maillages, et l’étude probabiliste de modèles de surfaces aléatoires issus de la gravité
quantique (voir plus bas).
De nombreuses variantes ou extensions de ces premières constructions ont été obtenues au fil
des ans, par des membres de l’équipe et d’autres combinatoristes (Bernardi , Bousquet-Mélou,. . . ),
mais aussi par des probabilistes (Miermont, Bettinelli,. . . ) ou des physiciens (Bouttier, di Francesco,
Guitter, Budd,. . . ). Il est ainsi apparu petit à petit que certaines orientations, les α-orientations
minimales, jouent un rôle crucial pour plusieurs de ces bijections.
Technique d’énumération La combinatoire énumérative est passée lors des 50 dernières années
du status de bric-à-brac d’astuces que critiquait les mathématiciens sérieux du siecle dernier à
celui d’une discipline bien établie sur quelques fondements qu’on réunit aujourd’hui sous les
termes de méthode symbolique et combinatoire analytique, pour reprendre la terminologie de l’un
des maı̂tres à penser du domaine, Philippe Flajolet.
Malgré ce tableau bucolique, la frontière du domaine reste toujours peuplée d’équations exotiques résolues par des tours de force et d’ingéniosité. Nous nous intéressons dans ce domaine
plus particulièrement aux équations à variables catalytiques, qui interviennent fréquemment
dans les questions d’énumérations de cartes: si les équations polynomiales à une variables catalytiques sont maintenant bien comprises grâce aux travaux de Bousquet-Mélou notamment, les
équations même linéaires à plusieurs variables catalytiques ou leurs variantes exp / log continuent de poser de nombreuses questions.
Aléa discret Notre équipe s’inscrit naturellement dans le groupe de travail ALEA du GDR IM:
ce groupe de recherche est le lieu de la rencontre d’outils issus de l’informatique théoriques
et de la théorie des langages (au sens initial de Chomsky-Schützenberger), de la combinatoire
énumérative et analytique et des probabilités autour d’objets aléatoires issus de l’analyse d’algorithmes, des mathématiques discrètes ou de la physique. Une question fondamentale de ce
domaine est de savoir décrire des structures aléatoires de grande taille. L’exemple de base est
celui de l’analyse du temps d’exécution moyen de l’algorithme de tri quicksort randomisé, qui se
ramène à la question de connaı̂tre le comportement moyen d’un certain paramètre des grandes
permutations aléatoires uniformes.
Une variante jusqu’ici relativement moins étudiée de ces analyses en moyenne (de la complexité) d’algorithmes est celle de l’analyse en moyenne de leur qualité de sortie, dont nous avions
proposé un premier exemple il y a quelques années dans le contexte du dessin de graphe. La
question est de dessiner une triangulation à n sommets en plaçant ses sommets sur d’une grille
N × N aussi petite que possible. Alors que la complexité dans le pire cas dit que N doit être égal
au moins à n − 2, nous avons montré que pour une triangulation aléatoire, la taille de la grille
nécessaire est sensiblement plus petite en moyenne.
Enfin un outil fondamental de l’étude de l’aléa discret est fourni par les algorithmes de
génération aléatoire. En permettant d’engendrer des objets aléatoires de grande taille selon
une distribution prescrite à l’avance, ces algorithmes offrent la possibilité d’observer in silico
les propriétés limites d’objets rétifs à l’analyse. Utilisés de longue date en physique statistique,
la génération aléatoire a longtemps fait appel quasi exclusivement à la méthode de simulation
de chaine de Markov: cette méthode permet dans de nombreux cas d’obtenir facilement des objets aléatoires dont la distribution tends vers la distribution souhaitée, mais à quelques rares
exceptions près, la qualité de l’approximation obtenue n’est pas facilement controlable. Sous
l’impulsion notamment de Philippe Flajolet, se sont développées des techniques de génération
aléatoire alternatives telles que la génération récursive ou plus récemment la génération Bolzmanienne, à l’emergence de laquelle plusieurs membres de l’équipe ont contribué. Ces approches donnent des algorithmes beaucoup plus efficaces et elles sont automatisables pour de
IV.2.2. THÈMES DE RECHERCHE
133
grandes classes de structures dites décomposables. Un des challenges de ce domaine est de faire
entrer des objets complexes, non facilement décomposables, dans le champs d’application de ces
méthodes.
Compression et structures de données compactes Parmi les applications algorithmiques de la
combinatoire des cartes, l’une des plus importantes est le codage de structures données. Plusieurs
membres de notre équipe ont contribué avec leurs travaux aux domaines de la compression de
données et de la conception de représentations compactes. En particulier, les décompositions bijectives à base d’arbres bourgeonnants ont conduit aux premièrs codages optimaux pour des
objets tels que les triangulations et les graphes 3-connexes, correspondant à la connectivité sousjacente aux maillages triangulaires et polygonaux (le problème de comprimer efficacement de
telles structures avait fait l’objet de nombreux travaux dans les communautés de la géométrie
algorithmique et de la modélisation geómétrique). En plus des questions de simple compression,
l’attention a été aussi portée sur l’étude de structures de données nécessitant une petite quantité
de ressource mémoire et permettant de répondre à des requêtes locales en temps constant. Dans
ce cadre, nous nous sommes interessés à la conception de solutions théoriques (représentations
succinctes) dont la coût mémoire est asymptotiquement optimal, ainsi qu’à la réalisation pratique de structures de données compactes, dont l’implémentation garantit en pratique un bon
compromis entre l’espace mémoire utilisé et l’efficacité de la navigation et de la mise à jour. Encore une fois, les propriétés combinatoires mentionnées auparavant (décompositions bijectives
et orientations minimales) ont joué un rôle crucial dans l’obtention de telles structures.
Géométrie de la combinatoire L’idée de mettre en évidence géométriquement des propriétés
combinatoires est ancienne et naturelle: rien ne montre de manière plus convaincante la symétrie
d’un objet abstrait que d’en donner une réalisation concrète symétrique. Au delà de cet exemple
naı̈f, une façon fondamentale de donner une géométrie à une structure combinatoire est de la
réaliser sous forme d’un polyèdre, de sorte que les propriétés de ce polyèdre (dimension, convexité, sphéricité, shellability, etc) en reflettent ou expliquent les propriétés combinatoires. Pour
illustrer cette approche par des exemples en relation directe avec les travaux de l’équipe, citons
d’une part l’existence d’un polytope dont les sommets correspondent aux α-orientations d’un
graphe donné, qui sont des outils fondamentaux pour l’étude des cartes planaires, et d’autre part
les constructions récentes de l’associaèdre qui mettent en lumière les connexions entre les triangulations d’un (n + 3)-gone convexe et les permutations de [n + 1]. Cette approche, très éclairante
lorsqu’elle s’applique, est cependant réputée difficile: les polyèdres sont des objets en grande
dimension, qui ne deviennent réellement accessibles que lorsqu’on peut décrire algorithmiquement leur construction et leur géométrie. Ce point de vue, apporté récemment dans l’équipe par
Pilaud, vient enrichir notre dialogue entre combinatoire et géométrie.
Analyse de données et géométrie Les interactions entre analyse de données et géométrie forment un champs d’investigation extrêmement large au sein duquel deux grands axes nous concernent particulièrement. D’un côté pour les données d’origine géométrique (images, modèles
3d, etc) Ovsjanikov et ses collaborateurs travaillent sur des questions de mise en correspondance de formes non-rigides: le challenge est ici de développer des méthodes robustes, capables
de passer à l’échelle sur des données massives (typiquement plusieurs dizaines de milions de
pixels, points ou triangles) pour une utilisation dans la comparaison de forme ou la recherche
dans une base (data retrieval). D’un autre côté, une des idées qui sous-tendent les travaux de
Nielsen et ses collaborateurs est que les techniques d’analyse géométriques peuvent être adaptées
à l’étude d’objets de nature a priori non géométrique, en les voyant justement comme munie
d’une géométrie propre dans un espace de paramètres bien choisi, notamment dans le cadre de
la géométrie de l’information. L’application de ces idées à l’apprentissage (machine learning),
au traitement du langage (pattern matching), ou à la bioinformatique conduit à considérer des
géométries très différentes de la géométrie euclidienne usuelle mais qui rentrent souvent dans
le cadre des mesures de distorsion de Bergman et des familles exponentielles. Le défi relevé est
134
alors, plutôt que de travailler au cas par cas, d’étendre d’abord les outils d’analyses géométriques
à ce cadre très général.
IV.2.3
Vers une théorie des bijections entre cartes et arbres L’un des objectifs fondamentaux du
projet ExploreMaps était de réaliser l’unification des nombreuses bijections entre cartes et arbres
apparues depuis le début des années 2000. Dans les articles [199, 328] Bernardi et Fusy d’une
part, et Albenque et Poulalhon d’autre part, ont mis en œuvre ce programme pour les deux
grandes familles de bijections entre cartes et arbres. En s’appuyant dans les deux cas sur la
notion d’α-orientations minimales, ces résultats permettent de présenter sous un même cadre la
quasi totalité des bijections développées jusqu’ici pour les cartes, que ce soit vers des mobiles
étiquetés ou vers des arbres bourgeonnants.
Cartes unicellulaires et surfaces de genre supérieur Si les arbres jouent un rôle central dans la
combinatoire bijective des cartes planaires, le passage à des surfaces de genre supérieur conduit
à donner une grande importance aux cartes unicellulaires. De ce fait plusieurs de nos travaux
fondamentaux portent sur ces objets et en particulier autour de la formule d’Harer et Zagier
pour leur énumération. Le résultat central des travaux de thèse de Guillaume Chapuy [326] ont
permis de franchir une étape importante dans la compréhension de ces objets qui a finalement
débouché dans les travaux récents de Chapuy, Feray et Fusy [277] sur la première preuve bijective directe de la formule de récurrence de Harer et Zagier. En parallèle, les travaux de Vassilieva
et ses coauteurs ont permis de comprendre bijectivement l’interprétation des formules à la Harer
et Zagier en terme de cartes colorées et d’arriver ainsi à traiter le cas le plus général des constellations unicellulaires [256, 236, 325], ainsi qu’à obtenir des résultats dans le cas plus difficile des
cartes sur des surfaces non orientées [289, 324].
Grands graphes et grandes cartes aléatoires Le comportement asymptotique des graphes et
des cartes planaires aléatoires de taille tendant vers l’infini fait l’objet d’une intense activité
ces dernières années, à laquelle participe activement l’équipe. Albenque et Addario-Berry ont
montré [327] que les triangulations simples aléatoires uniformes à 2n arêtes de longueur renor−1/4 convergeaient vers la carte brownienne. Ce résultat, le premier portant sur la
malisée ( 4n
3 )
convergence d’un modèle de cartes satisfaisant des contraintes de connexité, vient renforcer
l’“hypothèse d’universalité” selon laquelle tous les modèles raisonnables de cartes convergent
vers le même objet. Si pour les cartes de nombreux résultats ont déjà été obtenus, le cas des
graphes aléatoires est beaucoup plus difficile. Fusy et ses collaborateurs [278] ont obtenu un premier résultat dans cette direction et ont montré que le diamètre des graphes planaires aléatoires
uniformes à n sommets est concentré autour de n1/4 .
Ordres canoniques et bois de Schnyder Les travaux de Castelli Aleardi et Fusy, avec Devillers
[272] et Lewiner [210, 275], illustrent parfaitement les retombées algorithmiques que nous attendons de l’étude des orientations dans les cartes: dans le premier cas l’étude des bois de Schnyder sur un cylindre permettent de développer de nouveaux algorithmes de dessins planaires
périodiques de graphes toriques, tandis que dans le second cas l’extension au genre supérieur permet d’obtenir des algorithmes de codages optimaux pour les maillages triangulaires de topologie
arbitraire.
Algorithmique des permutations. Rossin et sa doctorante Pierrot ont résolu un vieux problème
ouvert posé par Knuth dans les années 60, le status polynomial ou NP de la reconnaissance des
permutations triables par deux piles en séries. Ce travail passe par la caractérisation fine d’une
nouvelle sous classe de permutations triables suivant une politique particulière (pushall sortable
IV.2.4. ANIMATION SCIENTIFIQUE, RAYONNEMENT, PRIX ET RÉCOMPENSES
135
permutations) [332]. Grâce à ce premier résultat, techniquement particulièrement difficile, ils
obtiennent dans [333] un algorithme polynomial pour le problème de Knuth.
Décomposabilité des polytopes simpliciaux Pilaud et ses collaborateurs Hähnle et Klee ont
donné dans [233] des obstructions à la décomposabilité faible pour les polytopes simpliciaux
qui ferment une approche possible de la conjecture de Hirsch polynomiale. Cette conjecture, en
étroite relation avec le problème de déterminer la complexité de l’algorithme du simplexe pour
la programmation linéaire, a suscité d’importantes recherches motivées par le récent contreexemple de Santos à la conjecture de Hirsch classique.
Apprentissage rapide de modèles de mélange avec des outils géométriques Dans les articles
[320] [321], Schwander et Nielsen étendent l’approche proposée par Nielsen pour les mélanges de
familles exponentielles. Cette généralisation, qui permet d’utiliser des composantes de mélanges
issues de plusieurs familles exponentielles, permet d’apprendre efficacement des mélanges de
Gaussiennes généralisées et de lois Gamma pour lesquels les outils sur les familles exponentielles
au sens strict étaient inapplicables.
Symétries et appariements d’objets géométriques Dans l’article [247], Ovsjanikov, Patraucean
et leur collègues introduisent une nouvelle méthode pour l’appariement de formes non rigides
présentant des symétries intrinsèques (par ex. une paire de formes humaines). Alors que la
majorité des travaux existants s’efforcent de surmonter cette ambiguité en échantillonant un ensemble de correspondences de motifs caractéristiques (landmark correspondence), l’idée est de
travailler directement dans l’espace quotienté par les symétries présentes. La comparaison de
cette technique avec les meilleures méthodes actuelles montre que des résultats supérieurs peuvent ainsi être obtenu aussi bien dans le cas où la symétrie est connue que dans le cas où elle doit
être estimée.
IV.2.4
Les membres de l’équipe participent à plusieurs comités éditoriaux et de nombreux comités de
programme dont le comité restreint du Journal of Combinatorial theory, Series A et le comité du
nouveau journal édité par la société européenne de mathématique Annals of IHP: Combinatorics,
Physics and Applications.
L’équipe porte les projets ExploreMap (ERC Research Starting Grant, leader Schaeffer), Hardness results in Geometry Processing (FP7 Career Integration Grant, leader Ovsjanikov) and Joint
Analysis of Images and 3D shapes (Google Faculty Award, leader Ovsjanikov).
Le projet ANR GAIA, dont Frank Nielsen était l’un des principaux acteurs a obtenu le Grand
Prix ANR du Numérique en 2013.
IV.2.4.1
Depuis la mise en place du projet européen ExploreMaps, l’équipe organise un séminaire hebdomadaire au LIX.
Les besoins financiers de l’équipe sur la période 2008-2013 ont été en grande partie couverts
par le soutien de l’ERC au projet ExploreMaps pour ce qui touche aux activités autour des cartes,
par l’ANR Magnum pour les activités autour des permutations, ainsi que par l’ANR GAIA pour
les activités autour de l’analyse géométrique de données. De manière plus marginale, nous avons
pris part au projet ANR A3. Enfin nous avons bénéficié du soutien de Qualcomm au LIX. Ces
projets ont notablement permis de financer 72 mois de postdocs et 48 mois de détachements
CNRS au sein de l’équipe.
Plus récemment, les nouveaux membres de l’équipe sont impliqués dans plusieurs projets
nationaux (ANR JCJC Carteaplus et EGOS, chaire d’excellence CNRS), ou internationaux (projet
FP7 CIG et Google Faculty Award).
136
Au total l’équipe a bénéficié sur la période d’environ 800.000 euros de financement (majoritairement en frais de personnel), et l’avenir est assuré à l’horizon de 2/3 ans grâce aux projets
engagés.
IV.2.4.2
L’équipe est impliquée dans la formation sur ses thèmes de recherche principalement au travers
du cours 2-10 du MPRI, aspects algorithmiques. de la combinatoire.
Les thèses effectuées dans l’équipe ont été financées par des bourses d’allocataires normaliens.
IV.3 Projet de recherche : Combinatoire
IV.3.1
Introduction
Une des forces de l’équipe Combinatoire est de réunir en son sein des compétences très variées
autour d’une thématique commune relativement bien définie: les interactions entre combinatoire et géométrie. Notre projet scientifique a pour objectif de tirer partie de cette situation
favorable pour explorer plusieurs directions de recherches qui nous paraissent prometteuses. Ce
sont ces directions communes que nous nous attachons à décrire ci-dessous, en mettant l’accent
sur les outils et les objets fondamentaux: suivant notre philosophie, si la théorie est bonne les
applications suivront.
Par ailleurs, tous membres de l’équipe ont leur specialité propre et leur réseau de collaborations extérieures qui ne sont pas détaillés ici.
Nous considérons fondamental que chacun cultive ainsi une spécificité individuelle et une
ouverture sur le monde extérieur, la plupart des membres de l’équipe étant voués à établir leur
autonomie scientifique et à prendre leur envol à plus ou moins brève échéance.
IV.3.2
Objectifs scientifiques et mise en œuvre
Surfaces, orientations
Comme cela est expliqué dans les pages précédentes, la théorie bijective des cartes est bien
avancée dans le cas planaire: les algorithmes classiques d’exploration de graphe y jouent un rôle
fondamental, de même que les treillis d’orientations. Plusieurs avancées significatives dans le
cas des surfaces de genre g > 0 laissent penser que le cas non-planaire, quoique plus technique,
ne soit pas hors de porté: cependant ces résultats sont encore relativement isolés, en particulier faute d’une bonne compréhension des propriétés des orientations dans ce contexte. Nous
pensons qu’il reste là, pour employer l’expression consacrée, un verrou scientifique majeur: c’est
pourquoi nous voulons porter un effort particulier sur l’étude des propriétés à la fois structurelle
et énumérative de ces orientations. Certains aspects de ce problème sont au cœur du projet ANR
JCJC EGOS dont l’équipe est partie prenante, d’autres font l’objet du démarrage d’une thèse en
cotutelle avec l’équipe combinatoire du LIAFA. Enfin, si les surfaces non-orientées paraissent
encore hors de porté pour les techniques à base d’orientations, les récentes avancées bijectives
dans le cas unicellulaire non-orienté ouvrent des perspectives intéressantes.
Technique d’énumération et aléa discret
La confluence des outils bijectifs, algébriques, probabilistes et algorithmiques qui caractérise la
communauté ALÉA se retrouve, toute proportion gardée, dans notre équipe. Les compétences
pointues dans chacun de ces différents domaines de certains membres de l’équipe donnent régulièrement lieu à des collaborations individuelles extérieures sur des sujets aussi variés que la
bioinformatique, l’étude de modèles d’urnes ou la résolution de systèmes d’équations fonctionnelles combinatoires exotiques et, comme cela a déjà été dit, nous pensons que cela est sain.
Quant aux travaux que nous menons autour des cartes, ils se prolongent naturellement par
l’étude de modèles de surfaces aléatoires. Les résultats déjà mentionnés d’Albenque avec AddarioBerry appellent plus généralement à décrire des conditions suffisantes auxquelles une décomposition bijective en termes d’arbre donne des résultats de convergence vers la carte Brownienne.
En particulier on pourrait espérer obtenir par ce genre de méthodes la convergence vers la carte
Brownienne d’un modèle assez différent comme celui des revêtements ramifiés simples comptés
par la formule d’Hurwitz et pour lesquels Duchi, Poulalhon et Schaeffer ont récemment donné
une construction en terme d’arbres de Cayley.
137
138
CHAPTER IV.3. PROJET DE RECHERCHE : COMBINATOIRE
Dans le contexte quelque peu différent de la géométrie algorithmique, se pose la question
de définir combinatoirement des sous-classes de surfaces ayant une géométrie typique de type
euclidienne. Un objectif à moyen terme dans ce contexte serait de développer des versions
paramétriques des générateurs aléatoires de cartes permettant de contraindre simultanément
les degré des sommets et des faces, afin de comprendre où se situe la transition entre les cartes
aléatoires uniformes (qui converge vers la carte Brownienne, dont la géométrie n’est pas du tout
euclidienne) et les réseaux réguliers.
Algorithmique combinatoire
Comme expliqué ci-dessus, nous attendons naturellement de nos travaux combinatoires qu’ils
débouchent sur des résultats algorithmiques. Ainsi dans le domaine du dessin automatique
de graphes, nos travaux sur les orientations minimales nous permettent de proposer de nouvelles stratégies de dessin contraints sur grilles et d’en mener l’analyse en moyenne pour montrer
qu’elles apportent un gain de compacité. Deux directions se proposent naturellement: étendre
la pratique de l’analyse en moyenne de qualité de sortie pour des algorithmes de dessin existant,
et étendre les résultats de dessin périodique (ou dessin sur un cylindre) aux autres algorithmes
de dessin planaires à base d’orientations et de décompte de faces.
Dans le domaine du codage compact, nous travaillons à des représentations optimales de
familles de maillages, et à la conception de structures de données succinctes: dans ce dernier contexte une difficulté récurrente est de trouver des compromis entre résultats combinatoires, qui
conduisent à des structures optimales mais très rigides, et contraintes pratiques de simplicité et
de flexibilité. Ainsi les travaux récents de Castelli-Aleardi et ses coauteurs ont permis d’obtenir
des structures de données compactes pour les triangulations dont l’implémentation pratique
garantit un bon compris entre taux de compression et temps de requête. Ces représentations
ont été conçues à l’aide au départ d’outils combinatoires tels que les bois de Schnyder. Il serait
intéressant de pousser les stratégies utilisées dans ce cadre (entre autres, le calcul d’une permutation des sommets et cellules du maillage de départ), afin d’obtenir des structures de données pour
des classes plus générales de maillages. On pourrait tirer profit encore une fois des propriétés
des décompositions bijectives à base d’arbres bourgeonnants. En plus d’avoir des représentations
bien plus générales, on pourrait aussi espérer un meilleur taux de compression et une réduction
du coût mémoire dans la phase de construction de la structure. Le cas 3D (maillages volumiques) reste presque totalement à explorer, que ce soit du point de vue de la compression que
de celui des structures de données compactes: nous espérons pouvoir tirer profit d’éventuelles
caractérisations combinatoires (généralisations des orientations de Schnyder) des complexes de
dimension 3, qui font actuellement l’objet d’étude de plusieurs membres de notre équipe.
Motifs, permutations et cartes
Les liens entre énumération de cartes et motifs exclus dans les permutations remontent aux
travaux de Goulden et West et de Guibert dans les années 90 et sont restés un peu oubliés jusqu’à
ce que le sujet soit relancé tout récemment par de nouveaux exemples présentés par Kitaev et ses
coauteurs. Au delà du plaisir de comprendre les coı̈ncidences énumératives qui surgissent dans
ce contexte, nous pensons qu’il y a un réel intérêt à croiser le point de vue algorithmique sur les
motifs exclus porté par Rossin dans son projet de recherche personnel et les compétences autour
de l’aléa discret présentes dans l’équipe: ainsi nous nous proposons de revisiter la conception
d’algorithmes de tri linéaire dans le pire cas pour des familles de permutations définies par motifs exclus à la lumière de l’analyse en moyenne, avec l’espoir qu’il soit plus facile de construire
systématiquement des algorithmes linéaires en moyenne pour ces classes.
Géométrie de la combinatoire
Les travaux menés par Pilaud dans ce cadre autour de la combinatoire et la géométrie de complexes de sous-mots associés aux groupes de Coxeter et sur la réalisation par polytopes de struc-
IV.3.2. OBJECTIFS SCIENTIFIQUES ET MISE EN ŒUVRE
139
tures combinatoires offrent plusieurs points de rencontre avec l’étude des cartes: on peut citer
par exemple l’interprétation en termes de cartes des factorisations dans le groupe symétrique
et la question d’en donner des analogues pour les autres groupes de Coxeter. Dans le but
de développer les interactions au sein de l’équipe autour de ces thèmes plusieurs séances du
séminaire y ont été consacrées et à l’occasion du séjour dans l’équipe de Holweg à l’automne
2013 nous prévoyons qu’il nous donne un cours interne sur le sujet. D’autres thèmes seront
aussi abordés, en particulier la dynamique et les propriétés limites des racines d’un groupe de
Coxeter infini, et les possibles applications aux constructions géométriques pour les treillis Cambriens de groupes infinis. Ces sujets sont dans le prolongement direct des travaux de plusieurs
membres de l’équipe sur les connexions entre le groupe symétrique et le treillis de Tamari sur
les triangulations d’un polygone convexe.
Outils spectraux, géométriques et combinatoires pour l’analyse de graphes
quasi-géométriques
L’analyse et le traitement de grands graphes (type réseaux sociaux, graphe de l’internet, ou
graphes d’interaction d’usagers) font couramment appel à des techniques d’analyse spectrale:
ainsi les valeurs et vecteurs propres de diverses matrices Laplaciennes permettent de décrire la
structure des communautés dans ces réseaux. Cependant une observation récente et encore peu
exploitée est que nombre de ces graphes présentent une nature quasi-géométrique liée au fait que
le monde physique dans lequel évoluent les usagers influencent les relations qu’ils entretiennent.
Dans cette direction notre but est d’exploiter l’expertise de l’équipe autour du dessin de
graphe, du codage de maillage et des outils spectraux pour développer des outils et des techniques pour analyser, compresser et traiter de tels grands graphes. L’idée est en particulier
de tirer partie du lien entre la géométrie du plongement sous-jacent du graphe et sa structure en communauté décrite par les propriétés spectrales: en effet la présence d’une structure
géométrique, peu exploité jusqu’ici, est susceptible d’avoir un profond impact sur les propriétés
du graphe, mais aussi de permettre d’importer dans ce nouveau contexte des techniques de compression, d’exploration ou traitement à grande échelle issues de l’informatique géométrique.
Dimensions supérieures
La plupart des résultats présentés dans ce rapport portent sur des modèles de surfaces aléatoires.
Quid des dimensions supérieures ? Jusqu’ici aucun modèle intéressant combinatoirement, ou
plus généralement avec des propriétés probabilistes convaincantes, n’a vraiment été trouvé: c’est
à la fois un problème notoirement difficile de topologie énumérative et un défi majeur de la
gravité quantique de le faire. Notre intention est de concentrer nos efforts sur cette direction
dans les années à venir.
Dans ce contexte nous avons pour l’instant entrepris d’explorer 2 pistes principales. D’une
part nous travaillons dans le cadre du projet EGOS autour de questions d’orientation de Schnyder en dimension 3, avec comme objectif des applications à la représentation des maillages
3d, comme déjà mentionné plus haut. D’autre part, en collaboration avec des physiciens du
plateau et du LIPN nous avons entrepris l’étude des propriétés énumératives de modèles de complexes simpliciaux inspiré par des modèles de tenseurs aléatoires: nous avons obtenu un premier
résultat important en obtenant l’asymptotique des complexes colorés en dimension D de degré k
quelconque (seul les cas k = 0 et k = 1 étaient connus), et nous travaillons l’extension à certains
complexes orientés en dimension 3. Enfin nous envisageons d’autres pistes, globalement autour
de la question fondamentale de définir des classes non triviales d’objets tridimentionnels admettant des décompositions bijectives en structures de dimension inférieure. L’objectif avoué, peut
être utopique, est de trouver une alternative aux définitions en terme d’épluchage (shellability)
pour espérer définir des sous-classes de complexes intéressantes mais de croissances exponentiellement bornées.
140
CHAPTER IV.3. PROJET DE RECHERCHE : COMBINATOIRE
en
ac
es
M
A F
O M
NEGATIF
s
141
M
re ar
al ch gin
a go er al
• st u s rith che isat
Dé ruc ein m fo ion
n p tu d iq n
d
te ent art ra es ues dam es
rm s d nt no e e a
e
e
j
e un s s uv t c nt spe
io m du el om ale c
rs em p le b s ts
à br la s e in en
co es te nt at
ur p au ité oir
t/ er .
s es
m m
oy a en
es
ss
té
ni
tu
or
pp
O
ue
iq ys eo
ph c G
de ve
s ,a
on
bo u
gi
la tea
s
ré
de
le pla
en des les
ec du
ue r a
av e
iq tou cip
s qu
am u rin
en ri
Li éo ica yn e a p
• th etr e d nn ues
m rt sie tiq
Fo ri a
pa ém uipe
th éq
l’
•
•
le
At
ou
ts
E´
p qu
co roje ipe
Fo m t pl
n rt m co ur
• do atio e re une hér idis
J m n c s en cip
t e lin
• m eun ain ale onn
t p ai
Im em es es , le ai
ub re
pl br se d ad ssa
ic es e e e n
lic av
at
c
r
t
c
s
at ec
io de dy om hi e
io u
i
n
p
n
n
p
ns n
au l’éq am ét su ter
DI uip ism enc r n X e
o
e
e . s
et
de
au
s
M
PR
I
•
•
•
ast
e op
e.
t d tr
ip la
en rds
qu ns
em sa
l’é da
dr hé
ns te u
ca e t
da san tea
en d
A
a
d’ et
g suffi pl
ux es
an n u
Ta ir . l r n i n d
e
a
• gi ibl seu tio tio
a
fa
ic ra
n
U pl ctu
Im tru
s
•
ib
Fa
POSITIF
IV.4 Analyse AFOM : Combinatoire
INTERNE
EXTERNE
Figure IV.4.1: Analyse AFOM de l’équipe Combinatoire : Atouts, Faiblesses, Opportunités, Menaces
142
CHAPTER IV.4. ANALYSE AFOM : COMBINATOIRE
IV.5 Fiche résumé : Combinatoire
IV.5.1
Membres
2008 : 2 chercheurs CNRS, 2 enseignants-chercheurs, 1 doctorant
2013 : 6 chercheurs CNRS, 2 enseignants-chercheurs, 1 postdocs, 2 doctorants
Départ de membres de l’équipe F. Nielsen (Chercheur chez Sony), D. Poulalhon ( Maı̂tre de
conférence à Paris Diderot).
Nouveaux membres É. Fusy, D. Rossin, M. Albenque, V. Pilaud, M. Ovsjanikov.
IV.5.2
Combinatoire de la géométrie 2d L’équipe a contribué largement aux riches développements
qu’a connu la théorie combinatoire des cartes au cours de ces dernières années: en particulier les
membres de l’équipe sont en grande partie à l’origine de la prise de conscience de l’importance
des orientations minimales dans ce contexte. À côté d’un gros travail d’unification de la théorie,
et de l’obtention de nombreux résultats d’énumération bijective, les membres de l’équipe se sont
aussi attachés à développer ses applications: en algorithmique avec de nouveaux résultats de
codage, de dessin ou de génération aléatoire, ou le développement de structures de données
succinctes; sur des questions d’aléa discret, avec l’obtention de résultats sur le comportement
asymptotique de grandes cartes ou graphes planaires aléatoires.
Géométrie de la combinatoire Nous abordons des questions de géométrie discrète (au sens
anglophone du terme), avec l’idée d’utiliser la géométrie notament des polyèdres convexes pour
faire apparaı̂tre des propriétés de structures combinatoires. Dans ce contexte Pilaud a obtenu
avec ses collaborateurs différents types de résultats, allant de nouvelles constructions générales
de réalisations d’associaèdres généralisés à des résultats d’indécomposabilités ou des algorithmes
d’énumérations de configurations géométriques.
Alignement et analyse de formes tridimensionnelles Ovsjanikov développe avec ses collaborateurs un ensemble cohérent d’algorithmes autour de la comparaison d’objets géométriques et
de l’analyse de leurs symétries, avec lesquels il obtient dans plusieurs cas les meilleurs résultats
actuels sur les données des benchmarks du domaine (shape matching, symmetry based matching, symmetry detection).
Géométrie de l’information algorithmique Les outils fondamentaux développés autour des
mesures de distorsion de Bregman et des familles exponentielles par Nielsen et ses coauteurs leur
ont permis d’obtenir de nouveaux résultats autour de la classification et des modèles statistiques,
avec des applications dans des domaines très variés allant de l’analyse de données biologiques au
traitement du langage.
IV.5.3
IV.5.3.1
Publications
Nos travaux ont conduit sur la période à la publication d’environ 70 articles de journaux internationaux et autant en acte de conférences internationales. Illustrons ceci de quelques résultats
significatifs:
143
CHAPTER IV.5. FICHE RÉSUMÉ : COMBINATOIRE
144
• L’article “Boltzmann samplers, Polya theory, and cycle pointing” par M. Bodirsky, E. Fusy,
M. Kang, et S. Vigerske (SIAM J. Comput., 40(3):721–769, 2011), propose un nouveau
paradigme pour traiter les symétries dans la conception d’algorithmes de génération aléatoire.
• L’article “A bijection for rooted maps on orientable surfaces” par G. Chapuy, M. Marcus, et
G. Schaeffer (SIAM J. Discrete Math., 23(3):1587–1611, 2009) pose les bases de l’explication
combinatoire de la dépendance linéaire en le genre de la correction polynomiale dans le
nombre asymptotique de cartes sur une surface.
• Dans l”article “Random Sampling of Simple Branched Coverings of the Sphere by itself”
par E. Duchi, D. Poulalhon et G. Schaeffer (à paraı̂tre dans les actes du prochain colloque
ACM-SIAM SODA), le paradigme du codage bijectif de cartes par arbres planaires est
étendu pour traiter des revêtements à l’aide d’arbres étiquetés non plongés, avec comme
application de nouveaux algorithmes de génération aléatoire.
• Dans l’article “Map-based exploration of intrinsic shape differences and variability” par
R. Rustamov, M. Ovsjanikov, et al. (ACM Trans. Graph.), est introduite une nouvelle formulation de la notion de “différence de forme”, qui permet, au lieu de se contenter d’une
mesure unique par un nombre comme dans les travaux antérieurs, de fournir des information détaillées sur la position et la nature de ces différences. Cet article fait partie des
6 papiers mis en avant par le comité de programme de la prestigieuse conférence ACM
SIGGRAPH pour l’édition 2013 (Highlights from technical papers program).
• L’article “Sided and symmetrized Bregman centroids” par F. Nielsen et R Nock (IEEE Trans.
Information Theory, 2009) étudie les différentes variantes de centroı̈des pour les divergences de Bregman, il donne les formules closes pour les versions gauches et droites de ces
centroı̈des et propose un algorithme efficace pour approcher le centroı̈de d’une divergence
de Bregman symmétrisée.
• Dans l’article “Canonical ordering for triangulations on the cylinder, with applications to
periodic straightline drawings”, de L. Castelli Aleardi, O. Devillers, et E. Fusy (20th International Symposium on Graph Drawing, GD’2012, LNCS, pages 376–387, 2012), est
développée une nouvelle application au dessin de graphes périodiques des ordres canoniques associés aux bois de Schnyder dont l’étude est une spécialité de l’équipe.
IV.5.3.2
Rayonnement
Gilles Schaeffer a présidé le comité de programme de la principale conférence internationale
annuelle en combinatoire énumérative et algébrique FPSAC 2013, qui réunit plus de 300 participants cette année et qui est co-organisée par les équipes combinatoire du LIX et du LIAFA. Il est
aussi membre du comité éditorial restreint du Journal of Combinatorial Theory, Series A.
Plus généralement les membres de l’équipe participent régulièrement à des comités de programmes de conférences internationales (SODA’09, FPSAC’11, 12, 13, Analco’09, 11, GD’11,
SGP’12, 13, ICCV’11, ICDE’11, ACCV’12, etc...)
L’ANR GAIA, dans laquelle Frank Nielsen était largement impliquée, a reçu en 2013 le grand
prix ANR du numérique.
IV.5.3.3
• Luca Castelli Aleardi, Maks Ovsjanikov, Eric Fusy et Gilles Schaeffer sont impliqué dans
différents cours de niveau L3 et M1 à l’École Polytechnique.
• Gilles Schaeffer coordonne le cours de combinatoire du MPRI au sein duquel interviennent
régulièrement Dominique Poulalhon et Éric Fusy.
IV.5.3. PRODUCTION SCIENTIFIQUE
145
• Gilles Schaeffer a donné une semaine de cours à la 41ème école d’été internationale de
probabilité de Saint Flour en 2011 et Éric Fusy a donné une semaine de cours à l’université
technique de Berlin en 2011.
146
CHAPTER IV.5. FICHE RÉSUMÉ : COMBINATOIRE
IV.6 Production scientifique : Combinatoire
Les publications [257] et [201] sont des publications avec des auteurs dans des des équipes
différentes.
IV.6.1
[185] Alexander M. Bronstein, Michael M. Bronstein, and Maks Ovsjanikov. Feature-based
methods in 3d shape analysis. In Nick Pears; Yonghuai Liu; Peter Bunting, editor, 3D
Imaging, Analysis and Applications. Springer-Verlag, London, 2012.
[186] Richard Nock and Frank Nielsen. Intrinsic geometries in learning. In Frank Nielsen,
editor, Emerging Trends in Visual Computing, number 5416 in Lecture Notes in Computer
Science. Springer Berlin Heidelberg, January 2009.
[187] Vincent Pilaud and Christian Stump. El-labelings and canonical spanning trees for subword complexes. In Discrete Geometry and Optimization, Fields Institute Communications
Series, pages 213–248. Springer, 2013.
[188] Olivier Schwander and Frank Nielsen. Learning mixtures by simplifying kernel density
estimators. In Frank Nielsen and Rajendra Bhatia, editors, Matrix Information Geometry,
pages 403–426. Springer Berlin Heidelberg, January 2013.
IV.6.2
[189] Marie Albenque. A note on the enumeration of directed animals via gas considerations.
Ann. Appl. Probab., 19(5):1860–1879, 2009.
[190] Marie Albenque, Éric Fusy, and Dominique Poulalhon. On symmetric quadrangulations and triangulations. À paraı̂tre dans European Journal of Combinatorics,
arXiv:1103.3657, 2013.
[191] Marie Albenque and Lucas Gerin. On the algebraic numbers computable by some generalized Ehrenfest urns. Discrete Math. Theor. Comput. Sci., 14(2):271–284, 2012.
[192] Marie Albenque and Jean-François Marckert. Some families of increasing planar maps.
Electron. J. Probab., 13:no. 56, 1624–1671, 2008.
[193] Omri Azencot, Mirela Ben-Chen, Frederic Chazal, and Maks Ovsjanikov. An operator
approach to tangent vector field processing. To appear in Computer Graphics Forum, 2013.
[194] Jérémy Barbay, Luca Castelli Aleardi, Meng He, and J. Ian Munro. Succinct representation of labeled graphs. Algorithmica, 62(1-2):224–257, 2012.
[195] Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, and Dominique Rossin. Deciding
the finiteness of the number of simple permutations contained in a wreath-closed class is
polynomial. Pure Math. Appl. (PU.M.A.), 21(2):119–135, 2010.
[196] Frédérique Bassino, Mathilde Bouvel, and Dominique Rossin. Enumeration of pinpermutations. Electron. J. Combin., 18(1):Paper 57, 39, 2011.
[197] Olivier Bernardi and Éric Fusy. A bijection for triangulations, quadrangulations, pentagulations, etc. J. Combin. Theory Ser. A, 119(1):218–244, 2012.
[198] Olivier Bernardi and Éric Fusy. Schnyder decompositions for regular plane graphs and
application to drawing. Algorithmica, 62(3-4):1159–1197, 2012.
147
148
BIBLIOGRAPHY
[199] Olivier Bernardi and Éric Fusy. Unified bijections for maps with prescribed degrees and
girth. J. Combin. Theory Ser. A, 119(6):1351–1387, 2012.
[200] Olivier Bodini, Éric Fusy, and Carine Pivoteau. Random sampling of plane partitions.
Combin. Probab. Comput., 19(2):201–226, 2010.
[201] Manuel Bodirsky, Éric Fusy, Mihyun Kang, and Stefan Vigerske. Boltzmann samplers,
Pólya theory, and cycle pointing. SIAM J. Comput., 40(3):721–769, 2011.
[202] Jean-Daniel Boissonnat, Frank Nielsen, and Richard Nock. Bregman Voronoi diagrams.
Discrete and Computational Geometry (DCG, Springer), 44(2):281–307, 2010.
[203] Jürgen Bokowski and Vincent Pilaud. Enumerating topological (nk )-configurations. To
appear in Computational Geometry: Theory and Applications., 2013.
[204] Nicolas Bonichon, Mireille Bousquet-Mélou, and Éric Fusy. Baxter permutations and
plane bipolar orientations. Sém. Lothar. Combin., 61A:Art. B61Ah, 29, 2009/10.
[205] Mireille Bousquet-Mélou, Éric Fusy, and Louis-François Préville-Ratelle. The number of
intervals in the m-Tamari lattices. Electron. J. Combin., 18(2):Paper 31, 26, 2011.
[206] Mathilde Bouvel, Cedric Chauve, Marni Mishna, and Dominique Rossin. Average-case
analysis of perfect sorting by reversals. Discrete Math. Algorithms Appl., 3(3):369–392,
2011.
[207] Mathilde Bouvel and Dominique Rossin. A variant of the tandem duplication–random
loss model of genome rearrangement. Theoret. Comput. Sci., 410(8-10):847–858, 2009.
[208] Luca Castelli Aleardi, Olivier Devillers, and Abdelkrim Mebarki. Catalog-based representation of 2D triangulations. Internat. J. Comput. Geom. Appl., 21(4):393–402, 2011.
[209] Luca Castelli Aleardi, Olivier Devillers, and Gilles Schaeffer. Succinct representations
of planar maps. Theoret. Comput. Sci., 408(2-3):174–187, 2008.
[210] Luca Castelli Aleardi, Éric Fusy, and Thomas Lewiner. Schnyder woods for higher genus
triangulated surfaces, with applications to encoding. Discrete Comput. Geom., 42(3):489–
516, 2009.
[211] Guillaume Chapuy, Éric Fusy, Mihyun Kang, and Bilyana Shoilekova. A complete grammar for decomposing a family of graphs into 3-connected components. Electron. J. Combin., 15(1):Research Paper 148, 39, 2008.
[212] Guillaume Chapuy, Michel Marcus, and Gilles Schaeffer. A bijection for rooted maps
on orientable surfaces. SIAM J. Discrete Math., 23(3):1587–1611, 2009.
[213] Robert Cori, Michel Marcus, and Gilles Schaeffer. Odd permutations are nicer than even
ones. European J. Combin., 33(7):1467–1478, 2012.
[214] Chris Dowden. The evolution of uniform random planar graphs. Elect. J. Combinatorics,
17:#R7, 2010.
[215] Chris Dowden. On the maximum size of minimal definitive quartet sets. Discrete Mathematics, 310(19):25462549, 2010.
[216] Chris Dowden. Random planar graphs with bounds on the maximum and minimum
degrees. Graph. Comb., 27(1):87–107, 2011.
[217] Chris Dowden and Louigi Addario-Berry. Subgraphs of 4-regular planar graphs. Algorithmica, 61(3):758–776, 2011.
BIBLIOGRAPHY
149
[218] Michael Drmota, Éric Fusy, Mihyun Kang, Veronika Kraus, and Juanjo Rué. Asymptotic
study of subcritical graph classes. SIAM J. Discrete Math., 25(4):1615–1651, 2011.
[219] Enrica Duchi, Simone Rinaldi, and Gilles Schaeffer. The number of Z-convex polyominoes. Adv. in Appl. Math., 40(1):54–72, 2008.
[220] Enrica Duchi and Gilles Schaeffer. A combinatorial approach to jumping particles: the
parallel TASEP. Random Structures Algorithms, 33(4):434–451, 2008.
[221] Murray Elder, Éric Fusy, and Andrew Rechnitzer. Counting elements and geodesics in
Thompson’s group F. J. Algebra, 324(1):102–121, 2010.
[222] Stefan Felsner, Éric Fusy, and Marc Noy. Asymptotic enumeration of orientations. Discrete Math. Theor. Comput. Sci., 12(2):249–262, 2010.
[223] Stefan Felsner, Éric Fusy, Marc Noy, and David Orden. Bijections for Baxter families and
related objects. J. Combin. Theory Ser. A, 118(3):993–1020, 2011.
[224] Valentin Féray and Ekaterina Vassilieva. Bijective enumeration of some colored permutations given by the product of two long cycles. Discrete Math., 312(2):279–292, 2012.
[225] Julien Ferté, Vincent Pilaud, and Michel Pocchiola. On the number of simple arrangements of five double pseudolines. Discrete Comput. Geom., 45(2):279–302, 2011.
[226] Éric Fusy. Transversal structures on triangulations: a combinatorial study and straightline drawings. Discrete Math., 309(7):1870–1894, 2009.
[227] Éric Fusy. Uniform random sampling of planar graphs in linear time. Random Structures
Algorithms, 35(4):464–522, 2009.
[228] Éric Fusy. New bijective links on planar maps via orientations. European J. Combin.,
31(1):145–160, 2010.
[229] Éric Fusy. Bijective counting of involutive Baxter permutations. Fund. Inform., 117(14):179–188, 2012.
[230] Éric Fusy, Dominique Poulalhon, and Gilles Schaeffer. Dissections, orientations, and
trees with applications to optimal mesh encoding and random sampling. ACM Trans.
Algorithms, 4(2):Art. 19, 48, 2008.
[231] Éric Fusy, Dominique Poulalhon, and Gilles Schaeffer. Bijective counting of plane bipolar orientations and Schnyder woods. European J. Combin., 30(7):1646–1658, 2009.
[232] Vincent Garcia, Frank Nielsen, and Richard Nock. Simplification and hierarchical representations of mixtures of exponential families. Signal Processing (Elsevier), 90(12):3197–
3212, December 2010.
[233] Nicolai Hähnle, Steve Klee, and Vincent Pilaud. Obstructions to weak decomposability
for simplicial polytopes. To appear in Proceedings of the American Mathematical Society.,
2013.
[234] Minghui Jiang, Vincent Pilaud, and Pedro J. Tejada. On a dispersion problem in grid
labeling. SIAM J. Discrete Math., 26(1):39–51, 2012.
[235] Benjamin Matschke, Julian Pfeifle, and Vincent Pilaud. Prodsimplicial-neighborly polytopes. Discrete Comput. Geom., 46(1):100–131, 2011.
[236] Alejandro Morales and Ekaterina Vassilieva. Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group. Electronic Journal
of Combinatorics, 20(2):Paper 6, 2013.
150
BIBLIOGRAPHY
[237] Frank Nielsen. Steering self-learning distance algorithms. Communications of the ACM,
52(11):Virtual Extensions, November 2009.
[238] Frank Nielsen and Sylvain Boltz. The Burbea-Rao and Bhattacharyya centroids. IEEE
Transactions on Information Theory, 57(8):5455–5466, august 2011.
[239] Frank Nielsen and Richard Nock. On the smallest enclosing information disk. Information Processing Letters, 105(3):93–97, January 2008.
[240] Frank Nielsen and Richard Nock. Approximating smallest enclosing balls with applications to machine learning. International Journal on Computational Geometry and Applications, 19(5):389–414, October 2009.
[241] Frank Nielsen and Richard Nock. Sided and symmetrized Bregman centroids. IEEE
Transactions on Information Theory, 55(6):2048–2059, June 2009.
[242] Frank Nielsen and Richard Nock. Skew Jensen-Bregman Voronoi diagrams. Transactions
on Computational Science XIV, 6970:102–128, 2011.
[243] Richard Nock and Frank Nielsen. Bregman divergences and surrogates for learning. IEEE
Transactions on Pattern Matching and Machine Intelligence, 31(11):2048–2059, November
2009.
[244] Richard Nock, Pascal Vaillant, Claudia Henry, and Frank Nielsen. Soft memberships for
spectral clustering, with application to permeable language distinction. Pattern Recognition, 42(1):43–53, January 2009.
[245] Maks Ovsjanikov, Mirela Ben-Chen, Frederic Chazal, and Leonidas Guibas. Analysis
and visualization of maps between shapes. To appear in Computer Graphics Forum, 2013.
[246] Maks Ovsjanikov, Mirela Ben-Chen, Justin Solomon, Adrian Butscher, and Leonidas
Guibas. Functional maps: a flexible representation of maps between shapes. ACM Trans.
Graph., 31(4):30:1–30:11, July 2012.
[247] Maks Ovsjanikov, Quentin Merigot, Leonidas Guibas, and Viorica Patraucean. Shape
matching via quotient spaces. To appear in Computer Graphics Forum, 2013.
[248] Julian Pfeifle, Vincent Pilaud, and Francisco Santos. Polytopality and Cartesian products
of graphs. Israel J. Math., 192(1):121–141, 2012.
[249] Vincent Pilaud and Michel Pocchiola. Multitriangulations, pseudotriangulations and
primitive sorting networks. Discrete Comput. Geom., 48(1):142–191, 2012.
[250] Vincent Pilaud and Francisco Santos. The brick polytope of a sorting network. European
J. Combin., 33(4):632–662, 2012.
[251] Natalia Polouliakh, Richard Nock, Frank Nielsen, and Hiroaki Kitano. G-protein coupled
receptor signaling architecture of mammalian immune cells. Public Libary of Science One,
4(1):e4189, January 2009.
[252] Juanjo Rué. Enumeration and limit laws of dissections on a cylinder. Discrete Mathematics, 310(19):2519–2541, 2010.
[253] Juanjo Rué, Ignasi Sau, and Dimitrios M. Thilikos. Asymptotic enumeration of noncrossing partitions on surfaces. Discrete Mathematics, 313(5):635 – 649, 2013.
[254] Juanjo Rué, Ignasi Sau, and DimitriosM. Thilikos. Dynamic programming for graphs on
surfaces. In Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der
Heide, and PaulG. Spirakis, editors, Automata, Languages and Programming, volume 6198
of Lecture Notes in Computer Science, pages 372–383. Springer Berlin Heidelberg, 2010.
IV.6.3. CONFÉRENCES INTERNATIONALES
151
[255] Raif Rustamov, Maks Ovsjanikov, Omri Azencot, Mirela Ben-Chen, Frederic Chazal, and
Leonidas Guibas. Map-based exploration of intrinsic shape differences and variability. To
appear in ACM Trans. Graph.., 2013.
[256] Gilles Schaeffer and Ekaterina Vassilieva. A bijective proof of Jackson’s formula for the
number of factorizations of a cycle. J. Combin. Theory Ser. A, 115(6):903–924, 2008.
[257] Adelene Y. L. Sim, Olivier Schwander, Michael Levitt, and Julie Bernauer. Evaluating
mixture models for building RNA knowledge-based potentials. Journal of Bioinformatics
and Computational Biology, 10(02):1241010, April 2012.
[258] Ekaterina Vassilieva. Bijective enumeration of 3-factorizations of an N -cycle. Ann.
Comb., 16(2):367–387, 2012.
[259] Ekaterina Vassilieva, G. Pinto, J. Acacio de Barros, and P. Suppes. Learning pattern
recognition through quasi-synchronization of phase oscillators. IEEE transactions on Neural Networks, 22(1):84 – 95, 2011.
[260] Ekaterina Vassilieva and Gilles Schaeffer. A combinatorial way of counting unicellular
maps and constellations. Fundamentalnaya i Prikladnaya Matematika (en Russe, Traduction
en Anglais in Journal of Mathematical Science, Juin 2013, Volume 191, Numéro 5, pp 613632), 17(4):25–52, 2011.
[261] Baba C. Vemuri, Meizhu Liu, Shun ichi Amari, and Frank Nielsen. Total Bregman divergence and its applications to DTI analysis. IEEE Transactions on Medical Imaging (TMI),
30(2):475–483, February 2011.
IV.6.3
[262] Marie Albenque and Jérémie Bouttier. Constellations and multicontinued fractions: application to Eulerian triangulations. In 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), Discrete Math. Theor. Comput. Sci. Proc.,
AR, pages 805–816. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2012.
[263] Marie Albenque, Éric Fusy, and Dominique Poulalhon. On symmetric quadrangulations. In European Conference on Combinatorics, Graph theory and Applications (Eurocomb
2011), Electronic Notes in Discrete Mathematics 38, pages 17–24. Elsevier, 2011.
[264] Marie Albenque and Philippe Nadeau. Growth function for a class of monoids. In 21st
International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009),
Discrete Math. Theor. Comput. Sci. Proc., AK, pages 25–38. Assoc. Discrete Math. Theor.
Comput. Sci., Nancy, 2009.
[265] Axel Bacher and Gilles Schaeffer. Multivariate Lagrange inversion and the cycle lemma.
In European Conference on Combinatorics, Graph theory and Applications (Eurocomb 2013),
Electronic Notes in Discrete Mathematics. Springer, 2013. to appear.
[266] Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, and Dominique
Rossin. Combinatorial specification of permutation classes. In 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), Discrete Math.
Theor. Comput. Sci. Proc., AR, pages 781–792. Assoc. Discrete Math. Theor. Comput. Sci.,
Nancy, 2012.
[267] Olivier Bernardi and Éric Fusy. A unified bijective method for maps: application to
two classes with boundaries. In 22nd International Conference on Formal Power Series and
Algebraic Combinatorics (FPSAC 2010), Discrete Math. Theor. Comput. Sci. Proc., AN,
pages 521–532. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2010.
152
BIBLIOGRAPHY
[268] Sylvain Boltz. Entropy regimes for multi-scale and stable image analysis: A new definition of texture. In Computer Vision, ECCV 2010. Springer, September 2010.
[269] Sylvain Boltz and Frank Nielsen. Randomized motion estimation. In IEEE ICIP 2010,
September 2010.
[270] Sylvain Boltz, Frank Nielsen, and Stefano Soatto. Earth mover distance on superpixels.
In IEEE ICIP 2010, September 2010.
[271] Luca Castelli Aleardi and Olivier Devillers. Explicit array-based compact data structures for triangulations. In 22th International Symposium on Algorithms and Computation
(ISAAC 2011), Lecture Notes in Computer Science, pages 312–323. Springer, 2011.
[272] Luca Castelli Aleardi, Olivier Devillers, and Éric Fusy. Canonical ordering for triangulations on the cylinder, with applications to periodic straight-line drawings. In 20th
International Symposium on Graph Drawing (GD 2012), Lecture Notes in Computer Science, pages 376–387. Springer, 2012.
[273] Luca Castelli Aleardi, Olivier Devillers, and Jarek Rossignac. Esq: Editable squad representation for triangle meshes. In XXV Sibgrapi Conference on Graphics, Patterns and Images
(SIBGRAPI 2012), pages 110–117. IEEE Computer Society, 2012.
[274] Luca Castelli Aleardi, Éric Fusy, and Thomas Lewiner. Schnyder woods for higher genus
triangulated surfaces. In Computational geometry (SoCG’08), pages 311–319. ACM, New
York, 2008.
[275] Luca Castelli Aleardi, Éric Fusy, and Thomas Lewiner. Optimal encoding of triangular
and quadrangular meshes with fixed topology. In 22nd Canadian Conference on Computational Geometry (CCCG 2010), 2010. 4 pages.
[276] Cesar Ceballos and Vincent Pilaud. Denominator vectors and compatibility degrees in
cluster algebras of finite type. In 25th International Conference on Formal Power Series
and Algebraic Combinatorics (FPSAC 2013), Discrete Math. Theor. Comput. Sci. Proc., AN,
[277] Guillaume Chapuy, Valentin Féray, and Éric Fusy. A simple model of trees for unicellular maps. In 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), Discrete Math. Theor. Comput. Sci. Proc., AR, pages 215–226.
Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2012.
[278] Guillaume Chapuy, Éric Fusy, Omer Giménez, and Marc Noy. On the diameter of random planar graphs. In 21st International Meeting on Probabilistic, Combinatorial, and
Asymptotic Methods in the Analysis of Algorithms (AofA’10), Discrete Math. Theor. Comput. Sci. Proc., AM, pages 65–78. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2010.
[279] Gwendal Collet and Éric Fusy. A simple formula for the series of bipartite and quasibipartite maps with boundaries. In 24th International Conference on Formal Power Series
and Algebraic Combinatorics (FPSAC 2012), Discrete Math. Theor. Comput. Sci. Proc., AR,
[280] Filipo Disanto, Enrica Duchi, Simone Rinaldi, and Gilles Schaeffer. Permutations with
few internal points. In European Conference on Combinatorics, Graph theory and Applications (Eurocomb 2011), Electronic Notes in Discrete Mathematics 38. Elsevier, 2011.
[281] Valentin Féray and Ekaterina Vassilieva. Linear coefficients of Kerov’s polynomials: bijective proof and refinement of Zagier’s result. In 22nd International Conference on Formal
Power Series and Algebraic Combinatorics (FPSAC 2010), Discrete Math. Theor. Comput.
Sci. Proc., AN, pages 713–724. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2010.
BIBLIOGRAPHY
153
[282] Zhicheng Gao and Gilles Schaeffer. The distribution of the number of small cuts in
a random planar triangulation. In 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’10), Discrete Math.
Theor. Comput. Sci. Proc., AM, pages 277–288. Assoc. Discrete Math. Theor. Comput.
Sci., Nancy, 2010.
[283] Vincent Garcia. Levels of details for gaussian mixture models. In Ninth Asian Conference
on Computer Vision (ACCV), volume 5995 (Part II), pages 514–525, Xi’an, China, September 2009. Springer-Verlag.
[284] Vincent Garcia, Eric Debreuve, Frank Nielsen, and Michel Barlaud. k-nearest neighbor
search: Fast GPU-based implementations and application to high-dimensional feature
matching. In IEEE ICIP 2010, September 2010.
[285] Vincent Garcia and Frank Nielsen. Searching high-dimensional neighbours: Cpu-based
tailored data-structures versus gpu-based brute-force method. In Computer Vision / Computer Graphics Collaboration Techniques and Applications (MIRAGE), volume 5496 of Lecture Notes in Computer Science, pages 425–436, INRIA Rocquencourt, France, May 2009.
[286] Vincent Garcia, Frank Nielsen, and Richard Nock. Hierarchical Gaussian mixture
model. In International Conference on Acoustics, Speech and Signal Processing (ICASSP),
LNCS, March 2010.
[287] Yukiko Matsuoka, Jason E. Shoemaker, Natalia Polouliakh, Yukiko Muramoto, Ken Fujii,
Samik Ghosh, Richard Nock, Frank Nielsen, Yoshihiro Kawaoka, and Hiroaki Kitano. A
systems biology approach to influenza virus infection. In Tenth International Conference
on Systems Biology (ICSB), Stanford, USA, September 2009. Poster 3.053.
[288] Alejandro H. Morales and Ekaterina Vassilieva. Bijective enumeration of bicolored maps
of given vertex degree distribution. In 21st International Conference on Formal Power Series
and Algebraic Combinatorics (FPSAC 2009), Discrete Math. Theor. Comput. Sci. Proc., AK,
[289] Alejandro H. Morales and Ekaterina Vassilieva. Bijective evaluation of the connection coefficients of the double coset algebra. In 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), Discrete Math. Theor. Comput. Sci. Proc.,
AO, pages 681–692. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2011.
[290] Frank Nielsen, Alexis Andre, and Shigeru Tajima. Real-time spherical videos from a fast
rotating camera. In International Conference on Image Analysis and Recognition (ICIAR),
pages 326–335, Povoa de Varzim, Portugal, June 2008.
[291] Frank Nielsen, Sylvain Boltz, and Olivier Schwander. Bhattacharyya clustering with
applications to mixture simplifications. In 2010 20th International Conference on Pattern
Recognition (ICPR), pages 1437–1440, 2010.
[292] Frank Nielsen, Vincent Garcia, and Richard Nock. Gaussian mixture models via entropic quantization. In 2009 European Signal Processing Conference (EUSIPCO), pages
2012–2016, Glasgow, United Kingdom, August 2009.
[293] Frank Nielsen and Richard Nock. Bregman sided and symmetrized centroids. In International Conference on Pattern Recognition (ICPR), pages 1–4, Tampa, Florida, USA,
December 2008.
[294] Frank Nielsen and Richard Nock. The entropic centers of multivariate normal distributions. In European Workshop on Computational Geometry (EuroCG), pages 221–224, Nancy,
France, March 2008.
154
BIBLIOGRAPHY
[295] Frank Nielsen and Richard Nock. Quantum Voronoi diagrams. In European Workshop on
Computational Geometry (EuroCG), pages 225–228, Nancy, France, March 2008.
[296] Frank Nielsen and Richard Nock. Quantum Voronoi diagrams and Holevo channel capacity for 1-qubit quantum states. In IEEE International Symposium on Information Theory
(ISIT), pages 96–100, Toronto, Canada, July 2008.
[297] Frank Nielsen and Richard Nock. The dual Voronoi diagrams with respect to representational Bregman divergences. In International Symposium on Voronoi Diagrams (ISVD),
DTU Lyngby, Denmark, June 2009. IEEE.
[298] Frank Nielsen and Richard Nock. Entropies and cross-entropies of exponential families.
In IEEE ICIP 2010, pages 3621–3624, September 2010.
[299] Frank Nielsen and Richard Nock. Hyperbolic Voronoi diagrams made easy. In International Conference on Computational Sciences and Its Applications (ICCSA), volume LNCS,
March 2010.
[300] Frank Nielsen and Richard Nock. Jensen-Bregman Voronoi diagrams and centroidal
tessellations. In IEEE ISVD 2010, June 2010.
[301] Frank Nielsen and Aurélien Serandour. Accuracy of distance metric learning algorithms.
In Workshop on Data Mining using Matrices and Tensors (DMMT), Paris, France, June 2009.
ACM.
[302] Richard Nock, Brice Magdalou, Eric Bryis, and Frank Nielsen. On tracking portfolios
with certainty equivalents on a generalization of Markowitz model: the fool, the wise
and the adaptive. In International Conference on Machine Learning (ICML), June 2011.
[303] Richard Nock and Frank Nielsen. On the efficient minimization of classification calibrated surrogates. In Neural Information Processing Society (NIPS), pages 1201–1208,
Vancouver, B.C., Canada, December 2008.
[304] Richard Nock and Frank Nielsen. On the efficient minimization of convex surrogates in
supervised learning. In International Conference on Pattern Recognition (ICPR), pages 1–4,
Tampa, Florida, USA, December 2008.
[305] Shigeru Owada, Frank Nielsen, Takeo Igarashi, Ryo Haraguchi, and Kazuo Nakazawa.
Projection plane processing for sketch-based volume segmentation. In International Symposium on Biomedical Imaging (ISBI), pages 117–120, Paris, France, May 2008.
[306] Viorica Patraucean, Rafael Grompone von Gioi, and Maks Ovsjanikov. Detection of
mirror-symmetric image patches. In Proceedings of Computer Vision and Pattern Recognition Workshops, 2013.
[307] Adeline Pierrot, Dominique Rossin, and Julian West. Adjacent transformations in permutations. In 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), Discrete Math. Theor. Comput. Sci. Proc., AO, pages 765–776.
Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2011.
[308] Vincent Pilaud and Christian Stump. Generalized associahedra via brick polytopes. In
24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC
2012), Discrete Math. Theor. Comput. Sci. Proc., AO, pages 73–84. Assoc. Discrete Math.
Theor. Comput. Sci., Nancy, 2012.
[309] Vincent Pilaud and Christian Stump. El-labelings and canonical spanning trees for subword complexes. In 25th International Conference on Formal Power Series and Algebraic
Combinatorics (FPSAC 2013), Discrete Math. Theor. Comput. Sci. Proc., AN, pages 611–
622. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2013.
BIBLIOGRAPHY
155
[310] Paolo Piro, Michel Barlaud, Richard Nock, and Frank Nielsen. k-nn boosting prototype
learning for object classification. In International Workshop on Image Analysis for Multimedia Interactive Services (WIAMIS), April 2010.
[311] Paolo Piro, Frank Nielsen, and Michel Barlaud. Tailored bregman ball trees for effective
nearest neighbors. In European Workshop on Computational Geometry (EuroCG), LORIA,
Nancy, France, March 2009. hal-00382782, version 1.
[312] Paolo Piro, Richard Nock, Frank Nielsen, and Michel Barlaud. Boosting bayesian MAP
classification. In IAPR International Conference on Pattern Recognition (ICPR), pages 661–
665, August 2010.
[313] Paolo Piro, Richard Nock, Frank Nielsen, and Michel Barlaud. Leveraging k-NN for
generic classification boosting. In IEEE International Workshop on Machine Learning for
Signal Processing (MLSP), September 2010.
[314] Paolo Piro, Richard Nock, Frank Nielsen, and Michel Barlaud. Multiclass leveraged kNN for image classification. In Tenth Asian Conference on Computer Vision (ACCV), New
Zealand, November 2010.
[315] Gilles Schaeffer and Ekaterina Vassilieva. Partitioned cacti: a bijective approach to the
cycle factorization problem. In 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), Discrete Math. Theor. Comput. Sci. Proc.,
AJ, pages 641–652. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2008.
[316] Olivier Schwander and Frank Nielsen. Reranking with contextual dissimilarity measures from representational bregman k-means. In Paul Richard and José Braz, editors,
VISAPP (1), pages 118–123. INSTICC Press, 2010.
[317] Olivier Schwander and Frank Nielsen. Non-flat clustering with alpha-divergences. In
2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP),
pages 2100–2103, 2011.
[318] Olivier Schwander and Frank Nielsen. PyMEF #x2014; A framework for exponential
families in python. In 2011 IEEE Statistical Signal Processing Workshop (SSP), pages 669–
672, 2011.
[319] Olivier Schwander and Frank Nielsen. Model centroids for the simplification of kernel
density estimators. In 2012 IEEE International Conference on Acoustics, Speech and Signal
Processing (ICASSP), pages 737–740, 2012.
[320] Olivier Schwander and Frank Nielsen. Fast learning of gamma mixture models with
k-MLE. In SIMBAD, 2013.
[321] Olivier Schwander, Aurélien Schutz, Frank Nielsen, and Yannick Berthoumieu. k-MLE
for mixtures of generalized gaussians. In 2012 21st International Conference on Pattern
Recognition (ICPR), pages 2825–2828, 2012.
[322] Hiroaki Tobita and Frank Nielsen. Image enforme: Automatic deformation of image
for multi-features without information loss. In Pervasive, Nara, Japan, May 2009. late
breaking result.
[323] Ekaterina Vassilieva. Type distribution of the composition of two long cycles. In International Algebraic Symposium Dedicated to the 80 Years of the Chair of Higher Algebra,
2010.
[324] Ekaterina Vassilieva. Explicit monomial expansions of the generating series for connection coefficients. In 24th International Conference on Formal Power Series and Algebraic
Combinatorics (FPSAC 2012), Discrete Math. Theor. Comput. Sci. Proc., AR, pages 123–
134. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2012.
BIBLIOGRAPHY
156
[325] Ekaterina Vassilieva. Long cycle factorizations : Bijective computation in the general
case. In 25th International Conference on Formal Power Series and Algebraic Combinatorics
(FPSAC 2013), Discrete Math. Theor. Comput. Sci. Proc., AS, pages 1107–1118. Assoc.
Discrete Math. Theor. Comput. Sci., Nancy, 2013.
IV.6.4
Thèses
[326] Guillaume Chapuy. Combinatoire bijective des cartes de genre supérieur. PhD thesis, École
Polytechnique, 2009. Prix de thèse de l’École Polytechnique.
IV.6.5
Autres
[327] Louigi Addario-Berry and Marie Albenque. The scaling limit of simple triangulations
and simple quadrangulations. Prépublication, 46pp., arXiv:1306.5227, 2013.
[328] Marie Albenque and Dominique Poulalhon. Generic method for bijections between
blossoming trees and planar maps. Prépublication, 41 pp., arXiv:1305.1312, 2013.
[329] Cesar Ceballos and Vincent Pilaud. Denominator vectors and compatibility degrees in
cluster algebras of finite type. Prépublication, 19 pp., arXiv:1302.1052, accepté dans
Transaction of the American Mathematical Society, 2013.
[330] Razvan Gurau and Gilles Schaeffer.
Colored regular graph of positive degree.
Prépublication, 25pp., arXiv:1307.5279, 2013.
[331] Adeline Pierrot and Dominique Rossin. Simple permutations poset. Prépublication,
15pp., arXiv:1201.3119.
[332] Adeline Pierrot and Dominique Rossin.
2-stack pushall sortable permutations.
Prépublication, 41pp., arXiv:1303.4376, 2013.
[333] Adeline Pierrot and Dominique Rossin. 2-stack sorting is polynomial. Prépublication,
23pp., arXiv:1304.2860, 2013.
[334] Vincent Pilaud and Christian Stump. Brick polytopes of spherical subword complexes :
a new approach to generalized associahedra. Prépublication, 45 pp., arXiv:1111.3349,
2012.
[335] Vincent Pilaud and Christian Stump. Vertex barycenter of generalized associahedra.
Prépublication, 14 pp., arXiv:1210.3314, accepté dans Proceedings of the American Mathematical Society, 2012.
IV.6.6
Communications à des conférences nationales sans actes
8ème Conférence de Génération Aléatoire de Structures Combinatoires (GASCOM 2012)
versité Bordeaux 1, Juin 2012 (Vincent Pilaud, The greedy flip tree of a subword complex)
Journées ALEA 2012
Uni-
CIRM, Mars 2012 (Gilles Schaeffer, Modèles de surfaces aléatoires)
Gretsi 2011 Bordeaux, Septembre 2011 (Olivier Schwander and Frank Nielsen, Simplification
de modèles de mélange issus d’estimateur par noyau)
Gretsi 2013 Brest, Septembre 2013 (Olivier Schwander and Frank Nielsen, Apprentissage rapide
de modèles de mélanges avec k-MLE et ses extensions)
IV.7 Annexes : Combinatoire
IV.7.1
et d’enseignement
• Luca Castelli Aleardi est membre du comité enseignement recherche du département
d’informatique de l’École Polytechnique (période 2012-).
• Dominique Rossin
– est chargé de mission STIC auprès de la D.R.R.T. d’Île de France (délégation régionale
à la recherche et à la technologie) (période 2012-).
– est membre du conseil scientifique de l’INS2I (période 2010-).
– est membre du comité enseignement recherche du département d’informatique de
l’École Polytechnique (période 2010-).
– est co-porteur de la création de l’École Doctorale STIC de l’Université Paris Saclay
(période 2013-).
• Gilles Schaeffer
– est représentant de l’École Polytechnique au sein de la commission des études du Master Parisien de Recherche en Informatique (période 2009-).
– a été responsable du pôle Algorithmique et combinatoire du GDR IM du CNRS. (période
2006-2009).
– est membre du conseil scientifique du LabEx CIMI de Toulouse. (période 2012-).
IV.7.1.1
Projet ERC ExploreMaps (2008-2013) (Type: Projet ERC Research Starting Grant 208471)
Titre: Combinatorial methods, from enumerative topology to random discrete structures and compact data representations. ExploreMaps is an effort to set up within LIX a leading research group
in combinatorics and algorithmics. The activities of the group revolve primarily around the
notion of combinatorial maps, that is, combinatorial descriptions of 2d surfaces, and embrace
problems arising in a wide range of contexts: statistical physics, data compression, enumerative
topology, etc. The methodology resorts mainly to algorithmics and enumerative combinatorics.
http://www.lix.polytechnique.fr/˜schaeffe/ExploreMaps/. Partenaires: LIX. Responsable: Gilles Schaeffer. Montant de la collaboration pour le LIX: 750.000 euros.
Projet FP7 CIG (2012-2016) (Type: Projet Marie-Curie Career Integration Grant PCIG12-GA2012-334283 HRGP) Titre: Hardness results in Geometry Processing. Partenaires: LIX. Responsable: Maks Ovsjanikov. Montant de la collaboration pour le LIX: 100 000 euros.
IV.7.1.2
IV.7.1.3
Google Faculty Award (2013-2014) (Type: Google Faculty Award) Titre: Joint Analysis of
Images and 3d Shapes.
Partenaires: INRIA, LIX. Responsable: Maks Ovsjanikov. Montant de
la collaboration pour le LIX: 57 000 euros.
157
158
IV.7.1.4
CHAPTER IV.7. ANNEXES : COMBINATOIRE
Projet ANR GAIA (2008-2012) (Type: Projet ANR blanc) Titre: Géométrie Algorithmique Informationnelle et Applications.
Partenaires: Université de Guyanne, INRIA Grenoble, LIX.
Responsable: Richard Nock. Montant de la collaboration pour le LIX: 296 000 euros.
Projet ANR Cartaplus (2013-2016) (Type: Projet ANR JCJC) Titre: Combinatoires des cartes
et interactions. The project focuses mainly on Combinatorial Maps which appear in various
scientific contexts (statistical physics, algebraic combinatorics, probability theory). The main
scientific objectives of the project are the further extension of the bijective method for maps and
of the combinatorial tools that come with it (orientations, recursive strategies, invariants), the
study of large random maps (continuum limits, local limits), and the exploration/development
of the interactions that the bijective/enumerative approach has with algebraic combinatorics and
theoretical physics. http://cartaplus.math.cnrs.fr/. Partenaires: LIAFA, LIX, IPHT (CEA).
Responsable: Guillaume Chapuy. Montant de la collaboration pour le LIX: 2 participants au
LIX sur 6, montant total 216 000 euros.
Projet ANR EGOS (2012-2015) (Type: Projet ANR JCJC) Titre: Graphes Plongés et leurs Structures Orientées. This project focuses on planar graphs and their oriented structures, and aims
at generalizing these oriented structures to higher genus surfaces and higher dimensional objects. http://www.lirmm.fr/egos/. Partenaires: LIRMM, LIX, LABRI. Responsable: Benjamin
Lévêque. Montant de la collaboration pour le LIX: 3 participants au LIX sur 7, montant total
158 000 euros.
Projet ANR A3 (2008-2012) (Type: Projet ANR Blanc) Titre: Arbres Aléatoires et Applications.
http://www.univ-orleans.fr/mapmo/membres/abraham/A3/. Partenaires: LPMA, MAPMO,
LIX, LABRI. Responsable: Jean-François Delmas. Montant de la collaboration pour le LIX: 2
participants au LIX sur 30, montant total 450 000 euros.
Projet ANR Magnum (2010-2014) (Type: Projet ANR Blanc) Titre: Méthodes Algorithmiques
pour la Génération aléatoire Non Uniforme: Modèles et applications. The project proposes to develop the general theory of complex discrete models, devise new algorithms for random generation and simulation, as well as bridge the gap between theoretical analyses and practically
meaningful data models. http://www-apr.lip6.fr/anrMagnum/. Partenaires: LIP6, LIPN, LIAFA, LIX. Responsable: Michèle Soria. Montant de la collaboration pour le LIX: 2 participants
au LIX sur 15, montant total 600 000 euros.
Thèses DGA (2013-2016) (Type: Thèses DGA) Titre: Joint Analysis of Images and 3d Shapes.
Partenaires: LIX, CMAP. Responsable: Maks Ovsjanikov. Montant de la collaboration pour le
LIX: 50 000 euros.
CNRS chaire d’excellence (2012-2017) (Type: CNRS chaire d’excellence) Titre: CNRS chaire
d’excellence.
Partenaires: LIX. Responsable: Maks Ovsjanikov. Montant de la collaboration
pour le LIX: 100 000 euros.
IV.7.1.5
Qualcomm/LIX Postdoctoral Grant (2012-2013) (Type: Postdoctoral Grant de Viorica Patraucean)
Titre: Multimodal data analysis. Partenaires: LIX. Responsable: Maks Ovsjanikov. Montant de
la collaboration pour le LIX: 50 000 euros.
IV.7.2. ADMINISTRATION DE LA RECHERCHE
IV.7.2
IV.7.2.1
159
• Dominique Rossin est membre du comité éditorial de la revue TSI, Technique et Science
Informatiques.
• Gilles Schaeffer est membre du comité éditorial restreint du Journal of Combinatorial Theory,
Series A.
• Gilles Schaeffer est membre du comité éditorial du nouveau journal Annals of IHP: Combinatorics, Physics and Application (première parution en 2014).
• Gilles Schaeffer a été membre du comité éditorial du journal ESAIMPS de 2008 à 2012
(mandat de 4 ans).
IV.7.2.2
• Gilles Schaeffer est président du comité de programme de la conférence internationnale
FPSAC 2013. Cette conférence est la principale conférence annuelle pour la combinatoire
énumérative et algébrique: parmi les 176 articles soumis à cette 25ème édition, le comité
de programme a sélectionné 27 exposés (15% d’acceptation comme exposé) et 75 posters
(57% d’acceptation). La conférence a réuni plus de 300 participants.
• Analco09 (6th Workshop on Analytic Algorithmics and Combinatorics) (2008). Éric
Fusy.
• Analco11 (8th Workshop on Analytic Algorithmics and Combinatorics) (2010). Éric
Fusy.
• FPSAC11 (23th International Conference on Formal Power Series and Algebraic Combinatorics) (2011). Gilles Schaeffer.
• FPSAC12 (24th International Conference on Formal Power Series and Algebraic Combinatorics) (2012). Gilles Schaeffer.
• FPSAC13 (25th International Conference on Formal Power Series and Algebraic Combinatorics) (2013). Dominique Poulalhon.
• GD2011 (19th International Symposium on Graph Drawing) (2011). Éric Fusy.
• Lattice10 (7th International Conference on Lattice Path Combinatorics and Applications) (2010). Gilles Schaeffer.
• MathInfo08 (5th Colloquium on Mathematics and Computer Science, Algorithms, Trees,
Combinatorics and Probabilities) (2008). Gilles Schaeffer.
• Sibgrapi11 (24th SIBGRAPI Conference on Graphics, Patterns and Images) (2011). Luca
Castelli Aleardi.
• SODA09 (ACM-SIAM Symposium on Discrete Algorithms) (2009). Gilles Schaeffer.
• GSI2013 (Geometric Science of Information) (2013). Olivier Schwander.
160
• SGP12 (Symposium on Geometry Processing) (2012). Maks Ovsjanikov.
• SGP13 (Symposium on Geometry Processing) (2013). Maks Ovsjanikov.
• ACCV12 (Asian Conference on Computer Vision) (2012). Maks Ovsjanikov.
• NORDIA12 (5th Workshop on Non-Rigid Shape Analysis and Deformable Image Alignment in ECCV 2012 Workshops) (2012). Maks Ovsjanikov.
• VMV13 (18th Vision, Modeling, and Visualization workshop) (2013). Maks Ovsjanikov.
IV.7.2.3
• PP13 (Permutation Patterns 2013) (2013). Dominique Rossin.
• Trimestre thématique IHP (Physique statistique, combinatoire et probabilités : approches
du continu par le discret) (2009). Gilles Schaeffer.
• ALÉA 2009 (Journées annuelles du GT ALÉA) (2009). Dominique Poulalhon.
• ALÉA 2011 (Journées annuelles du GT ALÉA) (2011). Éric Fusy, Gilles Schaeffer.
• FPSAC13 (Formal Power Series and Algebraic Combinatorics) (2013). Marie Albenque,
Vincent Pilaud.
• MIG (Workshop Matrix Information Geometries) (2011). Olivie Schwander.
IV.7.2.4
• Dominique Rossin a été expert auprès de Netherlands Organisation for Scientific Research
pour des demandes de financement.
• Gilles Schaeffer a été expert auprès du Conseil de recherches en sciences naturelles et en
génie du Canada (NSERC-CRSNG) pour des demandes de financement.
Au niveau national
• Gilles Schaeffer a été membre en 2012 du comité AERES d’évaluation du Laboratoire d’Informatique
de l’université Paris Nord (LIPN).
• Gilles Schaeffer a été membre des commissions de recrutement pour les établissements
suivants: université de Rouen (2009), de Marne-la-Vallée (2010, 2011, 2013), de Paris-Nord
(2010¸ 2013).
• Dominique Poulalhon a été membre de la commission de recrutement des universités Paris
Diderot (2008) et Paris-Nord (2011).
IV.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION
IV.7.3
IV.7.3.1
161
Habilitations à diriger les recherches
Dominique Rossin a été directeur de thèse de Mathilde Bouvel (2006-2009).
Dominique Rossin a été directeur de thèse de Adeline Pierrot (2009-2013).
Gilles Schaeffer a été directeur de thèse de Guillaume Chapuy (2007-2009)
IV.7.3.2
Rapports d’habilitations à diriger des recherches
Gilles Schaeffer a été rapporteur de l’habilitation à diriger des recherches en informatique d’Olivier
Bodini à l’université Pierre et Marie Curie (Paris 6), en 2011.
Par ailleurs, Gilles Schaeffer a été membre des jury d’habilitation suivants:
• Grégory Miermont, soutenue en 2008 à l’université Paris-Sud.
• Éric Colin de Verdière, soutenue en 2012 à l’École Normale Supérieure
• Nicolas Broutin, soutenue en 2013 à l’université Paris 6.
Rapports de thèse
Dominique Rossin a été rapporteur des thèses de
• Jérémie Lumbroso soutenue en 2012 à l’université Paris 6.
• Francesca de Carli soutenue en 2009 à l’université de Sienne.
Gilles Schaeffer a été rapporteur des thèses de
• Marie Albenque soutenue en 2008 à l’université Paris 7.
• Valentin Feray soutenue en 2009 à l’université de Marne-la-Vallée.
• Alexis Darasse, soutenue en 2010 à l’université de Paris 6.
• Axel Bacher, soutenue en 2011 à l’université de Bordeaux 1.
• Marc Sage, soutenue en 2012 à l’université de Marne-la-Vallée.
Par ailleurs, Gilles Schaeffer a participé au jury des thèses de
• Olivier Mallet, soutenue en 2008 à l’université Paris 7
• Matthieu Josuat-Vergès, soutenue en 2010 à l’université Paris-Sud
• Djamal Belazzougui, soutenue en 2010 à l’université Paris 7
• Samuele Giraudo, soutenue en 2010 à l’université de Marne-la-Vallée
162
IV.7.3.3
• MPRI Cours Aspects Algorithmiques de la combinatoire : Gilles Schaeffer, Dominique
Rossin, Éric Fusy, Dominique Poulalhon
• Master BIBS, BioInformaique et Biostatistique, Cours de programmation Web, Dominique
Rossin (2011-)
Jury
• Gilles Schaeffer fait partie du jury de M2 du Master Parisien de Recherche en Informatique.
• Gilles Schaeffer a été invité à donner un cours de 12h à la 41ème école d’été de Probabilité
de Saint Flour en 2011.
• Éric Fusy a été invité à donner un cours de 15h sur le dessin de graphe à l’université Technique de Berlin en 2011.
• Vincent Pilaud a été invité à donner un cours de 6h sur les polytopes de briques au Workshop Coxeter Groups meet Convex Geometry à l’Université du Québec À Montréal en 2012.
Vulgarisation
• Animation en école primaire : Dominique Rossin
IV.7.4
IV.7.4.1
Exposés invités en conférences
• 20th International Conference on Probabilistics, Combinatorial and Asymptotic Methods in the Analysis of Algorithms (AofA’09) (Plenary talk) (2009). Gilles Schaeffer, Combinatorial entropy and succinct data structures.
• CANADAM, minisymposium on enumerative combinatorics (Session speaker) (2009).
Éric Fusy, Asymptotic enumeration in unlabelled subcritical graph families.
• 68ème Séminaire Lotharingien de Combinatoire (SLC68) (Plenary lectures) (2012). Gilles
Schaeffer.
• Stochastic Processes and Applications, session on random planar maps (Session speaker)
(2013). Marie Albenque.
• Eurographics Workshop on 3D Object Retrieval (Plenary talk) (2012). Maks Ovsjanikov.
• Société de Mathématiques Appliquées et Industrielles (Session speaker) (2013). Maks
Ovsjanikov.
IV.7.4.2
Participation à des workshops sur invitations
• Workshop on configurations, J. Bokowski Festschrift, Darmstadt (2013). Vincent Pilaud.
• Journées Combinatoires de Bordeaux (2013). Vincent Pilaud.
• Algorithms and Permutations, Paris (2012). Vincent Pilaud.
IV.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ
163
• Journées Viennot, Bordeaux (2012). Éric Fusy.
• Young Workshop in arithmetics and combinatorics, Madrid (2011). Éric Fusy.
• Journées Combinatoires de Bordeaux (2011). Éric Fusy.
• Workshop on embedded random graphs, Paris (2009). Éric Fusy.
• Combinatorial Potlatch, Tacoma (2008). Éric Fusy.
• Journées Combinatoires de Bordeaux (2012). Gilles Schaeffer.
• Journées Combinatoires de Bordeaux (2011). Dominique Poulalhon.
• Journées Combinatoires de Bordeaux (2009). Marie Albenque.
• Young Workshop in Arithmetics and Combinatorics (2011). Marie Albenque.
• Workshop SIGMA’2012” (2012). Olivier Schwander.
• Journée Transport Optimal et Géométrie de l’information (2012). Olivier Schwander.
• Workshop Matrix Information Geometries (2012). Olivier Schwander.
IV.7.4.3
Invitations à l’étranger
• Université McGill Montréal (2013). Marie Albenque a été invitée pendant deux mois par
Bruce Reed.
• Université McGill Montréal (2012). Marie Albenque a été invitée pendant un mois par
Louigi Addario-Berry.
• Université Technique de Berlin (2011). Marie Albenque a été invitée pendant un an par
Stefan Felsner dans l’équipe de Mathématiques discrètes.
• MIT (2011-2012). Éric Fusy a été invité à plusieurs séjours par Olivier Bernardi.
• Stanford University (2008-2013). Ekaterina Vassilieva a été invitée à plusieurs séjours par
Patrick Suppes.
• Université d’Etat de Moscou (2012). Ekaterina Vassilieva a été invitée par Alexander
Mikhalev.
• Université de Sienne (2009, 2011). Gilles Schaeffer a été invité à plusieurs séjours par
Simone Rinaldi. .
• Stanford University (2012). Maks Ovsjanikov a été invité pendant un mois par Leonidas
Guibas.
IV.7.4.4
Exposés en séminaires
• Colloquium du laboratoire angevin de recherche en mathématique (2013). Gilles Schaeffer.
• Colloquium de l’institut Camille Jordan de l’université Lyon 1 (2012). Gilles Schaeffer.
• SIESTE de l’École Normale Supérieure de Lyon (2010). Gilles Schaeffer.
• Séminaire du laboratoire MIA de l’université de la Rochelle (2012). Olivier Schwander.
• Séminaire de combinatoire Philippe Flajolet (2012). Dominique Poulalhon.
• Séminaire de combinatoire Philippe Flajolet (2010). Gilles Schaeffer.
164
IV.7.4.5
G. Chapuy a obtenu le prix du meilleur article étudiant à la conférence FPSAC 2009 pour son
article A new combinatorial identity for unicellular maps, via a direct bijective approach.
COMBICombinatoire
V Équipe Concurrency, Mobility and Transactions (Comète)
165
V.1 Liste des membres : Concurrency, Mobility and Transactions
V.1.1
V.1.1.1
Membres permanents
Nom
Catuscia Palamidessi
Bernadette Charron-Bost
Frank Valencia
Konstantinos Chatzikokolakis
Christelle Lievin
V.1.1.2
Fonction
DR1
DR2
CR1
CR2
Assistant
Employeur
INRIA
CNRS
CNRS
CNRS
INRIA
HDR
HDR equivalent
HDR
Arrivée
2002
1993
2004
2011
2011
Doctorants
Nom
Henri Debrat
Financement
ED de l’université de Nancy
Arrivée
2009
Ivan Gazeau
ANR(CCP)
2009
Sophia Knight
INRIA/CORDIS
2010
Thomas Nowak
Luis Pino
EDX
INRIA/DGA
2010
2011
Nicolás Bordenabe
INRIA/DGA
2011
Lili Xu
Chinese Acad. of Sc.
ANR(PANDA + LOCALI)
EDX Monge
2011
Marco Stronati
2012
Encadrant
Stephan Merz
B. Charron-Bost
C. Palamidessi
D. Miller
F. Valencia
C. Palamidessi
B. Charron-Bost
F. Valencia
C. Palamidessi
K. Chatzikokolakis
C. Palamidessi
H. Lin
C. Palamidessi
K. Chatzikokolakis
C. Palamidessi
Postdoctorants
Nom
Sardaouna Hamadou
Yusuke Kawamoto
Tobias Heindel
V.1.1.3
Financement
ARN (PANDA + LOCALI)
IDEX Paris-Saclay
CEA
Dates
201120132013-
Responsable
C. Palamidessi
C. Palamidessi
C. Palmidessi
Nom
Fabio Gadducci
Carlos Olarte
Vladimiro Sassone
Financement
DIGITEO/EP
DIGITEO/EP
DIGITEO/INRIA
Dates
June 2013June 2013May 2013
167
Invitant
C. Palamidessi
F. Valencia
C.Palamidessi
168CHAPTER V.1. LISTE DES MEMBRES : CONCURRENCY, MOBILITY AND TRANSACTIONS
Autres
Nom
Fernán Martinelli
Fonction
Intern
Financement
Marie Curie Action MEALS
V.1.2
Anciens membres
V.1.2.1
Membres permanents
Nom
Lydie Fontaine
Marie-Jeanne Gaffard
V.1.2.2
Fonction
Assistant
Assistant
Employeur
INRIA
INRIA
HDR
Dates
2012-2013
Départ
2009
2011
Position actuelle
DIGITEO (Assistant)
INRIA DRI (Assistant)
Doctorants
Nom
Jesus Aranda
Financement
Colciencias
Départ
2009
Romain Beauxis
Antoine Gaillard
Carlos Olarte
Ile de France
EDX Monge
INRIA/CORDIS
2009
2009
2009
Sylvain Pradalier
ENS Cachan
2009
Christelle Braun
EDX
2010
Miguel Andrés
NWO project
2010
Marie-Aude Steineur
ANR(PANDA)
2011
Mario Sergio Alvim
CNRS/DGA
2011
Andrés Aristizábal
CNRS/DGA
2012
Encadrant
F. Valencia
C. Palamidessi
C. Palamidessi
B. Charron-Bost
F. Valencia
C. Palamidessi
C. Laneve
C. Palamidessi
C. Palamidessi
C. Palamidessi
P. Van Rossum
S. Abbes
C. Palamidessi
C. Palamidessi
F. Valencia
C. Palamidessi
Position actuelle
Univ. Valle, Colombia
(Assoc. Prof.)
Audiosocket USA
Private Consultant
Univ. Javeriana, Colombia
(Assoc. Prof.)
Dassault Systèmes
(R&D in Bioinformatics)
Ministry of Defense
(IT Project Officer)
Google Mountain View,
USA
Private Consultant
UFMG, Brazil
(Ass. Professor)
Univ. Javeriana, Colombia
(Postdoc)
Postdoctorants
Nom
Simon Kramer
Josef Widder
Financement
INRIA
LIX-DGA
Dates
2007-2008
2007-2009
Responsable
C. Palamidessi
B. Charron-Bost
Martin Biely
Qualcomm
2008-2009
B. Charron-Bost
Johan Thapper
Filippo Bonchi
Jérémy Dubreil
Miguel Andrés
Marco Giunti
Ehab ElSalamouny
Matteo Mio
LIX-DGA
ERCIM
INRIA
Qualcomm
ERCIM
INRIA
ERCIM
2008-2009
2009-2010
2009-2011
2010-2012
2011-2012
2011-2012
2011-2012
B. Charron-Bost
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
Position actuelle
IMSc, India (Researcher)
TU Vienna, Austria
(Postdoc)
EP de Lausanne, Switzerland
(Postdoc)
Univ. Paris-Sud XI (ATER)
CNRS ENS-Lyon, (CR)
Facebook, UK
Google Mountain View, USA
NOVA, Portugal (Postdoc)
Suez Canal Univ. (Lecturer)
CWI, Holland (Postdoc)
V.1.2. ANCIENS MEMBRES
V.1.2.3
169
Autres membres
Stagiaires Master 2
Nom
Luis Pino
Raluca Diaconu
Financement
EDX
ENS Cachan
Dates
2010-2011
2010-2011
Responsable
F. Valencia
F. Valencia
Position actuelle
LIX (PhD student)
LIP6 UPMC (PhD student)
Nom
Srecko Brlek
Angelo Troina
Andrea Turrini
Diletta Romana Cacciagrano
Vladimiro Sassone
Moreno Falaschi
Linda Brodo
Marzia Buscemi
Geoffrey Smith
Cosimo Laneve
Antonio Vitale
Pierpaolo Degano
Matthias Függer
Carlos Olarte
Elaine Pimentel
Camilo Rueda
Financement
DIGITEO/EP
DIGITEO/EP
DIGITEO/INRIA
DIGITEO/EP
DIGITEO/EP
DIGITEO/INRIA
DIGITEO/EP
DIGITEO/EP
DIGITEO/INRIA
DIGITEO/INRIA
DIGITEO/INRIA
DIGITEO/INRIA
DIGITEO/EP
DIGITEO
DIGITEO
DIGITEO/EP
DIGITEO/INRIA
DIGITEO/EP
DIGITEO/INRIA
DIGITEO/INRIA
INRIA
DIGITEO/INRIA
EP
DIGITEO/EP
DIGITEO/EP
DIGITEO/EP
Dates
01-02 2008
01-03 2008
02-04 2008
03-04 2008
04-06 2008
08-09 2010
11-12 2011
10-12 2012
04-06 2008
01-03 2009
06-07 2010
11-12 2011
06-07 2012
01-02 2009
06-07 2010
06-07 2012
01-03 2009
05-07 2009
08-12 2011
05-07 2009
05-07 2009
06-09 2010
01-04 2012
06-07 2012
06-07 2012
10-12 2012
Autres
Nom
Michael Martinez
Yamil Perchy
Luis Pino
Mario Sergio Alvim
Marco Stronati
Michela Paolini
Fonction
Intern
Intern
Intern
Postdoc
Intern
Intern
Intern
Financement
INRIA
INRIA
INRIA
INRIA
ANR(PANDA)
ANR(PANDA)
IMT Lucca
Dates
05-07 2009
11-12 2009
05-06 2010
10-12 2011
10-12 2011
01-03 2012
10-12 2012
Invitant
C. Palamidessi
C. Palamidessi
C. Palamidessi
F. Valencia
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
C. Palamidessi
B. Charron-Bost
F. Valencia
C. Palamidessi
F. Valencia
170CHAPTER V.1. LISTE DES MEMBRES : CONCURRENCY, MOBILITY AND TRANSACTIONS
V.2 Rapport scientifique : Concurrency,
Mobility and Transactions
V.2.1
V.2.1.1
Introduction
Our times are characterized by the massive presence of highly distributed systems consisting of
diverse and specialized devices, forming heterogeneous networks, and providing different services and applications. Revolutionary phenomena such as social networks and cloud computing
are examples of such systems.
In Comète we study emerging concepts of this new era of computing. Security and privacy
are some of the fundamental concerns that arise in this setting. In particular, in the modern
digital world the problem of keeping information secret or confidential is exacerbated by orders
of magnitude: the frequent interaction between users and electronic devices, and the continuous
connection between these devices and the internet, offer malicious agents the opportunity to
gather and store huge amount of information, often without the individual even being aware of it.
Mobility is an additional source of vulnerability, since tracing may reveal significant information.
To avoid these kinds of hazards, security protocols and various techniques for privacy protection
have been designed. However, the properties that they are supposed to ensure are rather subtle,
and, furthermore, it is difficult to foresee all possible expedients that a potential attacker may
use. As a consequence, even protocols that seem at first “obviously correct” are later (often years
later) found to be prone to attacks.
In addition to the security problems, the problems of correctness, robustness and reliability
are made more challenging by the complexity of these systems, since they are highly concurrent
and distributed. Despite being based on impressive engineering technologies, they are still prone
to faulty behavior due to errors in the software design.
To overcome these drawbacks, we need to develop formalisms, reasoning techniques, and verification methods, to specify systems and protocols, their intended properties, and to guarantee
that these intended properties of correctness and security are indeed satisfied.
In Comète we study formal computational frameworks for specifying these systems, theories
for defining the desired properties of correctness and security and for reasoning about them, and
methods and techniques for proving that a given system satisfies the intended properties.
V.2.1.2
Probability and information theory. Much of the research of Comète focuses on security and
privacy. In particular, we are interested in the problem of the leakage of secret information
through public observables.
Ideally we would like systems to be completely secure, but in practice this goal is often impossible to achieve. Therefore, we need to reason about the amount of information leaked, and
the utility that it can have for the adversary, i.e. the probability that the adversary is able to
exploit such information.
The recent tendency is to use an information theoretic approach to model the problem and
define the leakage in a quantitative way. The idea is to consider the system as an informationtheoretic channel. The input represents the secret, the output represents the observable, and
the correlation between the input and output (mutual information) represents the information
leakage.
Information theory depends on the notion of entropy as a measure of uncertainty. From the
security point of view, this measure corresponds to a particular model of attack and a particular
way of estimating the security threat (vulnerability of the secret). Most of the proposals in the
literature use Shannon entropy, which is the most established notion of entropy in information
theory. We, however, consider also other notions, in particular Rényi min-entropy, which seems
to be more appropriate for security in common scenarios like one-try attacks.
171
172CHAPTER V.2. RAPPORT SCIENTIFIQUE : CONCURRENCY, MOBILITY AND TRANSACTIONS
Model checking. Model checking addresses the problem of establishing whether a given specification satisfies a certain property. We are interested in developing model-checking techniques
for verifying concurrent systems of the kind explained above. In particular, we focus on security
and privacy, i.e., on the problem of proving that a given system satisfies the intended security or
privacy properties. Since the properties we are interested in have a probabilistic nature, we use
probabilistic automata to model the protocols. A challenging problem is represented by the fact
that the interplay between nondeterminism and probability, which in security presents subtleties
that cannot be handled with the traditional notion of a scheduler,
Concurrent constraint programming. Concurrent constraint programming (ccp) is a well established process calculus for modeling systems where agents interact by posting and asking
information in a store, much like in users interact in social networks. This information is represented as first-order logic formulae, called constraints, on the shared variables of the system (e.g.,
X > 42). The most distinctive and appealing feature of ccp is perhaps that it unifies in a single
formalism the operational view of processes based upon process calculi with a declarative one
based upon first-order logic. It also has an elegant denotational semantics that interprets processes as closure operators (over the set of constraints ordered by entailment). In other words,
any ccp process can be seen as an idempotent, increasing, and monotonic function from stores to
stores. Consequently, ccp processes can be viewed as: computing agents, formulae in the underlying logic, and closure operators. This allows ccp to benefit from the large body of techniques
of process calculi, logic and domain theory.
Our research in ccp develops along the following two lines:
(a) The study of a bisimulation semantics for ccp. The advantage of bisimulation, over other
kinds of semantics, is that it can be efficiently verified.
(b) The extension of ccp with constructs to capture emergent systems such as those in social
networks and cloud computing.
Expressiveness of Concurrent Formalisms. We study computational models and languages
for distributed, probabilistic and mobile systems, with a particular attention to expressiveness
issues. We aim at developing criteria to assess the expressive power of a model or formalism
in a distributed setting, to compare existing models and formalisms, and to define new ones
according to an intended level of expressiveness, also taking into account the issue of (efficient)
implementability.
Verification and Design of Distributed Algorithms. We study the verification and the design
of distributed algorithms. For the former, the objective is to develop a formal framework allowing to prove the correctness of distributed algorithms under thehypothesis of asynchronous
communication and in the presence of errors (of transmission or code execution). For the latter,
the objective is to design and analyze the complexity of distributed algorithms for coordinating
and synchronizing the agents (processes), when the topology of the interaction graph varies over
time due to transmission failures or due to the agents’ mobility.
V.2.1.3
Here we list some examples of our most significant contributions:
g-leakage. In [378] we introduced g-leakage, a rich generalization of the min-entropy model of
quantitative information flow. In g-leakage, the benefit that an adversary derives from a certain
guess about a secret is specified using a gain function g. Gain functions allow a wide variety of
operational scenarios to be modeled, including those where the adversary benefits from guessing a value close to the secret, guessing a part of the secret, guessing a property of the secret, or
guessing the secret within some number of tries. We proved important properties of g-leakage,
V.2.1. THÉMATIQUE GÉNÉRALE ET PRINCIPAUX OBJECTIFS
173
including bounds between min-capacity, g-capacity, and Shannon capacity. We also showed a
deep connection between a strong leakage ordering on two channels, C1 and C2, and the possibility of factoring C1 into C2 C3 , for some C3 . Based on this connection, we proposed a
generalization of the Lattice of Information from deterministic to probabilistic channels.
Modeling the adversary’s knowledge and belief. In real life situations it is often the case that
the attacker has some extra knowledge, independent from the protocol. For instance, in the case
of anonymity protocols, the attacker may have some expectations about the behavioral patterns
of individual users. This extra knowledge is called belief when it may be inaccurate. In [417]
we investigated how the adversary’s knowledge and belief evolves, and what is its impact on the
vulnerability of the system. We also reformulated and extended Reiter and Rubin’s notion of
probable innocence, and provided a new formalization for it based on the concept of protocol
vulnerability. Accordingly, we established new formal relationships between protocol parameters and attackers’ knowledge expressing necessary and sufficient conditions to ensure probable
innocence.
Computing leakage measures via model checking. In [379] we addressed the problem of verifying the leakage of a system in an efficient way, via model checking techniques. This was among
the first works to investigate the use of model checking for computing the measures related to
the information theoretic approaches to quantitative information flow. We proposed two methods: one based on reducing the problem to reachability, and the other based on techniques from
quantitative counterexample generation. The second approach can be used either for exact or
approximate computation, and provides feedback for debugging. We also considered the interactive case and we pointed out that the definition of associated channel proposed in literature
was not sound. We showed however that the leakage can still be defined consistently, and that
our methods extended smoothly.
Relation between differential privacy and quantitative information flow. Differential privacy is a notion that has emerged in the community of statistical databases, as a response to
the problem of protecting the privacy of the database’s participants when performing statistical
queries. The idea is that a randomized query satisfies differential privacy if the likelihood of obtaining a certain answer for a database x is not too different from the likelihood of obtaining the
same answer on adjacent databases, i.e. databases which differ from x for only one individual.
In [428], we analyzed critically the notion of differential privacy in light of the conceptual
framework provided by the Rényi min information theory. We proved that there is a close relation
between differential privacy and leakage, due to the graph symmetries induced by the adjacency
relation. Furthermore, we considered the utility of the randomized answer, which measures its
expected degree of accuracy. We focused on certain kinds of utility functions called “binary”,
which have a close correspondence with the Rényi min mutual information. Again, it turns
out that there can be a tight correspondence between differential privacy and utility, depending
on the symmetries induced by the adjacency relation and by the query. Depending on these
symmetries we can also build an optimal-utility randomization mechanism while preserving the
required level of differential privacy. Our main contribution was a study of the kind of structures
that can be induced by the adjacency relation and the query, and how to use them to derive
bounds on the leakage and achieve the optimal utility.
Differential privacy with general metrics. Differential privacy can be interpreted as a bound
on the distinguishability of two generic databases, which is determined by their Hamming distance: the distance in the graph determined by the adjacency relation (recall that two databases
are adjacent if they differ for one individual).
In [403] we lifted the restriction relative to the Hamming graphs and we explored the implications of differential privacy when the indistinguishability requirement depends on an arbitrary
notion of distance. We showed that we can express, in this way, (protection against) kinds of
privacy threats that cannot be naturally represented with the standard notion. We gave an intuitive characterization of these threats in terms of Bayesian adversaries, which generalizes the
characterization of (standard) differential privacy from the literature. Next, we revisited the wellknown result on the non-existence of universally optimal mechanisms for any query other than
counting queries. We showed that in our setting, for certain kinds of distances, there are many
more queries for which universally optimal mechanisms exist: Notably sum, average, and percentile queries. Finally, we showed some applications in various domains: statistical databases
where the units of protection are groups (rather than individuals), geolocation, and smart metering.
Privacy for location-based services. The growing popularity of location-based services, allowing unknown/untrusted servers to easily collect and process huge amounts of users’ information
regarding their location, has recently started raising serious concerns about the privacy of this
kind of sensitive information. In [442] we studied geo-indistinguishability, a formal notion of
privacy for location-based services that protects the exact location of a user, while still allowing
approximate information - typically needed to obtain a certain desired service - to be released.
Our privacy definition formalizes the intuitive notion of protecting the user’s location within
a radius r with a level of privacy that depends on r. We presented three equivalent characterizations of this notion, one of which corresponds to a generalized version [403] of the well-known
concept of differential privacy. Furthermore, we presented a perturbation technique for achieving geo-indistinguishability by adding controlled random noise to the user’s location, drawn
from a planar Laplace distribution. We demonstrated the applicability of our technique through
two case studies: First, we showed how to enhance applications for location-based services with
privacy guarantees by implementing our technique on the client side of the application. Second,
we showed how to apply our technique to sanitize location-based sensible information collected
by the US Census Bureau.
Robust Languages for Distributed Systems. We have made progress in concurrency theory
by extending the well established theory of concurrent constraint programming (ccp) to capture
new and wider phenomena. In [423] we introduced an universal construction for ccp to capture
mobility, a phenomenon which now pervades the informational world. More recently, in order
to model systems like social networks and cloud computing we introduced spatial and epistemic
process calculi for reasoning about spatial information and knowledge distributed among the
agents of a system [419] . We also introduced domain-theoretical structures to represent spatial and epistemic information. Finally we provided operational and denotational techniques
for reasoning about the potentially infinite behaviour of spatial and epistemic processes. We
also gave compact representations of infinite objects that can be used by processes to simulate
announcements of common knowledge and global information.
Fault-tolerant Distributed Computing. Problems in fault-tolerant distributed computing have
been studied in a variety of models. These models are structured around two central ideas:
(1) degree of synchrony and failure model are two independent parameters that determine a
particular type of system, (2) the notion of faulty component is helpful and even necessary for
the analysis of distributed computations when faults occur. In [359] we questioned these two
basic principles of fault-tolerant distributed computing, and showed that it is both possible and
worthy to renounce them in the context of benign faults: we presented a computational model
based only on the notion of transmission faults. In this model, computations evolve in rounds,
and messages missed in a round are lost. Only information transmission is represented: for each
round r and each process p, our model provides the set of processes that p “hears of” at round r
(heard-of set), namely the processes from which p receives some message at round r. The features
of a specific system are thus captured as a whole, just by a predicate over the collection of heardof sets. We showed that our model handles benign failures, be they static or dynamic, permanent
or transient, in a unified framework. We demonstrated how this approach leads to shorter and
V.2.1. THÉMATIQUE GÉNÉRALE ET PRINCIPAUX OBJECTIFS
175
simpler proofs of important results (non-solvability, lower bounds). In particular, we proved that
the Consensus problem cannot be generally solved without an implicit and permanent consensus
on heard-of sets. We also examined Consensus algorithms in our model. In light of this specific
agreement problem, we showed how our approach allows us to devise new interesting solutions.
Complexity in Distributed Computing. Linear max-plus systems describe the behavior of a
large variety of complex systems. It is known that these systems show a periodic behavior after
an initial transient phase. Assessment of the length of this transient phase provides important
information on complexity measures of such systems, and so is crucial in system design. In [444]
we identified relevant parameters in a graph representation of these systems and proposed a
modular strategy to derive new upper bounds on the length of the transient phase. We used
these bounds to derive new complexity results in distributed computing.
Bisimilarity Algorithms for Constraint-based Calculi. Bisimilarity is a standard behavioural
equivalence in concurrency theory, but a well-behaved notion of bisimilarity for ccp has been
proposed only recently. When the state space of a system is finite, the ordinary notion of bisimilarity can be computed via the well-known partition refinement algorithm, but unfortunately,
this algorithm does not work for ccp bisimilarity. In [386] we proposed a variation of the partition refinement algorithm for verifying ccp bisimilarity. To the best of our knowledge this is the
first work providing for the automatic verification of program equivalence for ccp.
In [386, 385] we only studied the strong version of bisimilarity. Weak bisimiliarity is obtained from the strong case by taking into account only the actions that are observable in the
system. Typically, the standard partition refinement can also be used for deciding weak bisimilarity simply by using Milner’s reduction from weak to strong bisimilarity; a technique referred
to as saturation. In [387] we showed that, because of its involved labeled transitions, the abovementioned saturation technique does not work for ccp. We also gave an alternative reduction
from weak ccp bisimilarity to the strong one that allows us to use the ccp partition refinement
algorithm for deciding this equivalence.
V.2.1.4
Members of our team are strongly involved in academic and scientific activities at an international level. We collaborate with researchers in Europe, South and North America, and Asia
and have participated in eight international projects. These collaborations has resulted in a significant number of student recruitments and visitors. We have also organized and participated
in over sixty international conferences and workshops, and have been invited speakers in over
twenty international events.
Regarding prizes, one of our doctoral students, Konstantinos Chatzikokolakis, was awarded
second place of the Prix de thèse Gilles Kahn in November, 2008.
V.2.1.5
The day-to-day work at Comète is based on a constant interaction between the permanent members, postdocs, students, and interns on research themes. The Comète-Parsifal seminar series
routinely meets and hosts international and local scientists. Coordination of the teams activities
are organized by the use of web-based calendars, svn repositories, mailing list, and web pages.
Our team enjoys a strong sense of comradeship among its members. We all regularly take
part of the various scientific and social activities of the group.
The funding of the team is mainly based on INRIA, International and French Projects, and
INRIA associated teams. PhD students are typically funded using our projects and grants from
INRIA, DGA, EDX, and CNRS. Postdocs are mainly funded by INRIA, Projects, Qualcomm, and
CNRS. Visitors are funded using DIGITEO, INRIA, CNRS, and projects.
V.3 Projet de recherche : Concurrency,
Mobility and Transactions
V.3.1
Here we describe our main goals for future work.
V.3.1.1
Objectif 1: Privacy protection in trace-based services
In a recent work ([1] in Chapter V.3) we introduced the notion of geo-indistinguishability, a privacy definition that protect the accuracy of the user’s geographical position when using locationbased services (LBS’s). Similarly to differential privacy ([2] in Chapter V.3) in its version extended
to arbitrary metrics ([403] in Chapter V.5), geo-indistinguishability demands that the closer two
points are, the more indistinguishable they should be. We have also proposed an efficient mechanism to achieve geo-indistinguishability by obfuscating the user’s position with noise drawn
from a planar Laplacian distribution. This method works well in those situations where accuracy is not essential for the service and a controlled amount of noise can be tolerated. The typical
example is a user walking in a city and querying a LBS for nearby points of interest such as
restaurants, where inaccuracy of hundreds of meters is acceptable, or gas stations, for inaccuracy
up to some kilometers.
The same mechanism can be used to sanitize location traces simply applying it independently
to each location. This approach has been investigated in previous work ([1] in Chapter V.3). However, the degree of protection decreases with the number of interactions with the system. This is
a phenomenon inherent to the nature of privacy mechanisms based on probabilistic obfuscation:
multiple observations tend to progressively cancel the noise. For this reason, in the practice of
differential privacy we use a notion of budget: each interaction consumes a fraction of the budget, and when the budget is all spent, no more interactions are allowed. In the case of traces, this
means that simply applying the mechanism independently to each location is not feasible when
the number of locations is too high, as the budget may not be sufficient.
One of our goals is to investigate methods to reduce the budget consumption in the approach
illustrated above, so to make it applicable to trace localization. Our idea is to exploit the correlation present in the data to predict the approximate position of the next location, so to avoid
applying the obfuscation mechanism, and therefore the budget consumption, each time a new
location is reported.
More precisely, we aim at developing a mechanism for geo-indistinguishability of traces.
The main ingredients will be a prediction function and a differentially private test to verify
the accuracy of the outcome of a prediction. For locations that fail the test, the standard geoindistinguishable mechanism will be used. The main component of the mechanism will be the
budget manager: it will configure the other components based on analysis of the previous steps,
and will account for the dynamic behaviour of the system. For instance, we could consider a
policy in which, while keeping a fixed privacy level, given a fixed number of steps we try to maximize utility. Alternatively, given a fixed utility, we could try to maximize the number of steps.
Various notions of utility will also be considered: for instance, we could measure the accuracy,
or the number of steps that the budget allows us to make.
The final goal of this work is to construct an LBS for traces which will provide geo-indistinguishability, and be also feasible for a high number of locations. The LBS will allow configuration of various parameters such as the policy to be adopted, and the notion of utility according
to the needs of the user.
V.3.1.2
Objectif 2: Extending the Theory of Quantitative Information Flow
Existing measures of leakage from quantitative information flow fail to take into account the
structure of the information that needs to be protected, considering all secrets to be of equal
177
178CHAPTER V.3. PROJET DE RECHERCHE : CONCURRENCY, MOBILITY AND TRANSACTIONS
value. Only recently was the importance of this restriction acknowledged, leading to the development of the g-leakage framework (see [378] in Chapter V.5) a generalization of the well-known
concept of min-entropy leakage, aiming at taking into account the structure of the data and the
gain that an adversary can obtain by inferring a secret partially or approximately.
In privacy preserving scenarios, the structure of the data is crucial and an adversary can obtain significant gains by inferring only part of the secret information (for example the value of
a single individual). Thus, g-leakage is better suited for measuring the loss of privacy than traditional quantitive information flow (QIF) measures. We will develop measures of information
leakage that are adapted to privacy requirements, using the g-leakage framework as a foundation. We will also explore the relationship between such privacy-specific measures of leakage
and the generalized differential privacy given in [403], Chapter V.5. This will lead to a deeper
understanding of the privacy guarantees provided by these notions.
We will investigate the foundations of g-leakage, trying to generalize the the concepts and
results of the traditional QIF theories. In particular, we aim at exploring the compositionality
properties of g-leakage and the corresponding notion of capacity. Furthermore, in the case of
applications in which a notion of utility is present, we will investigate the trade-off between
(the lack of) g-leakage and utility. In general, g-leakage can be expressed by means of a linear
expression on the elements of the channel matrix (representing the probability that a given secret
produces a certain observable). Hence we expect that the problem of finding the channel matrix
providing the least g-leakage, for a given level of utility, could be attacked using techniques of
linear programming.
V.3.1.3
Objectif 3: Epistemic and Spatial Reasoning for Distributed Systems
with Applications to Social Networks
Distributed Systems have changed substantially in the recent past with the digital revolution epitomized by the phenomena of social networks and cloud computing. In the previous incarnation
of distributed computing the emphasis was on consistency, fault tolerance, resource management
and related topics; these were all characterized by interaction between processes. Research proceeded along two lines: the algorithmic side and the more process algebraic approach where the
emphasis was on developing compositional reasoning principles. What marks this new era of
distributed systems is an emphasis on managing access to information to a much greater extent
and flexibility than before.
There are two prominent aspects of this new era of distributed systems that are central to
our future work. The first one is the intrinsic epistemic nature of these systems arising from
the presence of social behaviour. We constantly have millions of users posting facts, opinions,
beliefs and making decisions on social networks; (epistemic) information is everywhere. How precisely and by whom a user’s opinions and beliefs can be seen may have a significant impact on his
social/professional life. Being able to model this epistemic flow in a highly distributed environment would thus be an important contribution to asses the risk of privacy breaches. The other is
the spatial nature of computation. With the advent of cloud computing and other digital services,
computational space is now more than ever available to everyone; space is everywhere. Users, programs and information are spatially distributed in these networks. A solid understanding of this
notion of space is fundamental in any model of today’s distributed systems.
Goal. Given their complexity and increasing popularity, the design, analysis, simulation, and
programming of the new era of distributed systems will continue to raise important challenges
to computer science. We propose to rise to this challenge by developing an innovative and expressive computational model for these systems that will coherently combine techniques for the
analysis of concurrent systems such as process calculi with epistemic and spatial formalisms. The
model should provide reasoning techniques to predict potential privacy breaches as well as intrusive and unreliable behaviour. Epistemic analysis will be used to reason about the distributed
agents’ information, beliefs and knowledge acquired during computation. Spatial formalisms
will be used to describe distributed network topologies. The integration of these formalisms in
V.3.1. OBJECTIFS SCIENTIFIQUES
179
a single framework will allow us to capture meaningful families of modern distributed systems
that cannot be faithfully modeled in any previous concurrent framework.
Approach. In [419] (Chapter V.5) we put forth a process calculus, sccp, featuring two novel
operators: a spatial and an epistemic operator. The spatial operator may specify a process, or
a local store of information, that resides within the space of a given agent (e.g., an application
in some user’s account, some private data shared with a specific group). The epistemic operator
may specify that the information computed by a given process will be known to a given agent. To
the best of our knowledge, other process calculi can only express these epistemic concepts and
the spatial distribution of information indirectly.
Although our sccp model represents a significant first approach, in its present form it is not
sufficiently robust for the today’s distributed systems as we argue below. Our research strategy
is to develop a conservative extension of sccp, which we shall call D-Spaces, that captures more
faithfully the systems under consideration. The two technically challenging phenomena, not
included in sccp, that we shall explore in the development of our model are the following:
• Spatial mobility. The sccp model does not capture mobility, a common feature in the systems under consideration: Agents and programs may change from one space to another.
Other examples include GPS applications running on mobile devices, and in general agents
in distributed systems with dynamic and hierarchical link topologies. We plan to adapt the
notion of “change” from logic frameworks to capture mobility in D-Spaces.
• Quantitative Reasoning. Sccp does not include quantitative spatial and epistemic information. We propose an extension that will allow us to add weights to agents beliefs and
information within sccpthe spaces of the system. Our approach is to generalize the sccp
notion of space in D-Spaces as a form of probabilistic measure on epistemic statements to
express meaningful and wider social scenarios. For instance, suppose that c represents a
statement, the perception of which may change according to space, time or the individual,
e.g., an inherently subjective statement about politics, religion, or sports. We may have, for
example, that agent i initially believes that c holds with some probability p < 1. After interacting with other agents or moving across different spaces, agent i may end up convinced
that c is true (or that it is false). We can also express that agent i believes c more than agent j
does and other similar statements related to social interaction. This quantitative modeling
provides a more faithful representation of virtual social behavior in distributed networks,
where information certainty changes parallel to its dissemination.
The expected outcome is two-fold. On the theoretical side we will advance the state of the
art of concurrency theory with a formalism that deals with new challenging concepts from epistemic and spatially distributed systems. We also plan to extend other computational models for
distributed computing to deal with space and epistemic behavior. In particular, mobile agents
and programs, quantitative spatial information, and unboundedly many agents will be allowed
in the model. The model will be also equipped with reasoning techniques to predict and prevent,
by construction, privacy breaches and unreliable behaviour. On the other, we expect to produce
an automated tool to simulate and verify potential privacy breaches and unreliable behaviour on
the systems under consideration. We shall also implement a prototype of a social network based
on specialization of D-Spaces.
180CHAPTER V.3. PROJET DE RECHERCHE : CONCURRENCY, MOBILITY AND TRANSACTIONS
Bibliography
[1] Miguel E. Andrés, Nicolas Bordenabe, Konstantinos Chatzikokolakis, Catuscia Palamidessi.
Geo-indistinguishability: Differential privacy for location-based systems. In 20th ACM Conference on Computer and Communications Security (CCS 2013), 2013. To appear.
[2] Cynthia Dwork. Differential privacy. In Michele Bugliesi, Bart Preneel, Vladimiro Sassone,
Ingo Wegener, editors, 33rd International Colloquium on Automata, Languages and Programming
(ICALP 2006), volume 4052 of Lecture Notes in Computer Science, pages 1-12. Springer, 2006.
[4] Joseph Y. Halpern, Yoram Moses. Knowledge and common knowledge in a distributed environment. In Tiko Kameda, Jayadev Misra, Joseph G. Peters, Nicola Santoro, editors, 3rd Annual
ACM Symposium on Principles of Distributed Computing (PODC 1984), pages 50-61. ACM, 1984.
[5] Ronald Fagin, Joseph Y. Halpern, Yoram Moses and Moshe Vardi. Reasoning About Knowledge. MIT Press, 1995.
181
182
BIBLIOGRAPHY
en
ac
es
T
th he
offi e s ad
an c ec mi
d es ur nis
re m ity tr
cr ak a at
ui e n ive
t s it d
tu di im bur
de ffic mi de
nt ul gr ns
s t t at f
an o io ro
d ho n m
vi st
si
to
rs
s
•
A F
O M
NEGATIF
M
es
ss
At
ou
ts
l
le
té
ni
tu
or
pp
O
e
t,
th
of
ts nd os
ac a cr
tr ry i a- es
at st . M N d
y du .g on et
ac in . E issi ue
iv
s
q
pr the ion mm ati
on of ut o rm
k t tit C fo
or es s nd in
W ter r in , a l’ IL).
• in the les de CN
o a le (
Th ona rtés
ti be
li
183
ria
st
du
in
S
S tro
Fo yst ng
S rm em b
ti tro a s, ack
pa ons ng l Me Inf gro
e ti : In t or u
o ven on Re te hod ma nd
in f fo ts in flec rna s. tio in
te re a se te tio
n Di
rn ig nd ve d n
Th s t
s n a ra in al
eo rib
st s l
c
ry ute
ud ig in the oll
an d
en nifi ter p ab
a
d
ts ca na rt or
, v n ti ic ais t n on iito u al
rs m b
an er
d
e
th
•
se
ea
cr
in
to r
ed sfe
Ne an
tr
•
•
ib
Fa
POSITIF
V.4 Analyse AFOM : Concurrency, Mobility
and Transactions
INTERNE
EXTERNE
Figure V.4.1: Analyse AFOM de l’équipe Concurrency, Mobility and Transactions : Atouts, Faiblesses, Opportunités, Menaces
184
CHAPTER V.4. ANALYSE AFOM : CONCURRENCY, MOBILITY AND TRANSACTIONS
V.5 Fiche résumé : Concurrency, Mobility
and Transactions
V.5.1
Membres
2008 : 3 chercheurs (2 CNRS, 1 INRIA), 4 postdocs, 6 doctorants
Nouveaux membres: Konstantinos Chatzikokolakis joined our team in 2011 as CNRS CR2 researcher. His expertise in quantitative information flow and differential privacy as well as probabilistic process calculi and information theory are an excellent complement .
V.5.2
Quantitative information flow. Our team has had a leading role in establishing the foundations of the modern approach to quantitative information flow, and in finding connections with
other fields, in particular, anonymity and privacy. When we started doing research in this area
the most popular approach to model leakage was based on Shannon’s information theory. We
were among the first to recognize that the Shannon entropy is not the most natural notion to
represent the behaviors of typical adversaries, and we started exploring suitable models for a
Bayesian attacker. Recently, we have been able to characterize several classes of attacks by using the more general conceptual framework of decision theory. In connection with this research,
we have developed various software tools for measuring information leakage and other related
quantities in the various models. These tools are not yet in the state of being disseminated, but
several members of our community have already started using them, and they find them quite
useful.
Differential privacy on general metric spaces. Differential privacy is probably the most accepted approach to privacy protection in statistical databases. Based on the notion of Hamming
distance between datasets, this theory establishes how much noise we should add to queries’
answers in order to provide a certain level of privacy for the individuals participating in the
database. We have extended the framework of differential privacy to arbitrary metric domains,
and we have characterized universally optimal mechanisms for a large class of queries, thus setting a sharp contrast, surprisingly, with the standard differential privacy case, for which only
counting queries admit universally optimal mechanisms. We have also studied applications of
the generalized definition, for statistical databases as well as for other areas, such that privacyaware geolocation and smart metering.
Epistemic and spatial reasoning in distributed systems. The increasing prevalence of the internet and its involvement in every aspect of people’s lives makes information protection in distributed settings a crucial research area. Recently, concurrent systems have changed significantly
with the advent of phenomena such as social networks and cloud computing. In these settings,
epistemic information, or information about the users’ knowledge as well as spatial distribution
are central concerns. We have explored novel ways of applying epistemic and spatial reasoning to problems in concurrency theory. In particular, we developed process calculi which use
modalities as programming constructs, allowing the expression of epistemic and spatial information within the process calculus. The calculi are equipped with tools such as equivalences,
denotational semantics and verification techniques to reason about social and spatial behavior in
distributed systems.
185
186
CHAPTER V.5. FICHE RÉSUMÉ : CONCURRENCY, MOBILITY AND TRANSACTIONS
Models for Distributed Systems One of our aims is to develop meaningful computational
models for distributed systems. Recently, we developed a formalism that combines the advantages of the standard round-by-round fault detector model and the Transmission Faults model
but avoids their drawbacks. Our round-based computational model, called Heard-Of (HO for
short) in which the synchrony degree and failure model are encapsulated in the same high-level
abstraction, and the notion of faulty component (process or link) has totally disappeared. As
a result, the HO model accounts for transmission faults without specifying by whom nor why
such faults occur. There is no evidence that this leads to a more powerful model than existing
models from a computational viewpoint. However, we proved the semantic effectiveness of the
HO model, and show that it is more elegant and simpler, specially for the design and correctness
proofs of fault-tolerant distributed algorithms. Indeed, simplicity and conciseness is crucial for
model checking and formal verifications of algorithms.
V.5.3
V.5.3.1
Publications
Journaux : 24
The following are some of our most significant publications:
• Anonymity protocols as noisy channels. K. Chatzikokolakis, C. Palamidessi, P. Panangaden.
Information and Computation 206 (2), 378-401, 2008 In this paper we have applied the information theoretic approach to Anonymity. This paper has been cited 122 times according
to Google Scholar.
• Measuring Information Leakage using Generalized Gain Functions. M. Alvim, K Chatzikokolakis, C Palamidessi, G Smith. IEEE 25th Computer Security Foundations Symposium,
265-279. 2012. In this paper we have proposed the first decision-theoretic model for information flow, and have showed that it can model a rich class of adversaries.
• Broadening the scope of Differential Privacy using Metrics. K Chatzikokolakis, ME Andrés, NE
Bordenabe, C Palamidessi. Privacy Enhancing Technologies, 82-102, 2013. In this paper
we have extended the definition of differential privacy to arbitrary metrics.
• Spatial and Epistemic Modalities in Constraint-Based Process Calculi. S. Knight, C. Palamidessi,
P. Panangaden, F. Valencia. CONCUR 2012: 317-332, 2012. In this paper we have put forward a calculus to reason about spatial and epistemic behavior on distributed systems. This
is the first process calculus using epistemic modalities for distributed systems.
• Deriving Labels and Bisimilarity for Concurrent Constraint Programming. A. Aristizabal, F.
Bonchi, C. Palamidessi, L. Pino, F. Valencia. FOSSACS 2011: 138-152, 2011. In this paper we have introduced the first proper notion of bisimulation for Concurrent Constraint
Programming. We have also showed that previous notions of bisimulation were not satisfactory.
• The Heard-Of Model: Computing in Distributed Systems with Benign Failures. B. Charron-Bost
and A. Schiper. Distributed Computing, Springer Verlag, vol. 22(1), pp. 49–71, 2009. In
this work, we have questioned two basic principles of fault-tolerant distributed computing:
(1) The independence of the degree of synchrony and failure model, and (2) necessity of
the notion of faulty component is helpful and for the analysis of distributed computations
when faults occur. We have showed that it is both possible and worthy to renounce these
principle in the context of benign faults. This paper has been cited 79 times according to
Google Scholar.
V.5.3. PRODUCTION SCIENTIFIQUE
187
• New Transience Bounds for Long Walks. B. Charron-Bost, Matthias Függer, Thomas Nowak.
ArXiv, volume abs/1209.3342, 2012. In this paper we derived new complexity results in
distributed computing. To do this we identified relevant parameters in a graph representation of linear max-plus systems and proposed a modular strategy to derive new upper
bounds on the length of the transient phase. We are the first to give asymptotically tight
and potentially subquadratic transience bounds.
V.5.3.2
Rayonnement
Catuscia Palamidessi has been a chair of various conferences (for example, QEST 2011 and TGC
2012), and has participated in the PC of several conferences, including CONCUR, LICS, CSF, and
ICALP. She is in the editorial board of the journal Mathematical Structures in Computer Science and
in the steering committees of the European Association of Theoretical Computer Science and the
European Joint Conferences on Theory and Practice of Software. She has been the coordinator
of the ANR project PANDA, and coordinator of all the INRIA sites for the Marie Curie Action
MEALS. She has given invited talks at some of the main conferences in theoretical computing
science such as LICS 2010 and ICALP 2011. She has also been invited to chair LICS 2015, and to
write an article on her recent research interests in information flow and privacy for the Communications of the ACM.
Kostas Chatzikokolakis has been a PC co-chair of two international workshops (SecCo 2010
and SecCo 2011) as well as PC member of five well-established international conferences (for
example, ESOP 2012, TGC 2012) and several international workshops. In 2008, he received the
second “Prix de thèse Gilles Kahn” for his PhD thesis. He has been invited to give two talks on the
popularization of science (Debat citizen, 2012, Unithé ou Café?, 2011) as well as several invited
talks at international workshops and seminars (for example, the DIMACS Working Group on
Measuring Anonymity, 2013).
Frank Valencia has been a PC track co-chair of the international conference SOFSEM 2008
and a co-chair of two editions of the international workshop on expressiveness in concurrency
theory: EXPRESS 2011 and EXPRESS 2012. He is member of the steering committee of the
EXPRESS workshops. He has also participated in the PC of some of the main venues in declarative programming, expressiveness in concurrency and concurrency theory: ICLP 2008, ICLP
2009 and ICLP 2010, EXPRESS’08 and CONCUR 2012. He has co-edited two special issues
of Mathematical Structures in Computer Science on the expressiveness in concurrency theory
and the Theoretical Computer Science Festschrift for Mogens Nielsen’s 60th birthday. He has
established strong and continuos scientific and academic collaborations with Colombian universities. This international relation has resulted in the mobility of several students and visitors
between Colombia and France. He has been the main supervisor of five PhD students as well as
four interns. He has being the French coordinator for three International projects with Colombia (FORCES, REACT, and REACT-PLUS) and he is one of the principal investigators for the
Chinese-French ANR project PACE.
V.5.3.3
Team members are routinely involved with teaching activities. Here we list some of these activities.
• All our permanent members have been teaching at the MPRI Master Parisien de Recherche
en Informatique (M2 level) for a number of years.
• Bernadette Charron-Bost has been teaching courses at Master SAR, Université Paris VI.
• Catuscia Palamidessi has taught courses in advanced schools, such as FOSAD (Bertinoro,
Italy), and the Summer School RIO 2012 (Rio Cuarto, Argentina).
• Frank D. Valencia has been teaching summer school courses on concurrency theory at the
Universidad Javeriana, Cali, Colombia since 2004.
188
CHAPTER V.5. FICHE RÉSUMÉ : CONCURRENCY, MOBILITY AND TRANSACTIONS
V.6 Production scientifique : Concurrency, Mobility and Transactions
V.6.1
Édition des ouvrages
[336] Marco Carbone, Pawel Sobocinski, and Frank D. Valencia. Festschrift for Mogens Nielsen’s
60th Birthday. Theoretical Computer Science. Elsevier, September 2009.
[337] Bernadette Charron-Bost, Shlomi Dolve, Jo Ebergen, and Ulrich Schmid. Fault-Tolerant
Distributed Algorithms on VLSI Chips, volume 193 of Dagstuhl Seminar Proceedings.
Springer-Verlag, 2009.
[338] Bernadette Charron-Bost, André Schiper, and Fernando Pedone. Replication: Theory and
Practice, volume 5959 of Lecture Notes in Computer Science. Springer-Verlag, 2010.
[339] Maurizio Gabbrielli, Moreno Falaschi, and Catuscia Palamidessi. Abstract Interpretation
and Logic Programming: Festschrift in honor of professor Giorgio Levi, volume 410 of Theoretical Computer Science. Elsevier, 2009.
[340] Mogens Nielsen, Antonin Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma,
and Frank D. Valencia. SOFSEM 2009: Proceedings of the 35th Conference on Current
Trends in Theory and Practice of Computer Science, volume 5404 of Lecture Notes in Computer Science. Springer, 2009.
[341] Catuscia Palamidessi and Alma Riska. Proceedings of the Eighth International Conference
on Quantitative Evaluation of SysTems. IEEE, 2011.
[342] Catuscia Palamidessi and Mark D. Ryan. Proceedings of the 7th International Symposium
on Trustworthy Global Computing (TGC), volume 8191 of Lecture Notes in Computer Science. Springer, 2013.
Chapitres de livres
[343] Mário S. Alvim, Miguel E. Andrés, Konstantinos Chatzikokolakis, and Catuscia
Palamidessi. Quantitative information flow and applications to differential privacy. In
Alessandro Aldini and Roberto Gorrieri, editors, Foundations of Security Analysis and Design VI – FOSAD Tutorial Lectures, volume 6858 of Lecture Notes in Computer Science, pages
211–230. Springer, 2011.
[344] Romain Beauxis, Catuscia Palamidessi, and Frank D. Valencia. On the asynchronous
nature of the asynchronous π-calculus. In Rocco De Nicola, Pierpaolo Degano, and José
Meseguer, editors, Concurrency, Graphs and Models: Festschrift in honor of Prof. Ugo Montanari, Lecture Notes in Computer Science, pages 473–492. Springer, 2008.
[345] Bernadette Charron-Bost and André Schiper. Consensus with partial synchrony. In
Ming-Yang Kao, editor, Encyclopedia of Algorithms, pages 198–202. Springer-Verlag, March
2008.
[346] Maurizio Gabbrielli, Catuscia Palamidessi, and Frank D. Valencia. Concurrent and reactive constraint programming. In Agostino Dovier and Enrico Pontelli, editors, A 25-Year
Perspective on Logic Programming, pages 231–253. Springer, June 2010.
[347] Sophia Knight, Radu Mardare, and Prakash Panangaden. Combining epistemic logic and
Hennessy-Milner logic. In Robert L. Constable and Alexandra Silva, editors, Logic and
Program Semantics: Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday,
volume 7230 of Lecture Notes in Computer Science, pages 219–243. Springer, April 2012.
189
BIBLIOGRAPHY
190
[348] Giuseppe Longo, Catuscia Palamidessi, and Paul Thierry. Some bridging results and
challenges in classical, quantum and computational randomness. In Hector Zenil, editor,
Randomness Through Computation, pages 73–91. World Scientific, 2011.
[349] Carlos Olarte, Camilo Rueda, and Frank D. Valencia. Concurrent constraint calculi:
a declarative paradigm for modeling music systems. In Gérard Assayag and Andrew
Gerzso, editors, New Computational Paradigms for Computer Music, pages 97–112. Delatour France / Ircam-Centre Pompidou, June 2009.
[350] Mauricio Toro, Camilo Rueda, Frank D. Valencia, Gerardo Sarria, and Carlos Olarte.
Concurrent constraints models of music interaction. In Constraint Programming in Music,
pages 133–156. Wiley, 2011.
V.6.2
[351] Mário S. Alvim, Miguel E. Andrés, and Catuscia Palamidessi. Quantitative information
flow in interactive systems. Journal of Computer Security, 20(1):3–50, 2012.
[352] Miguel E. Andrés, Catuscia Palamidessi, Ana Sokolova, and Peter Van Rossum. Information hiding in probabilistic concurrent systems (journal version). Theoretical Computer
Science, 412(28):3072–3089, 2011.
[353] Romain Beauxis and Catuscia Palamidessi. Probabilistic and nondeterministic aspects
of anonymity. Theoretical Computer Science, 410(41):4006–4025, 2009.
[354] Martin Biely and Josef Widder. Optimal message-driven implementations of omega
with mute processes. ACM Transactions on Autonomous and Adaptive Systems, 4(1):Article
No. 4, 2009.
[355] Diletta Cacciagrano, Flavio Corradini, and Catuscia Palamidessi. Explicit fairness in
testing semantics. Logical Methods in Computer Science, 5(2):Article 15, 2009.
[356] Franck Cassez, Jérémy Dubreil, and Hervé Marchand. Synthesis of opaque systems with
static and dynamic masks. Formal Methods in System Design, 40(1):88–115, 2012.
[357] Bernadette Charron-Bost, Martin Hutle, and Josef Widder. In search of lost time. Information Processing Letters, 110(1):928–933, 2010.
[358] Bernadette Charron-Bost and Stephan Merz. Formal verification of a consensus algorithm in the heard-of model. International Journal of Software and Informatics, 3(2-3):273–
303, 2009.
[359] Bernadette Charron-Bost and André Schiper. The heard-of model: Computing in distributed systems with benign failures. Distributed Computing, 22(1):49–71, 2009.
[360] Konstantinos Chatzikokolakis, Sophia Knight, Catuscia Palamidessi, and Prakash
Panangaden. Epistemic strategies and games on concurrent processes. Transactions on
Computational Logic, 13(4):28:1–28:35, October 2012.
[361] Konstantinos Chatzikokolakis and Catuscia Palamidessi. Making random choices invisible to the scheduler. Information and Computation, 208(6):694–715, 2010.
[362] Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Christelle Braun. Compositional methods for information-hiding. Mathematical Structures in Computer Science,
2013. To appear.
[363] Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden.
Anonymity protocols as noisy channels. Information and Computation, 206(2-4):378–401,
2008.
V.6.3. CONFÉRENCES INTERNATIONALES
191
[364] Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden. On the
bayes risk in information-hiding protocols. Journal of Computer Security, 16(5):531–571,
2008.
[365] Henri Debrat and Stephan Merz. Verifying fault-tolerant distributed algorithms in the
heard-of model. Archive of Formal Proofs, June 2009.
[366] Sardaouna Hamadou, Vladimiro Sassone, and Mu Yang. An analysis of trust in
anonymity networks in the presence of adaptive attackers. Mathematical Structures in
Computer Science, 2013. To appear.
[367] Simon Kramer and Julian C. Bradfield. A general definition of malware. Journal in
Computer Virology, 6(2):105–114, 2010.
[368] Simon Kramer, Catuscia Palamidessi, Roberto Segala, Andrea Turrini, and Christelle
Braun. A quantitative doxastic logic for probabilistic processes and applications to
information-hiding. The Journal of Applied Non-Classical Logic, 19(4):489–516, 2009.
[369] Matteo Mio. On the equivalence of game and denotational semantics for the probabilistic
µ -calculus. Logical Methods in Computer Science, 8(2):Paper 7, June 2012.
[370] Matteo Mio. Probabilistic modal mu-calculus with independent product. Logical Methods
in Computer Science, 8(4):Paper 18, November 2012.
[371] Gethin Norman, Catuscia Palamidessi, David Parker, and Peng Wu. Model checking
probabilistic and stochastic extensions of the π-calculus. IEEE Transactions of Software
Engineering, 35(2):209–223, 2009.
[372] Carlos Olarte and Camilo Rueda. A declarative language for dynamic multimedia interaction systems. Mathematics and Computation in Music, 38:218–227, July 2009.
[373] Carlos Olarte, Camilo Rueda, and Frank D. Valencia. Models and emerging trends of
concurrent constraint programming. Constraints, 18(4):535–578, 2013.
[374] Ulrich Schmid and Josef Widder. The theta-model: achieving synchrony without clock.
Distributed Computing, 22(1):29–47, 2009.
V.6.3
[375] Mário S. Alvim, Miguel E. Andrés, Konstantinos Chatzikokolakis, Pierpaolo Degano,
and Catuscia Palamidessi. Differential privacy: on the trade-off between utility and
information leakage. In Gilles Barthe, Anupam Datta, and Sandro Etalle, editors, The
8th International Workshop on Formal Aspects of Security & Trust (FAST), volume 7140 of
[376] Mário S. Alvim, Miguel E. Andrés, and Catuscia Palamidessi. Information flow in interactive systems. In Paul Gastin and François Laroussinie, editors, 21th International
Conference on Concurrency Theory (CONCUR 2010), volume 6269 of Lecture Notes in Computer Science, pages 102–116. Springer, 2010.
[377] Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi, and Peter Van Rossum. Safe
equivalences for security properties. In Cristian S. Calude and Vladimiro Sassone, editors, 6th IFIP International Conference on Theoretical Computer Science (TCS 2010), volume 323 of IFIP Advances in Information and Communication Technology, pages 55–70.
Springer, 2010.
192
BIBLIOGRAPHY
[378] Mário S. Alvim, Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Geoffrey
Smith. Measuring information leakage using generalized gain functions. In Stephen
Chong, editor, Computer Security Foundations (CSF), pages 265–279. IEEE, 2012.
[379] Miguel E. Andrés, Catuscia Palamidessi, Peter Van Rossum, and Geoffrey Smith. Computing the leakage of information-hiding systems. In Javier Esparza and Rupak Majumdar, editors, 16th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (TACAS 2010), volume 6015 of Lecture Notes in Computer Science,
pages 373–389. Springer, 2010.
[380] Miguel E. Andrés, Catuscia Palamidessi, Peter Van Rossum, and Ana Sokolova. Information hiding in probabilistic concurrent systems. In 7th IEEE International Conference
on Quantitative Evaluation of SysTems (QEST 2010), pages 17–26. IEEE Computer Society,
2010.
[381] Jesus Aranda, Gérard Assayag, Carlos Olarte, Camilo Rueda, Toro Mauricio, Perez Jorge,
and Frank D. Valencia. An overview of FORCES: An INRIA project on declarative formalisms for emergent systems. In Patricia M. Hill and David Scott Warren, editors, 25th
International Conference in Logic Programming (ICLP’09), volume 5649 of Lecture Notes in
Computer Science, pages 509–513. Springer, July 2009.
[382] Jesus Aranda, Perez Jorge, Camilo Rueda, and Frank D. Valencia. Stochastic behavior
and explicit discrete time in concurrent constraint programming. In Maria Garcia de la
Banda and Enrico Pontelli, editors, 24th International Conference in Logic Programming
(ICLP’08), volume 5366 of Lecture Notes in Computer Science, pages 682–686. Springer,
December 2008.
[383] Jesus Aranda, Frank D. Valencia, and Cristian Versari. On the expressive power of restriction and priorities in CCS with replication. In Luca de Alfaro, editor, 12th International Conference on Foundations of Software Science and Computational Structures (FOSSACS), volume 5504 of Lecture Notes in Computer Science, pages 242–256. Springer, March
2009.
[384] Andrés Aristizábal. Bisimilarity in concurrent constraint programming. In Manuel V.
Hermenegildo and Torsten Schaub, editors, Technical Communications of the 26th International Conference on Logic Programming (ICLP 2010), volume 7 of Leibniz International
Proceedings in Informatics, pages 236–240, July 2010.
[385] Andrés Aristizábal, Filippo Bonchi, Catuscia Palamidessi, Luis Pino, and Frank D.
Valencia. Deriving labels and bisimilarity for concurrent constraint programming. In
Martin Hofmann, editor, 14th International Conference on Foundations of Software Science
and Computational Structures (FOSSACS 2011), volume 6604 of Lecture Notes in Computer
Science, pages 138–152. Springer, 2011.
[386] Andrés Aristizábal, Filippo Bonchi, Luis Pino, and Frank D. Valencia. Partition refinement for bisimilarity in CCP. In Sascha Ossowski and Paola Lecca, editors, 27th Annual
ACM Symposium on Applied Computing (SAC 2012), pages 88–93. ACM, 2012.
[387] Andrés Aristizábal, Filippo Bonchi, Luis Pino, and Frank D. Valencia. Reducing weak
to strong bisimilarity in CCP. In Marco Carbone, Ivan Lanese, Alexandra Silva, and Ana
Sokolova, editors, 5th Interaction and Concurrency Experience (ICE 2012), volume 104 of
Electronic Proceedings in Theoretical Computer Science, pages 2–16. Electronic Proceedings
in Theoretical Computer Science, 2012.
[388] David Baelde, Romain Beauxis, and Samuel Mimram. Liquidsoap: a high-level programming language for multimedia streaming. In Ivana Cerná, Tibor Gyimóthy, Juraj
Hromkovic, Keith Jefferey, Rastislav Královic, Marko Vukolic, and Stefan Wolf, editors,
BIBLIOGRAPHY
193
SOFSEM 2011: Theory and Practice of Computer Science, volume 6543 of Lecture Notes in
Computer Science, pages 99–110. Springer, 2011.
[389] Romain Beauxis, Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash
Panangaden. Formal approaches to information-hiding (tutorial). In Gilles Barthe and
Cédric Fournet, editors, Trustworthy Global Computing (TGC), volume 4912 of Lecture
Notes in Computer Science, pages 347–362. Springer, 2008.
[390] Romain Beauxis and Samuel Mimram. A non-standard semantics for kahn networks in
continuous time. In Marc Bezem, editor, 20th Conference on Computer Science Logic (CSL
2011), volume 12 of Leibniz International Proceedings in Informatics (LIPIcs), pages 35–50.
Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2011.
[391] Abhishek Bhowmick and Catuscia Palamidessi. Bounds on the leakage of the input’s distribution in information-hiding protocols. In Christos Kaklamanis and Flemming Nielson, editors, Fourth Symposium on Trustworthy Global Computing (TGC), volume 5474 of
[392] Martin Biely and Ulrich Schmid. Weak synchrony models and failure detectors for message passing (k-)set agreement. In Tarek Abdelzaher, Michel Raynal, and Nicola Santoro,
editors, 13th International Conference on Principles of Distributed Systems (OPODIS), volume 5923 of Lecture Notes in Computer Science, pages 285–299. Springer, July 2009.
[393] Christelle Braun, Konstantinos Chatzikokolakis, and Catuscia Palamidessi. Compositional methods for information-hiding. In Roberto Amadio, editor, Foundations of Software Science and Computation Structures (FOSSACS), volume 4962 of Lecture Notes in Computer Science, pages 443–457. Springer, 2008.
[394] Christelle Braun, Konstantinos Chatzikokolakis, and Catuscia Palamidessi. Quantitative notions of leakage for one-try attacks. In Samson Abramsky, Michael Mislove, and
Catuscia Palamidessi, editors, Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics (MFPS 2009), volume 249 of Electronic Notes in Theoretical
Computer Science, pages 75–91. Elsevier, 2009.
[395] Mayla Brusó, Konstantinos Chatzikokolakis, Sandro Etalle, and Jerry Den Hartog. Linking unlinkability. In Catuscia Palamidessi and Mark Dermot Ryan, editors, 7th International Symposium on Trustworthy Global Computing (TGC), volume 8191 of Lecture Notes
in Computer Science, pages 129–144. Springer, 2012.
[396] Michele Bugliesi, Lucia Gallina, Andrea Marin, Sabina Rossi, and Sardaouna Hamadou.
Interference-sensitive preorders for MANETs. In Ninth International Conference on Quantitative Evaluation of Systems, QEST 2012, pages 189–198. IEEE Computer Society, 2012.
[397] Mouna Chaouch-Saad, Bernadette Charron-Bost, and Stephan Merz. A reduction theorem for the verification of round-based distributed algorithms. In Olivier Bournez and
Igor Potapov, editors, Reachability Problems 2009, volume 5797 of Lecture Notes in Computer Science, pages 93–106. Springer, 2009.
[398] Bernadette Charron-Bost, Henri Debrat, and Stephan Merz. Formal verification of consensus algorithms tolerating malicious faults. In Xavier Défago, Franck Petit, and Vincent Villain, editors, 13th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS 2011), volume 6976 of Lecture Notes in Computer Science, pages
120–134. Springer, October 2011.
[399] Bernadette Charron-Bost, Matthias Függer, Jennifer Welch, and Josef Widder. Full
reversal routing as a linear dynamical system. In Adrian Kosowski and Masafumi Yamashita, editors, 18th International Colloquium on Structural Information and Communication Complexity, volume 6796 of Lecture Notes in Computer Science, pages 101–112.
Springer, 2011.
194
BIBLIOGRAPHY
[400] Bernadette Charron-Bost, Matthias Függer, Jennifer Welch, and Josef Widder. Partial is
full. In Adrian Kosowski and Masafumi Yamashita, editors, 18th International Colloquium
on Structural Information and Communication Complexity, volume 6796 of Lecture Notes in
Computer Science, pages 113–124. Springer, 2011.
[401] Bernadette Charron-Bost, Antoine Gaillard, Jennifer Welch, and Josef Widder. Routing
without ordering. In Friedhelm Meyer auf der Heide and Michael A. Bender, editors, 21st
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 145–153.
ACM, 2009.
[402] Bernadette Charron-Bost, Jennifer Welch, and Josef Widder. Link reversal: How to play
better to work less. In Shlomi Dolev, editor, 5th International Workshop on Algorithmic
Aspects of Wireless Sensor Networks (ALGOSENSORS), volume 5804 of Lecture Notes in
Computer Science, pages 88–101. Springer, July 2009.
[403] Konstantinos Chatzikokolakis, Miguel E. Andrés, Nicolás E. Bordenabe, and Catuscia
Palamidessi. Broadening the scope of differential privacy using metrics. In Emiliano De
Cristofaro and Matthew Wright, editors, 13th International Symposium on Privacy Enhancing Technologies (PETS 2013), volume 7981 of Lecture Notes in Computer Science, pages
82–102. Springer, 2013.
[404] Konstantinos Chatzikokolakis, Sophia Knight, and Prakash Panangaden. Epistemic
strategies and games on concurrent processes. In Mogens Nielsen, Antonı́n Kucera, Peter
Bro Miltersen, Catuscia Palamidessi, Petr Tuma, and Frank D. Valencia, editors, 35th
Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2009),
volume 5404 of Lecture Notes in Computer Science, pages 153–166. Springer, January 2009.
[405] Davide Chiarugi, Moreno Falaschi, Carlos Olarte, and Catuscia Palamidessi. Compositional modelling of signalling pathways in timed concurrent constraint programming.
In Aidong Zhang, Mark Borodovsky, Gultekin Özsoyoglu, and Armin R. Mikler, editors,
First ACM International Conference on Bioinformatics and Computational Biology (BCB ’10),
pages 414–417. ACM Digital Libraries, 2010.
[406] Philippe Darondeau, Jérémy Dubreil, and Hervé Marchand. Supervisory control for
modal specifications of services. In Jorg Raisch, Stephane Lafortune, Allessandro Giva,
and Thomas Moor, editors, Workshop on Discrete Event Systems, WODES’10, pages 428–
435. Elsevier, August 2010.
[407] Ehab Elsalamouny, Konstantinos Chatzikokolakis, and Catuscia Palamidessi. A differentially private mechanism of optimal utility for a region of priors. In David Basin
and JohnC. Mitchell, editors, Principles of Security and Trust (POST 2013), volume 7796
of Lecture Notes in Computer Science, pages 41–62. Springer Berlin Heidelberg, January
2013.
[408] Moreno Falaschi, Carlos Olarte, and Catuscia Palamidessi. A framework for abstract
interpretation of timed concurrent constraint programs. In António Porto and Francisco
Javier López-Fraguas, editors, 11th International ACM SIGPLAN Conference on Principles
and Practice of Declarative Programming, pages 207–218. ACM, September 2009.
[409] Matthias Függer, Alexander Kößler, Thomas Nowak, and Martin Zeiner. Brief announcement: The degrading effect of forgetting on a synchronizer. In Andréa W. Richa and
Christian Scheideler, editors, 14th International Symposium on Stabilization, Safety, and
Security of Distributed Systems, volume 7596 of Lecture Notes in Computer Science, pages
90–91. Springer, 2012.
[410] Lucia Gallina, Sardaouna Hamadou, Andrea Marin, and Sabina Rossi. A framework
for throughput and energy efficiency in mobile ad hoc networks. In IFIP Wireless Days
Conference, pages 1–6. IEEE, 2011.
BIBLIOGRAPHY
195
[411] Lucia Gallina, Sardaouna Hamadou, Andrea Marin, and Sabina Rossi. A probabilistic
energy-aware model for mobile ad-hoc networks. In Khalid Al-Begain, Simonetta Balsamo, Dieter Fiems, and Andrea Marin, editors, Analytical and Stochastic Modeling Techniques and Applications (ASMTA), volume 6751 of Lecture Notes in Computer Science, pages
316–330. Springer, 2011.
[412] Ivan Gazeau, Dale Miller, and Catuscia Palamidessi. A non-local method for robustness
analysis of floating point programs. In Mieke Massink and Herbert Wiklicky, editors, 10th
Workshop on Quantitative Aspects of Programming Languages (QAPL 2012), pages 63–76.
Electronic Proceedings in Theoretical Computer Science (EPTCS), March 2012.
[413] Ivan Gazeau, Dale Miller, and Catuscia Palamidessi. Preserving differential privacy under finite-precision semantics. In Luca Bortolussi and Herbert Wiklicky, editors, QAPL
- 11th International Workshop on Quantitative Aspects of Programming Languages and Systems, volume 117 of Electronic Proceedings in Theoretical Computer Science, pages 1–18,
Rome, Italy, 2013. Open Publishing Association.
[414] Marco Giunti. A type checking algorithm for qualified session types. In Laura Kovács,
Rosario Pugliese, and Francesco Tiezzi, editors, 7th International Workshop on Automated
Specification and Verification of Web Systems (WWV 2011), pages 96–114. Electronic Proceedings in Theoretical Computer Science, August 2011.
[415] Marco Giunti, Catuscia Palamidessi, and Frank D. Valencia. Hide and new in the picalculus. In Bas Luttik and Michel A. Reniers, editors, Proceedings of the Combined 19th
International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured
Operational Semantics (EXPRESS/SOS 2012), volume 89 of Electronic Proceedings in Theoretical Computer Science, pages 65–80. Electronic Proceedings in Theoretical Computer
Science, August 2012.
[416] Sardaouna Hamadou, Catuscia Palamidessi, Vladimiro Sassone, and Ehab Elsalamouny. Probable innocence and independent knowledge. In Pierpaolo Degano and Joshua
D. Guttman, editors, 6th International Workshop on Formal Aspects of Security and Trust
(FAST 2009), volume 5983 of Lecture Notes in Computer Science, pages 141–156. Springer,
2010.
[417] Sardaouna Hamadou, Vladimiro Sassone, and Catuscia Palamidessi. Reconciling belief
and vulnerability in information flow. In 31st IEEE Symposium on Security and Privacy
(S&P 2010), pages 79–92. IEEE Computer Society, 2010.
[418] Diana Hermith, Carlos Olarte, Camilo Rueda, and Frank D. Valencia. Modeling cellular signaling systems: An abstraction-refinement approach. In Miguel P. Rocha, Juan
M. Corchado Rodriguez, Florentino Fdez-Riverola, and Alfonso Valencia, editors, 5th International Conference on Practical Applications of Computational Biology & Bioinformatics
(PACBB 2011), volume 93 of Advances in Intelligent and Soft Computing, pages 321–328.
Springer, 2011.
[419] Sophia Knight, Catuscia Palamidessi, Prakash Panangaden, and Frank D. Valencia.
Spatial and epistemic modalities in constraint-based process calculi. In Maciej Koutny
and Irek Ulidowski, editors, 23rd International Conference on Concurrency Theory (CONCUR 2012), volume 7454 of Lecture Notes in Computer Science, pages 317–332. Springer,
September 2012.
[420] Hugo Lopez, Carlos Olarte, and Jorge Perez. Towards a unified framework for declarative structured communications. In Alastair R. Beresford and Simon J. Gay, editors,
2nd International Workshop on Programming Language Approaches to Concurrency and
Communication-cEntric Software (PLACES 2009), volume 17 of Electronic Proceedings in
Theoretical Computer Science, pages 1–15. Electronic Proceedings in Theoretical Computer
Science, March 2009.
BIBLIOGRAPHY
196
[421] Matteo Mio and Alex Simpson. A proof system for compositional verification of probabilistic concurrent processes. In Frank Pfenning, editor, 16th International Conference on
Foundations of Software Science and Computation Structures (FOSSACS 2013), volume 7794
of Lecture Notes in Computer Science, pages 161–176. Springer, March 2013.
[422] Thomas Nowak, Matthias Függer, and Alexander Kößler. On the performance of a
retransmission-based synchronizer. In Adrian Kosowski and Masafumi Yamashita, editors, 18th International Colloquium on Structural Information and Communication Complexity, volume 6796 of Lecture Notes in Computer Science, pages 234–245. Springer, 2011.
[423] Carlos Olarte and Frank D. Valencia. The expressivity of universal Timed CCP: Undecidability of Monadic FLTL and closure operators for security. In Sergio Antoy and Elvira
Albert, editors, 10th International ACM SIGPLAN Conference on Principles and Practice of
Declarative Programming (PPDP 2008), pages 8–19. ACM, 2008.
[424] Carlos Olarte and Frank D. Valencia. Universal concurrent constraint programing: Symbolic semantics and applications to security. In Roger L. Wainwright and Hisham Haddad, editors, 23rd Annual ACM Symposium on Applied Computing (SAC 2008), pages 145–
150. ACM, 2008.
[425] Catuscia Palamidessi and Marco Stronati. Differential privacy for relational algebra:
Improving the sensitivity bounds via constraint systems. In Herbert Wiklicky and Mieke
Massink, editors, 10th Workshop on Quantitative Aspects of Programming Languages (QAPL
2012), volume 85 of Electronic Proceedings in Theoretical Computer Science, pages 92–105.
Electronic Proceedings in Theoretical Computer Science, 2012.
[426] Lili Xu. Modular reasoning about differential privacy in a probabilistic process calculus.
In Catuscia Palamidessi and Mark Dermot Ryan, editors, 7th International Symposium
on Trustworthy Global Computing (TGC 2013), volume 8191 of Lecture Notes in Computer
[427] Mu Yang, Vladimiro Sassone, and Sardaouna Hamadou. A game-theoretic analysis of cooperation in anonymity networks. In Pierpaolo Degano and Joshua D. Guttman, editors,
1st International Conference on Principles of Security and Trust (POST 2012), volume 7215
of Lecture Notes in Computer Science, pages 269–289. Springer, 2012.
V.6.4
Full Papers
[428] Mário S. Alvim, Miguel E. Andrés, Konstantinos Chatzikokolakis, and Catuscia
Palamidessi. On the relation between differential privacy and quantitative information
flow. In Luca Aceto, Monika Henzinger, and Jiri Sgall, editors, 38th International Colloquium on Automata, Languages and Programming - ICALP 2011, volume 6756 of Lecture
Notes in Computer Science, pages 60–76. Springer, 2011.
[429] Mário S. Alvim, Miguel E. Andrés, and Catuscia Palamidessi. Probabilistic information
flow. In 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010), pages
314–321. IEEE Computer Society, 2010.
Abstracts
[430] Mário S. Alvim, Miguel E. Andrés, and Catuscia Palamidessi. Entropy and attack models in information flow. In Cristian S. Calude and Vladimiro Sassone, editors, 6th IFIP
International Conference on Theoretical Computer Science (TCS 2010), volume 323 of IFIP
Advances in Information and Communication Technology, pages 53–54. Springer, 2010.
V.6.5. THÈSES
197
[431] Catuscia Palamidessi. Compositionality of secure information flow. In Claude Bolduc,
Jules Desharnais, and Béchir Ktari, editors, Joint Conference: 10th International Conference
on the Mathematics of Program Construction (MPC 2010), and 13th International Conference
on Algebraic Methodology And Software Technology (AMAST 2010), volume 6120 of Lecture
Notes in Computer Science, page 19. Springer, 2010.
[432] Catuscia Palamidessi, Mário S. Alvim, and Miguel E. Andrés. Interactive information
flow. In Alessandro Armando and Gavin Lowe, editors, Joint Workshop on Automated
Reasoning for Security Protocol Analysis and Issues in the Theory of Security (ARSPA-WITS
2010), volume 6186 of Lecture Notes in Computer Science, page 111. Springer, March 2010.
V.6.5
Thèses
[433] Mário S. Alvim. Des approches formelles pour le cachement d’information: Une analyse des
systèmes interactifs, contrôle de divulgation statistique, et le raffinement des spécifications.
PhD thesis, École Polytechnique de Paris, October 2011.
[434] Miguel E. Andrés. Quantitative Analysis of Information Leakage in Probabilistic and Nondeterministic Systems. PhD thesis, Radboud University, Nijmegen, July 2011.
[435] Jesus Aranda. On the Expressivity of Infinite and Local Behaviour in Fragments of the picalculus. PhD thesis, École Polytechnique de Paris and Universidad del Valle, Colombia,
November 2009.
[436] Andrés Aristizábal. Techniques de Bisimulation et Algorithmes pour la Programmation Concurrente par Contraintes. PhD thesis, École Polytechnique de Paris, October 2012.
[437] Romain Beauxis. Asynchronous Process Calculi for Specification and Verification of Information Hiding Protocols. PhD thesis, École Polytechnique de Paris, May 2009.
[438] Christelle Braun. Quantitative Approaches to Information Hiding. PhD thesis, École Polytechnique de Paris, May 2010.
[439] Antoine Gaillard. Problèmes de communication dans les systèmes distribués: ruptures et
corruptions. PhD thesis, École Polytechnique de Paris, February 2009.
[440] Carlos Olarte. Programmation Concurrente par Contraintes pour Vérifier un Protocole de
Sécurité. PhD thesis, École Polytechnique de Paris, September 2009.
[441] Sylvain Pradalier. Formal Approach to the Modeling, Simulation and Analysis of NanoDevices. PhD thesis, École Polytechnique de Paris, September 2009.
V.6.6
Rapports techniques
[442] Miguel E. Andrés, Nicolás E. Bordenabe, Konstantinos Chatzikokolakis, and Catuscia Palamidessi. Geo-indistinguishability: Differential privacy for location-based systems. Accepted at ACM CCS. Technical Report hal-00766821, INRIA, 2012. http:
//hal.inria.fr/hal-00766821.
[443] Bernadette Charron-Bost, Matthias Függer, and Thomas Nowak. On the transience of
linear max-plus dynamical systems. Technical Report abs/1111.4600, Cornell University,
September 2011. http://arxiv.org/abs/1209.3342.
[444] Bernadette Charron-Bost, Matthias Függer, and Thomas Nowak. New transience
bounds for long walks. Technical Report abs/1209.3342, Cornell University, September
2012. http://arxiv.org/abs/1209.3342.
198
BIBLIOGRAPHY
[445] Philippe Darondeau, Jérémy Dubreil, and Hervé Marchand. Supervisory control for
modal specifications of services. Technical Report inria-00472736, INRIA, April 2010.
http://hal.inria.fr/inria-00472736.
V.7 Annexes : Concurrency, Mobility and
Transactions
V.7.1
• Catuscia Palamidessi is a member of the Comité d’Orientation Scientifique et Technique,
Groupe de travail Relation Internationales de l’INRIA (COST-GTRI) (période 2007-).
• Catuscia Palamidessi is a member of the Comité de These for Mathematics and Computer
Science at the École Polytechnique (période 2007-).
• Catuscia Palamidessi has been a member of the Commission Scientifique Disciplinaire pour le
Programme Non Thématiques de l’ANR (période 2008).
• Catuscia Palamidessi has been a member of the Commission Scientifique Disciplinaire pour le
Programme Jeunes Chercheurs de l’ANR (période 2008).
• Catuscia Palamidessi has been a member of the Commission Scientifique du Centre de Recherche
INRIA Saclay (période 2008-2010).
• Catuscia Palamidessi is co-director of LIX (période 2010-).
• Catuscia Palamidessi is a member of the Comité de Centre of INRIA (période 2012-).
• Bernadette Charron-Bost has been a representative of LIX to the commission Bâtiments
DIGITEO (période 2007-2010).
• Bernadette Charron-Bost is a representative of the Conseil de laboratoire (période 2011-).
V.7.1.1
PRINTEMPS (2006-2011) (Type: INRIA DRI Project) Titre: PRobability and INformation ThEory for Modeling anonymity, Privacy, and Secrecy. The main goal is to establish a formal framework for expressing and reasoning about information-hiding properties, for helping the design
of adequate protocols, and for verifying them–www.lix.polytechnique.fr/comete/Projects/
Printemps. Partenaires: INRIA Saclay, McGill University. Responsable: Catuscia Palamidessi.
Montant de la collaboration pour le LIX: 65000 euros (Total 97000 euros)..
REACT (2007-2009) (Type: International Collaboration with Colombia) Titre: Robust theories for Emerging Applications in Concurrency Theory. The goal is to develop CCP theories for
dealing with applications in the areas of Security Protocols, Biology and Multimedia Semantic
Interaction–cic.javerianacali.edu.co/wiki/doku.php?id=grupos:avispa:react. Partenaires:
Universidad Javeriana, Universidad del Valle, LIX, IRCAM . Responsable: Frank Valencia. Montant de la collaboration pour le LIX: 20000 euros (Total 72000 euros)..
FORCES (2007-2010) (Type: INRIA DRI Project) Titre: FORmalisms from Concurrency for
Emergent Systems.
The main goal is to provide more robust formalisms for analyzing emergent concurrent systems–www.lix.polytechnique.fr/comete/Forces. Partenaires: Universidad Javeriana, Universidad del Valle, INRIA Saclay, IRCAM. Responsable: Frank D. Valencia.
Montant de la collaboration pour le LIX: 45000 euros (Total 73000 euros)..
199
200
CHAPTER V.7. ANNEXES : CONCURRENCY, MOBILITY AND TRANSACTIONS
REACT-PLUS (2010-2012) (Type: International Collaboration with Colombia) Titre: Robust
theories for Emerging Applications in Concurrency Theory: Processes and Logic Used in Emergent Systems. This project is a continuation of REACT and more focused towards automatic verification–
cic.javerianacali.edu.co/wiki/doku.php?id=grupos:avispa:react-plus. Partenaires: Universidad Javeriana, Universidad del Valle, LIX, IRCAM . Responsable: Frank Valencia. Montant
de la collaboration pour le LIX: 20000 euros (Total 72000 euros)..
PRINCESS (2013-2018) (Type: INRIA DRI Project) Titre: Protecting pRIvacy while preservINg data accESS. The main goal is to investigate secure information flow and privacy from a
quantitative (probabilistic) point of view. Partenaires: INRIA Saclay, Florida International University, and University of Pennsylvania. Responsable: Catuscia Palamidessi. Montant de la
collaboration pour le LIX: 65000 euros (Total 106 000 euros)..
V.7.1.2
PANDA (2009-2013) (Type: Projet ANR) Titre: Analysis of Parallelism and Distribution. The
main goal is to develop a comprehensive framework for probabilistic concurrent systems that
would apply to several models of concurrency; understand how usual concepts and tools from
probability theory such as limit theorems apply to those models–lipn.univ-paris13.fr/˜mazza/
Panda. Partenaires: INRIA Saclay, CEA Saclay, Pôle Parisien, Pôle Méditerranéen, Airbus. Responsable: Catuscia Palamidessi. Montant de la collaboration pour le LIX: 152922 euros (Total
566733 euros)..
D-SPACES (2013-2016) (Type: DIGITEO-Digicosme) Titre: Distributed Spaces in Concurrent
Epistemic Systems.
The main goal is to develop formalisms to reason about social behavior
on spatially distributed systems, in particular social networks– www.lix.polytechnique.fr/
˜fvalenci/projects/D-Spaces.pdf. Partenaires: LIX, ENS Cachan. Responsable: Frank
Valencia. Montant de la collaboration pour le LIX: 110000 euros (Total 110000 euros)..
V.7.1.3
LOCALI (2011-2015) (Type: ANR Blanc International avec Chine) Titre: Logical Approach to
Novel Computational Paradigms. The main goal is to extend and reformulate both calculi and
proposes to design programming languages and proof systems based on a study of their relation
to logic–www.agence-nationale-recherche.fr/en/anr-funded-project/?tx_lwmsuivibilan_
pi2%5BCODE%5D=ANR-11-IS02-0002. Partenaires: INRIA Saclay, INRIA Rocquencourt, Paris
VII, Chinese Academy of Science in Beijin. Responsable: Gilles Dowek. Montant de la collaboration pour le LIX: 55000 euros (Total 502166 euros)..
PACE (2013-2015) (Type: ANR International avec Chine) Titre: Beyond plain Processes: Analysis techniques, Coinduction and Expressiveness. The goal is to enrich and adapt the notions
of coinduction, expressiveness, analysis techniques to much broader forms of interactive models beyond the realm of traditional processes–perso.ens-lyon.fr/daniel.hirschkoff/pace.
Partenaires: BASICS Shanghai, INRIA Saclay and Sophia Antipolis, ENS Lyon. Responsable:
Daniel Hirschkoff. Montant de la collaboration pour le LIX: 80000 euros (Total 338 000 euros)..
MEALS (2013-2015) (Type: FP7 Project) Titre: Mobility between Europe and Argentina applying
Logic to Systems. The goal is to study formal methods in all their aspects: foundations, algorithmic advances and practical considerations–www.meals-project.eu. Partenaires: Saarland
University, Germany; Rheinisch-Westfälische Technische Hochschule Aachen, Germany; Technische Universität Dresden, Germany; INRIA, France; Imperial College of Science, Technology
and Medicine, UK; University of Leicester, UK; Technische Universiteit Eindhoven, NL; Universidad Nacional de Cordoba, AR; Universidad de Buenos Aires, AR; Instituto Tecnologico de Buenos
V.7.2. ADMINISTRATION DE LA RECHERCHE
201
Aires, AR; Universidad Nacional de Rio Cuarto, AR.. Responsable: Holger Hermans (Catuscia
Palamidessi is responsible for INRIA). Montant de la collaboration pour le LIX: 172139 euros
(Total 573300 euros)..
V.7.1.4
CPP (2009-2013) (Type: Projet ANR) Titre: Confidence, Proofs and Probabilities. The goal is
to study the joint use of probabilistic and formal (deterministic) semantics and analysis methods, in a way to improve the applicability and precision of static analysis methods on numerical
programs–www.lix.polytechnique.fr/˜bouissou/cpp. Partenaires: LSV, CEA Saclay, CEA
LIST, Supelec SSE, Supelec L2S, Airbus. Responsable: Catuscia Palamidessi. Montant de la
collaboration pour le LIX: 142600 euros (Total 484371 euros)..
CAPPRIS (2011-2015) (Type: INRIA) Titre: Analysis of Parallelism and Distribution.
The
main goal is to foster the collaboration between research groups involved in privacy in France and
the interaction between the computer science, law and social sciences communities–cappris.
inria.fr/. Partenaires: INRIA Saclay, INRIA Saphia-Antipolis, INRIA Rennes, INRIA Grenoble, and CNRS-LAAS, Eurecom and the university of Namur. Responsable: Catuscia Palamidessi.
Montant de la collaboration pour le LIX: 50000 euros (Total 400000 euros. NOTE: The budget is
not precise because it is provided by INRIA on demand)..
V.7.1.5
Contrats et bourses
We have several contracts and grants for financing PhD students and postdocs. Here we list some
of them:
LIX-Qualcomm (2008-2009) Type de contrat: LIX-Qualcom.
distribués probabilistes. Bernadette Charron-Bost.
Titre détaillé: Algorithmes
LIX-DGA (2008-2011) Type de contrat: X-DGA. Titre détaillé: Algorithmes de routage dans
les réseaux mobiles ad-hoc. Bernadette Charron-Bost.
OISAU (2009) Type de contrat: DGA.
autonomes. Bernadette Charron-Bost.
Titre détaillé: Méthodes formelles pour les systèmes
V.7.2
V.7.2.1
• Electronic Notes of Theoretical Computer Science (Elsevier Science) Catuscia Palamidessi (2000-). Voir www.entcs.org/.
• Theory and Practice of Logic Programming (Cambridge University Press) Catuscia Palamidessi (2004-2012). Voir journals.cambridge.org/tlp.
• Mathematical Structures in Computer Science (Cambridge University Press) Catuscia
Palamidessi (2006-). Voir journals.cambridge.org/msc.
202
• Theoretical Computer Science (Elsevier) Festschrift for Mogens Nielsen’s 60th birthday Marco Carbone, Pawel Sobocinski and Frank Valencia. 2009.
• Theoretical Computer Science (Elsevier) Abstract Interpretation and Logic Programming:
Festschrift in honor of professor Giorgio Levi Moreno Falaschi, Maurizio Gabbrielli and Catuscia Palamidessi. 2009.
• Journal of Computer Security (IOS Press) Best papers presented at SECCO’07. Daniele
Gorla and Catuscia Palmidessi. 2010.
• Theoretical Computer Science (Elsevier) Selected papers of MFPS XXV. Samson Abramsky,
Michael Mislove and Catuscia Palamidessi. 2012.
• Logical Methods in Computer Science (open-access journal) Selected papers of FoSSaCS
2013. Catuscia Palamidessi and Frank Pfenning. 2013.
• Journal of Computer Security (IOS Press) Selected papers of TOSCA 2011 and SecCo 2011.
Konstantinos Chatzikokolakis, Sebastian Mödersheim and Catuscia Palamidessi. To appear.
• Mathematical Structures in Computer Science (Cambridge University Press) Quantitative Information Flow Geoffrey Smith and Catuscia Palamidessi. To appear.
• Mathematical Structures in Computer Science (Elsevier) Selected papers of the 17th International Workshop on Expressiveness in Concurrency Sibylle Froeschle and Frank Valencia.
To appear.
• Mathematical Structures in Computer Science (Elsevier) Selected papers of the 18th International Workshop on Expressiveness in Concurrency Bas Luttik and Frank Valencia. To
appear.
V.7.2.2
• EXPRESS (The International Workshop in Concurrency EXPRESS) (1997-). Catuscia
Palamidessi.
• EATCS (The European Association for Theoretical Computer Science) (2005-). Catuscia
Palamidessi.
• ETAPS (The European Joint Conferences on Theory and Practice of Software) (2006-).
Catuscia Palamidessi.
• IFIP Tech. Cmte. 1 (Foundations of Computer Science) (2007-). Catuscia Palamidessi.
• SOFSEM (International Conference on Current Trends in Theory and Practice of Computer Science) (2001-2012). Bernadette Charron-Bost.
• EXPRESS (The International Workshop in Concurrency EXPRESS) (2010-). Frank Valencia.
203
Conferences:
• SOFSEM (Current Trends in Theory and Practice of Computer Science) (2009). Catuscia
Palamidessi and Frank Valencia.
• MFCS XXV ( Mathematical Foundations of Programming Semantics ) (2009). Catuscia
Palamidessi.
• TOSCA (Theory Of SeCurity and Applications) (2011). Catuscia Palamidessi.
• QEST 2011 (8th International Conference on Quantitative Evaluation of SysTems) (2011).
• TGC 2012 (7th International Symposium on Trustworthy Global Computing) (2012).
Workshops:
• SecCo 2010 (8th International Workshop on Security Issues in Concurrency ) (2011).
Konstantino Chatzikokolakis .
• SecCo 2011 (9th International Workshop on Security Issues in Concurrency ) (2012).
Konstantino Chatzikokolakis .
• EXPRESS 2011 (Expressiveness in Concurrency Theory) (2011). Frank Valencia.
• EXPRESS 2012 (Expressiveness in Concurrency Theory) (2012). Frank Valencia.
Conferences:
• QEST’08 (Fifth International Conference on Quantitative Evaluation of SysTems) (2008).
• CONCUR 2008 (19th International Conference on Concurrency Theory) (2008). Catuscia Palamidessi.
• CiE 2008 (Logic and Theory of Algorithms) (2008). Catuscia Palamidessi.
• LICS 2008 (23rd Symposium on Logic in Computer Science) (2008). Catuscia Palamidessi.
• MFPS XXIV (Twenty-fourth Conference on the Mathematical Foundations of Programming Semantics) (2008). Catuscia Palamidessi.
• ESOP 2008 (17th European Symposium on Programming) (2008). Catuscia Palamidessi.
• VMCAI 2008 (9th International Conference on Verification, Model Checking, and Abstract Interpretation) (2008). Catuscia Palamidessi.
• DISC 2008 (22th International Symposium on Distributed Computing ) (2008). Bernadette Charron-Bost .
• ICLP 2008 (24th International Conference on Logic Programming) (2008). Frank D.
Valencia.
• SAC 2008 (23rd Annual ACM Symposium on Applied Computing. Track on Constraint
Satisfaction and Programming) (2008). Carlos A. Olarte.
204
• CONCUR 2009 (20th International Conference on Concurrency Theory) (2009). Catuscia Palamidessi.
• FOSSACS 2009 (12th International Conference on Foundations of Software Science and
Computation Structures) (2009). Catuscia Palamidessi.
• CONCUR 2009 (The 20th International Conference on Concurrency Theory) (2009).
• PPDP 2009 (The 11th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming) (2009). Catuscia Palamidessi.
• FOSSACS 2009 (The 12th International Conference on Foundations of Software Science
and Computation Structures) (2009). Catuscia Palamidessi.
• ICLP 2009 (25th International Conference on Logic Programming) (2009). Frank D.
Valencia.
• SOFSEM 2009 (35th International Conference on Current Trends in Theory and Practice
of Computer Science) (2009). Frank D. Valencia.
• SAC 2009 (24th Annual ACM Symposium on Applied Computing. Track on Constraint
Satisfaction and Programming) (2009). Carlos A. Olarte.
• MFPS XXVI (The 26th Conference on the Mathematical Foundations of Programming
Semantics) (2010). Catuscia Palamidessi.
• CONCUR 2010 (The 21st International Conference on Concurrency Theory) (2010).
• ICDCS 2010 ( 29th Int. Conf. on Distributed Computing Systems) (2010). Bernadette
Charron-Bost .
• ICLP 2010 (the 26th International Conference in Logic Programming) (2010). Frank D.
Valencia.
• CALCO 2011 (Fourth International Conference on Algebra and Coalgebra in Computer
Science) (2011). Catuscia Palamidessi.
• CSF 2011 (The 24th IEEE Computer Security Foundations Symposium) (2011). Catuscia
Palamidessi.
• MFPS XXVII (27th Int.l Conference on Mathematical Foundations of Programming Semantics) (2011). Catuscia Palamidessi.
• TGC 2011 (6th International Symposium on Trustworthy Global Computing) (2011).
Konstantinos Chatzikokolakis.
• POST 2012 (First Conference on Principles of Security and Trust) (2012). Catuscia
Palamidessi.
Palamidessi.
• QEST 2012 (International Conference on Quantitative Evaluation of SysTems) (2012).
• PPDP 2012 (International ACM SIGPLAN Conference on Principles and Practice of
Declarative Programming) (2012). Catuscia Palamidessi.
205
• CONCUR 2012 (23rd International Conference on Concurrency Theory) (2012). Catuscia Palamidessi.
• CARDIS 2012 (The Eleventh Smart Card Research and Advanced Application Conference) (2012). Catuscia Palamidessi.
• SSS 2012 (14th International Symposium on Stabilization, Safety, and Security of Distributed Systems) (2012). Bernadette Charron-Bost .
• ESOP 2012 (21th European Symposium on Programming) (2012). Konstantinos Chatzikokolakis.
• TGC 2012 (International Symposium on Trustworthy Global Computing) (2012). Konstantinos Chatzikokolakis.
• ISPEC 2012 (8th International Conference on Information Security Practice and Experience) (2012). Konstantinos Chatzikokolakis.
• TGC 2013 (The 8th International Symposium on Trustworthy Global Computing) (2013).
• ICALP 2013 (The 40th International Colloquium on Automata, Languages and Programming) (2013). Catuscia Palamidessi.
Palamidessi.
• LICS 2013 (The Twenty-Eighth Annual ACM/IEEE Symposium on Logic in Computer
Science) (2013). Catuscia Palamidessi.
• FOSSACS 2013 (The 16th Int.l Conf. on Foundations of Software Science and Computation Structures) (2013). Catuscia Palamidessi.
• SOFSEM 2013 (39th International Conference on Current Trends in Theory and Practice
of Computer Science) (2013). Catuscia Palamidessi.
• CONCUR 2013 (The 24th International Conference on Concurrency Theory) (2013).
Frank D. Valencia.
• ISPEC 2013 (9th International Conference on Information Security Practice and Experience) (2013). Konstantinos Chatzikokolakis.
Workshops:
• FICS 2008 (Foundations of Informatics, Computing and Software) (2008). Catuscia
Palamidessi.
• FMWS 2008 (Formal Methods for Wireless Systems. CONCUR 2008 affiliated workshop) (2008). Catuscia Palamidessi.
• SOS 2008 (Structural operational semantics. ICALP 2008 affiliated workshop) (2008).
• TFIT 2008 (Fourth Taiwanese-French Conference on Information Technology) (2008).
• EXPRESS 2008 (15th International Workshop on Expressiveness in Concurrency) (2008).
Frank D. Valencia.
• PLID 2009 (The 5th International Workshop on Programming Language Interference
and Dependence) (2009). Catuscia Palamidessi.
206
• SecCo 09 (The 7th International Workshop on Security Issues in Concurrency) (2009).
• FCS-PrivMod 2010 (Workshop on Foundations of Security and Privacy) (2010). Catuscia
Palamidessi.
• LIS 2010 ( Workshop on Logics in Security) (2010). Catuscia Palamidessi.
• SVT 2011 (Software Verification and Testing track of the 26th Annual ACM Symposium
On Applied Computing) (2011). Catuscia Palamidessi.
• EXPRESS 2011 (18th International Workshop on Expressiveness in Concurrency) (2012).
Frank D. Valencia.
• QAPL 2011 (9th Workshop on Quantitative Aspects of Programming Languages) (2011).
• FAST 2011 (The 8th International Workshop on Formal Aspects of Security & Trust)
(2011). Konstantinos Chatzikokolakis.
• EXPRESS 2012 (Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structural Operational Semantics) (2012). Frank D. Valencia.
• ICE 2012 (The 5th International Workshop on Interaction and Concurrency Experience)
(2012). Frank D. Valencia.
V.7.2.3
• Dagstuhl Seminar (Fault-Tolerant Distributed Algorithms on VLSI Chipsl) (2008). Bernadette Charron-Bost with Shlomi Dolev, Jo Ebergen and Ulrich Schmid.
• Mogens Nielsen’s Symposium (Mogens Nielsen’s 60th birthday: an Aarhus celebration)
(2009). Frank Valencia with Marco Carbone and Pawel Sobocinski.
• CMLS-CMAP-LIX (Colloquium CMLS-CMAP-LIX à l’École polytechnique) (2009). Bernadette Charron-Bost with Grégoire Allaire and Gilles Courtois.
• CINE (Colloquium pour les élèves CINE à l’École polytechnique) (2011). Bernadette
Charron-Bost with Olivier Bournez .
• Informatique et Combinatoire (Les journées Informatique et Combinatoire à l’École
polytechnique) (2012). Bernadette Charron-Bost with Julia Wolf.
• Dagstuhl Seminar (Quantitative Security Analysis) (2012). Catuscia Palamidessi with
Boris Köpf and Pasquale Malacaria.
V.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION
V.7.2.4
207
• PRIN (2005-) Catuscia Palamidessi. Reviewer for the project proposals for the program
PRIN, sponsored by the Italian MIUR (Ministero dell’Istruzione, dell’Università e della Ricerca).
• EATCS (2006-) Catuscia Palamidessi. President of the selection committee for the EATCS
Best Paper Award at the ETAPS conferences.
• ICT (2008) Catuscia Palamidessi. Member of the panel to evaluate project proposals for
programme Information and Communication Technology (ICT).
• EAPLS (2010-11) Catuscia Palamidessi. Member of the EAPLS PhD Award Committee.
• LICS (2010) Catuscia Palamidessi. Member of the LICS 2011 Test Of Time Award Committee.
Au niveau national
• ANR (2008) Catuscia Palamidessi. Member of the Commission Scientifique Disciplinaire pour
les Programmes non-Thématiques et Jeunes Chercheurs de l’ANR.
• INRIA (2008-2010) Catuscia Palamidessi. Member of the Commission Scientifique du Centre
de Recherche INRIA Saclay.
We have been members of several selection committees. Here we list a few examples:
• Member of the committee for the promotion to full professor at KTH Denmark (Catuscia Palamidessi) 2010 .
• Member of the commission de spécialistes de l’université de Nancy (Bernadette CharronBost) 2011 .
• Member of Selection Committee for the Lix-Qualcomm Postdoctoral Fellowship (Frank
Valencia) 2011-2013 .
V.7.3
V.7.3.1
• Antoine Gaillard (Feb 2009). Problèmes de communication dans les systèmes distribués :
ruptures et corruptions. Encadrant: Bernadette Charron-Bost.
• Romain Beauxis (May 2009). Asynchronous Process Calculi for Specification and Verification of Information Hiding Protocols. Encadrant: Catuscia Palamidessi.
• Sylvain Pradalier (Sep 2009). A formal approach to the modeling, simulation and analysis
of nano-devices. Encadrant: Cosimo Laneve and Catuscia Palamidessi.
• Carlos Olarte (Sept 2009). Programmation Concurrent par Contraintes pour Vérifier un
Protocole de Sécurité. Encadrant: Frank Valencia and Catuscia Palamidessi.
• Jesus Aranda (Nov 2009). On the Expressivity of Infinite and Local Behaviour in Fragments
of the pi-calculus. Encadrant: Frank D. Valencia and Catuscia Palamidessi.
208
• Christelle Braun (May 2010). Quantitative Approaches to Information Hiding.
rant: Catuscia Palamidessi.
Encad-
• Miguel Andrés (July 2011). Quantitative Analysis of Information Leakage in Probabilistic
and Nondeterministic Systems. Encadrant: Catuscia Palamidessi, Bart Jacobs and Peter
van Rossum.
• Mário Alvim (Oct 2011). Des approches formelles pour le cachement d’information: Une
analyse des systèmes interactifs, contrôle de divulgation statistique, et le raffinement des
spécifications. Encadrant: Catuscia Palamidessi.
• Andrés Aristizábal (Oct 2012). Techniques de Bisimulation et Algorithmes pour la Programmation Concurrente par Contraintes. Encadrant: Frank Valencia and Catuscia Palamidessi.
V.7.3.2
• Steve Kremer (March 2011). Modelling and analyzing security protocols in cryptographic
process calculi. Rapporteur: Catuscia Palamidessi.
Rapports de thèse
• Rémy Haemmerléu (Jan 2008). Fermetures et Modules dans les langages concurrents avec
contraintes fondés sur la logique linèaire. Université Paris VII. Rapporteur: Catuscia
Palamidessi.
• Sardaouna Hamadou (March 2008). Analyse formelle des protocoles cryptographiques et
flux d’information admissible. Ecole Polytechnique of Montreal, Canada. Rapporteur:
• Augusto Parma (May 2008). Axiomatic and Logical Characterizations of Probabilistic
Preorders and Trace Semantics.
Università di Verona, Italy.
Rapporteur: Catuscia
Palamidessi.
• Gerardo Sarria (Aug 2008). Formal Methods of Timed Musical Processes. Universidad del
Valle, Cali, Colombia. Rapporteur: Frank Valencia.
• Han Chen (Dec 2008). Information-Theoretic Approaches to Non-Interference.
Mary, University of London, UK. Rapporteur: Catuscia Palamidessi.
Queen
• Luca Fossati (Feb 2009). Modeling the Handshaking Protocol for Asynchrony. University
of Turin, Italy. Rapporteur: Catuscia Palamidessi.
• Cinzia Di Giusto (Apr 2009). Expressiveness of Concurrent Languages.
Bologna, Italy. Rapporteur: Catuscia Palamidessi.
University of
• Andrea Turrini (Sept 2009). Hierarchical and compositional verification of cryptographic
protocols. University of Verona, Italy. Rapporteur: Catuscia Palamidessi.
• Antonio Vitale (Oct 2010). Expressiveness in biologically inspired languages. University
of Bologna, Italy. Rapporteur: Catuscia Palamidessi.
• Pierre Sutra (Nov 2010). Efficient Protocols for Generalized Consensus and Partial Replication. Université de Rennes. Rapporteur: B. Charron-Bost.
• Sonja Georgievska (Oct 2011). Probability and Hiding in Concurrent Processes.. Eindhoven University of Technology, The Netherlands. Rapporteur: Catuscia Palamidessi.
V.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION
209
• Mathieu Sassolas (Nov 2011). Méthodes qualitatives et quantitatives pour la détection
d’information cachée. University of Paris VI. Rapporteur: Catuscia Palamidessi.
• Giulio Caravagna (Dec 2011). Formal Modeling and Simulation of Biological Systems
with Delays. University of Pisa, Italy. Rapporteur: Catuscia Palamidessi.
• Robert Abo (Dec 2011). Approches formelles pour l’analyse de la performabilité des systèmes communicants mobiles. Conservatoire National des Arts et Métiers. Rapporteur:
• Jacopo Mauro (April 2012). Concurrent Pattern Unification. University of Bologna, Italy.
Rapporteur: Catuscia Palamidessi.
• Thomas Given-Wilson (Aug 2012). Concurrent Pattern Unification. University of Technology, Sydney, Australia. Rapporteur: Catuscia Palamidessi.
• James Jerson Ortiz Vega (Sep 2012). Formal Methods for the Specification and Verification
of Distributed and Timed Systems. Universidad del Valle, Cali, Colombia. Rapporteur:
V.7.3.3
• Catuscia Palamidessi taught a course on Concurrency at the Master MPRI, Université Paris
VII, France. 2008.
• Bernadette Charron-Bost taught at Master SAR, Université Paris VI, jusqu’en 2011
• Bernadette Charron-Bost teaches at Master MPRI, ENS, X et Université Paris VII
• Frank Valencia taught a course on Concurrency at the Master MPRI, ENS, X et Université
Paris VII 2009-2011
• Konstantinos Chatzikokolakis teaches a course on Concurrency at the Master MPRI, ENS,
X et Université Paris VII 2011Jury
• Catuscia Palamidessi was on the PhD Jury of Han Chen, Queen Mary, University of London,
UK, 2008.
• Catuscia Palamidessi was on the PhD Jury of Augusto Parma, Università di Verona, Italy,
2008.
• Catuscia Palamidessi was on the PhD Jury of Sardaouna Hamadou, Ecole Polytechnique of
Montreal, Canada, 2008.
• Catuscia Palamidessi was on the PhD Jury of Rémy Haemmerlé, Université Paris VII, 2008.
• Frank Valencia was on the PhD Jury of Gerardo Sarria, Universidad del Valle, Cali, Colombia, 2008.
• Bernadette Charron-Bost was on the PhD Jury of Martin Biely, Université technologique de
Vienne (TUV), 2008.
• Catuscia Palamidessi was on the PhD Jury of Cinzia Di Giusto, University of Bologna, Italy,
2009.
• Catuscia Palamidessi was on the PhD Jury of Magnus Johansson, Uppsala University), 2010.
210
• Bernadette Charron-Bost was on the PhD Jury of Pierre Sutra, Université Paris VI, 2010.
• Catuscia Palamidessi was on the PhD Jury of Robert Abo, Conservatoire National des Arts
et Métiers, France, 2011.
• Catuscia Palamidessi was on the PhD Jury of Mathieu Sassolas, University of Paris VI,
France, 2011.
• Catuscia Palamidessi was on the PhD Jury of Sonja Georgievska, Eindhoven University of
Technology, The Netherlands, 2011.
• Catuscia Palamidessi was on the PhD Jury of Jerson Ortiz Vega, Universidad del Valle, Cali,
Colombia, 2012.
• Catuscia Palamidessi was on the PhD Jury of Morgan Barbier, Ecole Polytechnique, 2012.
• Frank Valencia teaches a summer course on Models of Concurrency Theory at the Universidad Javeriana. Cali, Colombia, 2008–
• Bernadette Charron-Bost taught at à l’École RESCOM. La Palmyre, France, 2009.
• Catuscia Palamidessi taught a course on Quantitative Information Flow at the 11th International School on Foundations of Security Analysis and Design. Bertinoro, Italy, September
2011.
• Catuscia Palamidessi taught a course on Quantitative Information Flow and Differential
Privacy at RIO 2012, at the Summer School on Informatics. Rı́o Cuarto, Argentine, February 2012.
V.7.4
V.7.4.1
Invited Presentations
We have given invited talks in several scientific events. Here we list some of them:
Conferences:
• Invited Speaker at IFIP-TCS 2010, the International IFIP Conference on Theoretical
Computer Science. Brisbane, Australia (2010). Catuscia Palamidessi.
• Invited Speaker at LICS 2010, the twenty-Fifth Annual IEEE Symposium on Logic In
Computer Science. Edinburgh, UK (2010). Catuscia Palamidessi.
• Invited Speaker at MPC 2010 - AMAST 2010, the 10th International Conference on
Mathematics of Program Construction, and the 13th International Conference on Algebraic Methodology And Software Technology. Manoir St-Castin, Québec, Canada (2010).
• Invited Speaker at ICALP 2011, the 38th International Colloquium on Automata, Languages and Programming (2011). Catuscia Palamidessi.
• Invited Speaker at CBSoft 2011. Brazilian Conference on Software: Theory and Practice.
São Paulo, Brazil (2011). Catuscia Palamidessi.
V.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ
211
Workshops:
• Invited Speaker at workshop in occasion of the opening of the MT-Lab in Copenhagen
(2008). Catuscia Palamidessi.
• Invited Speaker at workshop on Informatic Phenomena. New Orleans, USA (2008).
• Invited Speaker at workshop on Logic And Information Security. Leiden, NL (2008).
• Invited Speaker at SecCo 2008, the international Workshop on Security Issues in Concurrency,Toronto, Canada, August 2008. (2008). Catuscia Palamidessi.
• Invited Speaker at ICE’08, Synchronous and Asynchronous Interactions in Concurrent
Distributed Systems. Reykjavik, Iceland (2008). Catuscia Palamidessi.
• Invited Speaker at IFIP 1.8 Workshop on Formal Methods for Embedded Systems. Eindhoven, NL (2009). Catuscia Palamidessi.
• Invited Speaker at Workshop on Ubiquitous Computing at a Crossroads. London, UK
(2009). Catuscia Palamidessi.
• Invited Speaker at BCTCS 2010. British Colloquium for Theoretical Computer Science.
Edinburgh, UK (2010). Catuscia Palamidessi.
• Invited Speaker at ARSPA-WITS’10, the Joint Workshop on Automated Reasoning for
Security Protocol Analysis and Issues in the Theory of Security. Paphos, Cyprus, (2010).
• Invited Speaker at SOS 2010 - EXPRESS 2010, the 7th workshop on Structural Operational Semantics, and the 17th workshop on Expressiveness in Concurrency Theory,
Paris (2010). Catuscia Palamidessi.
• Invited Speaker at SecCo 2011, the International Workshop on Security Issues in Concurrency, Aachen, Germany (2011). Catuscia Palamidessi.
• Invited Speaker at VECoS 2012, the 6th International Workshop on Verification and
Evaluation of Computer and Communication Systems. CNAM, Paris, France (2012).
• Invited Speaker at Grande Region Security and Reliability Day. Nancy, France (2012).
• Invited Speaker at COW 2012. The 19th CREST Open Workshop on Interference and
Dependence, UK (2012). Catuscia Palamidessi.
V.7.4.2
Participations sur invitation à des rencontres scientifiques
We have been invited to participate in several scientific events. Here we list a few of them:
Dagstuhl seminar on Fault-Tolerant Distributed Algorithms on VLSI Chips (invited speaker).
Schloss Dagstuhl, Germany, 2008 ( B. Charron-Bost)
The Amir Pnueli Memorial Symposium (invited speaker). Shanghai, China, 2009 (Catuscia
Pa-lamidessi)
Symposium for Prof. Mogens Nielsen’s 60th birthday: an Aarhus celebration. Aarhus, Denmark, 2009 (Frank Valencia)
212
BASICS 2009, the international Workshop on Computation and Interaction (invited speaker).
Shanghai, China, 2009 (Catuscia Palamidessi)
Quantum and Classical Information Flow. Bellairs Research Center, Barbados, 2011 (Mario
Alvim, Miguel Andrés, Konstantinos Chatzikokolakis, Sophia Knight and Catuscia Palamidessi)
Dagstuhl seminar on Information Flow and Its Applications (invited speaker).
stuhl, Germany, 2012 (Catuscia Palamidessi)
Schloss Dag-
Dagstuhl seminar on Quantitative Security Analysis. Schloss Dagstuhl, Germany, 2012 (Konstantinos Chatzikokolakis, Ehab ElSalamouny, Sardaouna Hamadou, Catuscia Palamidessi and
Marco Stronatti)
Shonan seminar on Quantitative Methods in Security and Safety Critical Applications. Shonan Village, Japan, 2012 (Konstantinos Chatzikokolakis)
DIMACS Working Group on Measuring Anonymity.
nos Chatzikokolakis)
V.7.4.3
Rutgers University, US, 2013 (Konstanti-
• Prix de thèse Gilles Kahn (second place) , Konstantinos Chatzikokolakis, 2008.
ComèteConcurrency, Mobility and Transactions
VI Équipe Cryptographie (CRYPTO)
213
VI.1 Liste des membres : Cryptographie
VI.1.1
VI.1.1.1
Membres permanents
Nom
Daniel Augot
Alain Couvreur
Françoise Levy-dit-Vehel
François Morain
Benjamin Smith
Valérie Lecomte
VI.1.1.2
Fonction
DR
CR
Associate Professor
Professor
CR, CHE
Assistant
Employeur
INRIA
INRIA
ENSTA
École polytechnique
INRIA, École polytechnique
INRIA
HDR
HDR
HDR
HDR
Arrivée
2008
2011
2012
1991
2007
2012
Doctorants
Nom
Cécile Gonçalves
Gwezheneg Robert
Alexander Zeh
Financement
Monge
MESR-Rennes
Ulm Universität (Germany)
Arrivée
2011
2012
2010
Encadrant
F. Morain
P. Loidreau (IRMAR, Rennes)
M. Bossert (University of Ulm)
G. Robert and A. Zeh are located in their respective university, and are co-advised by D. Augot.
Postdoctorants
Nom
Nicolas Delfosse
Julia Pieltant
Guillaume Quintin
VI.1.1.3
Financement
Qualcomm
INRIA
X/DGA
Dates
2012–2013
2013–2014
2012–2013
Responsable
A. Couvreur
D. Augot
D. Augot
Autres
Iwan Duursma, U. Illinois at Urbana–Champaign: April 11th 2011 to April 21th 2011
Kamal Khuri-Makdisi, American U. of Beirut: July 1st 2011 to July 17th 2011.
VI.1.2
Anciens membres
VI.1.2.1
Membres permanents
Nom
Andreas Enge
Fonction
CR
Employeur
INRIA Saclay–Île-de-France
215
HDR
HDR
Départ
2010
Position actuelle
INRIA Bordeaux Sud-Ouest
CHAPTER VI.1. LISTE DES MEMBRES : CRYPTOGRAPHIE
216
VI.1.2.2
Doctorants
Nom
Morgan Barbier
Jean-François Biasse
Luca De Feo
Thomas Houtmann
Guillaume Quintin
Financement
DGA
X/Monge
DGA
INRIA/DGA
Départ
2011
2010
2010
2008
2012
Encadrant
D. Augot
A. Enge
F. Morain
F. Morain
D. Augot
Position actuelle
ATER Caen, MC on October 1st, 2013
PostDoc, University of Calgary
MC, Versailles–Saint-Quentin University
Professor, “Classes préparatoires”
PostDoc École polytechnique
Postdoctorants
Nom
Alain Couvreur
Sorina Ionica
VI.1.2.3
Financement
INRIA
DGA
Dates
2009-2010
2010-2011
Responsable
D. Augot
B. Smith
Position actuelle
CR, INRIA
ATER, ENS Ulm
Autres membres
Stagiaires Master 2
Nom
Guillaume Quintin
Financement
CNRS
Dates
2009
Responsable
D. Augot
Position actuelle
LIX postdoctorant
Autres
Nom
Jérôme Milan
Jérôme Milan
Tania Richmond
Fonction
Software Engineer
Software Engineer
Stagiaire M1
Financement
Digiteo
CNRS
CNRS
Dates
2007-2008
2009-2012
2011
VI.2 Rapport scientifique : Cryptographie
VI.2.1
VI.2.1.1
Introduction
Algorithmic number theory, and the computational issues related to algebraic curves over various
fields and arithmetic rings, is a central theme of our research. This very rich area of mathematics
and computer science has already shown its relevance in public key cryptography, with industrial
successes including the RSA cryptosystem and elliptic curve cryptography. It is less well known
that very good codes for error correction can be built using the same branches of mathematics;
this is also at the heart of the Crypto team.
Both of these application domains deal with communication systems for securing high-level
applications. While cryptography is considered as a part of computer science, coding theory
traditionally has an electrical engineering flavour; but recent developments in computer science
have shed new light on coding theory, with new applications more central to computer science.
Our team aims to: provide better cryptosystems; provide better security assessments for key
sizes in cryptography and cryptanalysis, and build the best codes with algebraic curves.
More concretely: the discrete logarithm problem, which is at the heart of many cryptosystems, can be stated for any abelian group, but finding groups suitable for cryptography is difficult. There are two issues: finding groups with intractable discrete logarithm problems, and
computing their cardinality (called point counting). Our roadmap includes improving algorithms
for discrete logarithms and point counting in various settings. On the discrete logarithm front,
we are working in collaboration with with the Caramel project (at LORIA) to build software
for large scale computations. We will continue F. Morain’s work on factorization and primality proving. We produce small and highly efficient standalone programs dedicated to a specific
purpose (such as fastECPP: Fast Elliptic Curve Primality Proving, and TIFA: Tools for Integer
Factorization).
Curves also appear in the problems we treat in coding theory. Surprisingly, list decoding algorithms build an interpolating curve related to the problem; other algorithmic problems related
to computer algebra also arise. Further, the algebraic geometry (AG) codes that we promote rely
heavily on the theory of algebraic curves over finite fields. We plan to build software for AG
codes, since they are regularly invoked as a substitute for Reed-Solomon codes, but implementations of most relevant constructions are not yet available.
We will also investigate connections between the two domains of number-theoretic cryptography and coding theory. For example, the decoding problem is related to the discrete logarithm
problem for finite fields or elliptic curves, as studied by F. Morain and D. Augot.
VI.2.1.2
Algorithmic Number Theory Algorithmic Number Theory is concerned with effective number theory at large, with three main threads: fundamental algorithms (primality, factorization),
number fields, and curves (over all kinds of fields). Algorithmic Number Theory is concerned
with replacing special cases with algorithms. As an example, Mersenne primes (which have the
form 2p − 1) make nice and cute examples of prime numbers, but they lack generality: these
numbers can be proven prime in deterministic polynomial time with a specific algorithm that
cannot be used on all prime numbers. Nowadays, there are several algorithms for this task.
Clearly, we use computer algebra in many ways. While there has been a renewal of interest in
these areas triggered by cryptologic motivations, the problems exist per se. Roughly speaking, the
problems of the cryptological world are of bounded size, whereas Algorithmic Number Theory
is also concerned with asymptotic results.
217
218
CHAPTER VI.2. RAPPORT SCIENTIFIQUE : CRYPTOGRAPHIE
Arithmetic Geometry: Curves and their Jacobians More involved number theory deals with
Arithmetic Geometry which is the meeting point of algebraic geometry and number theory: the
study of geometric objects defined over arithmetic number systems. In our case, the most important objects are curves and their Jacobians over finite fields; these are fundamental to our
applications in both coding theory and cryptology.
An algebraic plane curve X over a field K is defined by an equation
X : FX (x, y) = 0
where FX ∈ K[x, y].
Not every curve is plane (we may have more variables, and more defining equations), but from
an algorithmic point of view, we can always reduce it to the plane setting. The genus gX of X
is a non-negative integer classifying the essential geometric complexity of X ; it depends on the
degree of FX and on the number of singularities of X .
For any field L containing K, the set of points of X with coordinates in L is denoted
X (L) = {(α, β) ∈ L2 : FX (α, β) = 0}
(we may also include some additional points “at infinity”).
In a functorial way, there exists an algebraic group JX , called the Jacobian of X ; Jacobians are
fundamental in curve-based cryptography. The group JX has a geometric structure: its elements
correspond, to points on a gX -dimensional projective algebraic group variety. Typically, we do
not compute with the equations defining this projective variety: there are too many of them,
in too many variables, for this to be convenient. Instead, we use fast algorithms based on the
representation in terms of classes of formal sums of points on X .
The simplest curves with nontrivial Jacobians are curves of genus 1, known as elliptic curves.
Elliptic curves are particularly important given their central role in public-key cryptography over
the past two decades. Other important examples of curves include hyperelliptic curves, which
can be typically defined by an equation of the form
X : y 2 + h(x)y = f (x)
with deg h ≤ g and deg f = 2g + 1 or 2g + 2.
While not every curve of genus ≥ 3 is hyperelliptic, for computational and historical reasons
(hyper)elliptic curves form the most important class of curves for curve-based cryptology. The
higher genus case is considerably harder than the genus 1 case, and is far from being its mere
generalization.
Curve-Based Cryptology Jacobians of curves are excellent candidates for cryptographic groups
when constructing efficient instances of public-key cryptosystems. Diffie–Hellman key exchange
is an instructive example.
Suppose Alice and Bob want to establish a secure communication channel. Essentially, this
means establishing a common secret key, which they will then use for encryption and decryption. Some decades ago, they would have exchanged this key in person, or through some trusted
intermediary; in the modern, networked world, this is typically impossible, and in any case completely unscalable. Alice and Bob may be anonymous parties who want to do e-business, for example, in which case they cannot securely meet, and they have no way to be sure of each other’s
identities. Diffie–Hellman key exchange solves this problem. First, Alice and Bob publicly agree
on a cryptographic group G with a generator P (of order N ); then Alice secretly chooses an integer a from [1..N ], and sends aP to Bob. In the meantime, Bob secretly chooses an integer b from
[1..N ], and sends bP to Alice. Alice then computes a(bP ), while Bob computes b(aP ); both have
now computed abP , which becomes their shared secret key. The security of this key depends on
the difficulty of computing abP given P , aP , and bP ; this is the Computational Diffie–Hellman
Problem (CDHP). In practice, the CDHP corresponds to the Discrete Logarithm Problem (DLP),
which is to determine a given P and aP .
This simple protocol has been in use, with only minor modifications, since the 1970s. The
challenge is to create examples of groups G with a relatively compact representation and an
VI.2.1. THÉMATIQUE GÉNÉRALE ET PRINCIPAUX OBJECTIFS
219
efficiently computable group law, and such that the DLP in G is hard (ideally approaching the
exponential difficulty of the DLP in an abstract group). The Pohlig–Hellman reduction shows
that the DLP in G is essentially only as hard as the DLP in its largest prime-order subgroup. We
therefore look for compact and efficient groups of prime order.
The classic example of a group suitable for the Diffie–Hellman protocol is the multiplicative
group of a finite field Fq . There are two problems that render its usage somewhat less than ideal.
First, it has too much structure: we have a subexponential Index Calculus attack on the DLP in
this group, so while it is very hard, the DLP falls a long way short of the exponential difficulty
of the DLP in an abstract group. Second, there is only one such group for each q: its subgroup
treillis depends only on the factorization of q − 1, and requiring q − 1 to have a large prime factor
eliminates many convenient choices of q.
This is where Jacobians of algebraic curves come into their own. First, elliptic curves and
Jacobians of genus 2 curves do not have a subexponential index calculus algorithm: in particular,
from the point of view of the DLP, a generic elliptic curve is currently as strong as a generic
group of the same size. Second, they provide some diversity: we have many degrees of freedom
in choosing curves over a fixed Fq , with a consequent diversity of possible cryptographic group
orders. Furthermore, an attack which leaves one curve vulnerable may not necessarily apply to
other curves. Third, viewing a Jacobian as a geometric object rather than a pure group allows us
to take advantage of a number of special features of Jacobians. These features include efficiently
computable pairings, geometric transformations for optimised group laws, and the availability of
efficiently computable non-integer endomorphisms for accelerated encryption and decryption.
Coding theory Coding Theory studies originated with the idea of using redundancy in messages to resist noise and errors. The last decade of the 20th century has seen the success of
so-called iterative decoding methods, which enable us to get very close to the Shannon capacity.
The capacity of a given channel is the best achievable transmission rate for reliable transmission.
The consensus in the community is that these methods have won against algebraic codes (such
as Reed–Solomon codes).
However, algebraic coding is useful in settings other than the Shannon context. Indeed, the
Shannon setting is a random case setting, and promises only a vanishing error probability. In
contrast, the algebraic Hamming approach is a worst case approach: under combinatorial restrictions on the noise, the noise can be adversarial, with strictly zero errors.
These considerations are renewed by the topic of list decoding after the breakthrough of Guruswami and Sudan at the end of the nineties. List decoding relaxes the uniqueness requirement
of decoding, allowing a small list of candidates to be returned instead of a single codeword. List
decoding can reach a capacity close to the Shannon capacity, with zero failure, with small lists,
in the adversarial case. The method of Guruswami and Sudan enabled list decoding of most of
the main algebraic codes: Reed–Solomon codes and Algebraic–Geometry (AG) codes and new
related constructions “capacity-achieving list decodable codes”.
Another avenue of our studies is AG codes over various geometric objects. Although Reed–
Solomon codes are the best possible codes for a given alphabet, they are very limited in their
length, which cannot exceed the size of the alphabet. AG codes circumvent this limitation, using
the theory of algebraic curves over finite fields to construct long codes over a fixed alphabet. The
striking result of Tsfasman–Vladut–Zink showed that codes better than random codes can be
built this way, for medium to large alphabets. Disregarding the asymptotic aspects and considering only finite length, AG codes can be used either for longer codes with the same alphabet, or
for codes with the same length with a smaller alphabet (and thus faster underlying arithmetic).
From a broader point of view, a good slogan is that wherever Reed–Solomon codes are used,
we can substitute AG codes with some benefits: either beating random constructions, or beating
Reed–Solomon codes which are of bounded length for a given alphabet.
220
VI.2.1.3
Algebraic Geometry codes over small fields : A. Couvreur provided a complete understanding of subfield subcodes of algebraic geometry codes. This involves the theory of the Cartier operator acting on differential forms of curves in positive characteristic. His work explains the
phenomenon of minimum distance doubling of classical binary Goppa codes, and generalizes it
in the higher genus case. To realize the full potential of these codes, further work is needed to
decode these codes as fast as classical Goppa codes.
List decoding of binary Goppa codes We have noticed the true list decoding capability of
binary Goppa codes, i.e., over F2 , which is much higher than the standard radius which is independent of the size of the field. This was important to publish, since cryptographers interested
in these codes for McEliece’s cryptosystem were not aware of the correct radius.
Cryptanalysis of genus 3 curves : B. Smith described the use of explicit isogenies to translate
instances of the discrete logarithm problem (DLP) from Jacobians of hyperelliptic genus 3 curves
to Jacobians of non-hyperelliptic genus 3 curves, where they are vulnerable to faster index calculus attacks. The isogenies he constructed give an explicit and efficient reduction of instances of
the DLP from hyperelliptic to non-hyperelliptic Jacobians for around 18.57% of all hyperelliptic
genus 3 curves over a given finite field. This strong result further restricts the domain of curves
suitable for cryptographic purposes.
Point counting for the genus 2 case : Genus 2 curves, for cryptosystems based on the discrete
logarithm problem, offer per-bit security and efficiency comparable with elliptic curve cryptosystems. However, among the issues to be adressed in practice is the point counting problem.
B. Smith, with P. Gaudry and D. Kohel, provided a fast method to find the number of points
of such a curve, in the case of real multiplication. This method enables to routinely compute the
number of points for curves of cryptographic size. Yet, curves with real multiplication are not
too special, and still provide enough generality and randomness for cryptographic purposes.
VI.2.1.4
We are proud that F. Morain was co-chair of ANTS-IX (2010) and organized it in France (Nancy).
D. Augot was also co-chair of WCC 2011 In Paris.
Our team is happy to have received several prices:
1. B. Smith won the Best Paper award at EUROCRYPT 2008 for his work on discrete logarithms in genus 3.
2. A. Enge won the Selfridge Prize of the Number Theory Foundation for the best paper presented at ANTS-VIII, 2008.
3. L. De Feo received the SIGSAM Distinguished Student Paper Award at ISSAC’09.
4. B. Smith won the Best Paper award at Asiacrypt 2011 for his work on counting points on
genus 2 curves with real multiplication.
VI.2.1.5
Local positionning
Except us, our research areas are not well represented around the Plateau de Saclay, except the
Crypto group in the PRISM computer science laboratory at Versailles Saint Quentin, but links
with this institution are extremely limited (the only practical means is a 20km drive). We are
nevertheless glad that Luca de Feo, a former PhD student, is now Maı̂tre de Conférence in this
group.
Our team also aims at organizing an internal “groupe de travail”. We did not organize an
open and wider seminar because of lack of local audience and Parisian competition. Sometimes,
VI.2.1. THÉMATIQUE GÉNÉRALE ET PRINCIPAUX OBJECTIFS
221
we also have some shared seminar presentations with MAX, and also with SpecFun (Chyzak,
INRIA Saclay). A. Couvreur attends a regular seminar at the Centre Mathematiques Laurent
Schwartz (École polytechnique), and has contributed by giving a talk in January 2013. D. Augot
sometimes attends Comèteseminar.
We are regular participants of a monthly “Butte aux Cailles” open seminar, located in Paris
at Télécom ParisTech, where the focus is on topics in curves, cryptography and coding.
VI.2.1.6
Since January 2012, our team is also an INRIA team (the status of EPC promised in 2013), under
the name Grace: Geometry, aRithmetic, Algorithms, Codes and Encryption, which is the follow-up
of INRIA team TANC: Théorie algorithmique des nombres et cryptographie. We are thus also under
INRIA’s governance, and subject to INRIA internal evaluation.
We receive most of our recurrent funding from INRIA, and our team assistant is employed by
INRIA. However, we are regular members of LIX, using LIX ressources, and helping in various
tasks. Also, two of our members are heavily involved in teaching at École Polytechnique: François
Morain, who is a full professor, and Ben Smith, who is Chargé d’Enseignement.
Except for the years 2011–2012, we received grants from the ANR, and from other bodies,
not very abundantly. We are happy with this situation: our budget suffices for our needs. To
summarize, our team received the following amount of money:
Name
CADO
PACE
DIFMAT
CATREL
Topic
Factorization
Pairings in crypto
Optimal codes
Discrete Logarithm
Funding Agency
ANR
ANR (industrial)
X/DGA
ANR
Amount
96, 000
180, 000
86, 000
149, 000
511, 000
Start
2006
2007
2012
2013
End
2009
2011
2013
2015
We are proud of our own local computing cluster, called les titans: 17 nodes, each node having
around 64 Gigabytes of memory, with 4 processors, 2 cores each and 2× hyperthreading. This
enables us to run 272 processes. At the level of INRIA Saclay – Île-de-France, we share a larger
cluster, TomPouce, with other INRIA teams. At the level of the Plateau de Saclay, F. Morain has
discussions with TeraTech on the Curie supercomputer.
VI.2.1.7
The Plateau de Saclay environment provides many opportunities to get PhD funding (École polytechnique graduate school – EDX, INRIA, Digiteo-Digicosme). We received one Monge, one
EDX, two DGA, one half-Monge half-DGA, one half-INRIA half-DGA, and a starting PhD within
Alcatel-Lucent agreement. The duration has always been three years plus one to three months,
except for Houtmann who did not complete his thesis. We are attractive to postdocs, and hired
five of them.
We are involved in teaching in MPRI, both in coding and cryptography. Also, F. Morain and
B. Smith are in charge of M1 lectures and tutorials in cryptology at the École Polytechnique.
222
VI.3 Projet de recherche : Cryptographie
VI.3.1
VI.3.1.1
Basic Number Theory
This is a strong historical thread from François Morain, which will be continued. The Complex
Multiplication (CM) method, which emerged from ECPP, is an important tool for building cryptographically interesting curves. We will continue the search for new invariants, in collaboration
with Andreas Enge (Lfant), as well as other possible improvements. We still face an intriguing
conjecture on the minimal size of class invariants, which we will continue to investigate through
the study of modular curves.
It is tempting to write about finding a polynomial time algorithm for integer factorization—
but in this field nobody can announce such ideals, and we will refrain from doing so. In any case,
factoring and computing discrete logarithms is something we do on a periodical basis. Following the CADO ANR, we now have the CATREL ANR project, where we investigate discrete log
computations based on the same sieve-engine, together with our close colleagues in Caramel.
Modular curves are intimately related to class invariants. F. Morain has already found new
small invariants that prove useful (see his slides for ECC2010, for instance). He uses quotients
of modular curves X0 (`) for prime ` with Atkin’s functions. A more general study of quotients
of modular curves X0 (N ) is underway, with the aim of finding new instances. In particular, the
factorization of N leads to interesting computable Galois properties of the extension field, and
also to a decomposition of the modular polynomial over quadratic extension fields corresponding
to the fixed fields of the Atkin-Lehner involutions.
Making tables of such objects available in a complete and understandable way is one of our
objectives in this domain. This will involve a lot of computations with modular forms and curves,
some of which are already available (in systems such as SAGE and Magma). We will also investigate applications to codes, especially in relation to the Garcia–Stichtenoth towers.
VI.3.1.2
Isogeny and Endomorphism Computations
Computing explicit isogenies and isogeny structures has historically been a strength for our team,
which we will carry forward. Briefly, isogenies are used to relate different Jacobians, to glue them
together, and (when possible) to split them into smaller pieces. Endomorphisms (isogenies from
a Jacobian to itself) reveal the inner structure and special arithmetic features of a Jacobian. Since
isogeny and endomorphism algorithms are typically building blocks for other computations including encryption, decryption, and point counting, our emphasis is on efficiency.
B. Smith has used isogenies as a means to transform DLP instances, bridging the gap between
relatively “hard” and “easy” instances in genus 3. This result has had a considerable impact in
the cryptographic community, and generalizing this attack to a wider range of curves is one of
our research priorities.
One particularly interesting problem is the construction of low-genus curves whose Jacobians
have explicit, efficiently computable endomorphisms. These endomorphisms have a number of
applications, ranging from accelerated encryption and decryption to faster point counting, but
the relative lack of practical examples of such curves is frustrating. We must develop new constructions, and new families of curves. During the evaluation period, B. Smith has developed a
range of new families, including a series of families of elliptic curves equipped with explicit endomorphisms that can be used to improve the efficiency of encryption and decryption operations
(generalizing and extending the classic results of Gallant–Lambert–Vanstone and Galbraith–Lin–
Scott). Going forward, we hope that a wider collection of examples will foster new applications
and algorithms for low-dimensional Jacobians with explicit endomorphism structures. This will
lead to better cryptographic operations, and more effective cryptanalytic attacks.
223
224
CHAPTER VI.3. PROJET DE RECHERCHE : CRYPTOGRAPHIE
Explicit decomposition and glueing of Jacobians has applications in pairing-based cryptography, and also in the analysis of AG codes based on Hermitian curves. Enumerating polarizations
of low-dimensional Jacobians is an interesting problem in explicit CM-theory for genus 2 (currently a very hot topic in Algorithmic Number Theory and pairing-based cryptography). An
algorithm for changing the polarization on a genus 3 Jacobian would lead to a completely new
attack on the DLP in genus 3, with a potentially wider applicability than Smith’s isogeny-based
work.
Endomorphisms and isogenies can also play a role in the acceleration of standard point counting algorithms (which are fundamental in computational number theory, curve-based cryptology,
and curve-based coding theory). We are considering improvements of these algorithms when
specialized to arithmetically special curves, such as curves whose Jacobians have efficiently computable endomorphisms. This approach has already yielded some spectacular success in genus 2:
B. Smith, P. Gaudry (Caramel) and D. Kohel (Aix–Marseille U.) have recently used this approach
to smash the world record for genus-2 point counting over large prime fields. Future research
includes extending these benefits to p-adic point counting methods, such as Kedlaya’s algorithm
and the AGM. Related problems include relative point counting, where we are given partial information on the zeta function (corresponding to coverings of curves, or isogeny factors of the
Jacobian).
Deformation-theoretic algorithms, originally developed by Alan Lauder at Oxford and the
research group at Leuven, represent a new direction in point counting research. These algorithms use “continuous” geometric methods to deform curves representing hard p-adic point
counting instances into easier examples, by viewing the hard and easy curves as members of a
parametrized family, and then analysing the p-adic differential equation governing the variation
of the Weil polynomials over the family. We aim to explore these methods for arithmetically
special families of curves: for example, curves with real multiplication (RM) occur in natural
families, and we will investigate using this structure to further simplify and accelerate point
counting computations. The RM common to all members of the family should impact on the
deformation analysis, and also allow some acceleration of the “easier” deformed point counting
instance. Further along these lines, it would be interesting to develop a theory of hardness of
deformations. Put simply, given a “hard” X and an “easy” curve X 0 of the same type over the
same finite field, we can define a number of families including both X and X 0 . The question is:
which of these families yields the most efficient point counting algorithm?
VI.3.1.3
Algebraic Geometry Codes
We are building the codes promised by the Garcia–Stichtenoth tower of function fields. These
codes have the property that they are better than random codes, when the alphabet Fq has a size
q equal to a square larger than 49. This is true asymptotically, but also for immediate length,
in the range of a few hundreds (over F64 ). Being better than random codes has been an elusive
goal since the beginning of coding theory. We have postdoctoral fellow who is working on an
implementation of Shum et al.’s methods to build these AG codes over this tower.
Then, building on this implementation, decoding algorithms will be studied, either unique
decoding (which is more-or-less standard), or list decoding, which would require more work.
These codes are also of interest for various cryptographic protocols, like secret sharing.
We are also interested in McEliece’s cryptosystem. This area is already well studied in France
and elsewhere in Europe, with N. Sendrier leading this direction. We will contribute to the
efforts in this domain by asserting the security of the most structured candidates, when seen
as AG codes, or eventually introduce Cartier codes as a replacement to binary Goppa codes.
A. Couvreur also has a cooperation with J.P. Tillich on attacks on the system.
VI.3.1.4
Unique, List and Local Decoding
The breakthrough of Sudan and Guruswami for decoding decade old Reed-Solomon codes can be
seen as a general principle to be applied and adapted to many codes and situations. For instance,
VI.3.1. OBJECTIFS SCIENTIFIQUES
225
it not only applies to Reed–Solomon codes but also to AG codes and their number-theoretical
analogues. Although polynomial time, this algorithm is heavy to run, and we have a number of
different objectives ranging from direct and useful implementations to more speculative ideas.
Apart from the standard formulation of these algorithms, progress can be made on the list
decoding problem itself. For instance, Wu’s approach is to preprocess the problem, and listdecode with a high gain in complexity. Understanding and systematising this approach is the
objective here.
We also believe that list decoding algorithms à la Sudan are somewhat too powerful. They
are deterministic algorithms, which deal with the worst case, when the size of the list is large.
This has a big influence on the complexity; but it is known, at least for Reed–Solomon codes, that
the size of the list is one with overwhelming probability, but the algorithm cannot deal with the
situation, only with worst case scenarios. We want to reach the improved Guruswami-Sudan’s
decoding radius with probabilistic algorithms, which sometimes smartly fail.
Locally decodable codes were introduced by Babai et al. in 1991, but were formally defined
by Katz and Trevisan in 2000. The aim is to recover a bit of the message by looking only at a
small number ` of (randomly) chosen locations in the encoding. Mainly they enable to recover
one corrupted symbol from other symbols, without dealing with all the symbols, just a few of
them.
An important result was achieved by Koppary, Saraf and Yekhanin. From the technical point
of view, we recognize our familiar themes here: algebraic codes, multiplicities, etc. One of the
main practical applications of this problem is the so-called Private Information Retrieval: this
primitive enables a user to query an entry in a database without revealing it, in such a way that
the server answering the query has no information about the entry. We received an industrial
contract on this topic with Alcatel-Lucent, within INRIA and the Alcatel-Lucent partnership, on
locally decodable codes for distributed storage, and we will recruit a new PhD student in Fall
2013 to work on this topic.
226
CHAPTER VI.3. PROJET DE RECHERCHE : CRYPTOGRAPHIE
en
ac
es
N
D o
ne epa mor
nt rt e
m ure PhD
em o
b e f o stu
rs ur de
.
ju nts
ni .
or
pe
rm
a-
•
•
s
227
NEGATIF
M
•
At
ou
ts
es
ss
•
O
c ut
et odi of
B ry ng th
an e b
• er est ).
d ox
So ro al
r
cr t
g
• cl ft c e
yp hin
W ust wa orr bra
to k
r
o
e
e
tio rl r e c ic
gr ing
ns d r , ti ma tin kn
ap a
. ec es st g ow
hy bo
c
or w er o le
( g ut
d ith y, de dg
eo
br C ou s. e
m
ea a r
o
n
ki ram loc
ng e a
co l. l
m
pu
ta
-
le
ib
Fa
lcu
d . LIX
an ing in fit
es d s e
iti Co as en
un d m b
m n al lly
m o a tic fu ay.
co ypt cri to cl
nt r l I X S a
re n C oca L de s.
ffe i l de
nt
Di es of tsi eau de
r
• tu ack ou lat stu
L d P d
an om Ph
fr w
Fe
•
•
té
ni
tu
or
pp
ty c
au i
m
iun th
ed is
m ri
m go
gr y in rit de
co Al
u
,
y
ech hy
ke sec A Îl
I
en p y. a
Fr gra eor is nd INR . tre t
de
ng to h y , a y me n en re
ro yp r T ph ity b s Ce ur oi nd .
St Cr be gra ur th ico S ( La rat , a rd
• in um to sec bo Dig ML es bo ay) ma
N ryp of ted nd C qu (La rs da
C t o a ng ti
’O Ha
• en om ce ori ma MO s d s
pr an hb thé ), L ue que
Fr eig a rtz tiq ac
N m a a J
• de hw ém ion
Sc ath at
m nd
Fo
O
A F
O M
POSITIF
VI.4 Analyse AFOM : Cryptographie
INTERNE
EXTERNE
Figure VI.4.1: Analyse AFOM de l’équipe Cryptographie : Atouts, Faiblesses, Opportunités,
Menaces
228
CHAPTER VI.4. ANALYSE AFOM : CRYPTOGRAPHIE
VI.5 Fiche résumé : Cryptographie
VI.5.1
Membres
From TANC to Grace After the departure of F. Morain, D. Augot became head of the team, and
we had to change our name, making a new project-team proposal in 2012, under INRIA’s rules.
We underwent a full evaluation process, which took the whole 2012 year, involving internal and
external reviewers, with a positive conclusion in February 2013.
2008 – TANC : 3 INRIA chercheurs, 1 enseignant-chercheurs (X), 1 engineer, 4 doctorants.
2013 – GRACE : 3 chercheurs (3 INRIA), 2 enseignants-chercheurs (X, ENSTA), 3 postdocs, 3
doctorants.
Départ de membres de l’équipe Andreas Enge left the team in 2010, to join INRIA Bordeaux–
Sud-Ouest, where he founded the LFant team, devoted to algorithmic number theory,
with GP/PARI as a programming platform.
Nouveaux membres Alain Couvreur (CR INRIA) joined the team in 2011, bringing AG codes
and related algebraic geometry over finite fields to the group. We used the proximity of ENSTA
to have Françoise Levy-dit-Vehel (Associate professor, ENSTA) joining the team, with themes
like applied cryptography and multivariate cryptography.
VI.5.2
Isogenies for genus 3 curves B. Smith described the use of explicit isogenies to translate instances of the discrete logarithm problem (DLP) from Jacobians of hyperelliptic genus 3 curves to
Jacobians of non-hyperelliptic genus 3 curves, where they are vulnerable to faster index calculus
attacks. The isogenies he constructed give an explicit and efficient reduction of instances of the
DLP from hyperelliptic to non-hyperelliptic Jacobians for around 18.57% of all hyperelliptic
genus 3 curves over a given finite field. This strong result further restricts the domain of curves
suitable for cryptographic purposes.
Point counting for genus 2 curves Genus 2 curves, for cryptosystems based on the discrete
logarithm problem, offer per-bit security and efficiency comparable with elliptic curve cryptosystems. However, among the issues to be adressed in practice is the point counting problem.
B. Smith, with P. Gaudry and D. Kohel, provided a fast method to find the number of points of
such a curve, in the case of real multiplication. This method enables the routine computation of
the number of points for curves of cryptographic size. Yet, curves with real multiplication are
not too special, and still provide enough generality and randomness for cryptographic purposes.
Algebraic geometry codes over small finite fields A. Couvreur provided a complete understanding of subfield subcodes of algebraic geometry codes. This involves the theory of the Cartier
operator acting on differential forms of curves in positive characteristic. His theory explains the
phenomenon of minimum distance doubling of classical binary Goppa codes, and generalizes it
to the higher genus case. We now have the proper language to speak of most algebraic codes,
including their subfield subcodes.
229
CHAPTER VI.5. FICHE RÉSUMÉ : CRYPTOGRAPHIE
230
VI.5.3
VI.5.3.1
Publications
Journaux : 18
The above count of international conferences includes also presentations at ISIT conferences (7),
which are peculiar, and do not follow the standard *crypt* IACR rules. Nevertheless, it is the
best and widest audience to present coding theoretical results.
• A former Ph.D. student, Régis Dupont, investigated the complexity of the evaluation of
some modular functions and forms (such as the elliptic modular function j or the Dedekind
eta function). Exploiting the deep connection between the arithmetic-geometric mean
(AGM) and a special kind of modular form known as theta constants, he devised an algorithm that has quasi-optimal linear complexity (Math. Comp, 2011).
• F. Morain, G. Hanrot and E. Thomé co-edited the proceedings of the ANTS-IX conference
(2010, Springer).
• D. Augot, A. Canteaut, G. Kyureghyan, F. Solov’Eva, and Ø. Ytrehus co-edited the WCC
proceedings of WCC 2011 (Designs, Codes and Cryptography special issue, 2012).
• B. Smith as the sole author received the Eurocrypt 2008 best paper award, and was invited
to submit a long version of it to the Journal of Cryptology.
• B. Smith and his co-authors received the Asiacrypt 2011 best paper award.
VI.5.3.2
Rayonnement
• D. Augot is co-organizer of the CCA seminar, which occurs three times a year in Paris. This
France–wide seminars gather participants for a whole day at the Institut Henri Poincaré, or
Télécom ParisTech, on topics related to cryptography, coding and discrete maths.
• B. Smith invited 3 international speakers and four French speakers to a one shot spontaneous workshop on “algorithmic number theory for public key crypto”, June 20-21, 2013
inside the Alan Turing Building. This was very well received and we got 35 participants.
• F. Morain breaks world records with fastECCP, which he continuously improves, from his
primality proving programm ECPP, originally developed in the early 1990s. His personal
record is around 25, 000 decimal digits, presented at the ECC2010 conference, for the 25
years on elliptic curve cryptography.
VI.5.3.3
We are involved in teaching in MPRI, both in coding and cryptography. Also, F. Morain and B.
Smith are in charge of M1 lectures and tutorials in cryptology at Ecole polytechnique.
D. Augot regularly makes presentations to high school students on computer science, coding
and cryptography.
VI.5.3.4
Software
We have a tradition of producing specialized, focused and fast software: MPC (fast complex
numbers), MPFRCX (univariate polynomials over complex numbers), (fast)ECPP, TIFA (routine
factorization), CADO-NFS (factoring big RSA numbers), SEA (point counting on elliptic curves),
Decoding (Reed-Solomon codes).
VI.6 Production scientifique : Cryptographie
Les publications [504] et [499] sont des publications avec des auteurs dans des des équipes
différentes.
VI.6.1
[446] Daniel Augot, Anne Canteaut, Gohar Kyureghyan, Faina Solov’eva, and Øyvind Ytrehus, editors. Special Issue on Coding and Cryptography, volume 66 of Designs, Codes and
Cryptography. Springer, January 2013. Full journal versions of selected papers of WCC
2011.
[447] G. Hanrot, F. Morain, and E. Thomé, editors. Algorithmic Number Theory, volume 6197 of
Lecture Notes in Comput. Sci. Springer-Verlag, 2010. 9th International Symposium, ANTSIX, Nancy, France, July 2010, Proceedings.
VI.6.2
[448] F. Morain. Cours de Cryptologie. Ecole Polytechnique, 2013. 80 pages.
[449] F. Morain. Introduction à la programmation et à l’algorithmique. Ecole Polytechnique, 2013.
260 pages.
VI.6.3
[450] Morgan Barbier, Christophe Chabot, and Guillaume Quintin. On Quasi-Cyclic Codes
as a Generalization of Cyclic Codes. Finite Fields and Their Applications, 18(5):904–919,
September 2012.
[451] Alain Couvreur. Construction of rational surfaces yielding good codes. Finite Fields and
Their Applications, 17(5):424–441, September 2011.
[452] Alain Couvreur. Differential Approach for the Study of Duals of Algebraic-Geometric
Codes on Surfaces. Journal de Théorie des Nombres de Bordeaux, 23(1):95–120, January
2011.
[453] Alain Couvreur. The dual minimum distance of arbitrary-dimensional algebraicgeometric codes. Journal of Algebra, 350(1):84–107, January 2012.
[454] Luca De Feo. Fast algorithms for computing isogenies between ordinary elliptic curves
in small characteristic. Journal of Number Theory, 131(5):873–893, May 2011.
[455] Luca De Feo and Éric Schost. transalpyne: a language for automatic transposition. ACM
SIGSAM Bulletin, 44(1/2):59–71, July 2010.
[456] Luca De Feo and Éric Schost. Fast Arithmetics in Artin-Schreier Towers over Finite Fields.
Journal of Symbolic Computation, 47(7):771–792, July 2012.
[457] Régis Dupont. Fast evaluation of modular functions using Newton iterations and the
AGM. Mathematics of Computation, 80(275):1823–1847, 2011.
[458] Andreas Enge. Computing modular polynomials in quasi-linear time. Mathematics of
Computation, 78(267):1809–1824, 2009.
231
BIBLIOGRAPHY
232
[459] Andreas Enge. The complexity of class polynomial computation via floating point approximations. Mathematics of Computation, 78(266):1089–1107, 2009.
[460] Steven Galbraith, Christophe Ritzenthaler, Jordi Pujolas, and Benjamin Smith. Distortion maps for supersingular genus two curves. Journal of Mathematical Cryptology, 3(1):1–
18, 2009.
[461] Carlos Munuera and Morgan Barbier. Wet paper codes and the dual distance in steganography. Advances in mathematics of communications, 6(3):273–285, November 2011.
[462] Benjamin Smith. Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3
Hyperelliptic Curves. Journal of Cryptology, 22(4):505–529, 2009.
[463] Benjamin Smith. Families of explicitly isogenous Jacobians of variable-separated curves.
LMS Journal of Computation and Mathematics, 14:179–199, August 2011.
[464] Alexander Zeh and Sergey Bezzateev. A New Bound on the Minimum Distance of Cyclic
Codes Using Small-Minimum-Distance Cyclic Codes. Designs, Codes and Cryptography,
June 2012.
[465] Alexander Zeh, Christian Gentner, and Daniel Augot. An Interpolation Procedure for
List Decoding Reed-Solomon Codes Based on Generalized Key Equations. IEEE Transactions on Information Theory, 57:5946–5959, September 2011.
[466] Alexander Zeh and Antonia Wachter. Fast Multi-Sequence Shift-Register Synthesis with
the Euclidean Algorithm. Advances in mathematics of communications, 5(4):667–680,
posted–at = 2011–10–26 07:39:25, 2011.
[467] Alexander Zeh, Antonia Wachter, and Sergey Bezzateev. Decoding Cyclic Codes up to
a New Bound on the Minimum Distance. IEEE Transactions on Information Theory, May
2012.
VI.6.4
[468] Frederik Armknecht, Daniel Augot, Ludovic Perret, and Ahmad-Reza Sadeghi. On Constructing Homomorphic Encryption Schemes from Coding Theory. In Liqun Chen, editor,
13th IMA International Conference on Cryptography and Coding, volume 7089 of Lecture
Notes in Computer Science, pages 23–40, Oxford, Royaume-Uni, December 2011. Institute
of Mathematics and its Applications (IMA), Springer.
[469] Daniel Augot, Morgan Barbier, and Alain Couvreur. List-Decoding of Binary Goppa
Codes up to the Binary Johnson Bound. In Shokrollahi. Amin, Valdemar C. da Rocha Jr.,
and Sueli I. R. Costa, editors, IEEE Information Theory Workshop, pages 229 – 233, Paraty,
Brésil, October 2011. IEEE.
[470] Daniel Augot, Morgan Barbier, and Caroline Fontaine. Ensuring message embedding
in wet paper steganography. In Liqun Chen, editor, IMACC 2011, volume 7089 of Lecture Notes in Computer Science, pages 244–258, Oxford, Royaume-Uni, November 2011.
Springer.
[471] Daniel Augot and Michael Stepanov. A note on the generalisation of the GuruswamiSudan list decoding algorithm to Reed-Muller codes. In Massimiliano Sala, Teo Mora,
Ludovic Perret, Shojiro Sakata, and Carlo Traverso, editors, Gröbner Bases, Coding, and
Cryptography, volume 2, pages 395–398. Springer, 2009.
BIBLIOGRAPHY
233
[472] Daniel Augot and Alexander Zeh. On the Roth and Ruckenstein equations for the
Guruswami-Sudan algorithm. In Frank R. Kschischang and En-Hui Yang, editors, Information Theory, 2008. ISIT 2008. IEEE International Symposium on, pages 2620–2624,
Toronto, Canada, August 2008. IEEE.
[473] Morgan Barbier and Paulo Barreto, S. L. M. Key Reduction of McEliece’s Cryptosystem Using List Decoding. In Alexander Kuleshov, Vladimir M. Blinovsky, and Anthony
Ephremides, editors, International Symposium of Information Theory (ISIT), pages 2657–
2661, Saint-Peterburg, Russie, Fédération De, August 2011. IEEE.
[474] Juliana Belding, Reinier Bröker, Andreas Enge, and Kristin Lauter. Computing Hilbert
Class Polynomials. In Andreas Stein Alfred J. van der Poorten, editor, ANTS-VIII - Eighth
Algorithmic Number Theory Symposium, volume 5011 of Lecture Notes in Computer Science,
pages 282–295, Banff, Canada, 2008. Springer-Verlag.
[475] Luca De Feo and Éric Schost. Fast Arithmetics in Artin-Schreier Towers over Finite Fields.
In International Conference on Symbolic and Algebraic Computation, pages 127–134, Corée,
République De, July 2009.
[476] Andreas Enge. Discrete logarithms in curves over finite fields. In Gary L. Mullen, Daniel
Panario, and Igor E. Shparlinski, editors, Eighth International Conference on Finite Fields
and Applications - Fq8, volume 461 of Contemporary Mathematics, pages 119–139, Melbourne, Australie, 2008. American Mathematical Society.
[477] Pierrick Gaudry, David Kohel, and Benjamin Smith. Counting Points on Genus 2 Curves
with Real Multiplication. In Dong Hoon Lee and Xiaoyun Wang, editors, ASIACRYPT
2011, volume 7073 of Lecture Notes in Computer Science, pages 504–519, Seoul, Corée,
République De, November 2011. International Association for Cryptologic Research,
Springer.
[478] Guillaume Quintin. A Lifting Decoding Scheme and its Application to Interleaved Linear Codes. In Guiseppe Caire, Michelle Effros, Hans-Andrea Loeliger, and Alexander
Vardy, editors, International Symposium on Information Theory, pages 96–100, Cambridge,
États-Unis, 2012. IEEE.
[479] Guillaume Quintin. The decoding Library for List Decoding. In François Boulier, editor,
International Symposium on Symbolic and Algebraic Computation, volume 46, pages 168–
170, Grenoble, France, 2012. ACM.
[480] Christian Senger, Steffen Schober, Tong Mao, and Alexander Zeh. End-to-End algebraic network coding for wireless TCP/IP networks. In Mohamed-Slim Alouini, editor,
Telecommunications (ICT), 2010 IEEE 17th International Conference on, pages 607–612,
Doha, Qatar, 2010.
[481] Benjamin Smith. Isogenies and the Discrete Logarithm Problem in Jacobians of Genus
3 Hyperelliptic Curves. In Nigel Smart, editor, Eurocrypt 2008, volume 4965 of Lecture
Notes in Computer Science, pages 163–180, Istanbul, Turquie, 2008. International Association for Cryptologic Research.
[482] Benjamin Smith. Families of Explicit Isogenies of Hyperelliptic Jacobians. In David
Kohel and Robert Rolland, editors, Arithmetic, Geometry, Cryptography and Coding Theory
2009, volume 521 of Contemporary Mathematics, pages 121–144, Luminy, France, 2010.
American Mathematical Society.
[483] Alexander Zeh and Sergey Bezzateev. Describing A Cyclic Code by Another Cyclic Code.
In Guiseppe Caire, Michelle Effros, Hans-Andrea Loeliger, and Alexander Vardy, editors,
ISIT 2012 - Internation Symposium on Information Theory, pages 2896–2900, Boston, ÉtatsUnis, April 2012. IEEE.
BIBLIOGRAPHY
234
[484] Alexander Zeh, Christian Gentner, and Martin Bossert. Efficient List-Decoding of ReedSolomon Codes with the Fundamental Iterative Algorithm. In Daniel Costello and Alex
Grant, editors, Information Theory Workshop, 2009. ITW 2009. IEEE, Taorminia, Italie,
2009.
[485] Alexander Zeh, Sabine Kampf, and Martin Bossert. On the Equivalence of SudanDecoding and Decoding via Virtual Extension to an Interleaved Reed-Solomon Code. In
R. Mathar, editor, 8th International ITG Conference on Source and Channel Coding, Siegen,
Germany, Allemagne, 2010.
[486] Alexander Zeh and Wenhui Li. Decoding Reed-Solomon codes up to the Sudan radius
with the Euclidean algorithm. In Mao-Chao Lin, Hideki Ochiai, and Tetsushi Ikegami,
editors, Information Theory and its Applications (ISITA), 2010 International Symposium on,
pages 986 –990, Taichung, Taı̈wan, Province De Chine, 2010.
[487] Alexander Zeh and Christian Senger. A link between Guruswami-Sudan’s list-decoding
and decoding of interleaved Reed-Solomon codes. In M. Gastpar, R. Heath, and K.
Narayanan, editors, Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on, pages 1198–1202, Austin, États-Unis, 2010. IEEE.
[488] Alexander Zeh, Antonia Wachter, and Sergey Bezzateev. Efficient decoding of some
classes of binary cyclic codes beyond the Hartmann-Tzeng bound. In Bruce Hajek, Simon
Litsyn, and Boris Ryabko, editors, Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, pages 1017 –1021, St. Petersburg, Russie, Fédération De, 2011.
[489] Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau, and Sergey Bezzateev.
Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product
Codes. In Amos Lapidoth, Igal Sason, Jossy Sayir, and Emre Telatar, editors, IEEE International Symposium on Information Theory (ISIT), Istanbul, Turquie, June 2013. IEEE. 5
pages, no figure, submitted to ISIT2013.
VI.6.5
[490] Daniel Augot. Les codes algébriques principaux et leur décodage. In Jean-Guillaume
Dumas, Grégoire Lecerf, Delphine Boucher, and Thomas Cluzeau, editors, Journées Nationales de Calcul Formel, volume 1 of Les cours du CIRM, pages 31–74, Luminy, France,
May 2010. CIRM.
[491] Daniel Augot. Problématique des bons codes sur le corps à deux éléments. In Journées de
la Société Mathémarique de France, Fascicules Journées annuelles de la SMF, Paris, France,
June 2010.
VI.6.6
Vulgarisation
[492] F. Morain. Factorisation d’entiers : la voie royale du cassage de RSA. MISC Hors-Série 5
– Cryptographie : vos secrets sont-ils bien gardés?, April 2012.
[493] F. Morain. Le logarithme discret contre les tunnels sécurisés. MISC Hors-Série 6 – Les
mains dans la cryptographie, November 2012.
VI.6.7. LOGICIEL
VI.6.7
Logiciel
VI.6.7.1
Multiprecision
235
MPC
The mpc library, developed in C by A. Enge in collaboration with Ph. Théveny and P. Zimmermann, implements the basic operations on complex numbers in arbitrary precision, which
can be tuned to the bit. This library is based on the multiprecision libraries GMP and mpfr.
Each operation has a precise semantics, in such a way that the results do not depend on the
underlying architecture. Several rounding modes are available. This software, licensed under the GNU Lesser General Public License (LGPL), can be downloaded freely from the URL
http://www.multiprecision.org/mpc/.
The library currently benefits from an INRIA Opération de développement logiciel. The latest
version (0.8) was released in November 2009. A Debian package has been available (in the testing distribution) since October 2008. The perl wrapper Math::MPC (http://search.cpan.org/
˜sisyphus/Math-MPC/) has been available on CPAN since version 0.4.6.
The mpc library is used in our team to build curves with complex multiplication and to compute modular polynomials, and it is de facto incorporated in the ECPP program. It is used by
the Magma Computational Algebra System (http://magma.maths.usyd.edu.au/magma/) and
by Trip (http://www.imcce.fr/Equipes/ASD/trip/trip.php), a symbolic-numeric system for
celestial mechanics developed at Institut de Mécanique Céleste et de Calcul des Éphémérides.
MPFRCX
The mpfrcx library, developed in C by A. Enge, implements the arithmetic of univariate polynomials with floating coefficients of arbitrary precision, be they real (mpfr) or complex (mpc).
Version 0.2 was published in May 2009, and is available at http://www.multiprecision.org/
mpfrcx. Advanced asymptotically fast algorithms have been implemented, such as Karatsuba
and Toom–Cook multiplication, various flavours of the FFT and division with remainder by
Newton iteration. Special algorithms for symbolic computation, such as fast multievaluation,
are also available.
Publishing mpfrcx is part of an ongoing effort to make A. Enge’s program for building elliptic
curves with complex multiplication available. This program is a very important building block
for cryptographic purposes as well as for primality proving (fastECPP).
VI.6.7.2
Integer Factorization
ECPP
F. Morain has been continuously improving his primality proving algorithm called ECPP, originally developed in the early 1990s. Binaries for version 6.4.5 have been available since 2001
on his web page. Proving the primality of a 512 bit number requires less than a second on an
average PC. His personal record is around 25, 000 decimal digits, with the fast version he started
developing in 2003. All of the code is written in C, and based on publicly available packages
(GMP, mpfr, mpc, mpfrcx).
TIFA
The TIFA library (short for Tools for Integer FActorization) was initially developed in 2006 and
has been continuously improved during the last few years. TIFA is made up of a base library
written in C99 using the GMP library, together with stand-alone factorization programs and a
basic benchmarking framework to assess the performance of each algorithm.
It is now available online at http://www.lix.polytechnique.fr/Labo/Jerome.Milan/tifa/
tifa.xhtml and distributed under the Lesser General Public License, version 2.1 or later.
BIBLIOGRAPHY
236
CADO-NFS
One of the achievements of the ANR CADO is the program cado-nfs available on http://
cado-nfs.gforge.inria.fr/. This program factors large integers (up to 700 bits) and was written by several authors from LORIA and F. Morain at LIX. His role was to tackle the filtering
process of the relations obtained in the first phase of the algorithm (a kind of sparse elimination
before using specific linear algebra algorithms). F. Morain was credited of 10% work when the
program was deposited at APP.
VI.6.7.3
Elliptic curves over finite fields: SEA
Together with E. Schost and L. De Feo, F. Morain has developed a new implementation of the SEA
algorithm that computes the cardinality of elliptic curves over finite fields (large prime case, case
p = 2). It uses NTL and includes the more recent algorithms for solving all subtasks. The large
prime case is relevant to cryptographical needs. The p = 2 case, though not directly useful, is a
good testbed for the FAAST program of L. De Feo. This program is a gforge project.
VI.6.7.4
Coding theory
Quintix
The Quintix library is a Mathemagix package available at http://www.mathemagix.org/www/
main/index.en.html. It is developed in C++ within the Mathemagix computer algebra system.
It implements basic arithmetic for Galois rings and their unramified extensions, basic functions
for the manipulation of Reed-Solomon codes and the complete Sudan list-decoding algorithm. It
also implements the root-finding algorithms presented in [504]. The source code is distributed
under the General Public License version 2 or higher.
Quintix is a very efficient library for Galois rings, extensions of Galois rings and root-finding
in Galois rings.
Decoding
Decoding is a standalone C library licensed under the GNU General Public License (GPL) created
by G. Quintin. Its primary goal is to implement as efficiently as possible the Guruswami-Sudan
list decoding algorithm. Its secondary goal is to give an efficient tool for the implementation of
decoding algorithms (not necessarily list decoding algorithms) and their benchmarking.
The library provides unique and list decoding algorithms. It takes advantage of other publicly
available libraries such as GMP, MPFQ and GF2X. Decoding contains a functionnal GuruswamiSudan list decoding algorithm and Gao’s unique decoding algorithm over any finite field. The
library is being actively developped and more algorithms will be added. Decoding was presented
at the 2012 International Symposium on Symbolic and Algebraic Computation.
VI.6.8
Thèses
[494] Morgan Barbier. Décodage en liste et application à la sécurité de l’information. These, Ecole
Polytechnique X, December 2011.
[495] Jean-François Biasse. Subexponential algorithms for number fields. PhD thesis, Ecole Polytechnique X, 2010.
[496] Luca De Feo. Algorithmes Rapides pour les Tours de Corps Finis et les Isogénies. These, Ecole
Polytechnique X, December 2010.
[497] Guillaume Quintin. Sur l’algorithme de décodage en liste de Guruswami-Sudan sur les anneaux finis. PhD thesis, Ecole Polytechnique X, November 2012.
VI.6.9. BREVETS
VI.6.9
VI.6.10
237
Brevets
Rapports techniques
[498] Daniel Augot, Morgan Barbier, and Alain Couvreur. List-decoding of binary Goppa
codes up to the binary Johnson bound. Rapport de recherche RR-7490, INRIA, December
2010. http://hal.inria.fr/inria-00547106.
[499] Thomas Heide Clausen, Ulrich Herberg, and Jérôme Milan. Digital Signatures for Admittance Control in the Optimized Link State Routing Protocol version 2. Rapport de
recherche RR-7216, INRIA, February 2010. http://hal.inria.fr/inria-00460057.
VI.6.11
Autres
[500] Daniel Augot and Matthieu Finiasz. Exhaustive Search for Small Dimension Recursive
MDS Diffusion Layers for Block Ciphers and Hash Functions. Published at ISIT 2013,
2013, http://hal.inria.fr/hal-00823082.
[501] Daniel Augot and François Morain. Discrete logarithm computations over finite fields
using Reed-Solomon codes. Preprint, 2012, http://hal.inria.fr/hal-00672050.
[502] Stéphane Ballet, Jean Chaumine, and Julia Pieltant. Shimura modular curves and
asymptotic symmetric tensor rank of multiplication in any finite field. Preprint, 2013,
http://hal.inria.fr/hal-00828070.
[503] Morgan Barbier. New Set of Codes for the Maximum-Likelihood Decoding Problem. In
Yet Another Conference on Cryptography, Porquerolle, France, October 2010.
[504] Jérémy Berthomieu, Grégoire Lecerf, and Guillaume Quintin. Polynomial root finding
over local rings and application to error correcting codes. Preprint, http://hal.inria.
fr/hal-00642075.
[505] Alain Couvreur, Philippe Gaborit, Valérie Gautier, Ayoub Otmani, and Jean-Pierre
Tillich. Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon
Codes. In Workshop on Coding and Cryptography 2013, Bergen, Norvège, April 2013.
[506] Nicolas Delfosse. Tradeoffs for reliable quantum information storage in surface codes
and color codes. Preprint, 2013, http://hal.inria.fr/hal-00798030.
[507] Andreas Enge and François Morain. Generalised Weber Functions. I. Preprint, 2009,
http://hal.inria.fr/inria-00385608.
[508] Johan Sebastian Rosenkilde Nielsen and Alexander Zeh. Multi-Trial Guruswami–Sudan
Decoding for Generalised Reed–Solomon Codes. In International Workshop on Coding and
Cryptography (WCC), Bergen, Norvège, April 2013.
[509] Julia Pieltant and Hugues Randriam. New uniform and asymptotic upper bounds on
the tensor rank of multiplication in extensions of finite fields. Preprint, 2013, http:
[510] Guillaume Quintin, Morgan Barbier, and Christophe Chabot. On Generalized ReedSolomon Codes Over Commutative and Noncommutative Rings. Preprint, 2012, http:
238
BIBLIOGRAPHY
VI.7 Annexes : Cryptographie
VI.7.1
Responsabilités administratives des membres de l’équipe incluant responsabilité de recherche et
d’enseignement
• F. Morain
– represents INRIA at Conseil d’UFR 929 Maths of Paris 6 (période 2005-2008).
– is vice-head of the Département d’informatique of Ecole Polytechnique (période 2009).
– represents École polytechnique in the Commission des Études du Master MPRI (période
2004-2008).
– is vice-head of the Département d’informatique of Ecole Polytechnique (période 2013).
– is a member of the commission de recrutement en informatique of Ecole Polytechnique
(période 2011-).
– is an elected member to the conseil de laboratoire du LIX (période 2011-).
• Andreas Enge was in charge of European affairs at INRIA Saclay–Île-de-France
(période -2010).
• D. Augot
– is charge of the followup of PhD students of INRIA Saclay–Île-de-France (période
2010-).
– is member of INRIA Saclay–Île-de-France’s commission scientifique, in charge of allocating a few PhD and postdoctoral grants (période 2010-).
– is member of INRIA Saclay–Île-de-France’s bureau du comité des projets, in charge of
discussing the creation and ending of INRIA project-teams (période 2010-).
– is part of Digiteo comité de programme in charge of evaluating Digiteo Ph.D. and PostDoctoral grant applications (période 2011-).
– represents INRIA in the commission formation of Digicosme (période 2012-).
• F. Levy-dit-Vehel
– is in charge of the teaching module Sécurité des systèmes d’information for third year
students. (période 2000-).
– is the correspondent of Master MPRI at ENSTA ParisTech. (période 2007-).
• B. Smith
– is an elected member of the Comité de Centre of INRIA Saclay–Île-de-France (période
2012-).
– is an elected member of the Conseil du Laboratoire of LIX. (période 2012-).
– is the coordinator for the LIX-Qualcomm postdoctoral fellowship. (période 2011-).
– is the responsable de bureaux at LIX. (période 2013-).
239
240
VI.7.1.1
CHAPTER VI.7. ANNEXES : CRYPTOGRAPHIE
Project PACE (2007-2011) (Type: Industrial ANR project) Titre: Pairings and advances in
cryptology for e-cash https:// pace.rd.francetelecom.com/ .
Partenaires: France Télécom
R&D, Gemalto, NXP Semiconductors, Cryptolog International, École normale supérieure Paris
and Université Caen. Responsable: Andreas Enge. Montant de la collaboration pour le LIX:
180 624 euros (sur un total de 1 365 333 euros).
This industrial ANR project dealt with pairings, which are bilinear operations on groups built
from elliptic curves. These operations allow a whole new range of cryptosystems, and a regular
conference was established, “Pairings”. The aim of this ANR was to study how pairings could
help building difficult cryptographic protocols like e-cash, promoted by France Télécom in Caen.
Project CADO (2006-2009) (Type: Projet ANR) Titre: Crible Algébrique : Distribution, Optimisationcado.gforge.inria.fr.
Partenaires: LORIA. Responsable: F. Morain. Montant de la
collaboration pour le LIX: 96 072 euros (sur un total de 228 700 euros).
The aim of this project was to build competitive software, along with algorithmic and theoretical improvements for factorisation of numbers, specially RSA-like product of two primes. This
ANR provided CADO-NFS, a complete implementation in C/C++ of the Number Field Sieve
(NFS) algorithm for factoring integers, distributed under LGPL version 2.1.
Project DIFMAT (2012-2013) (Type: X/DGA) Titre: Diffusion matrices. Partenaires: None.
Responsable: D. Augot. Montant de la collaboration pour le LIX: 86 000 euros.
The project designed so-called diffusion matrices used in block ciphers and hash functions. In
a standard way, the matrices correspond to MDS codes, and this two-year project first found new
such matrices in its first year, while the second year was devoted to finding suboptimal matrices
built from algebraic geometry codes.
Project CATREL (2013-2015) (Type: ANR project) Titre: Cribles: Améliorations Théoriques et
Résolution Effective du Logarithme Discret. — Sieve Algorithms: Theoretical Advances, and Effective
Resolution of the Discrete Logarithm Problem, catrel.loria.fr. Partenaires: LORIA (Nancy),
LIRMM (Montpellier). Responsable: F. Morain. Montant de la collaboration pour le LIX:
149 000 received by LIX, 673 202 for all participants.
This ANR gathers together partners sharing their expertise on software for factorization
(mostly from previous ANR CADO) to work in the field of discrete logarithm cryptosystems,
with the same aim of delivering software.
Project ToCQ (2013-2014) (Type: CNRS PEPS, projet exploratoire premier soutien) Titre:
Topolgie algébrique et Codes Quantiques — Algebraic topology and Quantum Codes.
Partenaires:
INRIA Rocquencourt, IMB (Bordeaux), LATP (Marseille). Responsable: G. Zémor. Montant de
la collaboration pour le LIX: no funding for the LIX, the total amount is 7 000 euros, managed by
IMB, for meetings.
This exploratory project aims at investigating further connections between, algebra, topology
and quantum coding theory. It is motivated by several constructions of Quantum LDPC codes
from topology such as the famous toric code due to Kitaev.
VI.7.1.2
CryptoNet (2008-2008) (Type: Digiteo offre de maturation technologique) Titre: Cryto mecanisms for Ad Hoc networks.
Partenaires: None. Responsable: D. Augot. Montant de la
collaboration pour le LIX: 53 582 euros.
This project, with the HiperCom team, looked at solutions for improving security in the OLSR
(Optimized Link State Routing) protocol in adhoc networks. We provided an implementation in
Java with short signature built with pairings.
VI.7.2. ADMINISTRATION DE LA RECHERCHE
241
Amiga (2010-2011) (Type: Digiteo/DGA Postdoc) Titre: Advanced Methods for Isogeny Graph
Analysis. Postdoc, Sorina Ionica.
Partenaires: None. Responsable: B. Smith. Montant de la
Isogenies are essentially morphisms between elliptic curves, occuring in many contexts in
computational number theory and cryptography.
VI.7.1.3
Contrats bilatéraux
Project LDC (2013-) (Type: Alcatel-Lucent) Titre: Locally decodable codes for privacy in distributed storage. Partenaires: INRIA. Responsable: F. Levy-dit-Vehel. Montant de la collaboration pour le LIX: 122 000 euros (Ph.D. grant, Irene Giacomelli, Pisa University, to be confirmed)
.
This starting project, built under INRIA–Alcatel-Lucent joint agreement, aims at studying
so-called locally decodable codes with application to a multi-cloud setting. These codes will
provide less data transfert for retrieving small blocks of information, and privacy, by blinding
cloud servers about the data they store and the requests they are asked for.
VI.7.2
VI.7.2.1
• Designs, Codes and Cryptography (Springer) A. Enge (2004-). Voir http://link.springer.
com/journal/10623.
• RAIRO - Theoretical Informatics and Applications (Cambrige University Press) D. Augot (2012-). Voir http://www.rairo-ita.org/.
• Journal of Symbolic Computation (Springer) Special issue: Gröbner Bases in Cryptography,
Coding Theory, and Algebraic Combinatorics D. Augot, with J.C. Faugère and L. Perret
2009http://www.sciencedirect.com/science/journal/07477171/44
• Designs, Codes and Cryptography (Springer) Special Issue on Coding and Cryptography
D. Augot, with A. Canteaut, G. Kyureghyan, F. Solov’eva, Ø. Ytrehus
2013http://dx.doi.org/10.1007/s10623-012-9731-1
VI.7.2.2
• ANTS (Ninth Algorithmic Number Theory Symposium) (2010). F. Morain, co-chair with
G. Hanrot.
• WCC (International Workshop on Coding and Cryptography) (2011). D. Augot, co-chair
with A. Canteaut.
• Pairing (Conference on Pairing-Based Cryptography) (2008). A. Enge.
• JNCF (Journées Nationales de Calcul Formel, advisory board) (2008). A. Enge.
242
• WAIFI (International Workshop on the Arithmetic of Finite Fields) (2008,2010). D. Augot.
• WCC (International Workshop on Coding and Cryptography) (2009,2011,2013). D. Augot.
• PQ Crypto (Post-Quantum Cryptography) (2010). D. Augot.
• YACC (Yet Another Conference in Cryptography) (2012). D. Augot.
• IMA-CC (IMA International Conference on Cryptography and Coding) (2013). B. Smith.
VI.7.2.3
The team organized the C4 (Computations on Curves for Crypto and Coding) workshop, held on
the 9th and 10th of June 2008 at the École polytechnique, bringing together leading researchers
from France, the United States, Canada, Denmark, and the Netherlands.
• CADO Workshop (CADO Workshop on Integer Factorization) (2008). The team has contributed to the organisation of the 2008 CADO Workshop on Integer Factorization, held
jointly with the CACAO project team in Nancy.
• CCA (Codage, Cryptographie et algorithmes French seminar) (2010-). D. Augot.
• ANTS-X (10th International Algorithmic Number Theory Symposium) (2010). B. Smith
organised the poster session at the ANTS-X conference in Nancy. .
• ECC 2011 (Elliptic Curve Cryptography 2011) (2011).
session for the 2011 ECC conference in Nancy. .
VI.7.2.4
B. Smith organised the rump
• Swiss National Science Foundation (2011) D. Augot. Grant evaluation.
Au niveau national
• CNRS PEPS – Projets Exploratoires PluridisciplinaireS (2011) D. Augot. Grant evaluation.
• Université Pierre et Marie Curie (D. Augot) 2010
• Université du Sud Toulon-Var (D. Augot) 2011, 2012
• Université Paris 8, Vincennes–Saint-Denis (D. Augot) 2011
• Université de Versailles–Saint-Quentin (D. Augot) 2013
VI.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION
243
VI.7.3
VI.7.3.1
• Jean-François Biasse (September 20, 2010). Subexponential algorithms for number fields.
Encadrant: Andres Enge.
• Luca de Feo (December 13, 2010). Algorithmes Rapides pour les Tours de Corps Finis et
les Isogénies. Encadrant: François Morain.
• Morgan Barbier (December 2, 2011). List decoding and application to information security. Encadrant: D. Augot (with Caroline Fontaine).
• Guillaume Quintin (November 22, 2012). On the Algorithms of Guruswami-Sudan List
Decoding over Finite Rings. Encadrant: D. Augot (with Grégoire Lecerf).
VI.7.3.2
• Ayoub Otmani (December 6, 2011). Contribution à la cryptanalyse de primitives cryptographiques fondées sur la théorie des codes. Rapporteur: D. Augot.
Rapports de thèse
• Eleonara Guerini (April 27, 2009). Systematic codes and polynomial ideals. Université of
Trento, Italy. Rapporteur: D. Augot.
• Thomas Roche (January 29, 2010). Dimensionnement et intégration d’un chiffre symétrique
dans le contexte d’un système d’information distribué de grande taille. Grenoble. Rapporteur: D. Augot.
• Cyril Bazin (January 19th, 2010). Tatouage de données géographiques et généralisation
aux données devant préserver des contraintes. Caen. Rapporteur: D. Augot, supervising
Caroline Fontaine’s review.
• Alexander Soro (December 3rd, 2010). Mécanismes de fiabilisation pro-actifs. Toulouse.
Rapporteur: D. Augot.
• Amine Bouabdallah (December 3rd, 2010). Contributions à la fiabilisation du transport
video. Toulouse. Rapporteur: D. Augot.
• Kristian Brander (March 10, 2010). Interpolation and List Decoding of Algebraic Codes.
DTU Lyngby, Denmark. Rapporteur: D. Augot.
• Aurore Bernard (September 15, 2011). Formes quadratiques binaires et applications cryptographiques. Université de Limoges. Rapporteur: D. Augot.
• Romain Cosset (November 7, 2011). Applications des fonctions thêta à la cryptographie
sur courbes hyperelliptiques. Université H. Poincaré. Rapporteur: F. Morain.
• Shi Bai (November 2011). Polynomial selection for the number field sieve.
National University. Rapporteur: F. Morain.
Australian
• Rafaël Fourquet (December 9th, 2011). Décodage par liste des codes de Reed et Muller et
applications à la cryptanalyse. Université Paris 8. Rapporteur: F. Levy-dit-Vehel.
244
• Vincent Herbert (December 5th, 2011). Des codes correcteurs pour sécuriser l’information
numérique. Université Paris 6. Rapporteur: F. Levy-dit-Vehel.
• Casper Thomsen (September 9th, 2011). Random linear network coding, zeros of multivariate polynomials and affine variety codes. Aalborg university. Rapporteur: D. Augot.
Jurys de thèse
• Damien Robert (July 21st, 2010). Fonctions thêta et applications à la cryptographie. Président:
F. Morain.
• Stéphane Jacob (March 8th, 2012). Protection cryptographique des bases de données :
conception et cryptanalyse. Président: F. Morain.
• Shaoshi Chen (February 16th, 2011). Some Applications of Differential-Difference Algebra
to Creative Telescoping. Membre: F. Morain.
• Marc Mezzarobba (October 27th, 2011). Autour de l’évaluation numérique des fonctions
D-finies. Membre: F. Morain.
• Romain Cosset (November 7th, 2011). Applications des fonctions thêta à la cryptographie
sur courbes hyperelliptiques. Membre: F. Morain.
• Sorina Ionica (May 14th, 2010). Algorithmique des couplages et cryptographie. Membre:
B. Smith.
• Jean-Pierre Flori (February 3rd, 2012). Fonctions booléennes, courbes algébriques, et multiplication complexe. Membre: B. Smith.
VI.7.3.3
• Licence : F. Morain, 10 lectures of 1.5h, 1st year course “Introduction à l’informatique”
(INF311) at École polytechnique (L2). Responsability of this module (350 students).
• License (L2) : B. Smith, tutorials for “Introduction à l’informatique” (INF311) at École
polytechnique. 36h in 2012, 36h in 2013.
• License (L2) : B. Smith, tutorials for “Les principes des langages de programmation” (INF321).
36h in 2011.
• License (L3) : B. Smith, tutorials for “Les bases de la programmation et de l’algorithmique”
(INF421a). 36h in 2010.
• Master (M1) : F. Morain, 9 lectures of 1.5h, 3rd year course “cryptology” at École polytechnique.
• Master (M1) : B. Smith, tutorials for “Cryptology” (INF568). 18h in 2012, 18h in 2013.
ENSTA
• ENSTA ParisTech: “Mathématiques discrètes pour la protection de l’information”, course
for 2nd year students. F Levy-dit-Vehel, 21 hours, 2001-.
• ENSTA ParisTech: “Cryptographie”, course for 3rd year students. F Levy-dit-Vehel, 21
hours, 2000-.
• ENSTA ParisTech: “Introduction à la cryptographie”, course in specialized master “architecture des systèmes d’information”. F Levy-dit-Vehel, 7 hours, 2009-.
VI.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION
245
• MPRI (Master Parisien de recherche en informatique),U. Paris Diderot, ENS Ulm, ENS
Cachan, É. Polytechnique, U. Paris Sud, U. P. et M. Curie, France
– “Codes correcteurs d’erreurs et applications à la cryptographie”. D. Augot, 24 hours,
M2, 2008-.
– “Arithmetic algorithms for cryptology”. F. Morain, 9 hours, M2.
– “Arithmetic algorithms for cryptology”. B. Smith, 9 hours, M2.
Jury
• Agrégation de Mathématiques option D (informatique). A. Couvreur, 2013-.
• B. Smith gave two lectures on advanced topics in elliptic curves at the DIAMANT Summer
School on Elliptic and Hyperelliptic Curve Cryptography in September 2008 in Eindhoven.
• B. Smith has given a lecture on pairings on elliptic curves at the 3rd E CRYPT PhD Summer
School on Advanced Topics in Cryptography in May 2008 on Crete.
• B. Smith gave three lectures on advanced topics in elliptic curves at the ECRYPT II Winter
School on Mathematical Foundations in Cryptography in February 2009 in Lausanne.
• A. Enge has taken part in the school “Référentiels de la cryptographie moderne” organised
from October 28 to 31, 2009, in Rabat by the Association Marocaine de Cryptographie with
a lecture series on pairings entitled “Couplages sur les courbes elliptiques — Fondements
mathématiques et calcul”.
• D. Augot gave a three hours lecture on “the decoding of algebraic-geometric codes and the
Guruswami-Sudan algorithms” at the 2010 “Journées nationales du calcul formel”.
• B. Smith gave two lectures in the summer school linked to ECC2011.
• B. Smith gave two lectures at the CryptoBG 2012 (Cryptography and Cyber-Defence) summer school.
• F. Morain gave three lectures in the summer school Number theory for cryptography in Warwick University, june 2013.
Vulgarisation
• 2010
– F. Morain was invited to the Festival PariScience to participate in a debate following a
movie on the Riemann Hypothesis.
– D. Augot gave a popular science seminar on Coding Cryptography and Steganography
to Versailles High School Math Teachers.
– D. Augot gave a popular science seminar on Coding Cryptography and Steganography
to Polytechnique’s students.
• 2011
– D. Augot made a presentation “Quand 1+1=0” to High School students at Savignysur-Orge.
– D. Augot participated in a S[cube] meeting at Gif-sur-Yvette, about mathematicians.
246
– D. Augot was interviewed for a video about Évariste Galois.
– D. Augot, M. Barbier, C. Gonçalves, S. Ionica, and B. Smith took part in the “Nuit des
chercheurs” at the École polytechnique.
• 2012
– D. Augot made a presentation in high school at Courcouronnes “Quand 1 + 1 = 0”.
– D. Augot was interviewed by French novelist François Bon.
– F. Morain gave a talk on “Turing et la cryptanalyse”, during the special days for the
centenary of the birth of Turing, Nancy 2012/09/20.
– A. Couvreur presented the LIX and the research in Computer science to high-school
students in the context of the program “grandes écoles, pourquoi pas moi?”.
• 2013
– D. Augot made a presentation in high school at Courcouronnes “Quand 1 + 1 = 0”.
– A. Couvreur made a presentation at UniThé ou Café (INRIA Saclay) “Décryptage du
codage”.
VI.7.4
VI.7.4.1
Invitations
International Conferences
• Finite Fields and Applications (2008). A. Enge.
• ANTS8, Banff (2008). F. Morain.
• ECC (Elliptic Curve Cryptography) 2009, Calgary (2009). L. De Feo.
• ECC (Elliptic Curve Cryptography) 2010, Redmond (2010). F. Morain.
• ECC (Elliptic Curve Cryptography) 2011, Nancy (2011). B. Smith.
• ECC (Elliptic Curve Cryptography) 2013, Leuven (2013). B. Smith.
International Workshops
• Third Franco-Japanese Computer Security Workshop, Nancy (2008). A. Enge.
• Joint Meetings of the American Mathematical Society and the Mathematical Association
of America, San Diego (2008). B. Smith.
• Canadian Mathematical Society Winter meeting, Ottawa (2009). L. De Feo.
• “Counting points: theory, algorithms, and practice” meeting at the CRM, Montréal (2010).
B. Smith.
• Elliptic Curve Discrete Logarithm workshop, Laboratory for Cryptologic Algorithms
(LACAL), EPFL, Lausanne (2011). B. Smith.
National workshops
• Rencontres Arithmétiques de l’Informatique Mathématique, Lyon. (2008). L. De Feo.
• 25 ans du DEA Limoges (2011). F. Morain.
• Journées C2, Codage et Cryptographie, Oléron (2011). F. Morain.
• Journées C2, Codage et Cryptographie, Dinard (2012). D. Augot.
VI.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ
247
Participation à des rencontres scientifiques sur invitation seulement
• Explicit Methods in Number Theory workshop, Oberwolfach (2009). B. Smith.
• AGCT 12, Luminy (2009). D. Augot, B. Smith.
• Computational Aspects of Elliptic and Hyperelliptic Curves mini-workshop, Katholieke
Universiteit Leuven (2009). B. Smith.
• AGCT 13, Luminy (2011). D. Augot, B. Smith.
• Coding Theory, Schloss Dagstuhl (2011). D. Augot, F. Levy-dit-Vehel.
• Trends in Coding Theory, Monte Verita (2012). D. Augot, F. Levy-dit-Vehel.
• AGCT 14, Luminy (2013). D. Augot, B. Smith, A. Couvreur, C. Goncalves, J. Pieltant,
G. Quintin.
Séjours invités
• Combinatorial, Algebraic and Algorithmic Aspects of Coding Theory Semester, EPFL
(2011). D. Augot, two weeks.
VI.7.4.2
1. B. Smith won the Best Paper award at EUROCRYPT 2008 for his work on discrete logarithms in genus 3.
2. A. Enge won the Selfridge Prize of the Number Theory Foundation for the best paper presented at ANTS-VIII, 2008.
3. L. De Feo received the SIGSAM Distinguished Student Paper Award at ISSAC’09.
4. B. Smith won the Best Paper award at Asiacrypt 2011 for his work on counting points on
genus 2 curves with real multiplication.
CRYPTOCryptographie
248
VII Équipe High-Performance Communications
(Hipercom)
249
VII.1 Liste des membres : High-Performance
Communications
VII.1.1
VII.1.1.1
Membres permanents
Nom
Thomas Heide Clausen
Sylvie Tonda-Goldstein
Valerie Lecomte
Fonction
Maitre de conference
Chargée d’Affaire à la DRIP
Administrative assistant
Employeur
DRIP, École Polytechnique
INRIA
HDR
Arrivée
2004
2004
2008
Note: La DRIP est la Direction des Relations Industrielles et Partenariales de l’École polytechnique.
VII.1.1.2
Postdoctorants
Nom
Jiazi Yi
Financement
Carnot
Dates
2012-2013
Responsable
T. Clausen
VII.1.2
Anciens membres
VII.1.2.1
Membres permanents
Nom
Aline Carneiro Viana
Emmanuel Baccelli
Fonction
CR
CR
Employeur
INRIA
INRIA
HDR
HDR
Départ
March 2012
March 2012
Philippe Jacquet
DR
INRIA
HDR
2011
VII.1.2.2
Position actuelle
INRIA
INRIA, mission longue duree
a Berlin FU
Alcatel-Lucent Bell Labs
Doctorants
Nom
Ulrich Herberg
Financement
EDx
Départ
2011
Juan Antonio Cordero Fuertes
EDx
2011
Marie Nestor Mariyasagayam
CIFRE
2011
Song-Yean Cho
INRIA
2008
Encadrant
T. Clausen &
P. Jacquet
E. Baccelli &
P. Jacquet
T. Clausen &
P. Jacquet
P. Jacquet
Position actuelle
Fujitsu Laboratories of
America
Université catholique de
Louvain, ICTEAM, Brussels
Hitachi France
Samsung, Korea
Postdoctorants
Nom
Jiazi Yi
Jiazi Yi
Georg Wittenberg
Financement
ERDF
Qualcomm
INRIA
Dates
2011-2012
2010-2011
2010-2010
251
Responsable
T. Clausen
T. Clausen
E. Baccelli
Position actuelle
Still at LIX, different financing
Still at LIX, different financing
The Boston Consulting Group, Germany
252
CHAPTER VII.1. LISTE DES MEMBRES : HIGH-PERFORMANCE COMMUNICATIONS
VII.1.2.3
Autres membres
Stagiaires Master 2
Nom
Ulrich Herberg
Juan Antonio Cordero Fuertes
Financement
Bourse TUM
Bourse X
Dates
2006-2007
2006-2007
Responsable
T. Clausen
T. Clausen
Veronika Maria Bauer
Bourse TUM
2010
Alberto Camacho Martinez
Erasmus
2011-2012
T. Clausen &
E. Baccelli
T. Clausen
Position actuelle
Fujitsu Laboratories of America
Université catholique de Louvain, ICTEAM, Brussels
PhD student, TUM
Universitat Pompeu Fabra
Nom
Rodney Van Meter
Financement
Ecole Polytechnique
Dates
March 2011-April 2011
Invitant
T. Clausen
VII.2 Rapport scientifique : HighPerformance Communications
VII.2.1
VII.2.1.1
Introduction
The team aims to design, evaluate and optimise the telecommunication algorithms. The team
is working on protocols, new telecommunication standards and quality of service management
in networks, centred around the new networks and services supporting internet. Although interested the whole spectrum of telecommunication domain, practically the team is specialised in
local area networking, local loops, in particular mobile ad hoc networking. However the thematic
extends to the information theory and modelling of internet graph and traffics.
VII.2.1.2
Thème 1
: Wireless MESH Networks, convergence of wireless, mobile and wired networks
Thème 2
: Sensor Networking, Smart Objects and the Internet of Things
Thème 3
: Service-Driven Networks
VII.2.1.3
New Services for MESH and Tactical Networks. MESH networks are unplanned, spontaneous,
dynamic and self-organising networks, typically using wireless network interfaces, wherein each
device acts both as an ”end-point for communication” as well as a relay for traffic generated by
others – also, often, denoted ”mobile ad hoc networks” (MANETs), and (less often) ”wireless ad
hoc networks”). The challenges presented by this form of networks are threefold: (i) the unplanned, spontaneous nature of this type of networks requires routing protocols able to adopt to
deploy on any connectivity scenario, and that without user configuration, (ii) the nature of wireless links, as well as physical mobility of the devices partaking in the network, requires routing
protocols able to rapidly detect, and react to, changes in the network topology, (iii) this, while
being frugal with information exchange required as part of the protocol operation due to limited
capacity on the physical ”links” in the network. Additionally, while ”classic” routing protocols,
such as OSPF, can make restrictive assumptions as to the ”links” in the network having certain
properties (e.g., that a message sent on a link will be received by all interfaces participating in the
link, or that all links are bidirectional), such properties are not guaranteed, and most commonly
not present, across a ”wireless ad hoc link”, thus adding complexities in algorithm and protocol
designs.
The team is, historically, at the origin of routing protocols for MESH networking, by way
of having developed the routing protocol ”OLSR” (http://datatracker.ietf.org/doc/rfc3626/ –
standardised in 2003) – the predominant routing protocol for MESH, community and tactical
networks. During the period evaluated, the team has maintained its leadership position in that
area by continuing the development of OLSRv2 [543], [607] – the designated successor to OLSR.
OLSRv2 introduces, in addition to ”engineering improvements”, in particular for IPv6 support,
enhanced security mechanisms (these, in part, co-developed with the GRACE, formerly TANC,
team at LIX as part of a DIGITEO OMTE) [536], [549], [535], [571], and a flexible, innovative
framework for quality-of-service routing [608].
Given that the basic routing problem in MESH networks is, now, considered as having been
”solved” by the team, our interests have in the recent years shifted to providing new ”services”
and increased ”performance” in these networks. Thus, for example, [547] studies how to adapt
an OLSRv2-routed network to support delay/disconnection and thus to be a component for Delay/Disruption Tolerant Networking (DTN), or how to apply optimisations to path-calculation
253
254CHAPTER VII.2. RAPPORT SCIENTIFIQUE : HIGH-PERFORMANCE COMMUNICATIONS
Figure VII.2.1: Known implementations and deployments of OLSR/OLSRv2, world-wide.
within OLSRv2 routers [544]. The arrival of Jiazi Yi to the team has brought important activities on supporting capacity-intensive multimedia applications (such as video streaming) to the
team, e.g., by way of discovering and exploiting path-diversity and multi-path routes through an
OLSRv2 network [560] and [553]
Based on the experiences from classic MESH networking, the team has been contributing
significantly to adapting the Internet routing protocol OSPF for better support of highly dynamic
topologies [525], [540], [542].
The majority of these activities have, upon reaching maturity, been carried – by the team
members – through to international standardisation and industrial and community acceptance
as reflecting the de-facto best common practice for routing in MESH and MANETs [607]1 , [568],
[570], [565], [567], [566], [569], and [571].
It is worth noting that several deployments of such MESH networks, using the protocols
(OLSR, OLSRv2) developed by the team, exist. In the civilian world this includes community
networks such as Funkreuer in Vienna – http://www.funkfeuer.at – as well as similar networks
in Berlin, Seattle, etc. Additionally, the US Naval Research Lab, BAE Systems, and others, have
adopted and are deploying the protocols developed by the team as part of their ”tactical networking / network-centric warfare” initiatives. In total, 51 independent implementations of OLSR or
OLSRv2 are known, see figure VII.2.1.
Routing protocols for self-organising constrained networks. Routing in dynamic and large
networks is an extremely well understood and mastered subject (cf. the Internet), this is made
possible principally by way of two advances: large dedicated devices (routers) with memory
and processing power to run algorithms over large data structures (graphs), and high-capacity
interconnects (e.g., fibre optics) for enabling routers to maintain their data structures consistent. However, a new class of communicating devices are emerging, a non-exclusive list includes:
light-switches and light fixtures (domotics), actuators and sensors (factory automation), temperature, pressure, chemical detectors (environmental monitors), automating utility consumption
management such as electricity, gas, water (smart metering – also called ”automated metering
1 OLSRv2 - ratified for publication as international standard, but awaiting final administrative and editorial tasks to
complete.
VII.2.1. THÉMATIQUE GÉNÉRALE ET PRINCIPAUX OBJECTIFS
255
infrastructure”), as well as management and matching of energy production and distribution to
the consumption on the electric grid (smart grid – also called ”connected energy”). Collectively
and colloquially, these are denoted the ”Internet of Things” (IoT) or the ”Internet of Objects” –
occasionally, terms such as ”low-power and lossy networks” (LLN) are employed, for when emphasising the nature of the challenges that must be addressed: contrary to routers in the Internet,
these devices have communication as an ancillary function to their primary raison d’être, and the
desire is for this communications ability to impose neither increased manufacturing costs (i.e.,
to minimise the number of additional electrical components required), installation complications (i.e., rely on existing infrastructure, if present, or wireless communication otherwise, and
require no ”telecom competencies” for installation), energy consumption, and with no special
maintenance throughout the lifecycle of the device.
To give but one example motivating this, if deploying an estimated 35 million ”smart meters”
for EDF (the dominant electric utility) in France, the potential environmental and economical
benefit from ”fine-grained management of the electricity consumption” would quickly be nullified if each ”smart meter” consumed 1W and incurred a marginal cost of as little as 1 Eur,
and if installation required also establishing a telecommunications infrastructure parallel to the
electricity grid.
Thus the challenge: develop algorithms and protocols permitting a network of ”35 million
devices” to communicate, whilst being constrained in both the device capacity and their interconnect, and necessitating neither additional installation nor management considerations –
self-organising constrained networks.
The team has a long history of developing protocols for constrained networks, as discussed
in the above. While for MESH networks, the underlying assumptions was ”links are wireless
and constrained, the topology is dynamic, but devices are powerful, constrained self-organising
constrained networks are a logical continuation of this research topic. Given the applicability
space outlined in the above, and the potential ”market”, it is also a highly competitive domain
with significant interests from both research and industry.
A significant result for the team has been to be able to, based on its experience of wireless
and constrained networks (e.g., [524], [532]), significantly impact routing protocol protocol
development for self-organising constrained networks, as they are used by various branches of
industry, as outlined in the below.
Within the IETF2 , a set of algorithms and a resulting protocol, named RPL3 were developed
and pushed – principally by industry giants – towards standardisation. The team at LIX was
(to the best of the team’s knowledge) the first to implement and rigorously test and analyse, in
realistic conditions, the proposed protocol [537], [546], [538], [532] – thereby identifying that the
protocol, as proposed, was insufficient.
This resulted in two parallel developments within the team: [529], which ”improved” on
RPL – and was adopted and standardised within the IETF4 and an alternative protocol denoted
LOADng [539]. The latter was shown [519] to offer considerable improvements for ”Smart Grid”
and ”Automatic Metering Infrastructure” deployment, both in terms of performance and complexity (and so, requiring fewer computational, storage and energy resources) – and was therefore subsequently adopted by the G3 alliance including major utilities and equipment manufacturers5 and ratified by and standardised within the International Telecommunications Union
[572]. Driven by the experiences from deployments and tests in close collaborations with ERDF
(see ”Responsabilités de projets nationaux”), LOADng has been, and remains, a subject of interest
and further developments, e.g., [558], [531], [557].
Implementing and scientifically rigorously analysing and testing the ”industry standard”
protocol allowed us to identify flaws, inconveniences and areas of improvement. The theoret2 Internet Engineering Task Force – http://www.ietf.org/
3 ”RFC 6550: RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks” Tim Winter, Pascal Thubert, Anders
Brandt, Jonathan Hui, Richard Kelsey, Philip Levis, Kris Pister, Rene Struik, JP Vasseur, and Roger Alexander
4 ”RFC6997 - Reactive Discovery of Point-to-Point Routes in Low-Power and Lossy Networks”, M. Goyal, E. Baccelli,
M. Philipp, A. Brandt, J. Martoccini, August 2013.
5 http://www.g3-plc.com
ical background allowed the team to both understand how to improve the standard and propose
an amendment (cf. RFC6997), as well as propose an alternative [539]. The close collaborations
with industrial partners ensured credibility for that proposal, offered experimental validation,
and saw it through to industry-wide adoption and standardisation [572]. As a side-note, this has
also been instrumental in both ensuring continued research financing, both during the period
evaluated, and in the years to come.
The team strongly believes that the three-pronged approach of ”theory”–”experimentation–
”standardisation” has been, and continues to be, important – despite the fact that the two latter
takes considerable resources (both, in manpower and in finances). This, both in identifying
interesting problems, attracting research funding, and having a direct positive impact on
society. It is therefore a priority to maintain competencies in all three areas.
VII.2.1.4
Scientific Production
The team members have, during the period evaluated, been publishing in excess of 45 academic
publications, accepted in peer-reviewed conferences and journals, and has furthermore been
active in numerous program committees, including several major conferences within our field
such as IEEE SECON, IEEE ICC, and IEEE WOCN, as well as participated in conference organisation in various chair-level roles in notable conferences including ACM MOBIHOC and IEEE
SECON.
Technology Transfer and Industrial Relations
One of the particularities of the team is the involvement in international protocol standardisation, and the has during the period evaluated contributed significantly to the IETF – resulting in
8 international IETF standards having been ratified, authored by the team members, within
the area of mobile ad-hoc networks (MANETs), OSPF and sensor/low-power networking. Participation in international standardisation is a key activity: it provides for ”technology transfer”, it
offers the researchers in the team a window to real-world problems that can contribute to guiding
future research – and, importantly, constructive and successful participation in standardisation
offers visibility vs. companies, and thus enables possible future collaborations
Financing
The visibility attained by the team through successful participation in and contribution to international standardisation has been the key vehicle for attracting and sustaining direct industrial
sponsorship from Toyota, Hitachi, Qualcomm and ERDF, over the 5 years direct industrial sponsorship exceeding 420KEur. This also has been key in being invited to participate in the SOGRID
(former: Chip2Grid) ADEME project (http://www.erdf-leblog.fr/tag/sogrid/) - participation in
which is going to represent a major axis of research for the team from 2013 and for the coming
years, and for which the financing to LIX amounts to in excess of 430KEur.
Political and societal impact
Finally, the research team has been asked to advice the French legislature on two occasions: in
2009 within the context of development of the law HADOPI - ”favorisant la diffusion et la protection de la creation sur internet” (http://www.assemblee-nationale.fr/13/rap-info/i3560.asp)
and in 2010 as part of the ”Mission d’information sur les droits de l’individu dans la révolution
numérique” (http://www.assemblee-nationale.fr/13/commissions/revol-num/, 2010)
VII.2.1. THÉMATIQUE GÉNÉRALE ET PRINCIPAUX OBJECTIFS
257
Teaching and Training
A member of the team coordinates the computer networking curriculum at Ecole Polytechnique,
and has invested considerable time in constructing a M2 in ”Advanced Computer Networking”,
jointly with Telecom ParisTech. This M2 is on the verge of final approval, with an estimated start
date in 2014. Additionally, several team members teach major courses in computer networking
at Ecole Polytechnique, as well as in the MPRI.
Additionally, as part of the national initiative to strengthen the computer science curriculum in high-schools team members have participated in authoring training material for qualifying high-school teachers to teach computer science, notably the computer networking chapter
in the textbook ”Introduction à la science informatique” (http://crdp.ac-paris.fr/Introduction-ala-science,27388).
VII.2.1.5
Hipercom@LIX was, from 2008 and until March 2012 an ”equipe-projet commun” with INRIA,
as an umbrella including an anchor at INRIA-Saclay, an anchor at LIX and an anchor at INRIARocquencourt. In March 2012, Hipercom@LIX split up - by mutual agreement - for a number
of reasons: (i) the departure of mr. Jacquet to industry and a planned long-term mission abroad
(2 years) of mr. Baccelli, leaving (ii) only a single INRIA researcher physically at LIX and with
the bulk of the INRIA researchers physically at Rocquencourt, and with (iii) the INRIA Project
”Hipercom” nearing its (planned) end and needed to be reformulated as a new project within
INRIA, and (iv) diverging scientific interests after having collaborated intimately for almost 10
years, this was a natural and opportune point in time to part ways and define distinct scientific
projects. This being an ”amicable divorce”, some axis of research continue to attract joint interest,
and publications within these are ongoing and naturally expected to continue in the future.
VII.2.1.6
Toutes les thèses sont financées : EDx (1), CIFRE (1), INRIA (2).
en
ac
e
M
s
M
P em
pl olyt be
i
to ci e rs
• fo pi tly chn o
• Co r t c is - s iqu f Di
S m he n ta e re
• it ev pe in ot te ha cti
• Ad y to ere titi sti a s d th ve on
L m h la ve tu tr a a of
• ap ack ini ire ck re tion ate t th lrea Ec
In pl of str pe of se . gic e dy ole
in cr ied ” at r p ar
pr rese - e
su g f eas re bas ive ma ers ch
io a xrit rc
bm un in se ic ov ne on top
y h
itt din g ti arc fun erh nt s nel ic.
in g, m h. d e ta g c e
in ad ff in
g” . . ab
pr on sp
op st en
ilfo
os ru t
r
no
al ct on
s” ing ”
n
c
.
an ha
d s-
A F
O M
NEGATIF
s
té
ni
tu
or
pp
O
t
or
pp su Re tent es ar ly- al
te d P o tu
P
t
pe n e e ac
m tio es ol tr
n- in
co ec ll Ec on
y ir rie t /c
iro ted
el ”D st ) a al
nv es
g
em e du IP e
l e ter
tr th In DR n l
ua n .
Ex om ns ” ( o
tr y i ts
• fr tio ats que
us gl ul
la ri ni s. ind sin res
na ch ter al rea of
te at ion nc n
m t t i tio
Na en lica
m pp
a
•
•
At
ou
ts
es
ss
le
•
•
H
S igh
pa ign -pr
• T rt ifi o
• In eam ner can file
sh t re
S te
• tio tro rna com ips ind sea
Ab na ng tio pe . ust rc
ry h
p il l im na te
in top
wi roje ity sta pli l v nc
te ic
se ct to nd ca isi ie
s
re .
b
). s at ar tio il .
st
(in tr d n ity
,
du ac isa in .
st t la tio in
ria r n. te
rn
l a ge
and re
ot sea
he rc
r- h
•
ib
Fa
em
m .
k
y
am ris s ll
te at ha tria
le s ry us
em nt
ng tie o d
m ca nd
si ivi he in
fi
of ct / t t to . eam gni g a s
e la h
t si in ram
ur l c ea ch t
rt s a ar k-s ar en a ach og
pa ut ese ac ese an ing te pr
De r p c r b r rm nd e ng .
• be asi n a ble pe spe tim chi que
B ke ica ly o is a ni
• ta ppl on als of h g te ech
a he is n tin lyt
T r io a o
• be ct din e P
a
fr oor col
c tE
a
POSITIF
INTERNE
EXTERNE
Figure VII.2.2: Analyse AFOM de l’équipe High-Performance Communications : Atouts, Faiblesses, Opportunités, Menaces
VII.3 Fiche résumé : High-Performance
Communications
VII.3.1
Membres
2008 : 2 chercheurs (2 INRIA), 1 enseignants-chercheurs, 3 doctorants
2013 : 1 enseignants-chercheurs, 1 postdoc
Départ de membres de l’équipe Philippe Jacquet (Alcatel-Lucent), Emmanuel Baccelli (INRIA,
on long-term mission at FU Berlin), Aline Carneiro Viana(INRIA).
Nouveaux membres
forcements.
VII.3.2
Sadly, none, despite intense lobbying with X and LIX for recruiting rein-
Algorithms and protocols for self-organising constrained networks. The team has enriched,
developed, and advanced the state of the art of algorithms and protocols for self-organising constrained networks, giving rise to numerous academic publications on routing algorithms and
mechanisms, and adaptive algorithms for information propagation in highly constrained and
lossy networks. The activities undertaken by the team have had a significant industrial and societal impact, directly measurable by way of ratification of several in international standards,
authored or co-authored by the team members. These have been adopted as ”best common practice” by, for example (but not exclusively), utilities (gas, water, electricity), who include these
standards as the communications core in their ”smart metering” or ”smart grid” deployments.
New Services for MESH and Tactical Networks. The team is, historically, at the origin of routing protocols for MESH networking, by way of having developed the routing protocol ”OLSR”
– the predominant routing protocol for MESH, community and tactical networks. During the
period evaluated, the team has maintained its leadership position in that area by continuing the
development of OLSRv2 – the designated successor to OLSR, as well as extensions and adaptations to OSPF. These activities have given rise to a number of academic publications. OLSRv2
introduces, in addition to ”engineering improvements”, in particular IPv6 support, enhanced
security mechanisms (these, in part, co-developed with the GRACE, formerly TANC, team at
LIX as part of a DIGITEO OMTE), and a flexible, innovative framework for quality-of-service
routing. OLSRv2 has been ratified as an international standard by the IETF for publication1 .
Additionally, the team has been developing innovative algorithms for multi-path routing for
both versions of OLSR, permitting utilising the total communications capacity available through
a network, rather than ”just” the shortest-path channel. Finally, based on the experiences from
classic MESH networking, the team has been contributing significantly to adapting the Internet
routing protocol OSPF for better support of highly dynamic topologies. This extension to OSPF
has, also, given rise to a ratified international standard.
Standardization While indicated in the above paragraphs, the team has maintained a strong
position within international standardisation, both the ITU-T and the IETF, and has produced
9 ratified and published international standards during the period evaluated. Additionally, 6
international standards written by the team members have been ratified by the IETF, but had
not (at the end of the period evaluated) completed the final editorial pass before publication.
The team believes that being active within standardisation is an important part for computer
1 At the time of this writing, the protocol has been ratified, but is awaiting the final ”editorial pass” and publication
by the RFC Editor http://www.rfc-editor.org/
259
260
CHAPTER VII.3. FICHE RÉSUMÉ : HIGH-PERFORMANCE COMMUNICATIONS
networking research, for three reasons: (i) it provides a natural outlet for ”technology transfer”
and thereby making our research results relevant to industry and society, (ii) successful participation in standardisation organisations provides visibility and is an efficient way of attracting
industrial funding (& placing interns and graduating Master’s and PhD students), (iii) it also
provides insights into what ”real-world problems” are relevant unsolved, and therefore worthy
of expanding future research efforts.
VII.3.3
VII.3.3.1
Publications
Journaux : 10
International Standards: 9
• N. Karowski, A. Carneiro Viana, and A. Wolisz, “Optimized Asynchronous Multi-channel
Discovery of IEEE 802.15.4-based Wireless Personal Area Networks”. Accepted in 2011. To
appear in IEEE Transaction on Mobile Computing, 2013
• C. Sengul, A. C. Viana, and A. Ziviani. “A Survey of Adaptive Services to Cope with Dynamics
in Wireless Self-Organizing Networks”. ACM Computing Surveys, vol 44, Issue 4, August
2012
• A. C. Viana, S. Maag, F. Zaidi. “One step forward: Linking Wireless Self-Organising Networks
Validation Techniques with Formal Testing approaches”. ACM Computing Surveys.Vo. 43,
issue 2. June 2011
• J. A. Cordero, T. Clausen, and E. Baccelli. “Mpr+sp: Towards a unified mpr-based manet
extension for ospf”. Hawaii International Conference on System Sciences (HICSS), January
2011.
• T. Clausen, U. Herberg, and M. Philipp. “A critical evaluation of the ”ipv6 routing protocol for
low power and lossy networks” (rpl)”. Proceedings of the 5th IEEE International Conference
on Wireless & Mobile Computing, Networking & Communication (WiMob), October 2011.
• Jiazi Yi, Thomas Clausen, and Axel Colin de Verdiere. Efficient data acquisition in sensor networks: introducing (the) loadng collection tree protocol. IEEE WiCom 2012, The
8th IEEE International Conference on Wireless Communications, Networking and Mobile
Computing., September 2012.
VII.3.3.2
Rayonnement
Scientific Production
The team members have, during the period evaluated, been publishing in excess of 45 academic
publications, accepted in peer-reviewed conferences and journals, and has furthermore been
active in numerous program committees, including several major conferences within our field
such as IEEE SECON, IEEE ICC, and IEEE WOCN, as well as participated in conference organisation in various chair-level roles in notable conferences including ACM MOBIHOC and IEEE
SECON.
VII.3.3. PRODUCTION SCIENTIFIQUE
261
Technology Transfer and Industrial Relations
One of the particularities of the team is the involvement in international protocol standardisation, and the has during the period evaluated contributed significantly to the IETF – resulting in
8 international IETF standards having been ratified, authored by the team members, within
the area of mobile ad-hoc networks (MANETs), OSPF and sensor/low-power networking. Participation in international standardisation is a key activity: it provides for ”technology transfer”, it
offers the researchers in the team a window to real-world problems that can contribute to guiding
future research – and, importantly, constructive and successful participation in standardisation
offers visibility vs. companies, and thus enables possible future collaborations
Financing
The visibility attained by the team through successful participation in and contribution to international standardisation has been the key vehicle for attracting and sustaining direct industrial
sponsorship from Toyota, Hitachi, Qualcomm and ERDF, over the 5 years direct industrial sponsorship exceeding 420KEur. This also has been key in being invited to participate in the SOGRID
(former: Chip2Grid) ADEME project (http://www.erdf-leblog.fr/tag/sogrid/) - participation in
which is going to represent a major axis of research for the team from 2013 and for the coming
years, and for which the financing to LIX amounts to in excess of 430KEur.
Political and societal impact
Finally, the research team has been asked to advice the French legislature on two occasions: in
2009 within the context of development of the law HADOPI - ”favorisant la diffusion et la protection de la creation sur internet” (http://www.assemblee-nationale.fr/13/rap-info/i3560.asp)
and in 2010 as part of the ”Mission d’information sur les droits de l’individu dans la révolution
numérique” (http://www.assemblee-nationale.fr/13/commissions/revol-num/, 2010)
VII.3.3.3
A member of the team coordinates the computer networking curriculum at Ecole Polytechnique,
and has invested considerable time in constructing a M2 in ”Advanced Computer Networking”,
jointly with Telecom ParisTech. This M2 is on the verge of final approval, with an estimated start
date in 2014. Additionally, several team members teach major courses in computer networking
at Ecole Polytechnique, as well as in the MPRI.
Additionally, as part of the national initiative to strengthen the computer science curriculum in high-schools team members have participated in authoring training material for qualifying high-school teachers to teach computer science, notably the computer networking chapter
in the textbook ”Introduction à la science informatique” (http://crdp.ac-paris.fr/Introduction-ala-science,27388).
262
CHAPTER VII.3. FICHE RÉSUMÉ : HIGH-PERFORMANCE COMMUNICATIONS
VII.4 Production scientifique : HighPerformance Communications
VII.4.1
[511] E. Baccelli, P. Jacquet, and T. Clausen. Database exchanges for ad-hoc networks using
proactive link state protocols. In Performance Modelling and Analysis of Heterogeneous
Networks, Book edited by: D. Kouvatsos, chapter 5, pages pp. 93–111. River Publishers,
Denmark, 2009.
[512] T. Clausen and E. Baccelli. Introduction à la science informatique. In http://crdp.acparis.fr/Introduction-a-la-science,27388, chapter 7. CRDP de l’Académie de Paris, July
2011.
[513] J. A. Cordero Fuertes, E. Baccelli, P. Jacquet, and T. Clausen. Wired/wireless compound
networking. In ”Mobile Ad-Hoc Networks: Applications”, Book edited by: Xin Wang, ISBN:
978-953-307-416-0, chapter 16. InTech, January 2011.
VII.4.2
[514] C. Adjih, E. Baccelli, P. Minet, P. Muhlethaler, and T. Plesse. QoS support, security and
OSPF interconnection in a MANET using olsr. Telecommunications and Information Technology (JTIT), 2008 issue no. 2, pages 70–76, June 2008.
[515] C. Adjih, E. Baccelli, P. Minet, P. Muhlethaler, and T. Plesse. QoS support, security and
OSPF interconnection in a MANET using olsr. Journal of Telecommunications and Information Technology (JTIT), issue no. 2, pages 70–76, June 2008.
[516] E. Baccelli, J. A. Cordero Fuertes, and P. Jacquet. OSPF over multi-hop ad hoc wireless
communications. International Journal of Computer Networks & Communications, pages 37
– 56, September 2010.
[517] E. Baccelli, P. Jacquet, Bernard Mans, and Georgios Rodolakis. Highway vehicular delay tolerant networks: Information propagation speed properties. IEEE Transactions on
Information Theory, pages 1743 – 1756, November 2011.
[518] U. Herberg and T. Clausen. Security issues in the optimized link state routing protocol
version 2 (olsrv2). International Journal of Network Security & Its Applications (IJNSA),
April 2010.
[519] U. Herberg and T. Clausen. Study of multipoint-to-point and broadcast traffic performance in the ’IPv6 routing protocol for low power and lossy networks’ (RPL). Journal
of Ambient Intelligence and Humanized Computing, Springer, ISSN 1868-5137, Volume 2,
Number 4, October 2011.
[520] N. Karowski, A. Carneiro Viana, and A. Wolisz. Optimized asynchronous multi- channel
discovery of IEEE 802.15.4-based wireless personal area networks. IEEE Transaction on
Mobile Computing, 2013. Accepted in 2011, to appear.
[521] C. Sengul, A. Carneiro Viaaa, and A. Ziviani. A survey of adaptive services to cope with
dynamics in wireless self-organizing networks. ACM Computing Surveys, vol 44, Issue 4,
pages 23:1–23:35, August 2012.
[522] A. Carneiro Viana, S. Maag, and F. Zaidi. One step forward: Linking wireless selforganising networks validation techniques with formal testing approaches. ACM Computing Surveys.Vo. 43, issue 2, pages 7:1–7:36, June 2011.
263
BIBLIOGRAPHY
264
VII.4.3
[523] E. Baccelli, T. Clausen, U. Herberg, and C. Perkins. IP links in multihop ad hoc wireless
networks? In Proceedings of SoftCom, September 2009.
[524] E. Baccelli, T. Clausen, and R. Wakikawa. IPv6 operation for WAVE wireless access in
vehicular environments. In Proceedings of IEEE VNC 2010, Jersey City, USA, December
2010.
[525] E. Baccelli, J. A. Cordero Fuertes, and P. Jacquet. Multi-hop relaying techniques with
OSPF on ad hoc networks. In 4th IEEE International Conference on Sensor Networks and
Communications (ICSNCSoftNet), Porto, Portugal, 2009, September 2009.
[526] E. Baccelli, J. A. Cordero Fuertes, and P. Jacquet. Optimization of critical data synchronization via link overlay RNG in mobile ad hoc networks. In Proceedings of IEEE MASS
2010, San Francisco, USA, November 2010.
[527] E. Baccelli, J. A. Cordero Fuertes, and P. Jacquet. Using relative neighborhood graphs for
reliable database synchronization in MANETs. In Proceedings of the Fifth IEEE Workshop
on Wireless Mesh Networks (WiMesh 2010), June 2010.
[528] E. Baccelli, P. Jacquet, Bernard Mans, and Georgios Rodolakis. Information propagation
speed in bidirectional vehicular delay tolerant networks. In IEEE Infocom, April 2011.
[529] E. Baccelli, M. Philipp, and M. Goyal. The p2p-RPL routing protocol for IPv6 sensor
networks: Testbed experiments. In Softcom, September 2011.
[530] E. Baccelli and J. Schiller. Towards scalable MANETs. In Proceedings of the IEEE International Conference on ITS Telecommunications (ITST), Phuket, Thailand, October 2008.
[531] A. Bas, J. Yi, and T. Clausen. Expanding ring search for route discovery in LOADng
routing protocol. In The 1st International Workshop on Smart Technologies for Energy, Information and Communication, October 2012.
[532] C.Adjih, E. Baccelli, P. Jacquet, P. Minet, M. Philipp, and G. Wittenburg. Deployment
experience with low power lossy wireless sensor networks. In Proceedings of the 1st Interconnecting Smart Objects with the Internet Workshop, March 2011.
[533] T. Clausen and U. Herberg. Comparative study of RPL-enabled optimized broadcast in
wireless sensor networks. In Proceedings of the 6th International Conference on Intelligent
Sensors, Sensor Networks and Information Processing (ISSNIP), December 2010.
[534] T. Clausen and U. Herberg. Multipoint-to-point and broadcast in RPL. In Proceedings
of the First International Symposium on Frontiers in Ubiquitous Computing, Networking and
Applications (NeoFUSION 2010), September 2010.
[535] T. Clausen and U. Herberg. Router and link admittance control in the optimized link
state routing protocol version 2 (OLSRv2). In Proceedings of the 4th International Conference on Network and System Security (NSS 2010), September 2010.
[536] T. Clausen and U. Herberg. Vulnerability analysis of the optimized link state routing
protocol version 2 (OLSRv2). In Proceedings of the IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS2010), June 2010.
[537] T. Clausen and U. Herberg. Some considerations on routing in particular and lossy environments. In Proceedings of the 1st Interconnecting Smart Objects with the Internet Workshop, March 2011.
BIBLIOGRAPHY
265
[538] T. Clausen, U. Herberg, and M. Philipp. A critical evaluation of the ”IPv6 routing protocol for low power and lossy networks” (RPL). In Proceedings of the 5th IEEE International
Conference on Wireless & Mobile Computing, Networking & Communication (WiMob), October 2011.
[539] T. Clausen, J. Yi, and A. Colin de Verdiere. LOADng: Towards AODV version 2. In 2012
IEEE 76th Vehicular Technology Conference, September 2012.
[540] J. A. Cordero Fuertes. Adjacency persistency in OSPF MANETs. In 4th IET China-Ireland
International Conference on Information and Communications Technologies (CIICT), October
2010.
[541] J. A. Cordero Fuertes. Mpr-based pruning techniques for shortest path tree computation.
In Proceedings of the 18th IEEE International Conference on Software Telecommunications
and Computer Networks (SoftCom’2010), September 2010.
[542] J. A. Cordero Fuertes, T. Clausen, and E. Baccelli. Mpr+sp: Towards a unified mprbased MANET extension for OSPF. In Hawaii International Conference on System Sciences,
January 2011.
[543] U. Herberg. JOLSRv2 an OLSRv2 implementation in Java. In Proceedings of the 4th OLSR
Interop Workshop, October 2008.
[544] U. Herberg. Performance evaluation of using a dynamic shortest path algorithm in OLSRv2. In Proceedings of the 8th Annual Conference on Communication Networks and Services
Research (CNSR), May 2010.
[545] U. Herberg and T. Clausen. Yet another autoconf proposal (YAAP) for mobile ad hoc
NETworks. In Proceedings of the 6th International Conference on Mobile Ad-hoc and Sensor
Networks (MSN’10), December 2010.
[546] U. Herberg and T. Clausen. A comparative performance study of the routing protocols
load and RPL with bi-directional traffic in low-power and lossy networks (LLN). In Proceedings of the Eighth ACM International Symposium on Performance Evaluation of Wireless
Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN), October 2011.
[547] U. Herberg and T. Clausen. Delay tolerant routing with OLSRv2. In Proceedings of the
The 9th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC),
October 2011.
[548] U. Herberg, T. Clausen, and R. Cole. MANET network management and performance
monitoring for nhdp and OLSRv2. In Proceedings of the 6th International Conference on
Network and Services Management, October 2010.
[549] U. Herberg, T. Clausen, and J. Milan. Digital signatures for admittance control in the optimized link state routing protocol version 2. In Proceedings of the International Conference
on Internet Technology and Applications (iTAP 2010), August 2010.
[550] U. Herberg, R. Cole, and J. Yi. Performance analysis of SNMP in OLSRv2-routed
MANETs. In Proceedings of the International Conference on Network and Service Management, October 2011.
[551] U. Herberg and I. Taylor. Development framework for supporting java NS2 routing protocols. In Proceedings of the 2010 International Workshop on Future Engineering, Applications
and Services (FEAS), May 2010.
[552] Dan Radu, Camelia Avram, Adina Astilean, Benoit Parrein, and J. Yi. Acoustic noise
pollution monitoring in an urban environment using a VANET network. In 2012 IEEE
International Conference on Automation, Quality and Testing, Robotics, May 2012.
BIBLIOGRAPHY
266
[553] Dan Radu, J. Yi, and Benoit Parrein. QoE enhancement for h.264/SVC video transmission
in MANET using MP-OLSR protocol. In The 6th International Symposium on signal, Image,
Video and Communications, July 2012.
[554] W. Xie, M. Goyal, H. Hosseini, J. Martocci, Y. Bashir, E. Baccelli, and A. Durresi. A performance analysis of point-to-point routing along a directed acyclic graph in low power
and lossy networks. In Proceedings of NBiS 2010, Takayama, Japan, September 2010.
[555] W. Xie, M. Goyal, H. Hosseini, J. Martocci, Y. Bashir, E. Baccelli, and A. Durresi. Routing
loops in dag-based low power and lossy networks. In Proceedings of the IEEE Advanced
Information Networking and Applications (AINA), Perth, Australia., April 2010.
[556] J. Yi and T. Clausen. Vulnerability analysis of relay set selection algorithms for the simplified multicast forwarding (SMF) protocol for mobile ad hoc networks. In The 15th
International Conference on Network-Based Information Systems (NBiS-2012), September
2012.
[557] J. Yi, T. Clausen, and A. Bas. Smart route request for on-demand route discovery in
constrained environments. In 2012 IEEE International Conference on Wireless Information
Technology and Systems, November 2012.
[558] J. Yi, T. Clausen, and A. Colin de Verdiere. Efficient data acquisition in sensor networks:introducing (the) LOADng collection tree protocol. In IEEE WiCom 2012, The 8th
IEEE International Conference on Wireless Communications, Networking and Mobile Computing., September 2012.
[559] J. Yi, T. Clausen, and U. Herberg. Vulnerability analysis of the SMF protocol for mobile
ad hoc networks. In IEEE CPSCom 2011, October 2011.
[560] J. Yi, Benoit Parrein, and Dan Radu. Multipath routing protocol for MANET: Application
to h.264/SVC video content delivery. In The 14th International Symposium on Wireless
Personal Multimedia Communications, October 2011.
VII.4.4
Thèses
[561] Song-Yean Cho. Efficient Information Dissemination in Wireless Multi-Hop Networks. Phd
thesis, Ecole Polytechnique, September 2008.
[562] J. A. Cordero Fuertes. Link-State Routing Optimization for Compound Autonomous Systems
in the Internet. Phd thesis, Ecole Polytechnique, September 2011.
[563] U. Herberg. Performance, Scalability, Automatic Management and Internet Integration of Ad
Hoc Networks. Phd thesis, Ecole Polytechnique, May 2011.
[564] Marie Nestor Mariyasagayam. Communication Véhiculaires par géolocalisation pour
Systèmes de Transports Intelligents. Phd thesis, Ecole Polytechnique, June 2011.
VII.4.5
Normalisation - Ratified Standards
[565] E. Baccelli, T. Clausen, P. Jacquet, and D. Nguyen. RFC5449: OSPF multipoint relay
(MPR) extension for ad hoc networks. The Internet Engineering Task Force, February
2009. http://www.rfc-editor.org/rfc/rfc5449.txt.
[566] E. Baccelli and M. Townsley. RFC5889: Ip addressing model in ad hoc networks.
The Internet Engineering Task Force, September 2010. http://tools.ietf.org/html/
rfc5889.
VII.4.6. NORMALISATION - CONTRIBUTIONS
267
[567] T. Clausen and C. Dearlove. RFC5497: Representing multi-value time in MANETs.
The Internet Engineering Task Force, March 2009. http://www.rfc-editor.org/rfc/
rfc5497.txt.
[568] T. Clausen, C. Dearlove, and B. Adamson. RFC5148: Jitter considerations in mobile ad
hoc networks (MANETs). The Internet Engineering Task Force, February 2008. http:
//www.rfc-editor.org/rfc/rfc5148.txt.
[569] T. Clausen, C. Dearlove, and J. Dean. RFC6130: Mobile ad hoc network (MANET) neighborhood discovery protocol (nhdp). The Internet Engineering Task Force, March 2011.
http://tools.ietf.org/html/rfc6130.
[570] T. Clausen, C. Dearlove, J. Dean, and C. Adjih. RFC5444: Generalized mobile ad hoc network (MANET) packet/message format. The Internet Engineering Task Force, February
2009. http://www.ietf.org/rfc/rfc5444.txt.
[571] T. Clausen and U. Herberg. RFC6622: Integrity check value and timestamp TLV definitions for mobile ad hoc networks (MANETs). The Internet Engineering Task Force, May
2012. http://tools.ietf.org/html/rfc6622.
[572] ITU. ITU-T g.9903: Narrow-band orthogonal frequency division multiplexing power line
communication transceivers for g3-plc networks: Amendment 1, May 2013. The team
contributed the normative annex on routing in PLC networks to amendment 1 of this
specification, henceforth used for (among other things) communication in the ”Smart
Grid” and ”Automated Metering Infrastructure” networks of utilities world-wide.
[573] P. Levis, T. Clausen, J. Hui, O. Gnawli, and J. Ko. RFC6206: The trickle algorithm. The
Internet Engineering Task Force, March 2011. http://tools.ietf.org/html/rfc6206.
VII.4.6
Normalisation - Contributions
[574] A. Brandt, E. Baccelli, and R. Cragie. Applicability statement: The use of RPL in
building and home environments draft-00 - internet-draft (work in progress). The
Internet Engineering Task Force, April 2010. https://datatracker.ietf.org/doc/
draft-brandt-roll-rpl-applicability-home-building/.
[575] T. Clausen, A. Camacho, J. Yi, A. Colin de Verdiere, Y. Igarashi, H. Satoh, and Y.
Morii. Experience with the LOADng routing protocol for LLNs - internet-draft (work
in progress). The Internet Engineering Task Force, October 2011. http://tools.ietf.
org/html/draft-lavenu-lln-loadng-interoperability-report.
[576] T. Clausen, A. Colin de Verdiere, J. Yi, and U. Herberg. Experiences with RPL: IPv6
routing protocol for low power and lossy networks - internet-draft (work in progress).
The Internet Engineering Task Force, January 2012. http://tools.ietf.org/html/
draft-clausen-lln-rpl-experiences.
[577] T. Clausen, A. Colin de Verdiere, J. Yi, and U. Herberg. Experiences with RPL: IPv6
routing protocol for low power and lossy networks - internet-draft (work in progress).
The Internet Engineering Task Force, March 2012. http://tools.ietf.org/html/
draft-clausen-lln-rpl-experiences.
[578] T. Clausen, A. Colin de Verdiere, J. Yi, U. Herberg, and Y. Igarashi. Experiences with
RPL: IPv6 routing protocol for low power and lossy networks draft -03 - internet-draft
(work in progress). The Internet Engineering Task Force, April 2012. http://tools.
ietf.org/html/draft-clausen-lln-rpl-experiences.
268
BIBLIOGRAPHY
[579] T. Clausen, A. Colin de Verdiere, J. Yi, C. Lavenu, T. Lys, A. Niktash, Y. Igarashi, and
H. Satoh. The LLN on-demand ad hoc distance-vector routing protocol - next generation
(LOADng) - draft 00 - internet-draft (work in progress). The Internet Engineering Task
Force, October 2011. http://tools.ietf.org/html/draft-clausen-lln-loadng.
[580] T. Clausen, A. Colin de Verdiere, J. Yi, A. Niktash, Y. Igarashi, H. Satoh, and U. Herberg.
The LLN on-demand ad hoc distance-vector routing protocol - next generation (LOADng)
- internet-draft (work in progress). The Internet Engineering Task Force, October 2011.
http://tools.ietf.org/html/draft-clausen-lln-loadng.
[581] T. Clausen, A. Colin de Verdiere, J. Yi, A. Niktash, Y. Igarashi, H. Satoh, U. Herberg, C. Lavenu, and T. Lys. The LLN on-demand ad hoc distance-vector routing
protocol - next generation (LOADng) - draft -02 - internet-draft (work in progress).
draft-clausen-lln-loadng.
The Internet Engineering Task Force, April 2012. http://tools.ietf.org/html/
[584] T. Clausen, A. Colin de Verdiere, J. Yi, A. Niktash, Y. Igarashi, H. Satoh, U. Herberg, C.
Lavenu, T. Lys., C. Perkins, and J. Dean. The lightweight on-demand ad hoc distancevector routing protocol - next generation (LOADng) - internet-draft (work in progress).
The Internet Engineering Task Force, October 2012. https://tools.ietf.org/html/
draft-clausen-lln-loadng-06.
[585] T. Clausen, C. Dearlove, and J. Dean. MANET neighborhood discovery protocol (NHDP)
draft-06 - internet-draft (work in progress). The Internet Engineering Task Force, March
2008. https://datatracker.ietf.org/doc/draft-ietf-manet-nhdp/.
draft-07 - internet-draft (work in progress). The Internet Engineering Task Force, July
draft-11 - internet-draft (work in progress). The Internet Engineering Task Force, October
BIBLIOGRAPHY
269
[593] T. Clausen, C. Dearlove, and P. Jacquet. Link metrics for OLSRv2 draft-01 - internetdraft (work in progress). The Internet Engineering Task Force, July 2008. https://
datatracker.ietf.org/doc/draft-dearlove-olsrv2-metrics/.
[595] T. Clausen, C. Dearlove, and P. Jacquet. Link metrics for OLSRv2 draft-03 - internetdraft (work in progress). The Internet Engineering Task Force, September 2008. https:
//datatracker.ietf.org/doc/draft-dearlove-olsrv2-metrics/.
[596] T. Clausen, C. Dearlove, and P. Jacquet. The optimized link state protocol version 2 (OLSRv2) draft-05 - internet-draft (work in progress). The Internet Engineering Task Force,
February 2008. https://datatracker.ietf.org/doc/draft-ietf-manet-olsrv2/.
[597] T. Clausen, C. Dearlove, and P. Jacquet. The optimized link state protocol version 2
(OLSRv2) draft-06 - internet-draft (work in progress). The Internet Engineering Task
Force, June 2008. https://datatracker.ietf.org/doc/draft-ietf-manet-olsrv2/.
Force, July 2008. https://datatracker.ietf.org/doc/draft-ietf-manet-olsrv2/.
datatracker.ietf.org/doc/draft-dearlove-olsrv2-metrics-04.
March 2009. https://datatracker.ietf.org/doc/draft-ietf-manet-olsrv2/.
September 2009. https://datatracker.ietf.org/doc/draft-ietf-manet-olsrv2/.
[603] T. Clausen, C. Dearlove, and P. Jacquet. Link metrics for OLSRv2 draft-05 - internetdraft (work in progress). The Internet Engineering Task Force, June 2010. https://
[604] T. Clausen, C. Dearlove, and P. Jacquet. The optimized link state routing protocol version
2 (OLSRv2) draft-11 - internet-draft (work in progress). The Internet Engineering Task
Force, April 2010. https://datatracker.ietf.org/doc/draft-ietf-manet-olsrv2/.
October 2011. https://datatracker.ietf.org/doc/draft-ietf-manet-olsrv2/.
270
BIBLIOGRAPHY
[606] T. Clausen, C. Dearlove, and P. Jacquet. The optimized link state routing protocol version
2 (OLSRv2) draft-12 - internet-draft (work in progress). The Internet Engineering Task
[607] T. Clausen, C. Dearlove, P. Jacquet, and U. Herberg. The optimized link state
protocol version 2 (OLSRv2) draft-14 - internet-draft (work in progress). The Internet Engineering Task Force, March 2012. https://datatracker.ietf.org/doc/
draft-ietf-manet-olsrv2/.
[608] C. Dearlove, T. Clausen, and P. Jacquet. Link metrics for the mobile ad hoc network (manet) routing protocol olsrv2 - rationale. The Internet Engineering Task
Force, May 2013. Approved for publication as RFC, http://tools.ietf.org/html/
draft-ietf-manet-olsrv2-metrics-rationale-04.
[609] M. Goyal and E. Baccelli. Reactive discovery of point-to-point routes in low power and
lossy networks - internet-draft (work in progress). The Internet Engineering Task Force,
October 2010. http://tools.ietf.org/pdf/draft-ietf-roll-p2p-rpl-01.pdf.
[610] U. Herberg and T. Clausen. Cryptographical signatures in NHDP draft-00 - internetdraft (work in progress). The Internet Engineering Task Force, November 2009. http:
//tools.ietf.org/html/draft-herberg-manet-nhdp-sec.
[611] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft00 - internet-draft (work in progress). The Internet Engineering Task Force, July 2009.
http://tools.ietf.org/html/draft-herberg-manet-packetbb-sec.
[614] U. Herberg and T. Clausen. Security threats for NHDP draft-00 - internet-draft (work in
progress). The Internet Engineering Task Force, November 2009. http://tools.ietf.
org/html/draft-herberg-manet-nhdp-sec-threats.
[615] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft00 - internet-draft (work in progress). The Internet Engineering Task Force, June 2010.
http://tools.ietf.org/html/draft-ietf-manet-packetbb-sec.
http://tools.ietf.org/html/draft-ietf-manet-packetbb-sec-01.
[617] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft-02 internet-draft (work in progress). The Internet Engineering Task Force, November 2010.
http://tools.ietf.org/html/draft-ietf-manet-packetbb-sec-02.
[618] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft-03
- internet-draft (work in progress). The Internet Engineering Task Force, March 2010.
[619] U. Herberg and T. Clausen. Yet another autoconf proposal (yaap) for mobile ad hoc
networks draft-00 - internet-draft (work in progress). The Internet Engineering Task
Force, July 2010. http://tools.ietf.org/html/draft-herberg-autoconf-yaap-00.
BIBLIOGRAPHY
271
[620] U. Herberg and T. Clausen. Cryptographical signatures in NHDP draft-00 - internetdraft (work in progress). The Internet Engineering Task Force, July 2011. http://tools.
ietf.org/html/draft-ietf-manet-nhdp-sec-00.
[621] U. Herberg and T. Clausen. Cryptographical signatures in NHDP draft-01 - internetdraft (work in progress). The Internet Engineering Task Force, March 2011. http://
tools.ietf.org/html/draft-herberg-manet-nhdp-sec.
[622] U. Herberg and T. Clausen. Cryptographical signatures in NHDP draft-02 - internetdraft (work in progress). The Internet Engineering Task Force, July 2011. http://tools.
ietf.org/html/draft-herberg-manet-nhdp-sec.
[626] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft-06 internet-draft (work in progress). The Internet Engineering Task Force, September 2011.
[627] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft-07 internet-draft (work in progress). The Internet Engineering Task Force, November 2011.
- internet-draft (work in progress). The Internet Engineering Task Force, January 2012.
[630] U. Herberg and T. Clausen. Using integrity check values in NHDP draft-01 - internetdraft (work in progress). The Internet Engineering Task Force, March 2012. http://
tools.ietf.org/html/draft-ietf-manet-nhdp-sec.
[631] U. Herberg, T. Clausen, and J. Yi. Security threats for NHDP draft-00 - internet-draft
(work in progress). The Internet Engineering Task Force, April 2012. http://tools.
ietf.org/html/draft-ietf-manet-nhdp-sec-threats.
[632] U. Herberg, T. Clausen, and J. Yi. Security threats for NHDP draft-01 - internet-draft
(work in progress). The Internet Engineering Task Force, March 2012. http://tools.
ietf.org/html/draft-herberg-manet-nhdp-sec-threats.
[633] U. Herberg, R. Cole, and I. Chakeres.
Definition of managed objects for the
neighborhood discovery protocol draft-01 - internet-draft (work in progress). The
Internet Engineering Task Force, October 2009.
http://tools.ietf.org/html/
draft-ietf-manet-nhdp-mib-01.
272
BIBLIOGRAPHY
Internet Engineering Task Force, November 2009. http://tools.ietf.org/html/
draft-ietf-manet-nhdp-mib.
Internet Engineering Task Force, March 2010.
[636] U. Herberg, R. Cole, and I. Chakeres. Definition of managed objects for the neighborhood
discovery protocol draft-04 - internet-draft (work in progress). The Internet Engineering
Task Force, July 2010. http://tools.ietf.org/html/draft-ietf-manet-nhdp-mib.
discovery protocol - internet-draft (work in progress). The Internet Engineering Task
Force, January 2011. http://www.ietf.org/id/draft-ietf-manet-nhdp-mib-07.txt.
[642] U. Herberg, R. Cole, and I. Chakeres. Definition of managed objects for the neighborhood discovery protocol draft-10 - internet-draft (work in progress). The Internet Engineering Task Force, September 2011.
draft-ietf-manet-nhdp-mib.
[643] U. Herberg, R. Cole, and T. Clausen. Definition of managed objects for the MANET optimized link state routing protocol version 2 draft-00 - internet-draft (work in progress).
The Internet Engineering Task Force, March 2009. https://datatracker.ietf.org/
doc/draft-ietf-manet-olsrv2-mib/.
[644] U. Herberg, R. Cole, and T. Clausen. Definition of managed objects for the MANET optimized link state routing protocol version 2 draft-01 - internet-draft (work in progress).
The Internet Engineering Task Force, November 2009. http://tools.ietf.org/html/
draft-ietf-manet-olsrv2-mib.
[645] U. Herberg, R. Cole, and T. Clausen. Definition of managed objects for the optimized link state routing protocol version 2 draft-02 - internet-draft (work in progress).
The Internet Engineering Task Force, July 2010. http://tools.ietf.org/html/
draft-ietf-manet-olsrv2-mib.
VII.4.7. RAPPORTS TECHNIQUES
273
[646] U. Herberg, R. Cole, and T. Clausen. Definition of managed objects for the optimized link state routing protocol version 2 draft-02 - internet-draft (work in progress).
The Internet Engineering Task Force, January 2011. http://tools.ietf.org/id/
draft-ietf-manet-olsrv2-mib-03.txt.
[647] U. Herberg, J. Yi, and T. Clausen. Security threats for NHDP - internet-draft (work in
progress). The Internet Engineering Task Force, October 2012. http://tools.ietf.org/
html/draft-herberg-manet-nhdp-sec-threats-01.
[648] Y. Lacharite, M. Wang, P. Minet, and T. Clausen. Hierarchical olsr draft-00 - internetdraft (work in progress). The Internet Engineering Task Force, November 2008. https:
//datatracker.ietf.org/doc/draft-lacharite-manet-holsr/.
[649] Y. Lacharite, M. Wang, P. Minet, and T. Clausen. Hierarchical olsr draft-01 - internetdraft (work in progress). The Internet Engineering Task Force, November 2008. https:
//datatracker.ietf.org/doc/draft-lacharite-manet-holsr/.
[650] Y. Lacharite, M. Wang, P. Minet, and T. Clausen. Hierarchical olsr draft-02 - internetdraft (work in progress). The Internet Engineering Task Force, July 2009. https://
datatracker.ietf.org/doc/draft-lacharite-manet-holsr/.
[651] C. Lavenu, T. Clausen, A. Camacho, J. Yi, A. Colin de Verdiere, Y. Igarashi, H. Satoh, and
Y. Morii. Experience with the LOADng routing protocol for LLNs - draft -00 - internetdraft (work in progress). The Internet Engineering Task Force, October 2011. http:
//tools.ietf.org/html/draft-lavenu-lln-loadng-interoperability-report.
[652] P. Levis and T. Clausen. The trickle algorithm draft-00 - internet-draft (work in progress).
The Internet Engineering Task Force, February 2010. https://datatracker.ietf.org/
doc/draft-levis-roll-trickle/.
[653] P. Levis and T. Clausen. The trickle algorithm draft-01 - internet-draft (work in progress).
The Internet Engineering Task Force, March 2010. https://datatracker.ietf.org/
doc/draft-ietf-roll-trickle/.
VII.4.7
Rapports techniques
[654] C. Adjih, E. Baccelli, P. Jacquet, P. Minet, M. Philipp, and G. Wittenburg. Deployment
experience with low power lossy wireless sensor networks. Technical Report RR-7551,
INRIA, February 2011.
[655] E. Baccelli andJ. A. Cordero Fuertes and P. Jacquet. Optimization of critical data synchronization via link overlay RNG in mobile ad hoc networks. Technical Report RR-7272,
INRIA, April 2010.
[656] E. Baccelli, J. A. Cordero Fuertes, and P. Jacquet. Multi-hop wireless networking with
OSPF: MPR-based routing extensions for MANETs. Technical Report RR-6822, INRIA,
February 2009.
[657] E. Baccelli, P. Jacquet, B. Mans, and G. Rodolakis. Information propagation speed in
bidirectional vehicular delay tolerant networks. Technical Report RR-7266, INRIA, April
2010.
[658] T. Clausen. MANET router configuration recommendations. Technical Report RR-6852,
INRIA, February 2009.
[659] T. Clausen, E. Baccelli, and R. Wakikawa. IPv6 operation for WAVE - wireless access in
vehicular environments. Technical Report RR-7383, INRIA, September 2010.
274
BIBLIOGRAPHY
[660] T. Clausen and A. Colin de Verdiere. The LLN on-demand ad hoc distance-vector routing protocol - next generation (LOADng). Technical Report RR-7692, INRIA, July 2011.
[661] T. Clausen and U. Herberg. Comparative study of RPL-enabled optimized broadcast in
wireless sensor networks. Technical Report RR-7296, INRIA, May 2010.
[662] T. Clausen and U. Herberg. MANET network management and performance monitoring
for NHDP and OLSRv2. Technical Report RR-7311, INRIA, June 2010.
[663] T. Clausen and U. Herberg. Multipoint-to-point and broadcast in RPL. Technical Report
RR-7244, INRIA, April 2010.
[664] T. Clausen and U. Herberg. Router and link admittance control in the optimized link
state routing protocol version 2 (OLSRv2). Technical Report RR-7248, INRIA, April 2010.
[665] T. Clausen and U. Herberg. Security issues in the optimized link state routing protocol
version 2 (OLSRv2)). Technical Report RR-7218, INRIA, February 2010.
[666] T. Clausen and U. Herberg. Study of multipoint-to-point and broadcast traffic performance in RPL. Technical Report RR-7384, INRIA, September 2010.
[667] T. Clausen and U. Herberg. Vulnerability analysis of the optimized link state routing
protocol version 2 (OLSRv2). Technical Report RR-7203, INRIA, February 2010.
[668] T. Clausen and U. Herberg. Yet another autoconf proposal (YAAP) for mobile ad hoc
NETworks. Technical Report RR-7341, INRIA, July 2010.
[669] T. Clausen and U. Herberg. A comparative performance study of the routing protocols
LOAD and RPL with bi-directional traffic in low-power and lossy networks (LLN). Technical Report RR-7637, INRIA, June 2011.
[670] T. Clausen and U. Herberg. Some considerations on routing in particular and lossy environments. Technical Report RR-7540, INRIA, February 2011.
[671] T. Clausen, U. Herberg, and J. Milan. Digital signatures for admittance control in the optimized link state routing protocol version 2. Technical Report RR-7216, INRIA, February
2010.
[672] T. Clausen, U. Herberg, and M. Philipp. A critical evaluation of the ”IPv6 routing protocol for low power and lossy networks” (RPL). Technical Report RR-7633, INRIA, May
2011.
[673] J. A. Cordero Fuertes.
On MPR-OSPF specification and implementation in
quagga/gtnets. Technical Report RR-6827, INRIA, February 2009.
[674] J. A. Cordero Fuertes. MPR-based pruning techniques for shortest path tree computation. Technical Report RR-7329, INRIA, June 2010.
[675] J. A. Cordero Fuertes, E. Baccelli, and P. Jacquet. OSPF over multi-hop ad hoc wireless
communications. Technical Report RR-7268, INRIA, April 2010.
[676] U. Herberg. Integrating java support for routing protocols in NS2. Technical Report
RR-7075, INRIA, October 2009.
[677] U. Herberg. Performance analysis of SNMP in OLSRv2-routed MANETs. Technical Report RR-7407, INRIA, October 2010.
[678] U. Herberg. Performance evaluation of using a dynamic shortest path algorithm in OLSRv2. Technical Report RR-7174, INRIA, January 2010.
VII.4.8. AUTRES
275
[679] U. Herberg and T. Clausen. Delay tolerant routing with OLSRv2. Technical Report RR7662, INRIA, June 2011.
[680] U. Herberg, N. Mariyasagayam, and T. Clausen. Comparison of NHDP and MHVB for
neighbor discovery in multi-hop ad hoc networks. Technical Report RR-7173, INRIA,
January 2010.
[681] J. Yi, T. Clausen, and U. Herberg. Vulnerability analysis of the simple multicast forwarding (SMF) protocol for mobile ad hoc networks. Technical Report RR-7638, INRIA, June
2011.
VII.4.8
Autres
[682] E. Baccelli, T. Clausen, and P. Jacquet. The internet engineering task force and the future
of the internet. European Research Consortium for Informatics and Mathematics, ERCIM
News issue no. 77, pages 20–21, April 2009.
[683] G. Dowek, T. Viéville, J.P. Archambault, E. Baccelli, and B. Wack. Les ingrédients des
algorithmes. Interstices )i( (Online), April 2010.
[684] G. Dowek, T. Viéville, J.P. Archambault, E. Baccelli, and B. Wack. Tout a un reflet
numérique. Interstices )i( (Online), January 2010.
276
BIBLIOGRAPHY
VII.5 Annexes : High-Performance Communications
VII.5.1
et d’enseignement
• Thomas Heide Clausen
– co-chaired the AUTOCONF Working Group of the IETF (période 2005-2012).
– presided the selection committee of the LIX-Qualcomm Fellowship Program1 (période
2009-2010).
– was member of the “Commite Enseignement-Recherche du DIX”, nominated by the
Director of LIX (période 2010-2011).
– is coordinator of the Computer Networking curriculum at Ecole Polytechnique (période
2010-).
– is member of the ”Routing Area Directorate” of the IETF2 (période 2011-).
VII.5.1.1
Hitachi (2008-2009) (Type: Direct Industrial Sponsorship) Titre: Development of Scalable AdHoc Network System.
Partenaires: LIX and Hitachi Yokohama Research Lab. Responsable:
Thomas Heide Clausen. Montant de la collaboration pour le LIX: 20.000 euros.
Toyota (2009-2010) (Type: Direct Industrial Sponsorship) Titre: The Future Vehicular Ad-hoc
Networking. Partenaires: LIX and Toyota ITC. Responsable: Thomas Heide Clausen. Montant
de la collaboration pour le LIX: 35.880 euros.
Hitachi (2009-2010) (Type: Direct Industrial Sponsorship) Titre: Further Development of Scalable Ad-Hoc Network Systems. Partenaires: LIX and Hitachi Yokohama Research Lab. Responsable: Thomas Heide Clausen. Montant de la collaboration pour le LIX: 20.000 euros.
Hitachi (2010-2011) (Type: Direct Industrial Sponsorship) Titre: Routing in Ad Hoc Networks.
Partenaires: LIX and Hitachi Yokohama Research Lab. Responsable: Thomas Heide Clausen.
Montant de la collaboration pour le LIX: 20.000 euros.
Qualcomm (2010-2011) (Type: Direct Industrial Sponsorship) Titre: Réseaux sans-fils. Partenaires: LIX and Qualcomm. Responsable: Thomas Heide Clausen. Montant de la collaboration
pour le LIX: 100.000 euros.
Hitachi (2011-2012) (Type: Direct Industrial Sponsorship) Titre: Routing Protocols for LargeScale Networks for AMI. Partenaires: LIX and Hitachi Yokohama Research Lab. Responsable:
Thomas Heide Clausen. Montant de la collaboration pour le LIX: 20.000 euros.
Hitachi (2012-2013) (Type: Direct Industrial Sponsorship) Titre: Standardisation of Routing
Protocols for Low-power and Lossy Networks.
Partenaires: LIX and Hitachi Yokohama Research
Lab. Responsable: Thomas Heide Clausen. Montant de la collaboration pour le LIX: 20.000
euros .
1 http://www.lix.polytechnique.fr/fellowship/
2 http://www.ietf.org/iesg/directorate/routing.html
277
278
CHAPTER VII.5. ANNEXES : HIGH-PERFORMANCE COMMUNICATIONS
Fujitsu (2012-2013) (Type: Direct Industrial Sponsorship) Titre: Réseaux sans-fils.
Partenaires: LIX and Fujitsu Laboratories of America. Responsable: Thomas Heide Clausen. Montant de la collaboration pour le LIX: 20.000 euros.
VII.5.1.2
ERDF (2010-2011) (Type: Direct Industrial Sponsorship) Titre: Evaluation de protocoles de
routage du CPL G3 (projet Linky) - Etude de protocoles (RPL et LOAD) de routage d’un réseau de
smart metering.
Partenaires: LIX and ERDF. Responsable: Thomas Heide Clausen. Montant
de la collaboration pour le LIX: 186.339 euros.
VII.5.2
VII.5.2.1
Philippe Jacquet belongs to the editorial board of the DMTCS journal.
• ICC 2008 (IEEE International Conference on Communications) (2008). Thomas Heide
Clausen.
• PerCom 2010 (IEEE International Conference on Perversive Computing and Communications) (2010). Emmanuel Baccelli.
• IP+SN 2011 (Extending the Internet to Low power and Lossy Networks) (2011). Thomas
Heide Clausen.
• Mobility2011 (1st International Conference on MobileServices, Resources, andUsers)
(2011). Aline Carneiro Viana.
• WOCN2011 (IEEE International Conferenceon Wireless and Optical Communications
Neworks) (2011). Aline Carneiro Viana.
• WPerformance 2011 (Workshop em Desempenho de Sistemas Computacionais e de Comunicacao) (2011). Aline Carneiro Viana.
• MICOM 2012 (MILCOM 2012) (2012). Thomas Heide Clausen.
• ITST2012 (12th International Conference on ITS Telecommunications) (2012). Thomas
Heide Clausen.
• IoT-SoS 2012 (First IEEE Workshop on the Internet of Things: Smart Objects and Services) (2012). Thomas Heide Clausen.
• IEEE SECON 2012 (IEEE International Conference on Sensing, Communication, and
Networking) (2012). Emmanuel Baccelli.
• IEEE PerGroup 2012 (3rd IEEE Workshop on Pervasive Group Communication) (2012).
Emmanuel Baccelli.
• IEEE NovaEnEv (1st International Workshop on Novel approaches to Energy Measurement and Evaluation in Wireless Networks) (2012). Emmanuel Baccelli.
• ACM Mobile Health (3rd ACM MobiHoc Workshop on Pervasive Wireless Healthcare In
Conjunction With MobiHoc 2013 Symposium) (2012). Emmanuel Baccelli.
VII.5.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION
VII.5.2.2
279
• Organization of the “4th OLSR Interop/Workshop”, Ottawa, Canada, October 14-16, 2008,
• Organization of the “5th OLSR Interop/Workshop”, Vienna, Austria, October 2-4, 2009,
• MobiHoc (Twelfth ACM International Symposium on Mobile Ad Hoc Networking and
Computing) (2011). Philippe Jacquet, General Chair.
Computing) (2011). Thomas Heide Clausen, Finance Chair.
Computing) (2011). Emmanuel Baccelli, Registration Chair.
• IAB Workshop on Smart Object Security (IAB Workshop on Smart Object Security, Ecole
Polytechnique, March 2012) (2012). Thomas Heide Clausen.
• ExtremeCom2011 (3rd Extreme Conference on Communication, Manaus, Brazil) (2011).
Aline Carneiro Viana, Local arrangement co-chair.
• ExtremeCom2011 (3rd Extreme Conference on Communication, Manaus, Brazil) (2011).
Aline Carneiro Viana, Publicity Chair.
• Shadow ACM Conext 2011 (Shadow ACM 7th International Conference on emerging
Networking EXperiments and Technologies) (2011). Aline Carneiro Viana, TPC CoChair.
• AdHocNets 2011 (3rd International ICST Conference on Ad Hoc Networks) (2011). Aline
Carneiro Viana, Publication Chair.
• SECON’12 (9th Annual IEEE Communications SocietyConference on Sensor, Mesh and
Ad Hoc Communications and Networks) (2012). Aline Carneiro Viana, Publicity Chair.
• ExtremeCom 2012 (4th Extreme Conference on Communication, Manaus, Brazil) (2012).
Aline Carneiro Viana, Publicity Chair.
VII.5.3
• Song-Yean Cho (September 22, 2008). Efficient Information Dissemination in Wireless
Multi-Hop Networks. Encadrant: P.Jacquet.
• Marie Nestor Mariyasagayam (June 27, 2011). Communication Vehiculaires par geo-localisation
pour Systèmes de Transport Intelligents. Encadrant: P.Jacquet & T.Clausen.
• Ulrich Herberg (May, 2011). Réseaux Ad Hoc: performance, dimensionnement, gestion
automatisée et intégration dans l’Internet. Encadrant: P.Jacquet & T.Clausen.
• Juan Antonio Cordero Fuertes (September 15, 2011). Link-State Routing Optimization for
Compound Autonomous Systems in the Internen. Encadrant: P.Jacquet & E.Baccelli.
280
VII.5.3.1
At Ecole Polytechnique
• MODAL-NET - Hands-on Computer (T.Clausen), 2009-2013
• INF557 - Introduction to Networking, (T. Clausen) 2009• INF566 - Networks and Protocols (T. Clausen, with Mark Townsley, Cisco), 2012• INF567 - Mobile and Wireless Networks (P.Jacquet, with E.Baccelli), 2009Cours universitaires en M2
• MPRI MASTER(Paris) class : mobile ad hoc network/PeertoPeer networks (P.Jacquet with
Laurent Viennot), 2009
• Master COMASIC (Polytechnique) class: Telecommunication (P.Jacquet, 2009-2010
Vulgarisation
• Emmanuel Baccelli has co-authored ”Les ingrédients des algorithmes” http://interstices.info/jcms/c 43821/les-ingredients-des-algorithmes
• Emmanuel Baccelli has co-authored ”Tout a un reflet numérique” http://interstices.info/jcms/c 43823/tout-a-un-reflet-numerique
VII.5.4
• Thomas Clausen has been advising the French legislature within the context of the law
HADOPI - ”favorisant la diffusion et la protection de la creation sur internet” – http://www.assembleenationale.fr/13/rap-info/i3560.asp, 2009
• Thomas Clausen has been advising the French legislature within the context of the ”Mission
d’information sur les droits de l’individu dans la révolution numérique” – http://www.assembleenationale.fr/13/commissions/revol-num/, 2010
• Thomas Clausen has been performing reviews for the ANR VERSO program, 2010
• Aline Carneiro Viana has been performing remote reviews of short proposals for the FETOpen program of the European Commission since January 2011.
• Aline Carneiro Viana has been Rapporteur, Shadow and Challenger at the Panel evaluation
of Grant proposals for the EC ”Future and Emerging Technologies” programme (EC FETOpen), in Brussels, January 2011
• Thomas Clausen has been performing reviews of proposals for the EU FP7 CONFINE
project, in 2012
VII.5.4.1
Invitations
• Flajolet 60th Birthday Workshop, Paris (December 2008). Philippe Jacquet, Invited Speaker.
• Journée commune SEE Àcadémie des sciences, Paris (January 2009). Philippe Jacquet,
Invited Speaker.
• AofA 2009, Frejus (June 2009). Philippe Jacquet, Invited Speaker.
• Centre de Recerca Matematica (November 2009). Philippe Jacquet, Invited Speaker.
VII.5.4. AUTRES ÉLÉMENTS DE VISIBILITÉ
281
• Swedish National Computer Networking Workshop and Scandinavian Workshop on Wireless Adhoc Networks (SNCNW-ADHOC’09) (2009). Thomas Clausen, Keynote Speaker.
• IEEE LCN Workshop on Network Security (WNS) (2009). Thomas Clausen, Keynote
Speaker.
• WiOpt workshop, Avignon (2010). Philippe Jacquet, Invited Speaker.
HIPERCOMHigh-Performance Communications
282
VIII Équipe Modélisation Algébrique et Calcul
Symbolique (MAX)
283
VIII.1 Liste des membres : Modélisation
Algébrique et Calcul Symbolique
VIII.1.1
VIII.1.1.1
Membres permanents
Nom
Michel Fliess
Marc Giusti
Joris van der Hoeven
Grégoire Lecerf
Jean Moulin Ollagnier
Fonction
Directeur de recherche émérite
Professeur
François Ollivier
Denis Raux
Sylvie Jabinet
Ingénieur de recherche
Assistante
Chargée d’Affaire
Employeur
CNRS
CNRS
CNRS
CNRS
Univ. ParisEst Créteil
CNRS
CNRS
CNRS
Ecole Polytechnique,
DRIP
HDR
Thèse d’État
Thèse d’État
HDR
Thèse d’État
Arrivée
200520052009201020052005201120112004
Notes:
• Michel Fliess est Directeur de recherche émérite depuis octobre 2010.
• La DRIP est la Direction des Relations Industrielles et Partenariales de l’École polytechnique.
VIII.1.1.2
Autres membres
Nom
François Poulain
Fonction
Ingénieur
Financement
ANR & Digiteo
VIII.1.2
Anciens membres
VIII.1.2.1
Dates
Janvier 2012–
Doctorants
Nom
Jérémy Berthomieu
Romain Lebreton
VIII.1.2.2
Financement
Gaspard Monge
Gaspard Monge
Départ
2008-2011
2009-2012
Encadrant
M. Giusti et G. Lecerf
M. Giusti et É. Schost
Position actuelle
MCF LIP6, Univ. Paris 6
Postdoctorant au LIRMM
Autres membres
Stagiaires Master 2
Nom
Renan Calmet
Pierre Lairez
Financement
ANR MaGiX
ENS
Dates
2010
2010
Responsable
J. van der Hoeven
V. Cossart et J. van der Hoeven
285
Position actuelle
Professeur
En thèse
286CHAPTER VIII.1. LISTE DES MEMBRES : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE
De nombreux visiteurs sont restés dans l’équipe pour des séjours de longue durée, sur poste
d’accueil Polytechnique, poste rouge CNRS, ou bourse DIGITEO. Mentionnons entre autres Antonio Cafure (Argentine), Bernd Bank (Allemagne), Joos Heintz (Argentine et Espagne), Guillermo
Matera (Argentine), Luis Miguel Pardo (Espagne), Pablo Solernó, etc . . .
Nom
Brahim Sadik
Miguel De Benito Delgado
Brahim Sadik
Financement
DIGITEO
ANR MaGiX
ANR LEDA
Dates
11-12 2011
8/2012
6/2013
Invitant
F. Ollivier
J. van der Hoeven
F. Ollivier
Autres
Nom
David Michel
Douda Niang Diatta
Marc Mezzarobba
Francis Jamet
Fonction
Ingénieur
Ingénieur
Ingénieur
Stagiaire
Financement
ANR MaGiX
Digiteo MaGiX
ANR MaGiX
Dates
Novembre 2009–Septembre 2010
Septembre 2010–Décembre 2011
Septembre–Octobre 2011
2009–Juin 2011
VIII.2 Rapport scientifique : Modélisation
VIII.2.1
Introduction
Le développement scientifico-technologique de la société pose des problèmes qui, moyennant
simplifications et modélisations, se traduisent fréquemment par des systèmes d’équations et
d’inéquations algébriques ou différentielles, et nécessitent des solutions, c’est-à-dire des processus capables de les résoudre. L’équipe MAX s’attache à concevoir de tels processus robustes
et à étudier leurs performances.
L’originalité de plusieurs travaux de l’équipe MAX réside dans une approche géométrique
visant à exploiter les spécificités d’instances de problèmes au sein de leur classe. Sont visées principalement quatre classes d’objets : (i) les polynômes en une ou plusieurs variables (processus de
Newton, factorisation, élimination) ; (ii) les opérateurs différentiels linéaires (élimination noncommutative, intégration) ; (iii) les polynômes différentiels (résolution d’équations différentielles
non linéaires, automatique) ; (iv) le calcul analytique efficace et robuste. Nos algorithmes sont
pour la plupart validés par des logiciels portables et distribués librement, développés avec en
ligne de mire l’efficacité sur des problèmes de grandes tailles.
Durant ces cinq dernières années les réussites de l’équipe MAX ont d’une part classiquement
été de nombreux résultats scientifiques publiés dans des revues et actes de conférences de premier plan, et d’autre part le dépôt de deux brevets et la création d’une entreprise exploitant de
nouvelles techniques pour les commandes sans modèles. L’équipe a aussi reçu plusieurs financements pour soutenir ses travaux. En particulier les compétences et l’expertise du centre de calcul
Medicis de l’équipe MAX ont contribué à la réussite du projet européen SCIENCE chargé de
concevoir et d’implanter un système de communication entre de nombreux logiciels de calcul
(http://www.symcomp.org/Scscp).
Par ailleurs suite l’arrivée de van der Hoeven, Lecerf, et Raux dans l’équipe MAX, de nouveaux thèmes de recheche sont venus s’ajouter : (i) le développement du logiciel GNU TEXmacs,
largement distribué et utilisé à travers le monde, pour l’édition de documents scientifiques et
comme interface à de nombreux logiciels de calcul ou graphisme ; (ii) le développement d’une
plateforme collaborative pour l’édition partagée de documents scientifiques pouvant contenir
des calculs scientifiques reproductibles de façon pérenne.
VIII.2.2
Résolution exacte et numérique des systèmes polynomiaux
• Berthomieu, Hivert et Mourtada ont proposé un algorithme pour calculer le nombre minimal de variables d’un système polynomial défini sur un corps parfait de caractéristique
quelconque [699], avec la cryptanalyse à plusieurs variables comme champ d’application.
• Berthomieu et Pardo ont montré que le calcul d’une solution approchée par déformation
homotopique d’un système polynomial réel pouvait se faire en temps polynomial en la
borne de Bézout, à l’instar du cas complexe [703].
• Bank, Giusti, Heintz et Pardo ont achevé la résolution réelle des systèmes polynomiaux en
présence de singularités réelles (trouver un point par composante connexe). La spécificité
de l’algorithme réside en sa complexité polynomiale en des quantités intrinsèques et linéaire
en la longueur d’évaluation des équations du système.
• Colin et Giusti ont donné un algorithme quasi-polynomial pour le calcul de résolvantes de
Lagrange.
• Giusti et Yakoubsohn ont publié une suite à des travaux antérieurs avec Lecerf et Salvy sur
l’approximation de solutions isolées multiples.
287
288CHAPTER VIII.2. RAPPORT SCIENTIFIQUE : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE
• Lebreton et Schost ont conçu les premiers algorithmes quasi-optimaux pour le calcul de
représentations efficaces de l’algèbre de décomposition universelle [765].
• Une implantation de la résolution numérique certifiée par déformation homotopique est
en cours dans Mathemagix [806, 803].
Algorithmes élémentaires pour le calcul formel et numérique
• Berthomieu, van der Hoeven et Lecerf ont conçu une arithmétique paresseuse rapide, appelée aussi détendue, pour les entiers p-adiques [700]. Berthomieu et Lebreton utilisent
cette arithmétique pour calculer efficacement une solution d’un système algébrique dans
les p-adiques [736]. D’autres avancées sur le calcul détenu ont été réalisées dans [802, 804,
808, 809].
• van der Hoeven a accéléré la méthode de Newton intervenant dans des opérations élémentaires
sur les polynômes et les séries à une variable [716].
• van der Hoeven et Lecerf ont conçu plusieurs nouveaux algorithmes pour le produit des
polynômes et séries à plusieurs variables pour plusieurs types d’anneaux de coefficients
usuels [719, 721, 762].
• van der Hoeven, Lebreton et Schost ont accéléré l’algorithme de transformée de Fourier
rapide de polynômes à plusieurs variables dans le cas particulier des polynômes symétriques
ou à support réseau [761].
• Bostan, Chowdhury, Lebreton, Salvy et Schost ont développé deux approches pour le calcul
de solutions séries d’équations différentielles linéaires singulières, par adaptation de la
méthode de Newton et à base d’arithmétique détendue [737].
• Berthomieu, Lecerf et Quintin ont étudié la complexité du calcul des racines de polynômes
à une variable pour des problèmes de théorie des codes correcteurs d’erreur [702].
• Berthomieu et Lecerf ont conçu un algorithme pour réduire la factorisation des polynômes
à deux variables au cas de la représentation dense, en fonction du volume du polygone de
Newton des supports [701].
• van der Hoeven a proposé plusieurs méthodes pour trouver des dépendances linéaires à
coefficients analytiques entre un nombre fini de fonctions analytiques [715].
Algèbre différentielle
• L’étude et la traduction d’œuvres posthumes de Jacobi en latin, entreprise à partir de 2003
par Ollivier a été poursuivie et a donné lieu à deux publications en anglais, incluant des
fragments inédits retrouvés dans les archives de l’académie des sciences de Berlin [722,
723]. Ces documents fournissent des pistes intéressantes pour améliorer la complexité de
la résolution de systèmes différentiels. Un article ancien, demeuré inédit et à la base du
package Diffalg de Maple a été publié dans le même volume [704]. Une présentation des
résultats de Jacobi et de leur postérité a été faite au congrès DART II en 2007. La publication
du texte initialement rédigé en 2008 et longtemps différée, doit avoir lieu en juin 2013. Ceci
a permis de nombreuses mises à jour, en particulier sur l’état de l’art [770].
• En collaboration avec D’Alfonso, Jeronimo et Solernó de l’Université de Buenos Aires, ainsi
que Sedoglavic du Laboratoire d’Informatique Fondamentale de Lille, un premier algorithme inspiré de la méthode Kronecker a été mis au point pour les systèmes différentiels
ordinaires [705].
VIII.2.2. THÈMES DE RECHERCHE
289
• Par ailleurs, van der Hoeven a montré que le produit de deux opérateurs différentiels
linéaires dans [x, ∂] coûte asymptotiquement aussi cher que le produit matriciel à des facteurs logarithmiques près [735] (collaboration avec Benoit et Bostan). Les coûts des autres
opérations élémentaires sur ces opérateurs ont aussi été améliorés dans [805].
Intégrales premières à la Liouville, dérivations des algèbres de polynômes
• Nowicki et Moulin Ollagnier ont présenté [726] de nouveaux exemples de dérivations homogènes de l’anneau de polynômes k[X] = k[x1 , · · · , xn ] sur un corps k de caractéristique 0
sans polynôme de Darboux.
• Toujours en collaboration avec Nowicki, Moulin Ollagnier a caractérisé [727] une classe
importante de dérivations monomiales sans aucun polynôme de Darboux ; ils donnent en
particulier une classification complète de toutes les dérivations monomiales de k[x, y, z]
sans polynôme de Darboux.
• Nowicki et Moulin Ollagnier ont rédigé [728] un premier article dans lequel ils étudient la
dérivation de Jouanolou Jn,1 sur K[x0 , · · · , xn−1 ] (c.à.d. la dérivation d telle que d(xi ) = xi+1
pour i = 0, . . . , n − 2, et d(xn−1 ) = x0 ) et la dérivation factorisée associée FJn,1 qui ont de
nombreuses constantes.
Automatique et traitement du signal Les méthodes algébriques en automatique et signal ont
continué à se développer. Il convient de souligner avant tout les succès impressionnants de
la commande sans modèle, développée par Fliess et Cédric Join (MdC à l’université de Lorraine) [711, 710], succès dus aux méthodes d’estimation rapide découvertes au début des années
2000. Cette commande sans modèle permet, comme son nom l’indique, de réguler un dispositif sans nécessité d’en écrire une modélisation mathématique, à la fois précise et maniable, ce qui, dans la plupart des situations industrielles réelles est une gageure impossible. Le
système inconnu est approché pendant un cours laps de temps, par un modèle ultra-local, très
simple à un seul paramètre inconnu, estimé en temps réel. Lancée en 2006, cette approche
a connu non seulement une progression théorique notable (amélioration et simplification des
techniques d’estimation, explication du choix quasi-universel d’un modèle ultra-local d’ordre 1,
explication conceptuelle du rôle prédominant aujourd’hui dans l’industrie des régulateurs dits
proportionnels-intégraux-différentielles, ou PID, en dépit de réglages fort complexes et de performances trop souvent médiocres). Les applications nombreuses, facilités, par des correcteurs
PID, dits intelligents, dont le réglage est immédiat ont touché les domaines les plus divers, des installations hydro-électriques, au trafic autoroutier, en passant diverses questions concernant les
automobiles, la robotique et les paliers magnétiques [729, 724, 730, 794, 793]. Pour des raisons
expérimentales évidentes, elles ont toujours été effectuées en collaboration avec des industriels,
des universitaires, ou des administrations. Plusieurs ont été réalisées à l’étranger. En résumé,
la commande sans modèle représente, tant par la vision théorique renouvelée qu’elle porte, que
par sa puissance applicative, une révolution épistémologique.
Quant au signal, on insistera ici sur la détection de ruptures, c’est-à-dire de changements
brusques et violents, développée par Fliess, Cédric Join et Mamadou Mboup (professeur à l’université
de Reims) [712, 725]. C’est un sujet qui a suscité une littérature abondante, où méthodes statistiques et autres, comme les ondelettes, ont été utilisées. Nos techniques algébriques d’estimation
ont donné, dans les nombreuses simulations numériques déjà faites, des résultats bien supérieurs.
Ingénierie Financière Dans la théorie des bruits de Fliess, datant de 2006, ceux-ci apparaissent comme des fluctuations rapides. On peut alors poser les fondements d’une nouvelle approche des séries temporelles, ou chroniques, qu’on a orientée vers l’ingénierie financière. Fliess
et ses collaborateurs ont pu ainsi montrer rigoureusement, pour la première fois, l’existence de
tendances (on emploie souvent la traduction anglaise trend), utilisées par bien des praticiens,
alors que la quasi-totalité des théoriciens de la finance rejettent ladite existence. La fin de
cette querelle qui a duré plusieurs dizaines d’années s’accompagne d’algorithmes efficaces non
seulement pour déterminer les tendances, mais aussi les volatilités, qui reçoivent une définition
beaucoup plus claire. Fliess et ses collaborateurs ont aussi mis au point de nouveaux indicateurs [747, 748, 746, 744, 745].
VIII.2.3
Logiciels
GNU TEXmacs van der Hoeven, Raux et Poulain développent le logiciel GNU TEXmacs (http:
//www.texmacs.org), qui est un éditeur de texte scientifique libre et portable avec de multiples
interfaces pour des logiciels scientifiques existants. Il fournit un éditeur de texte mathématique
tel-écran-tel-écrit (wysiwyg) d’une qualité typographique professionelle. D’autres fonctionnalités
(images, mode de présentations, tableur, convertisseurs LaTeX, Html, édition sémantique, etc)
sont aussi présentes [807, 718, 819].
Mathemagix van der Hoeven et Lecerf développent le logiciel libre Mathemagix (http://www.
mathemagix.org) permettant à la fois la manipulation exacte d’objets de nature algébrique et
analytique. Au cours des projets ANR et Digiteo MaGiX, un nouveau langage de programmation
mathématique haut niveau a été développé pour ce système, avec un compilateur, un interpréteur
et des librairies de calcul [791, 720, 760]. Nous avons également mis en place une infrastructure
informatique organisée autour de plusieurs machines essentiellement virtuelles pour faciliter la
portabilité de nos logiciels.
VIII.2.4
GNU TEXmacs Une nouvelle version multi-plateformes du logiciel GNU TEXmacs, entièrement
remodelée sur la librairie graphique Qt a été produite grâce, en particulier, aux financements
de l’ANR et Digiteo. TEXmacs est distribué depuis longtemps via de nombreuses distributions
Linux. Les versions pour Mac OS X et Windows sont téléchargeables depuis le site www.texmacs.
org hébergé dans notre unité, via les infrastructures de l’INRIA Saclay.
Factorisation de polynômes Nous avons montré comment réduire efficacement les problèmes
de factorisation des polynômes creux à deux variables au cas dense, en fonction du volume du
polygone de Newton du support.
Opérateurs différentiels Nous avons conçu un algorithme quasi-optimal pour le produit des
opérateurs différentiels linéaires.
Géométrie algébrique réelle Nous avons conçu un algorithme intrinsèque pour trouver un
point par composante connexe réelle d’un fermé algébrique.
Commande sans modèle Notre nouvelle théorie de la commande sans modèle a connu des
succès théoriques et pratiques et a conduit à de nombreuses applications dont deux brevets
(aménagement hydroélectrique et trafic autoroutier). Michel Fliess a reçu le prix de l’innovation
(catégorie brevet) de l’École polytechnique pour son brevet sur les aménagements hydroélectriques.
VIII.2.5
Les membres de l’équipes MAX sont impliqués régulièrement dans l’organisation des colloques
majeurs de leurs domaines, aussi bien sur le plan international (AAECC, Calculemus, DART,
ICMS, ISSAC, MEGA, etc . . . ) que sur le plan national au sein des JNCF (Journées Nationales
VIII.2.6. FONCTIONNEMENT INTERNE
291
de Calcul Formel, école thématique CNRS). Les divers financements reçus ont aussi permis
l’organisation de quatre Workshops.
Concernant les activités éditoriales, soulignons que Marc Giusti est éditeur en chef exécutif
du journal Applicable Algebra in Engineering, Communication and Computing publié par Springer
Verlag. Michel Fliess est membre des comités éditoriaux de Forum mathematicum publié par De
Gruyter, et de Journal of Applied Mathematics publié par Hindawi Publishing Corporation.
L’équipe est par ailleurs très fière des récompenses obtenues par ses membres :
• Michel Fliess a reçu le prix de l’innovation (catégorie brevet) de l’École polytechnique pour
un brevet sur les aménagements hydroélectriques.
• Romain Lebreton a reçu le prix du meilleur article étudiant à la conférence internationale
ISSAC’12.
• Romain Lebreton a reçu le prix du meilleur poster de la part du “Fachgruppe Computer
Algebra” lors de la conférence internationale ISSAC’12.
VIII.2.6
Le total des financements externes obtenus aux travers des projets dans lesquels se sont impliqués
les membres de l’équipe MAX s’élève à environ 570 000 euros, ayant permis de financer plusieurs
workshops, environ 4 années de postes d’ingénieur recherche en CDD, ainsi que de nombreuses
invitations et missions et les infrastructures informatiques propres à l’équipe (plus d’une demiebaie de serveurs). Ces sources de financements sont variées puisque venant principalement d’un
projet européen, d’un projet ANR et d’un projet Digiteo.
Nous animons par ailleurs un séminaire en commun avec l’équipe Specfun de l’INRIA Saclay.
VIII.2.7
Giusti et Lecerf sont intervenus dans le cours Algorithmes efficaces en calcul formel du master
parisien de recherche en informatique (MPRI).
van der Hoeven et Lecerf ont donné des mini-cours lors de Journées Nationales de Calcul
Formel (école thématiques CNRS). Lecerf est aussi intervenu dans une école d’été organisée par
le CIMPA.
Les deux thèses soutenues dans l’équipe ont été financées en totalité par des bourses Gaspard
Monge de l’École polytechnique.
VIII.2.8
Création d’entreprise
La société AL.I.E.N. (acronyme de ALgèbre pour Identification et Estimation Numériques) a été
fondée à la toute fin de l’année 2011 par Cédric Join et Michel Fliess, après avoir obtenu, en
2011, le prix OSEO dans la catégorie émergence. C’est une spin-off de l’École polytechnique et
de l’université de Lorraine. À Polytechnique, l’aide de la DRIP a été particulièrement précieuse.
À Nancy, l’incubateur lorrain s’est beaucoup dépensé pour assurer son démarrage. Elle a pour
but de commercialiser les techniques d’automatique et de signal, dont il est question ici. La
commande sans modèle est, aujourd’hui, son produit phare.
VIII.3 Projet de recherche : Modélisation
VIII.3.1
Traditionnellement, l’équipe MAX couvre un grand nombre de sous domaines du calcul formel,
comme la résolution des systèmes polynomiaux, la complexité algébrique, l’algèbre différentielle,
la théorie de Galois, les applications à l’automatique, etc. En outre, l’équipe a toujours été
présente dans l’organisation de la communauté du calcul formel, notamment via le centre de
calcul Medicis.
Depuis le recrutement de J. van der Hoeven en 2009, comme DR CNRS, puis les mutations de
G. Lecerf et D. Raux vers le LIX, les thèmes de recherche ont évolué, mais l’esprit de transversalité
et de centre de services demeure. Les évolutions les plus notables concernent l’apparition du
nouveau thème de calcul analytique, et un investissement plus lourd dans le développement
d’une arithmétique de base efficace pour le calcul formel. Par ailleurs, les services de calcul
s’appuient davantage sur les logiciels GNU TEXmacs et Mathemagix, développés principalement
au sein de notre équipe.
Depuis septembre 2013, Bruno Grenet est postdoctorant au sein de l’équipe MAX, financé
par une bourse LIX/Qualcomm. Son travail de recherche concerne des questions d’informatique
théorique liées aux classes de complexité et aux bornes inférieures d’algorithmes sur les matrices
et polynômes à plusieurs variables.
VIII.3.1.1
Algorithmes fondamentaux pour le calcul formel
Lecerf compte travailler sur les questions de complexité liées aux calculs usuels dans les anneaux
locaux (principalement l’élimination, normalisation et factorisation), ainsi que sur de nouveaux
algorithmes pour la décomposition primaire des idéaux dans les anneaux de polynômes par
des méthodes en évaluation. La résolution des systèmes algébriques complexes et réels restera
néanmoins une préoccupation de tout premier plan pour Lecerf et Giusti, tant sur les aspects
liés à la complexité asymptotique que sur les performances pratiques de leurs logiciels. Van
der Hoeven et Lecerf espèrent aussi pouvoir mettre en place davantage d’interactions entre les
méthodes symboliques et celles numériques, propres au calcul analytique effectif.
La conception d’algorithmes efficaces pour le calcul formel s’appuie en grande partie sur le
développement d’une arithmétique rapide sur des objets mathématiques de base, comme les
grands entiers, les polynômes, les matrices, les séries formelles, les opérateurs différentiels, etc.
Van der Hoeven et Lecerf continueront leurs travaux sur ces sujets.
VIII.3.1.2
Algorithmes fondamentaux pour le calcul analytique
De la même manière que le calcul formel vise la manipulation exacte d’objets mathématiques
de nature algébrique, le calcul analytique vise la conception d’algorithmes fiables pour calculer
avec des objets plus analytiques, comme l’intégration de systèmes dynamiques ou la résolution
d’un système d’équations analytiques.
Ici, la fiabilité est une contrainte essentielle, ce qui distingue le calcul analytique du calcul
numérique plus classique. D’une part, cela nécessite de repenser des algorithmes numériques
classiques afin de rester efficace en précision multiple. D’autre part, cela nécessite l’utilisation
des méthodes de certification venant de l’arithmétique d’intervalles. Enfin, une réflexion de
nature plus logique sur ce qui est calculable est parfois nécessaire. Nous comptons poursuivre
nos travaux sur ce sujet, qui faisaient également l’objet des projets ANR et Digiteo MaGiX.
VIII.3.1.3
Résolution de systèmes polynomiaux invariants sous un groupe
Les travaux actuels de Colin et Giusti concernent l’algèbre des invariants polynomiaux sous un
sous-groupe fini, avec pour but ultime la résolution de systèmes invariants sous un groupe fini.
293
294CHAPTER VIII.3. PROJET DE RECHERCHE : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE
VIII.3.1.4
Résolution réelle des systèmes polynomiaux
Un très grand projet consiste à déterminer la topologie des variétés algébriques réelles, au delà
de simples éléments de réponse tel le premier nombre de Betti. Bien évidemment, comme dans
les travaux de Bank, Giusti, Heintz et Pardo, nous demandons une algorithmique efficace, ne
dépendant que de quantités intrinsèques.
VIII.3.1.5
Résolution des systèmes différentiels
Les travaux entrepris dans le cadre du projet LEDA ouvrent la voie à d’autres problématiques :
après avoir cherché à borner la complexité de la mise en forme normale, en particulier grâce à
la borne de Jacobi, on peut tenter de chercher un changement de variable permettant d’abaisser
l’ordre du système ou la complexité d’évaluation des expressions.
La première problématique inclut la question de la platitude différentielle, dont l’intérêt
en automatique est important. Ces questions sont abordées dans le cadre du projet SIMCA, à
travers le problème de Lüroth et ses avatars différentiels, comme endogène = exogène dont une
version effective dans les coordonnées d’origine du système fournirait une borne sur les sorties
linéarisantes, montrant la décidabilité de la platitude.
VIII.3.1.6
Développement de méthodes diverses en automatique et traitement du signal
La commande sans modèle et les correcteurs intelligents associés doivent pour confirmer qu’ils
constituent une révolution conceptuelle, aux conséquences pratiques considérables, encore relever
quelques défis, dont le plus important est, pour Fliess, la présence de retards. Plus qu’à une solution mathématique générale, difficile à imaginer sans modèle mathématique précis, Fliess pense
que l’étude de quelques exemples concrets, bien choisis, permettra de mieux comprendre empiriquement de quoi il retourne.
Quant au signal, Fliess souhaiterait trouver des exemples pratiques qui démontrent la robustesse de ses techniques pour des bruits forts.
D’autre part F. Ollivier envisage le développement d’une librairie Mathemagix dédiée à l’automatique algébrique et fournissant une boı̂te à outils pour tester les propriétés structurelles des
systèmes (observabilité, commandabilité, etc.) ainsi que des tests de platitude et des outils pour
construire les sorties linéarisantes dans les cas couverts par la littérature.
VIII.3.1.7
Refondation de la théorie des séries temporelles
Les séries temporelles ont été précédemment évoquées dans la partie pour l’ingénierie financière.
Fliess prévoit de fournir un effort considérable pour aborder de façon plus générale les bases de
données, très souvent représentées par de telles séries. Des résultats préliminaires prometteurs,
non encore publiés, devraient faire avancer ce domaine de l’informatique, en extension rapide.
VIII.3.1.8
Logiciels de calcul formel et analytique
van der Hoeven et Lecerf continueront de développer le logiciel Mathemagix pour le calcul
numérique et formel. D’une part en consolidant les librairies actuelles écrites en C++, et d’autre
part en améliorant le compilateur et l’interprète pour le language de programmation Mathemagix. Il devrait être ensuite possible de porter les librairies C++ en Mathemagix, de sorte à
gagner en clarté de programmation, généralité, et efficacité. Un soin particulier sera aussi porté à
la conception d’un environnement de calcul symbolique rigoureux (le logiciel Caas actuellement
dans la distribution de Mathemagix) destiné à des besoins en enseignement couvrant essentiellement le programme de CAPES de mathématiques.
VIII.3.2. MISE EN ŒUVRE
VIII.3.1.9
295
Plateforme d’édition et de calcul scientifiques
Dans les années 1990, plusieurs membres de l’équipe MAX actuelle ont contribué à la création
d’un centre de ressources matérielles et humaines pour le calcul formel hébergé à l’École polytechnique, et appelé Medicis (http://www.medicis.polytechnique.fr/). Ce centre était ouvert
librement au monde académique, c’est-à-dire aux scientifiques ayant besoin d’effectuer des calculs intensifs, principalement formels. D’une façon plus large, ce centre a aussi joué un rôle
très important dans l’animation scientifique pour la communauté française puis européenne de
calcul formel, notamment durant ces dernières années, au travers du projet européen SCIEnce
(Symbolic Computation Infrastructure for Europe).
Depuis le recrutement de J. van der Hoeven en 2009, comme DR CNRS, puis les mutations
de G. Lecerf et D. Raux vers le LIX, une nouvelle thématique de recherche et de développement
de logiciels pour l’édition et le calcul scientifique s’est développée avec les aides conjointes de
l’ANR et Digiteo (DIM), via un projet appelé MaGiX (Mathématiques, Analyse, Géométrie, Interface, eXactes). Dans les années avenir nous prévoyons d’orienter le développement de Medicis
vers une plateforme offrant des services originaux et innovants, via Internet, pour le travail collaboratif et l’utilisation de ressources de calcul d’une façon pérenne.
Une partie de ces développements se feront par l’intégration de nouvelles fonctionnalités
dans le logiciel d’édition scientifique libre GNU TeXmacs, afin de faire évoluer ce logiciel vers
une suite bureautique scientifique complet. Ceci inclut une approche plus centrée sur le web,
avec des possibilités d’édition collaboratives interactives. D’autre part, nous visons à mettre en
place un cluster de machines virtuelles pour faire des calculs scientifiques à distance, et pour
rédiger des articles et des livres, avec des contenus interactifs pérennes.
Le logiciel TeXmacs contient de nombreuses interfaces pour d’autres logiciels, ce qui conduit
à de nombreux défis et opportunités de collaborations. Un exemple récent est le projet DoCoq
qui vise à créer un nouveau type d’interface graphique pour le logiciel Coq. Ce projet vient de
recevoir un financement de 51000 EUROS pour une durée d’un an via le contrat Digiteo 20130607D, commençé en septembre 2013. Le responsable de ce projet est van der Hoeven et le
co-responsable est Enrico Tassi du projet INRIA SpecFun. Ce financement nous permet l’emploi
en Post-Doc de François Poulain.
VIII.3.2
Mise en œuvre
Traditionnellement, l’équipe MAX est très impliquée dans l’animation de la communauté du
calcul formel en France et au delà, via le centre de calcul Medicis, l’organisation de conférences
(comme ICMS 2010, ISSAC 2012, et MEGA 2013) et de workshops, des responsabilités éditoriales,
ainsi que divers collaborations nationales et internationales (comme les collaborations récentes
au sein des projets ANR Gecko, MaGiX et LEDA, et le projet européen Science). Dans les années
à venir nous comptons maintenir ces activités. Plusieurs nouvelles demandes ANR sont notamment en cours, qui nous permettront d’organiser de nouveaux événements scientifiques.
Concernant le centre de calcul Medicis, plusieurs concepts seront à la base de sa réorganisation :
utilisation de logiciels libres, interface simple et conviviale pour l’utilisateur non informaticien,
rapidité d’affichage des résultats, reproductibilité des calculs dans le temps, configuration à la
demande. Le cluster Medicis, déjà en cours de renouvellement, sera constitué de machines tournant sous Scientific Linux et proposant exclusivement des logiciels de calcul libres. Notre logiciel
GNU TEXmacs permettra, à distance, et de façon ergonomique, de lancer différentes sortes de calculs et d’incorporer les résultats de façon transparente dans un document. L’utilisateur se verra
proposer l’utilisation de différents types de machines virtuelles, selon ses besoins. Il est aussi
prévu que l’utilisateur puisse ajouter des logiciels à une machine donnée et même récupérer ces
machines, après passage dans une chaı̂ne de configuration sortante, pour les exécuter sur son
propre matériel. Le fonctionnement sera assuré par deux machines frontales (une principale et
une de secours), et d’un ensemble de nœuds de calculs.
296CHAPTER VIII.3. PROJET DE RECHERCHE : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE
297
en
ac
es
F
fa ina
• tiv ibl nce
L it es m
tâ a d é s po en
• m ch ive cie ur ts
Fl en es rsi nti m réc
ux te a té fiq ai u
d’ nt dm et ue nte rre
ét
in la r ni nt
é
is
ud
tr qu gu r un s tr
ia
at a liè e o
nt
i
ve nti re a p
s
cs té
in
au d
ce
rt
g- e
ai
n
M
NEGATIF
s
•
At
ou
ts
es
ss
•
•
R
l’ en
Re équ om
te n ip m
• si ch om e e ée
Vi gn niq mé n int
• ci sib al ue e cal ern
s int cu at
C el ili
en er l io
• re om GN té i
n
p
c
U
au na form na
P h l
t
to tio e le
re rés erc ém TE X ern
m na l de
ch en h en m at
at le
er ce e e ta ac io
iq d
ch d n rit s na
ue es
le
e ’u ca é
et
pe n lc de
d
u
rm ing ul s t
lo
an én fo hè
g
ien ieu rm me
t r el s
de
de
le
ib
Fa
ue
iq
at rm lo s
fo b re
in ue v ite
é iq œu (s
ly
rit hn e e
po
cu ec is ign
e
au
sé olyt la m n l c) ´ col urs ive
de e p ur s e , et l’E sie n n
es ol o ice ls à lu o
gl Éc s p rv cu nt p s b
Rè l’ te se al na gré trè
• de an os t, c eig al e
qu e n rne ns e m s d
d te d’e qu ure
In s ni at
Pa ch id
• te and
c
té
ni
tu
or
pp
c)
et un
e s,
ip oc sur e
qu td r m
l’é pos uye com nos
de
de s, pp ic er
t
l
a
s
ité en s’ ub ris
pe
tiv m de p alo
ui
es r es
d
v
ac he
éq
qu su u r
tr c lité an ur
ifi s tiq ie
es
At éta ibi gr po
tr
nt ité a al
• (d oss ciel cs
ie rs pr , p
au
sc ive es ier
P gi a
d’
• lo Xm aux ité au ns un iqu out
T E av im ive tio es hn or .
tr ox n ra rs ec ut e)
Pr ut bo ive s t a err
• ha olla c d int afic , s
C e po (tr ue
• av s is tiq
de réc né
p ag
m
O
A F
O M
POSITIF
VIII.4 Analyse AFOM : Modélisation
INTERNE
EXTERNE
Figure VIII.4.1: Analyse AFOM de l’équipe Modélisation Algébrique et Calcul Symbolique :
Atouts, Faiblesses, Opportunités, Menaces
298CHAPTER VIII.4. ANALYSE AFOM : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE
VIII.5 Fiche résumé : Modélisation
VIII.5.1
Membres
Composition actuelle de l’équipe 5 chercheurs CNRS, 1 enseignant-chercheur, 1 ingénieur de
recherche CNRS, 1 ingénieur de recherche en CDD.
Départ de membres de l’équipe Jérémy Berthomieu (ATER à l’université de Versailles, puis
MCF à Paris 6), Romain Lebreton (Postdoctorant au LIRMM à Montpelier).
Nouveaux membres Joris van der Hoeven (DR CNRS), Grégoire Lecerf (CR CNRS), Denis Raux
(IR CNRS).
VIII.5.2
Résultat 1 Nouvelle version multi-plateformes du logiciel GNU TEXmacs, entièrement remodelée
sur la librairie graphique Qt.
Résultat 2 Réduction des problèmes de factorisation des polynômes à deux variables au cas
dense, en fonction du volume du polygone de Newton du support.
Résultat 3 Algorithme quasi-optimal pour le produit des opérateurs différentiels linéaires.
Résultat 4 Algorithme intrinsèque pour trouver un point par composante connexe réelle d’un
fermé algébrique.
Résultat 5 Succès théoriques et pratiques de la commande sans modèle, et nombreuses applications dont deux brevets (aménagement hydroélectrique et trafic autoroutier)
VIII.5.3
VIII.5.3.1
Publications
Journaux : 40
Conférences invitées : 10
Brevets : 2
Créations d’entreprises : 1
Logiciels : 2
5 productions scientifiques marquantes :
• J. van der Hoeven et al., logiciel GNU TEXmacs, http://www.texmacs.org.
• J. Berthomieu et G. Lecerf. Reduction of bivariate polynomials from convex-dense to dense,
with application to factorizations. Math. Comp., 81(279), 2012.
• A. Benoit, A. Bostan et J. van der Hoeven. Quasi-optimal multiplication of linear differential
operators. In Proc. FOCS’12, pages 524–530, New Brunswick, October 2012. IEEE.
• Bernd Bank, Marc Giusti, et Joos Heintz. Point searching in real singular complete intersection
varieties-algorithms of intrinsic complexity. Accepté pour publication dans Math. Comp.
299
300CHAPTER VIII.5. FICHE RÉSUMÉ : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE
• M. Fliess, H. Abouaissa et C. Join. Procédé de régulation d’un trafic sur un axe principal de
circulation, système et produit programme d’ordinateur correspondants.
Brevet PCT/EP2012/053354,2012. École polytechnique, Université de Lorraine, Université
d’Artois, Centre National de la Recherche Scientifique.
VIII.5.3.2
Rayonnement
Durant ces cinq dernières années, l’équipe MAX s’est illustrée par l’obtention de plusieurs financements de projets, dont un européen, ayant permis l’organisation de diverses rencontres et
workshops. Plusieurs membres de l’équipe sont aussi intervenus dans l’organisation des principales conférences internationales dans leurs domaines (DART, ISSAC, ICMS, MEGA, Calculemus). Le rayonnement de l’équipe MAX sur le plan international a aussi été marqué par 33
invitations à donner des exposés dans des conférences de premier plan, et aussi par les deux prix
attribués à Lebreton lors de la conférence ISSAC 2012.
Les logiciels GNU TEXmacs et Mathemagix ont leurs sites Internet et listes de discussions
hébergés dans notre unité. Soulignons que TEXmacs est présent par défaut dans la grande majorité des distributions Linux. Des paquets binaires pour Windows et Mac OS X sont disponibles
depuis nos sites Internet, ainsi que des vidéos pour prendre en main rapidement le logiciel.
VIII.5.3.3
Lecerf a participé à l’organisation des Journées Nationales de Calcul Formel en 2010 et 2011,
qui réunissent tous les 18 mois une très grande majorité des chercheurs et doctorants en calcul
formel en France (http://jncf.math.cnrs.fr). Ces journées sont une école thématique CNRS,
qui comporte des mini-cours et des exposés donnés essentiellement par des jeunes chercheurs.
Van der Hoeven y a donné un cours en 2011 et Lecerf en 2013.
Par ailleurs, Lecerf a donné un cours de 12h à une école d’été organisée par le CIMPA en
Indonésie en 2011.
L’équipe MAX (Giusti puis Lecerf) est aussi intervenue tous les ans dans le cours Algorithmes
efficaces en calcul formel du master parisien de recherche en informatique (MPRI).
VIII.6 Production scientifique :
Modélisation Algébrique et Calcul Symbolique
VIII.6.1
[685] Carlos D’Andrea, Marc Giusti, Luis Miguel Pardo, and Ragni Piene, editors. Effective
methods in algebraic geometry - MEGA 2009: Barcelona, volume 45 of Journal of Symbolic
Computation, Elsevier, Special Issue. Selected papers from and related to MEGA 2009, 2010.
Held in Barcelona, June 15–19, 2009.
[686] Michel Fliess and Hebertt Sira-Ramirez. Closed-loop parametric identification for
continuous-time linear systems via new algebraic techniques. In H. Garnier & L. Wang,
editor, Identification of Continuous-time Models from Sampled Data, Advances in Industrial
Control, pages 362–391. Springer, 2008.
[687] K. Fukuda, J. van der Hoeven, M. Joswig, and N. Takayama, editors. Mathematical Software - ICMS 2010, Third International Congress on Mathematical Software, Kobe, Japan,
September 13-17, 2010. Proceedings, volume 6327 of Lecture Notes in Computer Science.
Springer, 2010.
[688] Marc Giusti and Pierre Rouchon, editors. Special issue dedicated to Professor Michel Fliess,
volume 81 of Internat. J. Control, Taylor & Francis, 2008.
[689] J. van der Hoeven and M. van Hoeij, editors. International Symposium on Symbolic and
Algebraic Computation 2012 (ISSAC 2012), Grenoble, France, 2012. ACM Press.
[690] E. Kaltofen and G. Lecerf. Handbook of Finite Fields, chapter Factorization of multivariate
polynomials. CRC Press, 2013.
VIII.6.2
[691] A. Bostan, F. Chyzak, M. Giusti, R. Lebreton, G. Lecerf, B. Salvy, and É. Schost. Algorithmes efficaces en calcul formel, notes du cours 2-22 du MPRI, version de 2013.
https://wikimpri.dptinfo.ens-cachan.fr/doku.php?id=cours:c-2-22.
VIII.6.3
[692] M. Aschenbrenner, L. van den Dries, and J. van der Hoeven. Towards a model theory for
transseries. Notre Dame journal for formal logic, 54(3–4):279–310, 2013.
[693] Bernd Bank, Marc Giusti, and Joos Heintz. Point searching in real singular complete
intersection varieties-algorithms of intrinsic complexity. Math. Comp. (à paraı̂tre), 2013.
[694] Bernd Bank, Marc Giusti, Joos Heintz, Lutz Lehmann, and Luis Miguel Pardo. Algorithms
of intrinsic complexity for point searching in compact real singular hypersurfaces. Found.
Comput. Math., 12(1):75–122, 2012.
[695] Bernd Bank, Marc Giusti, Joos Heintz, and Luis Miguel Pardo. On the intrinsic complexity of point finding in real singular hypersurfaces. Inform. Process. Lett., 109(19):1141–
1144, 2009.
[696] Bernd Bank, Marc Giusti, Joos Heintz, and Luis Miguel Pardo. Bipolar varieties and real
solving of a singular polynomial equation. Jaen J. Approx., 2(1):65–77, 2010.
[697] Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din, and Eric Schost. On the
geometry of polar varieties. Appl. Algebra Engrg. Comm. Comput., 21(1):33–83, 2010.
301
302
BIBLIOGRAPHY
[698] Lotfi Belkoura, Jean-Pierre Richard, and Michel Fliess. Parameters estimation of systems
with delayed and structured entries. Automatica, 45(5):1117–1125, 2009.
[699] J. Berthomieu, P. Hivert, and H. Mourtada. Computing Hironaka’s invariants: Ridge and
Directrix. In Arithmetic, Geometry, Cryptography and Coding Theory 2009, volume 521 of
Contemp. Math., pages 9–20. Amer. Math. Soc., Providence, RI, 2010.
[700] J. Berthomieu, J. van der Hoeven, and G. Lecerf. Relaxed algorithms for p-adic numbers.
Journal de Théorie des Nombres de Bordeaux, 23(3):541–577, 2011.
[701] J. Berthomieu and G. Lecerf. Reduction of bivariate polynomials from convex-dense to
dense, with application to factorizations. Math. Comp., 81(279), 2012.
[702] J. Berthomieu, G. Lecerf, and G. Quintin. Polynomial root finding over local rings and
application to error correcting codes. À paraı̂tre dans Applicable Algebra in Engineering,
Communication and Computing, 2011.
[703] J. Berthomieu and L. M. Pardo. Spherical Radon transform and the average of the
condition number on certain Schubert subvarieties of a Grassmannian. J. Complexity,
28(3):388–421, 2012.
[704] François Boulier, Daniel Lazard, François Ollivier, and Michel Petitot. Computing representations for radicals of finitely generated differential ideals. Applicable Algebra in
Engineering, Communication and Computing, 20(1):73–121, 2009.
[705] Lisi D’Alfonso, Gabriela Jeronimo, François Ollivier, Alexandre Sedoglavic, and Pablo
Solernó. A geometric index reduction method for implicit systems of differential algebraic equations. J. Symb. Comput., 46(10):1114–1138, 2011.
[706] Carlos D’Andrea, Marc Giusti, Luis M. Pardo, and Ragni Piene. Effective methods
in algebraic geometry 2009: Barcelona. Guest editors’ foreword. J. Symbolic Comput.,
45(12):1251–1253, 2010. Held in Barcelona, June 15–19, 2009.
[707] T. DeVries, J. van der Hoeven, and R. Pemantle. Automatic asymptotics for coefficients
of smooth, bivariate rational functions. Online Journal of Analytic Combinatorics, 11:24,
2011.
[708] Michel Fliess. Critique du rapport signal à bruit en communications numériques –
Questioning the signal to noise ratio in digital communications. ARIMA (Revue africaine
d’informatique et de Mathématiques appliquées), 9:419–429, 2008.
[709] Michel Fliess, Stefan Fuchshumer, Markus Schöberl, Kurt Schlacher, and Hebertt SiraRamirez. An introduction to algebraic discrete-time linear parametric identification with
a concrete application. Journal Européen des Systèmes Automatisés, 42(2-3):210–232, 2008.
[710] Michel Fliess and Cédric Join. Commande sans modèle et commande à modèle restreint.
Revue électronique Sciences et Technologies de l’Automatique (e-STA), 5(4):1–23, 2008.
[711] Michel Fliess and Cédric Join. Model-free control. International Journal of Control, page
to appear, 2013.
[712] Michel Fliess, Cédric Join, and Mamadou Mboup. Algebraic change-point detection.
Applicable Algebra in Engineering, Communication and Computing, 21(2):131–143, 2010.
[713] Michel Fliess, Cédric Join, and Hebertt Sira-Ramirez. Non-linear estimation is easy. Int.
J. Modelling Identification and Control, 4(1):12–27, 2008.
[714] Marc Giusti and Pierre Rouchon. Foreword [Special issue dedicated to Professor Michel
Fliess]. Internat. J. Control, 81(3):333, 2008.
BIBLIOGRAPHY
303
[715] J. van der Hoeven. Guessing singular dependencies. Technical Report 2008-07, Université Paris-Sud, Orsay, France, 2008. Version améliorée à paraı̂tre dans J. Symbolic
Comput.
[716] J. van der Hoeven. Newton’s method and FFT trading. J. Symbolic Comput., 45(8):857–
878, 2010.
[717] J. van der Hoeven. Meta-expansion of transseries. J. Symbolic Comput., 46(4):339–359,
2011.
[718] J. van der Hoeven, A. Grozin, M. Gubinelli, G. Lecerf, F. Poulain, and D. Raux. GNU
TEXmacs: a scientific editing platform. ACM SIGSAM Communications in Computer Algebra, 47(2):59–62, 2013.
[719] J. van der Hoeven and G. Lecerf. On the bit-complexity of sparse polynomial multiplication. J. Symbolic Comput., 50:227–254, 2013.
[720] J. van der Hoeven, G. Lecerf, B. Mourrain, Ph. Trébuchet, J. Berthomieu, D. Diatta, and
A. Manzaflaris. Mathemagix, the quest of modularity and efficiency for symbolic and
certified numeric computation. ACM Commun. Comput. Algebra, 45(3/4):186–188, 2012.
[721] J. van der Hoeven and É. Schost. Multi-point evaluation in higher dimensions. Appl.
Algebra Engrg. Comm. Comput., 24(1):37–52, 2013.
[722] Carl Gustav Jacob Jacobi and François Ollivier. Looking for the order of a system of arbitrary ordinary differential equations. De investigando ordine systematis aequationum
differentialium vulgarium cujuscunque. Applicable Algebra in Engineering, Communication and Computing, 20(1):7–32, 2009.
[723] Carl Gustav Jacob Jacobi and François Ollivier. The reduction to normal form of a nonnormal system of differential equations. De aequationum differentialium systemate non
normali ad formam normalem revocando. Applicable Algebra in Engineering, Communication and Computing, 20(1):33–64, 2009.
[724] Cédric Join, John Masse, and Michel Fliess. Etude préliminaire d’une commande sans
modèle pour papillon de moteur – A model-free control for an engine throttle: a preliminary study. Journal Européen des Systèmes Automatisés, 42(2-3):337–354, 2008.
[725] Mamadou Mboup, Cédric Join, and Michel Fliess. Numerical differentiation with annihilators in noisy environment. Numerical Algorithms, 50(4):439–467, 2009.
[726] J. Moulin Ollagnier and A. Nowicki. Derivations of polynomial algebras without Darboux polynomials. Journal of Pure and Applied Algebra, 212:1626–1631, 2008.
[727] J. Moulin Ollagnier and A. Nowicki. Monomial derivations. Communications in Algebra,
39:3138—-3150, 2011.
[728] J. Moulin Ollagnier and A. Nowicki. Constants of cyclotomic derivations. Journal of
Algebra, 394:92–119, 2013.
[729] Jorge Villagra, Brigitte D’Andrea Novel, Sungwoo Choi, Michel Fliess, and Hugues
Mounier. Robust stop-and-go control strategy: an algebraic approach for nonlinear estimation and control. Int. J. Vehicle Autonomous Systems, 7(3/4):270–291, 2009.
[730] Jorge Villagra, Brigitte D’Andréa-Novel, Michel Fliess, and Hugues Mounier. Synthèse
algébrique d’estimateurs de vitesses longitudinale et latérale d’une automobile. Revue
électronique Sciences et Technologies de l’Automatique (e-STA), 5(3):12–27, 2008.
[731] Jorge Villagra, Brigitte D’Andrea Novel, Michel Fliess, and Hugues Mounier. A diagnosisbased approach for tire-road forces and maximum friction estimation. Control Engineering Practice, 19(2):174–184, 2011.
BIBLIOGRAPHY
304
VIII.6.4
[732] Hassane Abouaissa, Michel Fliess, Violina Iordanova, and Cédric Join. First steps towards a model-free control of a freeway traffic flow—Prolégomènes à une régulation
sans modèle du trafic autoroutier. In Conférence Méditerranéenne sur l’Ingénierie Sûre des
Systèmes Complexes, MISC 2011, Agadir, Maroc, May 2011. CDROM.
[733] Hassane Abouaissa, Michel Fliess, and Cédric Join. Fast parametric estimation for macroscopic traffic flow model. In Myung Jin Chung and Pradeep Misra, editors, 17th IFAC
World Congress, Seoul, République De Corée, 2008. International Federation of Automatic
Control.
[734] Lotfi Belkoura, Jean-Pierre Richard, and Michel Fliess. A convolution approach for delay systems identification. In Myung Jin Chung and Pradeep Misra, editors, 17th IFAC
World Congress, Séoul, République De Corée, 2008. International Federation of Automatic
Control.
[735] A. Benoit, A. Bostan, and J. van der Hoeven. Quasi-optimal multiplication of linear differential operators. In Proc. FOCS ’12, pages 524–530, New Brunswick, October 2012.
IEEE.
[736] J. Berthomieu and R. Lebreton. Relaxed p-adic Hensel lifting for algebraic systems. In
J. van der Hoeven and van Hoeij M., editors, Proc. ISSAC ’12, pages 59–66, Grenoble,
France, 2012. ACM.
[737] A. Bostan, M. Chowdhurry, R. Lebreton, B. Salvy, and É Schost. Power series solutions
of singular (q)-differential equations. In J. van der Hoeven and van Hoeij M., editors,
Proceedings of ISSAC’12, pages 107–114. ACM Press, 2012.
[738] Sungwoo Choi, Brigitte D’Andréa-Novel, Michel Fliess, Hugues Mounier, and Jorge Villagra. Model-free control of automotive engine and brake for Stop-and-Go scenarios. In
European Control Conference (ECC’09), Budapest, Hongrie, 2009. European Union Control
Association.
[739] Brigitte D’Andrea Novel, Clément Boussard, Michel Fliess, Oussama El Hamzaoui,
Hugues Mounier, and Bruno Steux. Commande sans modèle de la vitesse longitudinale
d’un véhicule électrique. In Sixième Conférence Internationale Francophone d’Automatique
(CIFA 2010), Nancy, France, 2010.
[740] Brigitte D’Andrea Novel, Michel Fliess, Cédric Join, Hugues Mounier, and Bruno Steux.
A mathematical explanation via ”intelligent” PID controllers of the strange ubiquity of
PIDs. In 18th Mediterranean Conference on Control and Automation, MED’10, Marrakech,
Maroc, June 2010.
[741] Jérôme De Miras, Samer Riachy, Michel Fliess, Cédric Join, and Stéphane Bonnet. Vers
une commande sans modèle d’un palier magnétique — First steps towards a modelfree control of a magnetic bearing. In Septième Conférence Internationale Francophone
d’Automatique, Grenoble, France, 2012. CDROM, SURFDIAG, CID.
[742] Michel Fliess and Cédric Join. Intelligent PID controllers. In 16th Mediterrean Conference
on Control and Automation, Ajaccio, France, 2008.
[743] Michel Fliess and Cédric Join. Time Series Technical Analysis via New Fast Estimation
Methods: A Preliminary Study in Mathematical Finance. In IAR-ACD08 (23rd IAR Workshop on Advanced Control and Diagnosis), Coventry, Royaume-Uni, 2008.
[744] Michel Fliess and Cédric Join. Systematic risk analysis: first steps towards a new definition of beta. In Cognitive Systems with Interactive Sensors (COGIS’09), PARIS, France,
2009.
BIBLIOGRAPHY
305
[745] Michel Fliess and Cédric Join. Towards New Technical Indicators for Trading Systems
and Risk Management. In 15th IFAC Symposium on System Identification (SYSID 2009),
Saint-Malo, France, 2009.
[746] Michel Fliess and Cédric Join. Delta Hedging in Financial Engineering: Towards a ModelFree Approach. In 18th Mediterranean Conference on Control and Automation, MED’10,
Marrakech, Maroc, June 2010. IEEE.
[747] Michel Fliess and Cédric Join. Preliminary remarks on option pricing and dynamic hedging. In 1st International Conference on Systems and Computer Science, Villeneuve d’Ascq,
France, August 2012. CDROM, SURFDIAG, CID.
[748] Michel Fliess, Cédric Join, and Frédéric Hatt. Volatility made observable at last. In
3èmes Journées Identification et Modélisation Expérimentale, JIME’2011, Douai, France,
April 2011. CDROM.
[749] Michel Fliess, Cédric Join, and Wilfrid Perruquetti. Real-time estimation for switched
linear systems. In 47th IEEE Conference on Decision and Control, Cancun, Mexique, 2008.
[750] Michel Fliess, Cédric Join, and Wilfrid Perruquetti. Real-time estimation of the switching
signal for perturbed switched linear systems. In 3rd IFAC Conference on Analysis and
Design of Hybrid Systems, ADHS’09, Zaragoza, Espagne, September 2009.
[751] Michel Fliess, Cédric Join, and Samer Riachy. Revisiting some practical issues in the implementation of model-free control. In 18th IFAC World Congress, IFAC WC’2011, Milan,
Italie, August 2011. CDROM.
[752] Francisco De Ası́s Garcı́a Collado, Brigitte D’Andréa-Novel, Michel Fliess, and Hugues
Mounier. Analyse fréquentielle des dérivateurs algébriques. In XXIIe Colloque GRETSI,
Dijon, France, 2009.
[753] M. Giusti. Efficient computation of square-free Lagrange resolvants. In DART 2008, in
memory of Giuseppa Carrà-Ferro, Mars 2008.
[754] M. Giusti. Efficient computation of square-free Lagrange resolvants. In AAECC in honour
of Jacques Calmet, Février 2008.
[755] M. Giusti. Variedades polares y bipolares. In EACA 2008 (XI Encuentro de Algebra Computacional y Aplicaciones), Granada, Espagne, Septiembre 2008.
[756] M. Giusti. Efficient computation of square-free Lagrange resolvents. In Joint Conference
of ASCM2009 and MACIS2009, December 2009. http://gcoe.math.kyushu-u.ac.jp/
ascm-macis2009.
[757] M. Giusti. Point searching in real singular complete intersection varieties-algorithms
of intrinsic complexity. In MACIS 2011 (Fourth International Conference on Mathematical
Aspects of Computer and Information Sciences), October 2011. http://macis2011.cc4cm.
org/.
[758] M. Giusti. Geometry associated to a finite subgroup and evaluation techniques. In MEGA
2013, Frankfurt am Main, Germany, May 3-7, 2013. http://www.math.uni-frankfurt.
de/mega2013/.
[759] J. van der Hoeven. Relaxed resolution of implicit equations. Conférence MEGA 2011,
Stockholm, Sweden, juin 2011.
[760] J. van der Hoeven. Overview of the Mathemagix type system. In Electronic proc. ASCM
’12, Beijing, China, October 2012. Available from http://hal.archives-ouvertes.fr/
hal-00702634.
306
BIBLIOGRAPHY
[761] J. van der Hoeven, R. Lebreton, and É. Schost. Structured FFT and TFT: symmetric and
lattice polynomials. In M. Monagan, G. Cooperman, and M. Giesbrecht, editors, Proc.
ISSAC’13, pages 355–362. ACM Press, 2013.
[762] J. van der Hoeven and G. Lecerf. On the complexity of blockwise polynomial multiplication. In J. van der Hoeven and van Hoeij M., editors, Proc. ISSAC ’12, pages 211–218,
Grenoble, France, July 2012.
[763] Cédric Join, Gérard Robert, and Michel Fliess. Model-free based water level control for
hydroelectric power plants. In IFAC Conference on Control Methodologies and Tecnologies
for Energy Efficiency, CMTEE, Vilamoura, Portugal, 2010.
[764] Cédric Join, Gérard Robert, and Michel Fliess. Vers une commande sans modèle pour
aménagements hydroélectriques en cascade. In Sixième Conférence Internationale Francophone d’Automatique, CIFA 2010, Nancy, France, 2010.
[765] R. Lebreton and É. Schost. Algorithms for the universal decomposition algebra. In J.
van der Hoeven and van Hoeij M., editors, Proceedings of ISSAC’12, pages 234–241. ACM
Press, 2012.
[766] Lghani Menhour, Brigitte D’Andréa-Novel, Clément Boussard, Michel Fliess, and
Hugues Mounier. Algebraic nonlinear estimation and flatness-based lateral/longitudinal
control for automotive vehicles. In ITSC-2011, Washington, États-Unis, October 2011.
CDROM, 6 pages.
[767] Lghani Menhour, Brigitte D’Andréa-Novel, Michel Fliess, and Hugues Mounier.
Commande couplée longitudinale/latérale de véhicules par platitude et estimation
algébrique. In Septième Conférence Internationale Francophone d’Automatique, Grenoble,
France, 2012. CDROM.
[768] Loı̈c Michel, Cédric Join, Michel Fliess, Pierre Sicard, and Ahmed Chériti. Model-free
control of dc/dc converters. In 12th IEEE Workshop on Control and Modeling for Power
Electronics (COMPEL), Boulder, Colorado, États-Unis, June 2010. IEEE.
[769] F. Ollivier. Jacobi’s bound and applications. upper bounds on the index of an ordinary
differential system and on the order of the inverse of a partial differential rational mapping. Conférence MEGA 2009, Barcelone, Catalogne, Mai 2009.
[770] François Ollivier. Jacobi’s bound and normal forms computations. In Li Guo and William
Y. Sit, editors, Differential Algebra and Related Topics II, Singapore, June 2013. World Scientific. ISBN: 978-981-2833-71-6.
[771] Samer Riachy, Michel Fliess, and Cédric Join. High-order sliding modes and intelligent
PID controllers: First steps toward a practical comparison. In 18th IFAC World Congress,
IFAC WC’2011, Milan, Italie, August 2011. CDROM.
[772] Samer Riachy, Michel Fliess, Cédric Join, and Jean-Pierre Barbot. Vers une simplification de la commande non linéaire : l’exemple d’un avion à décollage vertical. In
Sixième Conférence Internationale Francophone d’Automatique, CIFA 2010, Nancy, France,
June 2010. CDROM.
[773] R. Ushirobira, W. Perruquetti, M. Mboup, and M. Fliess. Algebraic parameter estimation
of a multi-sinusoidal waveform signal from noisy data. In European Control Conference,
Zurich, Suisse, April 2013.
[774] Rosane Ushirobira, Wilfrid Perruquetti, Mamadou Mboup, and Michel Fliess. Estimation
algébrique des paramètres intrinsèques d’un signal sinusoı̈dal biaisé en environnement
bruité. In Gretsi, Bordeaux, France, September 2011.
VIII.6.5. CONFÉRENCES NATIONALES
307
[775] Rosane Ushirobira, Wilfrid Perruquetti, Mamadou Mboup, and Michel Fliess. Algebraic
parameter estimation of a biased sinusoidal waveform signal from noisy data. In Sysid
2012, 16th IFAC Symposium on System Identification, Brussels, Belgique, 2012.
[776] J. van der Hoeven and G. Lecerf. Interfacing Mathemagix with C++. In M. Monagan, G.
Cooperman, and M. Giesbrecht, editors, Proc. ISSAC ’13, pages 363–370. ACM, 2013.
[777] Jorge Villagra, Brigitte D’Andréa-Novel, Michel Fliess, and Hugues Mounier. Estimation
of longitudinal and lateral vehicle velocities: an algebraic approach. In 2008 American
Control Conference, Seattle, États-Unis, 2008.
[778] Jorge Villagra, Brigitte D’Andréa-Novel, Michel Fliess, and Hugues Mounier. Robust
grey-box closed-loop stop-and-go control. In 47th IEEE Conference on Decision and Control, Cancun, Mexique, 2008.
[779] Jorge Villagra, Brigitte D’Andrea Novel, Michel Fliess, and Hugues Mounier. An algebraic approach for maximum friction estimation. In 8th IFAC Symposium on Nonlinear
Control Systems (NOLCOS), Bologna, Italie, 2010.
VIII.6.5
[780] Hassane Abouaissa, Michel Fliess, Violina Iordanova, and Cédric Join. Towards a Nonlinear Characterization of a Freeway Network — Vers une caractérisation non linéaire
d’un réseau autoroutier. In 3èmes Journées Identification et Modélisation Expérimentale,
JIME’2011, Douai, France, April 2011. CDROM.
[781] J. van der Hoeven. Calcul analytique. In G. Chèze, T. Cluzeau, G. Lecerf, and C. Pernet,
editors, Journées Nationales de Calcul Formel 2011, volume 2 of Les cours du CIRM. Cedram,
2011.
[782] G. Lecerf. Factorization des polynômes à plusieurs variables (Cours no. II). In G. Chèze,
P. Boito, C. Pernet, and M. Safey el Din, editors, Journées nationales de calcul formel, volume
3 of Les cours du CIRM, pages 1–85. Cedram, 2013.
VIII.6.6
[783] Hassane Abouaissa, Michel Fliess, Violina Iordanova, and Cédric Join. Freeway ramp
metering control made easy and efficient. In 13th IFAC Symposium on Control in Transportation Systems (CTS 2012), Sofia, Bulgarie, 2012. SURFDIAG, CID.
[784] Bernd Bank, Marc Giusti, and Joos Heintz. Polar, bipolar and copolar varieties: Real
solving of algebraic varieties with intrinsic complexity. In José Luis Monta na and Luis
M. Pardo, editors, Recent Advances in Real Complexity and Computation, volume 604 of
Contemp. Math., 2013. Issu du cours donné par M. Giusti à l’Escuela Santaló, Universidad
de Cantabria, Universidad Internacional Menéndez Pelayo, Real Sociedad Matemática
Espa nola; Recent Advances in Real Complexity and Computation 16 – 20 Juillet 2012,
Palacio de la Magdalena, UIMP, Santander, Cantabria, Espagne, http://santalo2012.
unican.es.
[785] Michel Fliess and Cédric Join. A mathematical proof of the existence of trends in financial
time series. In A. EL JAI, L. AFIFI, and E. ZERRIK, editors, Systems Theory: Modelling,
Analysis and Control, Etudes, pages 43–62, Fes, Maroc, 2009. Presses Universitaires de
Perpignan.
BIBLIOGRAPHY
308
[786] Michel Fliess and Cédric Join. Model-free control and intelligent PID controllers: towards a possible trivialization of nonlinear control? In 15th IFAC Symposium on System Identification (SYSID 2009), Saint-Malo, France, 2009. This communication is a
slightly modified and updated version of a paper by the same authors (Commande sans
modèle et commande à modèle restreint, e-STA, vol. 5 (4), pp. 1-23, 2008. Available at
http://hal.inria.fr/inria-00288107/en/), which is written in French.
[787] Michel Fliess, Cédric Join, and Frédéric Hatt. Is a probabilistic modeling really useful in
financial engineering? — A-t-on vraiment besoin d’un modèle probabiliste en ingénierie
financière ? In Conférence Méditerranéenne sur l’Ingénierie Sûre des Systèmes Complexes,
MISC 2011, Agadir, Maroc, May 2011.
[788] Michel Fliess, Cédric Join, and Samer Riachy. Nothing is as Practical as a Good Theory: Model-Free Control — Rien de plus utile qu’une bonne théorie : la commande sans
modèle. In 4èmes Journées Doctorales / Journées Nationales MACS, JD-JN-MACS, Marseille,
France, June 2011.
[789] M. Giusti. Plenary invited talk: A Gröbner free alternative to solving and a geometric
analogue to Cook’s thesis. In E. Kaltofen, editor, ISSAC 2009 (International Symposium on
Symbolic and Algebraic Computation), Seoul, Corée, pages 1–2. ACM, 2009.
[790] Marc Giusti and Jean-Claude Yakoubsohn. Tracking multiplicities. In José Luis Monta
na and Luis M. Pardo, editors, Recent Advances in Real Complexity and Computation, volume 604 of Contemp. Math., 2013. Issu du cours donné par J. C. Yakoubsohn à l’Escuela
Santaló, Universidad de Cantabria, Universidad Internacional Menéndez Pelayo, Real Sociedad Matemática Espa nola; Recent Advances in Real Complexity and Computation
16 – 20 Juillet 2012, Palacio de la Magdalena, UIMP, Santander, Cantabria, Espagne,
http://santalo2012.unican.es.
[791] G. Lecerf. Mathemagix: towards large scale programming for symbolic and certified
numeric computations. In K. Fukuda, J. van der Hoeven, M. Joswig, and N. Takayama,
editors, Mathematical Software - ICMS 2010, Third International Congress on Mathematical
Software, Kobe, Japan, September 13-17, 2010, volume 6327 of Lecture Notes in Computer
[792] Da-Yan Liu, Olivier Gibaru, Wilfrid Perruquetti, Michel Fliess, and Mamadou Mboup.
An error analysis in the algebraic estimation of a noisy sinusoidal signal. In 16th Mediterranean Conference on Control and Automation, Ajaccio, France, 2008.
VIII.6.7
Brevets
[793] M. Fliess, H. Abouaissa, and C. Join. Procédé de régulation d’un trafic sur un axe principal de circulation, système et produit programme d’ordinateur correspondants. Brevet
PCT/EP2012/053354, 2012. École polytechnique, Université de Lorraine, Université
d’Artois, Centre National de la Recheche Scientifique.
[794] M. Fliess, C. Join, A. Libaux, and G. Robert. Procédé de régulation d’un niveau dans un
aménagement hydraulique, système et produit programme d’ordinateur correspondants.
Brevet EP20090178957, EP2196886 B1, 2009. École polytechnique, Électricité de France.
VIII.6.8
Thèses
[795] J. Berthomieu. Contributions à la résolution des systèmes algébriques : réduction, localisation,
traitement des singularités ; implantations. PhD thesis, École polytechnique, 2011.
BIBLIOGRAPHY
309
[796] R. Lebreton. Contributions à l’algorithmique détendue et à la résolution de systèmes polynomiaux. PhD thesis, École polytechnique, 2012.
VIII.6.9
Logiciels
[797] J. van der Hoeven et al. Logiciel GNU TEXmacs. http://www.texmacs.org, 1998–2013.
Licence GNU GPLv3.
[798] J. van der Hoeven, G. Lecerf, B. Mourrain, et al. Logiciel Mathemagix. http://www.
mathemagix.org, 2002–2013. Principalement licence GNU GPLv2.
VIII.6.10
Rapports techniques
[799] Bernd Bank, Marc Giusti, Joos Heintz, Grégoire Lecerf, Guillermo Matera, and Pablo
Solernó. Degeneracy loci and polynomial equation solving. Technical report, Humboldt Universität zu Berlin, 2013. Prépublication Humboldt Universität zu Berlin,
http://www2.mathematik.hu-berlin.de/publ/pre/2013/P-13-08.pdf.
[800] Bernd Bank, Marc Giusti, Joos Heintz, and Mohab Safey El Din. Intrinsic complexity
estimates in polynomial optimization. Technical report, Humboldt Universität zu Berlin,
2013. Prépublication Humboldt Universität zu Berlin, http://www2.mathematik.huberlin.de/publ/pre/2013/P-13-07.pdf, and arXiv:1304.5214v1.
[801] Michel Fliess and Cédric Join. A model-free approach to delta hedging. Technical report,
Laboratoire d’informatique de l’école polytechnique - LIX , ALIEN - INRIA Saclay - Ile
de France/Inria Lille - Nord Europe , Centre de recherche en automatique de Nancy CRAN, February 2010. http://hal.inria.fr/inria-00457222.
[802] J. van der Hoeven. Relaxed resolution of implicit equations. Technical report, HAL, 2009.
http://hal.archives-ouvertes.fr/hal-00441977.
[803] J. van der Hoeven. Efficient root counting for analytic functions on a disk. Technical
report, HAL, 2011. http://hal.archives-ouvertes.fr/hal-00583139.
[804] J. van der Hoeven. From implicit to recursive equations. Technical report, HAL, 2011.
[805] J. van der Hoeven. On the complexity of skew arithmetic. Technical report, HAL, 2011.
[806] J. van der Hoeven. Reliable homotopy continuation. Technical report, HAL, 2011. http:
//hal.archives-ouvertes.fr/hal-00589948.
[807] J. van der Hoeven. Towards semantic mathematical editing. Technical report, HAL, 2011.
[808] J. van der Hoeven. Faster relaxed multiplication. Technical report, HAL, 2012. http:
//hal.archives-ouvertes.fr/hal-00687479.
[809] J. van der Hoeven. On the complexity of polynomial reduction. Technical report, HAL,
2012. http://hal.archives-ouvertes.fr/hal-00658704.
[810] J. van der Hoeven and G. Lecerf. Mathemagix User Guide. HAL, 2013. http://hal.
archives-ouvertes.fr/hal-00785549.
BIBLIOGRAPHY
310
VIII.6.11
Autres
[811] Antoine Colin and Marc Giusti.
Efficient computation of square-free Lagrange resolvants.
http://www.lix.polytechnique.fr/giusti/publications/
CoGi-2009-12-07.pdf.
[812] Michel Fliess, Hassane Abouaissa, Violina Iordanova, and Cédric Join. La commande
“sans modèle’ du trafic autoroutier. FLASH X – La revue scientifique de l’Ecole polytechnique, 14:25–28, 2012. Le texte en anglais, présenté en conférence plénière (librement
accessible sur http://hal-polytechnique.archives-ouvertes.fr/hal-00711847/en/) fournit
des explications plus complètes et une bibliographie indispensable. SURFDIAG, CID.
[813] J. van der Hoeven and G. Lecerf. MaGiX. Poster présenté au Forum Digiteo 2011, Octobre
2011.
[814] J. van der Hoeven and F. Poulain. Vidéos de présentation de GNU TEXmacs, 2012. Ces
vidéos ont été produites à l’issue d’exposés donnés au Workshop TEXmacs à Albufeira au
Portugal. Elles sont disponibles depuis http://www.texmacs.org.
[815] F. Ollivier. A non-algebraic Galois theory and flat systems. Poster présenté au Congrès
AMDS, Mai 2010.
[816] F. Ollivier. An overview of the SCIEnce Project. Poster présenté au Congrès DART IV,
Octobre 2010.
[817] F. Ollivier. Simultaneous proof of the dimensional conjecture and of Jacobi’s bound.
Poster présenté au Congrès DART IV, Octobre 2010.
[818] F. Ollivier. Flat difference systems. A definition, some properties and open problems.
Poster présenté au Congrès MEGA’2011, Mai 2011.
[819] F. Poulain, J. van der Hoeven, and G. Lecerf. GNU TEXmacs, une plate-forme scientifique
libre. Poster présenté au Forum Digiteo 2012, Novembre 2012.
VIII.7 Annexes : Modélisation Algébrique
et Calcul Symbolique
VIII.7.1
• Michel Fliess a été responsable du projet INRIA Alien (période 2004-2010).
• Marc Giusti
– est responsable de l’équipe MAX (Modélisation Algébrique et Calcul Symbolique)
(période 2005-2013).
– est membre du Conseil de Laboratoire (période 2005-2013).
VIII.7.1.1
SCIEnce (2006-2011) (Type: Projet européen) Titre: Symbolic computation infrastructure. Partenaires: St Andrew, LIX, etc. Responsable: Marc Giusti. Montant de la collaboration pour le
LIX: 194 320 euros.
Le projet européen SCIEnce (Symbolic Computation Infrastructure for Europe), FP6, Research Infrastructure action, I3 (Integrated Infrastructure Initiative), qui avait débuté en avril
2006, s’est achevé fin 2011. Ont participé à ce projet : the University of St Andrews, Écosse ; le
laboratoire LIX, CNRS, France ; the Computational Mathematics Group, Universität Kassel, Kassel, Allemagne ; the Discrete Algebra and Geometry group, Technische Universiteit Eindhoven,
Pays-Bas ; the Institute e-Austria Timisoara, Roumanie ; Maplesoft, Waterloo, Canada ; the Research Institute for Symbolic Computation, Linz, Austriche ; the Dependable Systems Research
Group, Heriot-Watt University, Edinburgh, Écosse ; the KANT group, Technische Universität
Berlin, Allemagne.
Marc Giusti a été responsable de la tâche ”Communication et Organisation Interne ” de ce
projet, avec un budget de 194 320 euros sur 5 ans. La coordination a été assuré par Steve Linton
(GAP, St Andrews).
Les journées de clôture ont été organisées à Polytechnique en décembre 2011. http://www.
medicis.polytechnique.fr/science/
SIMCA (2013-) (Type: Projet Math AmSud) Titre: Coopération avec l’Argentine et le Brésil.
Partenaires: LIX, Universidad de Buenos Aires, Escola Politécnica São Paulo.
Responsable:
François Ollivier. Montant de la collaboration pour le LIX: 3000 euros en 2013 (sur un total de
9000 euros en 2013).
Nous étudions les systèmes différentiels apparaissant dans la modélisation de phénomènes
physiques en recherchant des changements de variables permettant de les simplifier. Dans le cas
de systèmes sous-déterminés, nous cherchons à faire chuter la borne de Jacobi, en nous attachant
plus particulièrement au cas des systèmes plats. Afin de rechercher les sorties linéarisantes les
plus simples, nous étudions le théorème de Lüroth et ses généralisations. http://www.lix.
polytechnique.fr/õllivier/SIMCA/
VIII.7.1.2
LEDA (2010-2013) (Type: Projet ANR) Titre: Logistique des Equations différentielles algébriques.
Partenaires: IMT, LGC, LIFL et LIX. Responsable: François Ollivier. Montant de la collaboration
pour le LIX: 28000 euros (sur un total de 220000 euros).
La détermination de l’index et la mise au point de méthodes d’intégration adaptées aux
systèmes à index positif est un problème récurrent dans de nombreux domaines de la science
et de l’industrie. Nous avons déposé en janvier 2010 un projet ANR auquel participent l’équipe
MIP de l’Institut de Mathématique de Toulouse, le département Procédés et Systèmes Industriels
311
312CHAPTER VIII.7. ANNEXES : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE
du Laboratoire de Génie Chimique de Toulouse et le Laboratoire d’Informatique Fondamentale
de Lille. Ce projet LÉDA (Logistique des Équations Différentielles Algébriques) a été accepté et
a démarré en septembre 2010.
Marc Giusti et Joris Van Der Hoeven ont participé à ce projet dont François Ollivier était
le responsable local. Les journées de clôture ont eu lieu à Lille en juin 2013, couplées avec
le congrès international DART V (Differential algebra and Related Topics). http://www.lix.
polytechnique.fr/õllivier/LEDA/
MaGiX, ANR-09-JCJC-0098-01 (2009–2012) (Type: ANR Jeunes Chercheuses Jeunes Chercheurs)
Titre: Mathématiques, Analyse, Géometrie, Interfaces, eXactes.
Partenaires: LIX. Responsable:
Joris van der Hoeven. Montant de la collaboration pour le LIX: 150000 EUROS.
Url : http://magix.lix.polytechnique.fr
Autres participants : Massimiliano Gubinelli (professeur à l’université Paris IX), Grégoire Lecerf.
Ce financement a permis l’emploi en CDD de David Michel puis François Poulain, l’achat
de matériel informatique, et l’organisation de la conférence MaGiX@LIX en septembre 2011 à
l’École polytechnique, puis d’un workshop TEXmacs à Faro au Portugal en février 2012, et enfin
un workshop MaGiX satellite d’ISSAC 2012 en juillet à Grenoble.
MaGiX, DIM/Digiteo 2009-36HD (2009–2013) (Type: DIM/Digiteo) Titre: Mathématiques,
Analyse, Géometrie, Interfaces, eXactes.
Partenaires: LIX. Responsable: Marc Giusti. Montant
de la collaboration pour le LIX: 112000 EUROS.
Url : http://magix.lix.polytechnique.fr
Autres participants : Joris van der Hoeven, Grégoire Lecerf.
Ce financement a permis l’emploi en CDD de Daouda Niang Diatta et François Poulain, ainsi
que l’achat de matériel informatique.
VIII.7.1.3
VIII.7.1.4
Projet ANR-05-BLAN-0226-03 (2006-2008) (Type: Projet ANR) Titre: GECKO. Partenaires:
INRIA Rocquencourt, LIX, Université de Nice, Université de Toulouse. Responsable: Bruno
Salvy. Montant de la collaboration pour le LIX: 94 281,50 euros sur un montant total de 372 000
euros.
Cette dernière année a culminé avec l’organisation de la conférence finale du projet (jointe à
TERA) sur une semaine en Novembre 2008 :
http://www.lix.polytechnique.fr/TERA2008/
VIII.7.2
VIII.7.2.1
Depuis Février 2006, Marc Giusti est Éditeur en Chef exécutif (”Managing Editor-in-Chief”) du
journal AAECC (Applicable Algebra in Engineering, Communication and Computing), Springer
Verlag.
• Forum mathematicum (De Gruyter) Michel Fliess (1988–2011). Voir www.degruyter.
com/view/j/form.
• Journal of Applied Mathematics (Hindawi Publishing Corporation) Michel Fliess (2010–
). Voir http://www.hindawi.com/journals/jam.
VIII.7.2. ADMINISTRATION DE LA RECHERCHE
313
• Journal of Symbolic Computation, Volume 45, Number 12, December 2010, ISSN 07477171 (Numéro spécial rassemblant des contributions sélectionnées présentées à ou en
rapport avec MEGA 2009) Marc Giusti avec Carlos D’Andrea, Luis Miguel Pardo, Ragni Piene
• International Journal of Control, Volume 81, Number 3, 2008, ISSN 0020-7179 (Special
Issue dedicated to Professor Michel Fliess) Marc Giusti avec Pierre Rouchon
VIII.7.2.2
• ICMS 2010 (International Congress on Mathematical Software) (2010). Joris van der
Hoeven.
• AAECC 2009 (Applied Algebra, Algebraic Algorithms and Error Correcting Codes) (2009).
Marc Giusti.
• Calculemus 2012 (Calculemus Track of CICM 2012) (2012). Joris van der Hoeven.
• DART IV (Differential Algebra and Related Topics) (2010). François Ollivier.
• DART V (Differential Algebra and Related Topics) (2013). François Ollivier.
• ISSAC’11 (International Symposium on Symbolic and Algebraic Computation) (2011).
Grégoire Lecerf.
• MEGA (Méthodes Effectives en Géométrie Algébrique, comité exécutif en charge de
l’organisation scientifique) (2009). Marc Giusti.
• MEGA (Méthodes Effectives en Géométrie Algébrique, advisory board) (2011). Marc
Giusti.
• MEGA (Méthodes Effectives en Géométrie Algébrique, advisory board) (2013). Marc
Giusti, Grégoire Lecerf.
VIII.7.2.3
• TERA 2008 (Congrès TERA 2008) (2008). François Ollivier.
• ICMS 2010 (International Congress on Mathematical Software) (2010). Joris van der
Hoeven.
• MaGiX@LIX (Conférence MaGiX au LIX) (2011). Joris van der Hoeven.
• Workshop TEXmacs (Workshop TEXmacs) (2012). Joris van der Hoeven.
• ISSAC’12 (International Symposium on Symbolic and Algebraic Computation) (2012).
Joris van der Hoeven.
• MaGiX@ISSAC (Satellite workshop of ISSAC’12) (2012). Grégoire Lecerf.
• SCIEnce 2011 (Atelier externe final du projet) (2011). Marc Giusti. http://www.symboliccomputing.org
• SCIEnce 2010 (Troisième atelier externe du projet) (2011). Marc Giusti avec Alexander
Konovalov.
• ACA 2010 (Session 13 Complexity of Solving Differential Algebraic Systems) (2010).
Marc Giusti avec François Ollivier.
• JNCF 2010 (Journées nationales de calcul formel) (2010). Grégoire Lecerf.
• JNCF 2011 (Journées nationales de calcul formel) (2011). Grégoire Lecerf.
• MaGiX@Lix (Conférence internationale du projet ANR MaGiX) (2011). Grégoire Lecerf.
• SCIEnce 2009 (Deuxième atelier externe du projet) (2009). Marc Giusti.
VIII.7.2.4
• Université de Versailles (Joris van der Hoeven) 2010
• Université de Limoges, Poste MC 601 26/25 (Marc Giusti) 2010 première réunion
VIII.7.3
VIII.7.3.1
• Jérémy Berthomieu (6 Décembre 2011). Contributions à la résolution des systèmes algébriques :
réduction, localisation, traitement des singularités, implantations. Encadrant: Marc Giusti
et Grégoire Lecerf.
• Romain Lebreton (11 Décembre 2012). Contributions à l’algorithmique détendue et à la
résolution de systèmes polynomiaux. Encadrant: Marc Giusti.
VIII.7.3.2
Rapports d’habilitations à diriger les recherches
• Laurent Busé (2011). Représentations matricielles en théorie de l’élimination et applications à la géométrie. Rapporteur: Marc Giusti.
Rapports de thèse
• Surjeet Kour (Juillet 2012). A class of simple derivations of k[x,y]. Indian Institute of
Technology Kanpur, Uttar Pradesh, INDIA. Rapporteur: Jean Moulin Ollagnier.
• Aslı Ürgüplü (2010). Contributions to Symbolic Effective Qualitative Analysis of Dynamical Systems; Application to Biochemical Reaction Networks. Université de Lille. Rapporteur: Marc Giusti.
VIII.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION
VIII.7.3.3
315
• M. Giusti est intervenu à hauteur de 12h dans le cours Algorithmes efficaces en calcul formel
du master parisien de recherche en informatique (MPRI) durant les années 2008-2012.
• G. Lecerf est intervenu à hauteur de 12h dans le cours Algorithmes efficaces en calcul formel
du master parisien de recherche en informatique (MPRI) durant l’année 2012-2013.
• J. Berthomieu est intervenu à hauteur de 12h dans les TD de Algèbre commutative et effectivité du master d’algèbre appliquée à la cryptographie et au calcul formel (M2A2C2)
durant l’année 2011-2012.
Autres cours universitaires
• Lebreton est intervenu à hauteur de 186h dans les TDs des cours d’Informatique de l’École
Polytechnique (INF 311-421-431-4441) durant la période 2009-2012.
Jury de thèse de doctorat
• Cristina Bertone (2010). Polynomial factorization and curve decomposition algorithms.
Membre: Dipartimento di Matematica, Torino, Italie. Grégoire Lecerf
• Louis Leroux (2011). Algorithmes pour les polynômes lacunaires. Membre: Laboratoire
de mathématiques Nicolas Oresme, université de Caen. Grégoire Lecerf
• Vanessa Viste (2011). Attaques algébriques du problème du logarithme discret sur courbes
elliptiques. Membre: Laboratoire d’informatique de l’université de Versailles Saint-Quentinen-Yvelines. Grégoire Lecerf
• Jérémy Berthomieu (2011). Contributions à la résolution des systèmes algébriques : réduction,
localisation, traitement des singularités, implantations. Membre: LIX, École polytechnique. Marc Giusti
• Jérémy Berthomieu (2011). Contributions à la résolution des systèmes algébriques : réduction,
localisation, traitement des singularités, implantations. Membre: LIX, École polytechnique. Grégoire Lecerf
• Marc Mezzarobba (2011). Autour de l’évaluation numérique des fonctions D-finies. Membre: École polytechnique. Joris van der Hoeven
• Shaoshi Chen (2011). Some Applications of Differential-Difference Algebra to Creative
Telescoping. Membre: École polytechnique. Joris van der Hoeven
• Guillaume Quintin (2012). On the Algorithms of Guruswami-Sudan List Decoding over
Finite Rings. Membre: LIX, École polytechnique. Grégoire Lecerf
• Alexandre Benoit (2011). Algorithmique semi-numérique rapide des séries de Tchebychev.
Membre: École polytechnique. Joris van der Hoeven
• Aslı Ürgüplü (2010). Contributions to Symbolic Effective Qualitative Analysis of Dynamical Systems; Application to Biochemical Reaction Networks. Membre: Université de Lille.
Marc Giusti
• Lionel Alberti (2008). Propriétés des Singularités des Variétés Algébriques Réelles. Membre: Université de Nice. Marc Giusti, président du jury
• Marc Dohm (2008). Implicitization of rational algebraic surfaces with syzygy-based methods. Membre: Université de Nice. Marc Giusti, président du jury
• Clémence Durvye (2008). Algorithmes pour la décomposition primaire d’idéaux de dimension nulle donnés en évaluation. Membre: Université de Versailles-Saint-Quentin.
Marc Giusti
Jury d’habilitations à diriger des recherches
• Mohab Safey el Din (2010). Résolution de systèmes polynomiaux sur les réels : algorithmes, complexité, implantations et applications. Membre: Marc Giusti, président du
jury.
• Laurent Busé (2011). Représentations matricielles en théorie de l’élimination et applications à la géométrie. Membre: Université de Nice. Marc Giusti
• Joris van der Hoeven (2008). Habilitation : Transséries et Analyse Complexe Effective.
Membre: Université d’Orsay. Marc Giusti
Écoles thématiques et cours spécialisés
• Calcul analytique (3h de cours), Joris van der Hoeven, Journées Nationales de Calcul Formel,
école thématique CNRS, CIRM, Luminy, 2011. Les notes de cours sont publiées dans [781].
• Fast algorithms for polynomials and matrices (12h de cours), Grégoire Lecerf, Non-linear
Computational Geometry CIMPA-UNESCO-MICINN-INDONESIA Research School, Department Mathematics, Universitas Gadjah Mada, Yogyakarta, Indonésie, juillet, 2011.
• Factorisation des polynômes à plusieurs variables (3h de cours), Grégoire Lecerf, Journées
Nationales de Calcul Formel, école thématique CNRS, CIRM, Luminy, mai, 2013. Les notes
de cours sont publiées dans [782].
Vulgarisation
• Exposé intitulé Présentation de GNU TEXmacs, par F. Poulain aux rencontres mondiales du
logiciel libre, Genêve, Suisse, 2012.
• Exposé intitulé GNU TEXmacs, une plate-forme scientifique libre, par F. Poulain aux rencontres mondiales du logiciel libre, Bruxelles, Belgique, 2013.
• Article La commande “sans modèle” du trafic autoroutier par Fliess, Abouaissa, Iordanovaet
et Join, dans FLASH X – La revue scientifique de l’École polytechnique, 2012.
VIII.7.4
VIII.7.4.1
Invitations
Exposés invités dans des conférences
• Deuxième colloque franco-maghrébin de Calcul formel, Kerkennah (Sfax, Tunisie) (2009).
Marc Giusti, La géométrie associée à un groupe fini.
• FoCm’11 (Foundations of Computational Mathematics), Real Number Complexity workshop, Budapest, Hongrie (2011). Marc Giusti, Algorithms of intrinsic complexity for point
searching in compact real singular hypersurfaces.
• A day in honour of Bernd Bank’s 70th anniversary, Humboldt Universität zu Berlin
(2011). Marc Giusti, Polare, Bipolare and Wein.
• Applications of Computer Algebra, Vlora, Albania (2010). Marc Giusti, A static analogue
to Ritt resolvents: Efficient computation of square-free Lagrange resolvents.
VIII.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ
317
• Thematic Program on the Foundations of Computational Mathematics, Fields Institute,
Toronto. Workshop on Complexity of Numerical Computation (2009). Marc Giusti, Polar
and Bipolar Varieties.
• Premier Colloque Franco-Tunisien de Mathématiques, organisé conjointement par la
SMT et la SMF, Djerba, Tunisie (2009). Marc Giusti, Variétés polaires et bipolaires.
• FoCM’08, Foundations of Computational Mathematics Conference, semi-plenary lecture, Hong Kong (2008). Marc Giusti, Polar and bipolar varieties.
• Premier colloque franco-maghrébin de Calcul Formel, Îles de Kerkennah, Tunisie (2008).
Marc Giusti, Variétés bipolaires et résolution d’une équation polynomiale réelle.
• Workshop on Complexity of Numerical Computation, Fields Institute, Toronto, Canada
(2009). Joris van der Hoeven, The art of guessing (mini-cours).
• Logical Approaches to Barriers in Computing and Complexity, Greifswald, Allemagne
(2010). Joris van der Hoeven, Ball arithmetic.
• Applications of Computer Algebra, Vlora, Albania (2010). Joris van der Hoeven, Relaxed
power series solutions of DAEs.
• Applications of Computer Algebra, Vlora, Albania (2010). Joris van der Hoeven, Ball
arithmetic.
• DART III, Newark, N.J. USA (2008). François Ollivier, A proof of the dimensional conjecture
and of Jacobi’s bound.
• Applications of Computer Algebra, Vlora, Albania (2010). François Ollivier, Complexity
of solving Differential Algebraic Systems.
• Valuations, Segovia, Espagne (2011). Joris van der Hoeven, Transserial Hardy fields (minicours).
• SAGA winter school, Auron, France (2010). Joris van der Hoeven, Mathemagix.
• SAGA winter school, Auron, France (2010). Grégoire Lecerf, Fast arithmetic for polynomials
and matrices in Mathemagix.
• XXI rencontres Arithmétiques de Caen, factorisation des nombres entiers et des polynômes,
Caen, France (2010). Grégoire Lecerf, Recent algorithms for multivariate polynomial factorization.
• ICTS-TIFR Discussion Meeting-2011, Bangalore, Inde (2011). Joris van der Hoeven,
Multi-precision computations and high performance: a delicate marriage.
Exposés invités dans des Workshops
• Journées nationales de calcul formel 2008, CIRM (2008). Marc Giusti, Variétés polaires et
bipolaires.
• Worshop Universidad de Cantabria, España (2009). Marc Giusti, Variedades polares, bipolares y resolución de una ecuación real.
• Workshop de Informatica Aplicable y Matematica (Semi)numerica, Buenos-Aires, Argentine (2008). Marc Giusti, Variedades polares y bipolares.
• Colloquium du département de mathématiques de l’Université de Rennes (2008). Marc
Giusti, Variétés polaires et bipolaires.
• Journées nationales de calcul formel 2010, CIRM (2010). Joris van der Hoeven, Mathemagix : langage, fonctionnalités et performances.
• Rencontres MaGiX@LiX 2011, École polytechnique, Palaiseau, France (2011). Grégoire
Lecerf, Mathemagix libraries.
• Rencontres MaGiX@LiX 2011, École polytechnique, Palaiseau, France (2011). Joris van
der Hoeven, Mathemagix compiler.
• Rencontres MaGiX@LiX 2011, École polytechnique, Palaiseau, France (2011). Joris van
der Hoeven, Semantic editing with GNU TEXmacs.
• Journées nationales de calcul formel 2013, Marseille, France (2013). François Poulain,
GNU TEXmacs, une plate-forme libre pour l’édition scientifique.
• Workshop TEXmacs, Albufeira, Portugal (2012). Joris van der Hoeven, plusieurs exposés
sur GNU TEXmacs.
• Workshop TEXmacs, Albufeira, Portugal (2012). Grégoire Lecerf, Presentation of Mathemagix.
• Workshop TEXmacs, Albufeira, Portugal (2012). François Poulain, Presentation of other
work on converters within TEXmacs.
• Workshop MaGiX@ISSAC 2012, Grenoble, France (2012). François Poulain, Introducing
TEXmacs to new users.
• Workshop MaGiX@ISSAC 2012, Grenoble, France (2012). Joris van der Hoeven, Advanced
use and new features of TEXmacs.
• Workshop MaGiX@ISSAC 2012, Grenoble, France (2012). Joris van der Hoeven, The
Mathemagix language.
• Journées nationales de calcul formel 2010, CIRM (2010). François Ollivier, Borne de Jacobi
et calcul de l’index de forme normale pour toutes les composantes quasi-régulières d’un système
d’EDO.
Séjours invités
• Université de Cantabria, Espagne (2008–2013). Marc Giusti a été invité plusieurs semaines par Joos Heintz et Luis Miguel Pardo.
• Université de Buenos Aires (2008–2013). Marc Giusti a été invité plusieurs semaines par
Joos Heintz.
• Université de Humboldt, Allemagne (2011). Marc Giusti a été invité pour le 70ème anniversaire de Bernd Bank.
• Université de Toruǹ, Pologne (2008). Jean Moulin Ollagnier a été invité 15 jours par
l’université Nicolas Copernic de Toruǹ en septembre 2008.
l’université Nicolas Copernic de Toruǹ en juillet 2010.
l’université Nicolas Copernic de Toruǹ en juillet 2012.
• Faculté des Sciences Semlalia, Marrakech, Maroc (2009). François Ollivier a été invité
une semaine par Brahim Sadik en mars 2009.
VIII.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ
319
une semaine par Brahim Sadik en novembre 2011.
une semaine par Brahim Sadik en juin 2012.
VIII.7.4.2
• Prix de l’innovation de l’École polytechnique 2010, catégorie brevet, Michel Fliess, 2010.
• Prix du meilleur article étudiant à la conférence internationale ISSAC’12, Romain Lebreton,
2012.
• Prix du meilleur poster de la part du “Fachgruppe Computer Algebra” lors de la conférence
internationale ISSAC’12, Romain Lebreton, 2012.
MAXModélisation Algébrique et Calcul Symbolique
IX Équipe Parsifal (PARSIFAL)
321
IX.1 Liste des membres : Parsifal
IX.1.1
IX.1.1.1
Membres permanents
Nom
Dale Miller
Lutz Straßburger
Stéphane Graham-Lengrand
Kaustuv Chaudhuri
François Lamarche
Christelle Lievin
IX.1.1.2
Fonction
DR
CR
CR, CHE
CR
DR
Assistant
Employeur
INRIA
INRIA
INRIA
INRIA
INRIA
HDR
HDR equivalent
HDR
Arrivée
2003
2005
2008
2009
2012
2011
Doctorants
Nom
Mahfuza Farooque
Ivan Gazeau
Hernán Vanzetto
Zakaria Chihani
Financement
ANR Jeunes Chercheurs PSI
ANR Blanc CPP
INRIA-MSR
ERC ProofCert
Arrivée
2010
2009
2011
2012
Encadrant
S. Graham-Lengrand
D. Miller
K. Chaudhuri
D. Miller
Postdoctorants
Nom
Matteo Cimini
Fabien Renaud
Novak Novakovic
Mikheil Rukhaia
Ryuta Arisaka
IX.1.1.3
Financement
INRIA
ERC ProofCert
ANR Structural
ANR Structural
ANR Structural
Dates
20122012–13
2012–13
2013
2013–14
Responsable
D. Miller
D. Miller
L. Straßburger
L. Straßburger
L. Straßburger
Autres
Nom
Quentin Heath
Anastasia Gkolfi
Sonia Marin
Jean Pichon
Damien Rouhling
Olivier Savary-Bélanger
Fonction
ingénieur
stagiaire M2
stagiaire M2
stagiaire M2
stagiaire L3
stagiaire M2
IX.1.2
Anciens membres
IX.1.2.1
Membres permanents
Nom
Joëlle Despeyroux
Fonction
CR
Employeur
INRIA
Financement
INRIA, ADT BATT
ANR Structural
ANR Structural
ERC ProofCert
ENS Lyon - ANR PSI
EA RAPT; McGill
HDR
323
Départ
2011
Dates
2011–
2013–
2013–
2013–
2013–
2013–
Position actuelle
CR, INRIA Sophia Antipolis
CHAPTER IX.1. LISTE DES MEMBRES : PARSIFAL
324
IX.1.2.2
Doctorants
Nom
Nicolas Guenot
Olivier Delande
Vivek Nigam
David Baelde
Alexis Saurin
Financement
EDX
Monge
Alloc Mobius
Alloc ENS Lyon
Alloc ENS Paris
Départ
2012
2009
2009
2008
2008
Encadrant
L. Straßburger
D. Miller
D. Miller
D. Miller
D. Miller
Position actuelle
Postdoc, ITU Copenhagen
Thales Research Center
Junior Prof, Univ Paraı́ba, Brazil
MdC, ENS Cachan
CR, CNRS PPS
Postdoctorants
Nom
Stefan Hetzl
Beniamino Accattoli
Willem Heijltjes
Revantha Ramanayake
Clément Houtmann
Andrew Gacek
Tom Gundersen
Stefan Hetzl
Laurent Méhats
Matteo Capelletti
IX.1.2.3
Financement
ANR Structural
INRIA
ANR Structural
ANR PSI
INRIA
INRIA
INRIA
INRIA
ANR Blanc Infer
INRIA
Dates
2012–13
2011–12
2011–12
2011–12
2010–11
2009–10
2009–10
2008–09
2007–08
2007–08
Responsable
L. Straßburger
D. Miller
L. Straßburger
S. Graham-Lengrand
D. Miller
D. Miller
L. Straßburger
L. Straßburger
L. Straßburger
L. Straßburger
Position actuelle
Researcher, TU Vienna
Postdoc, CMU
Postdoc, Univ. of Bath
Postdoc, TU Vienna
Ingénieur, Systerel
Ingénieur, Rockwell Collins
Postdoc, Univ. Paris 7
Researcher, TU Vienna
unknown
unknown
Autres membres
Stagiaires Master 2
Nom
Ivan Gazeau
Edlira Nano
Anne-Laure Schneider
Alexandre Viel
Financement
ENS
ENS
Dates
2009
2008
2009
2008
Responsable
D. Miller
L. Straßburger
D. Miller
D. Miller
Position actuelle
Ph.D. student
unknown
unknown
unknown
Autres Stagiaires
Nom
Andrew Cave
Chris Martens
Salil Joshi
Yuting Wang
Matthieu Vegreville
Financement
EA RAPT
EA RAPT
EA RAPT
EA RAPT
Dates
2011
2011
2011
2012
2012
Responsable
K. Chaudhuri
K. Chaudhuri
K. Chaudhuri
K. Chaudhuri
S. Graham-Lengrand
Position actuelle
Ph.D. McGill
Ph.D. Carnegie Mellon
Ph.D. Carnegie Mellon
Ph.D. Univ. Minnesota
Student
IX.2 Rapport scientifique : Parsifal
IX.2.1
Introduction
The aim of the Parsifal team is to develop and exploit proof theory in the specification and verification of computational systems. Within the team, we pursue our work by moving along the
following four axes.
• The team conducts basic research in proof theory, particularly in topics that support the
problem of the “identify of proof”, the construction of automated deduction systems, and
the development of standards for communicating and checking formal proofs.
• Based on experience with computational systems and theoretical results, the team designs
new logical principles, new proof systems, and new theorem proving environments.
• The team takes our designs and implements prototype systems to explore and validate our
basic research results.
• We use our systems to explore examples of specification and verification. Such examples not
only help to refine our implementations but also suggest basic research projects on which
to work next.
The foundational work of the team focuses on structural and analytic proof theory, i.e., the
study of formal proofs as algebraic and combinatorial structures and of proof systems as deductive and computational formalisms. Our research in recent years is mainly concerned with the
sequent calculus and the deep inference formalisms.
One important research question we address is the problem of formalizing and reasoning
about the relational style specifications that are commonly used in the specification of operational
semantics and typing. To this end, the team has been developing new approaches to dealing with
induction, co-induction, and generic quantification. A second important question is of canonicity
in deductive systems, i.e., when are two derivations “essentially the same”? This crucial question
is important not only for proof search, because it gives an insight into the structure and an ability
to manipulate the proof search space, but also for the communication of proof certificates between
different reasoning agents such as automated theorem provers and proof checkers.
IX.2.2
Research Themes
Structural proof theory An important organizational principle for the research done in Parsifal
is structural proof theory, which is the study of proofs as syntactic, algebraic, and combinatorial
objects. Formal proofs often have equivalences in their syntactic representations, leading to an
important research question about canonicity in proofs – when are two proofs “essentially the
same?” The syntactic equivalences can be used to derive normal forms for proofs that illuminate
not only the proofs of a given formula but also its entire proof search space.
Focused proof systems Following on early work on focused sequent calculus proof systems for
linear logic by Andreoli, the team has developed focused sequent calculus proof systems
for intuitionistic and classical logics [834, 835] as well as for deep inference [865], type
theory [832] and Satisfiability-Modulo-Theories [920]. Given the increased importance of
focused proof systems in computational logic, these papers provide an future applications
of logic to computer science.
Deep inference Deep inference is a novel methodology for presenting deductive systems. Unlike traditional formalisms like the sequent calculus, it allows rewriting of formulas deep
inside arbitrary contexts. The new freedom for designing inference rules creates a richer
325
326
CHAPTER IX.2. RAPPORT SCIENTIFIQUE : PARSIFAL
proof theory. For example, for systems using deep inference, we have a greater variety of
normal forms for proofs than in sequent calculus or natural deduction systems.
Proof nets and atomic flows Proof nets and atomic flows are abstract (graph-like) presentations
of proofs such that all ”trivial rule permutations” are quotiented away. Ideally the notion of
proof net should be independent from any syntactic formalism, but most notions of proof
nets proposed in the past were formulated in terms of their relation to the sequent calculus.
Consequently we could observe features like “boxes” and explicit “contraction links”. Only
recently, due to the rise of deep inference, new kinds of proof nets have been introduced
that take the formula trees of the conclusions and add additional “flow-graph” information.
This gives new insights in the essence of proofs and their normalization, but all the known
correctness criteria are no longer available.
Proof certificates The team has been involved with a multi-year, ambitious project to develop a
flexible and broad spectrum approach to communicating, checking, and trusting formal proofs.
We have identified the following four desiderata for such proof certificates.
1. They must be checkable by “simple” proof checkers.
2. The format definition for certificates must be flexible enough that existing provers can
conveniently produce certificates based on their internal evidence of proof.
3. The checking of proof certificates must be able to elaborate into proofs recognized by the
literature of structural proof theory.
4. Proof certificates must allow some details to be elided: the proof checker will thus be expected to do some (bounded) proof reconstruction.
For more about these desiderata and their various consequences, see [890]. An initial design
and implementation for proof certificates for first-order logic can be found in the recent papers
by Chihani, Miller, and Renaud [869, 868]. This project is funded by the ERC Advanced Grant
ProofCert.
Mechanized metatheory There has been increasing interest in the use of formal methods to
prove properties of programs and programming languages. The POPLMark challenge (from
2005) envisions a world where “mechanically verified software is commonplace: . . . [where] theorem proving technology is used routinely by both software developers and programming language researchers alike.”
The Parsifal team has developed several tools and techniques for formal reasoning about the
meta-theory of programming languages. It is crucial to be able to represent the binding constructs in programming languages in a way that is invariant with respect to α-conversion, i.e.,
renaming of bound variables. It is also important to be able to both specify the properties of
such languages and to reason about these specifications. The two-level logic approach to specification and reasoning, pioneered by members of Parsifal, achieves these goals at a very expressive,
declarative, and high level [829]. The Abella prover implements this approach and has been
successfully used both to solve the POPLMark challenge and to develop a number of novel formalizations of the meta-theory of the λ-calculus and the π-calculus. Both the theory and the implementation have been in active development by the members of Parsifal and their colleagues
for the past several years. The team has also been implementing the model checker Bedwyr that
can reason with programming language expressions directly, thus providing for ways to reason
directly on program phrases.
IX.2.3. SOFTWARE
IX.2.3
327
Software
Abella The Abella theorem prover is an implementation of the two-level logic approach for specifying and reasoning about deductive and computational formalisms such as programming languages, proof systems, and process calculi. Since 2011, members of Parsifal and their collaborators in Rockwell Collins, the University of Minnesota, and McGill University have been actively
extending the system with a number of new features such as a higher-order specification language and polymorphism. http://abella-prover.orgAbella
Bedwyr The Bedwyr model checker was built by Ph.D. students in the Parsifal team, and the
development of this system is continued by our engineer, Quentin Heath. While Abella and
Bedwyr share a common language, Bedwyr is completely automatic. There is growing evidence that Bedwyr may be used for the next phase of our work with proof certificates. http:
//slimmer.gforge.inria.fr/bedwyr/
TLAPS TLAPS is a proof development environment for the Temporal Logic of Actions [863],
which is designed to specify distributed, heterogeneous, reactive, and real-time systems. It was
built during 2008–2011 by members of Parsifal in collaboration with the Microsoft ResearchINRIA Joint Centre in Saclay. It has been used in a number of large formalization efforts of
distributed systems and distributed algorithms. http://tla.msr-inria.inria.fr/tlaps/
Profound Profound is a prototype of an interactive proof-development tool based on formula
linking [861], a technique inspired by deep inference and focusing [865]. It allows the user to
build proofs using direct manipulation of the theorem using ordinary input devices such as
keyboards, mice, and touchscreens, instead of via a textual proof interaction language. http:
//chaudhuri.info/software/profound
Psyche Developed in the PSI project, Psyche [879] is a proof-search engine in a rich logical
system based on a focused sequent calculus where decision procedures can be called (e.g. the
simplex algorithm for linear arithmetic). Its modularity allows the implementation of various theorem proving mechanisms (automated or interactive) as plugins, driving Psyche’s kernel through the proof-search space. The kernel-plugin architecture provides strong guarantees
about the correctness of Psyche’s output, which only relies on a small piece of trusted code.
http://www.lix.polytechnique.fr/˜lengrand/Psyche/
IX.2.4
The logic of nominal abstraction In the paper [828], Gacek, Miller, and Nadathur have developed a logic that allows strong forms of induction and co-induction in the presence of generic
reasoning using the ∇ quantifier. This quantifier was introduced in earlier work by Miller and
Tiu and it was shown to provide declarative and flexible operational semantic specifications for
a number of systems such as the λ-calculus and the π-calculus. The paper [828] introduces a
generalization of equality, called nominal abstraction, that permits natural specifications of predicates such as freshness. This paper provides the necessary meta theory (cut-elimination) for this
new logic.
Combining Classical and Intuitionistic Proof Systems In order to develop an approach to
proof certificates that is as comprehensive as possible, one needs to handle theorems and proofs
in both classical logic and intuitionistic logic. Instead of building two different sets of libraries,
one for each logic, an ideal approach would be to design a single proof system in which both
328
classical and intuitionistic proofs can exist together. Such a proof system should allow cutelimination to take place and should have a sensible semantic framework. Recent papers by
Liang and Miller have provided some promising new ways to do exactly that: see [835, 888].
Nested Sequents for Intuitionistic Modal Logics We have shown how the recent results for
treating classical modal logics in the modal cube under S5 via nested sequents can be transferred to intuitionistic modal logics. We have produced cut-free nested sequent systems for all
intuitionistic modal logics in the modal cube up to IS5 [901].
Broadening the scope of focused proof systems As we have mentioned earlier, the development of focused sequent calculus for classical and intuitionistic logics greatly enrich the scope of
this flexible and power form of normal form proofs. We have also shown shown how the concept
of focusing can be moved to the rather different setting of deep inference [865]. These theoretical
results will play a foundational role in the applications of proof theory to computer science.
Focused proof systems for type theory Type theory provides the logical bases of numerous
proof assistants, whose logical expressivity makes the design and understanding of proof search
mechanisms a difficult challenge. In [832], we developed the meta-theory of a focused sequent
calculus for Pure Type Systems -a broad family of type theories, with which we described such
mechanisms, as well as higher-order unification. In interaction with the INRIA project teams
Typical (Saclay) and πr 2 (Rocquencourt), this result led to re-designing the proof engine implemented in the Coq proof assistant.
Automated reasoning techniques as focused proof constructions Automated reasoning uses
a broad range of techniques whose soundness and completeness relate to the existence of certain
proofs. In [923, 922, 872] we build a finer-grained connection by specifying well-known techniques of automated reasoning (DPLL, connection tableaux) as the step-by-step construction of
proofs in a focused sequent calculus, as we know it from proof theory and logic programming.
One of the advantages of such a unifying framework is to combine those techniques more easily
and provide a natural system where their generalizations can be envisaged.
Foundational Proof Certificates for First-Order Logic One of the foundational roles played by
focused sequent calculus proofs is that they can be used to give a precise semantic definition of
proof certificate formats. We have encouraging results exploiting this connection.
Proof nets for second order multiplicative linear logic We have developed a new theory of
proof-nets that also includes the quantifiers [900]. Our technique does not rely on boxes, unlike
the original proposal for proof-nets by Girard, which lets us build more canonical proof structures.
Proof complexity It is standard in proof complexity to differentiate between proofs with extension and proofs without extension, unlike other areas of proof theory where one differentiates
between proofs with cut and cut-free proofs. We have shown that deep inference can provide a
uniform treatment for both classifications. In particular, this allows a study of cut-free proofs
with extension, which is not possible with other formalisms. By using deep inference we can
also give a new and simpler proof for the well-known theorem that extended Frege-systems psimulate Frege-systems with substitution and vice versa [842].
Proof normalization via atomic flows We have constructed a novel method, based on atomic
flows, for normalizing proofs in classical logic. These are purely graphical devices that abstract
away much of the typical syntactic bureaucracy of proofs [883].
IX.2.5. ANIMATION SCIENTIFIQUE, RAYONNEMENT, PRIX ET RÉCOMPENSES
IX.2.5
329
Members of Parsifal are strongly involved in professional and scientific activities at an international level. The following items are particularly noteworthy.
• Team members have routinely served in between 4 and 6 program committees a year and
have helped to organize 1 or 2 workshops a year during this review period.
• Miller is serving a six year appointment as Editor-in-Chief of the ACM Transactions on
Computational Logic (2009–2015). He has also had been an editor of four other journals.
• Miller has chaired the Program Committee for three international conferences and workshops: the Second International Conference on Certified Programs and Proofs (CPP 2012,
Kyoto); the International Joint Conference of Automated Reasoning (IJCAR 2012, Manchester, UK); and Fixed Points in Computer Science (FICS 2012, Tallinn, Estonia).
Team members have won the following awards and accolades.
• Alexis Saurin’s Ph.D. thesis won the “Prix de thèse de l’Ecole Polytechnique” and the “Prix
de thèse ASTI 2009”. Vivek Nigam won the Alexander von Humboldt Scholarship to pursue post-graduate studies in Germany.
• Miller won the LICS Test-of-Time Award 2011 for a paper he co-authored with Joshua Hodas in LICS 1991. Miller has also been awarded the ERC Advanced Grant ProofCert for the
period 2012-2016.
IX.2.6
The basis for the internal scientific life of Parsifal is organized a rich and regular interaction between the permanent researchers, postdocs, Ph.D. students, and interns on various paper writing projects and system building efforts. The Comète-Parsifal seminar series routinely meets
and hosts international and local scientists. Coordination of the teams activities are helped by
the use of web-based calendars, svn repositories, mailing list, and web pages. The team meets
almost daily for lunch.
During the review period, financing of the team has the following pattern. Generally, two
ANR contracts are active, one INRIA “associated team” is active, and several small travel funds
are available. The ERC Advanced Grant ProofCert that has started recently has made it possible
to increase our level of funding significantly. Postdocs are funded using ANR and the ERC funds
as well as using direct INRIA funds.
330
IX.3 Projet de recherche : Parsifal
IX.3.1
There has been about 25 years of work that has pushed the abstract mathematical discipline
of “proof theory” in the direction of computer science. This discipline is now sufficiently developed that the Parsifal team is able to routinely apply its results to a number of problems in
computer science. The team plans to continue studying and developing proof theory in order to
support a variety of computational considerations. Our planned efforts cover the full range of
concerns—namely, basic research into foundations; the design of new computational logic tools;
implementation of those tools; and extensive applications of those tools. We list our planned
objectives in more details below.
IX.3.1.1
Proof Certificates
At least two of the team’s major objectives are lined up directly with the ERC Advanced Grant
ProofCert. One of these objectives is the design, implementation, and communication of a highlevel language for describing proof evidence in a universal, flexible, and effective format. Our
initial results in designing a high-level semantic specification for proof evidence for first-order
logic has been encouraging. We plan to continue to develop many more formal specifications
(in classical, intuitionistic, and linear logics) of commonly used proof evidence. One of our key
aims is to improve the state of the art in proof certificates by designing flexible formal proof
systems with good meta-theoretic properties. For example, if some proof evidence consists of
truly concurrent sub-proofs, then the proof representation must manifest the parallelism; if a
proof contains computational sub-components that do not need to be recorded in detail, then
the proof objects must be able to represent such computations atomically. We also plan to work
with various communities of researchers and practitioner to understand what kinds of proof
certificates they are capable of producing.
IX.3.1.2
Focused proof systems for arithmetic
The technical notion of “focused proof system” is central to many aspects of Parsifal’s research.
Currently, the team’s knowledge of such proof systems is strong in the area of first-order logic.
Our project is to extend it to arithmetic, which offers (at least) three approaches to develop:
• First, we need to understand how focusing proofs can be defined and manipulated for
the inference rules of inductive and co-inductive (these rules are not found in first-order
logic). Both induction and co-induction (i.e., least and greatest fixed points) are used in
many computational logic systems in regular use these days: including, for example, model
checkers and the theorem provers Coq, Isabelle/HOL, and PVS. We are currently scaling
up our efforts at describing flexible proofs systems for treating fixed points in logic. Some
previous work has been done within the team and we are looking to employ Ph.D. students
and post doctoral researchers to work on this problem.
• Second, we need to find ways to integrate specific procedures for arithmetic, like the simplex algorithm, into our focused proof systems. We have studied, to some substantial extent, the case of convex theories like linear rational arithmetic; but a satisfying treatment of
non-convex theories, like linear integer arithmetic, requires a more intertwined integration
within our proof systems for pure logic, which we currently do not provide.
• Third, we need to develop the semantics of our focused proof systems. In particular, realisability models are particularly fit for our systems and seem to easily extend to arithmetic.
Understanding how this would be done for our systems and how arithmetic could be lifted
back into the syntax is our third approach.
331
CHAPTER IX.3. PROJET DE RECHERCHE : PARSIFAL
332
These three research approaches will not be developed independently since advances in one of
these areas can directly influence advances in the other approaches.
IX.3.1.3
Instantiation of variables beyond first-order logic
Another aspect of theorem proving that is well-understood in first-order logic but becomes less
clear in presence of a theory (be it arithmetic or something else), is the instantiation of variables.
In plain first-order logic (and only some of its extensions), a clear unification algorithm provides
a satisfying treatment, and is key to Prolog-style computation. Tools designed to work modulo a
theory must use enhanced or different techniques. When and how to use them (unlike unification) is currently not well-understood in the proof search mechanisms developed at Parsifal, and
one research direction is to remedy this, if possible by relating them to the use of unification.
Even in the theory of equality, instantiation of variables is unclear in our proof search mechanisms. In Sat-Modulo-Theories tools, unification is abandoned altogether in favor of (incomplete)
hacks, such as the use of triggers; making a theory of those based on the expertise at Parsifal is
another of our projects.
IX.3.1.4
Extending and enhancing our computational tools
The team routinely builds computer systems, most of which started as prototypes to illustrate the
research ideas put into the dissertations of various Ph.D. students. However, over time, we have
come to understand that while these tools have rather different targeted audiences, they are all
working on the same underlying logic. Also, over time, others outside the team have expressed
interest in using improved versions of these prototypes. As a result, we continue to develop these
systems. In particular, the Bedwyr model checker and the Abella interactive theorem prover have
received the most attention from us and others. For this activity, we plan to work closely with
our colleagues at the Universities of Minnesota (USA) and McGill (Canada) who have significant
expertise in implementing related computational logic systems.
Given that we now understand the common logic and proof theory underlying both a model
checker and a theorem prover, we are planning to develop means for these two systems to work
together. For example, one might prove in an inductive theorem prover that there are symmetries
in a given game: if that theorem can then be incorporated into the tabling mechanism of a model
checker, that checker should be able to immediately infer all the symmetric versions of a discovered winning strategy. Conversely, a model checker might be used to finish tedious case analyzes
that occur during an interactive and inductive proof. We are planning to make it possible for
these two different forms of reasoning to communicate theorems and proofs. Our efforts here
will focus on providing enhancements to both the Abella (inductive, interactive) theorem prover
and the Bedwyr (automatic) model checker. One avenue for getting these systems to cooperate
is the development of proof certificates for both of these systems, along with a third system that
can check such certificates.
The Psyche proof engine currently performs ground Sat-Modulo-Theories solving and never
instantiates variables. Development for the immediate future involves:
• implementing variable binding and unification, to perform Prolog-style computation in
absence of a specific theory;
• implementing some of the triggers-based mechanisms that can be found in state-of-the-art
SMT-tools (once their theory is understood); and
• hopefully having them both as instances of a more general instantiation mechanism.
IX.3.1.5
Deep Inference
Ever since Gentzen’s seminal work, the main tools of structural proof theory have been the sequent calculus and natural deduction. In both formalisms, the main principle of deduction is
IX.3.1. OBJECTIFS SCIENTIFIQUES
333
to decompose the formula to be proved along their main connective, and continue to work on
the subformulas. Only within the last decade, a new paradigm, called deep inference entered the
scene, which is a radical departure from the use of principal (top-level) connectives used in traditional formalisms. Deep inference means that inference rules are allowed to modify formulas
deep inside an arbitrary context. This change in the application of inference rules has drastic
effects on the most basic proof theoretical properties of the systems, like cut elimination. Thus,
much of the early research on deep inference went into reestablishing these fundamental results
of logical systems. Now, deep inference is a mature paradigm, and for most logics studied in computer science, there is a deductive system using deep inference. The next steps are (i) to establish
new proof theoretical results for deep inference systems that are not possible in shallow inference
systems, (ii) investigate different logics that have no presentation in shallow inference systems
and design deep inference systems for them, and (iii) exploit the new opportunities offered by
cut elimination in deep inference at the level of the computational interpretations of proofs.
IX.3.1.6
Proof Complexity
In deep inference several mechanisms that allow proof compression can coexist in such a way that
the natural workings of proof normalization are not affected. Two of them might correspond to
some computational notion of sharing: one is co-contraction and the other is substitution. Cocontraction has received a lot of attention in recent years and its basic mechanisms start to be
understood and it already led to a surprising normalization procedure with quasi-polynomial
complexity. On the other hand substitution has not yet been incorporated into a well-studied
definition of normalizable proof system. Given that substitution naturally induces an exponential compression of proofs, its potential as a sharing mechanism seems to be at least as powerful
as co-contraction.
For these reasons, we propose to investigate the direct use of substitution as a first class
compositional operation on proofs, in addition to co-contraction. This way, one proof would be
substituted for an atom (in all its occurrences) inside another proof, and the result would still be
a proof. This operation could, of course, be applied recursively, and substitution would then be
interpreted as a way to share the substituted proofs by referring to them by name (i.e., the atoms
that would be replaced).
One important open question is whether it is possible to define a normalization procedure on
a proof notation that implicitly indicates substitutions without performing them. Such notions
of proof composition and normalization would then constitute the theoretical basis over which
a computational interpretation could be defined, which would naturally profit from the proof
sharing mechanisms of both co-contraction and substitution.
IX.3.1.7
Geometry of Rewriting
Several hard theoretical problems associated with deep inference—and the representation of formal proofs in general—needs more sophisticated tools that are inspired by modern geometry
and topology. It is has been known for decades that in general logical rules of inference can be
formulated in the language of category theory, and the problem of finding normal form can then
be seen as a “coherence problem” in that language. The rules associated with deep inference
lead to new kinds of coherence problems, that have not been seen in traditional categorical logic.
The associated transformations are close, but not identical, to objects that have been studied intensely in modern geometry and topology, like braidings. Moreover, they have a markedly higher
dimensional character. Thus the quest for normal forms in deep inference naturally leads to the
study of higher-dimensional category theory, and especially the theory of higher dimensional
rewriting, which is in its infancy, but which we intend to develop in the near future. Syntactical
approaches to this higher dimensionality suggest the use of dependent types, but the need for
linearity in this context has to be addressed.
334
CHAPTER IX.3. PROJET DE RECHERCHE : PARSIFAL
ee
r
M
de iss
ve ing
lo a
pm n
en en
t. gin
fo
r
s
•
so
ftw
ar
e
en
ac
es
A F
O M
NEGATIF
M
es
ss
At
ou
ts
S
th tro
Ex e n ng
im te a th
• lo pl nsi tur eo
Lo gic em ve e o ret
ap ng sy en ba f p ica
pl h st ta ck ro l b
yi is em tio g o a
r f
ng to
s n o . ckg
lo ry o . of und
ro
gi f
co w
un
c- d
m ith
d
ba es
pu
in
se ign
th
t
at e
d in
io
to g
na
ol a
s . nd
l
in
le
té
ni
tu
or
pp
O
ba nd
a a ts rk os
de o p
ng
vi w nd
ro
ro ur a
st
s
y s.
t p g o nt
er ion
an in ra
t
t v sit
gr o to
C om oc
ac o
tr p
ER pr d
at CR
e or ing
y
Th s f ct
el for
• si ttra s. tin es
a c ou at
do e r did
W an
c
•
335
s
m
a
te
•
r
he
ot
th
wi .
n a
io re
at a
gr ris
te a
In e P
th
•
•
ib
Fa
POSITIF
IX.4 Analyse AFOM : Parsifal
INTERNE
EXTERNE
Figure IX.4.1: Analyse AFOM de l’équipe Parsifal : Atouts, Faiblesses, Opportunités, Menaces
336
CHAPTER IX.4. ANALYSE AFOM : PARSIFAL
IX.5 Fiche résumé : Parsifal
IX.5.1
Membres
2013 : 5 chercheurs (1 CNRS, 4 INRIA), 5 postdocs, 3 doctorants, 1 engineer
Départ de membres de l’équipe Joëlle Despeyroux joined the Parsifal team as a “bi-located”
member at the time the team was approved by INRIA. She lived near the INRIA Sophia-Antipolis
site but was formally part of the INRIA Saclay site from September 2005 until December 2012.
Since she could not move to the Saclay area and since she found it difficult to work at a distance,
it was decided that she leaves the team and to refocus her energies at the Sophia-Antipolis site.
Nouveaux membres In 2012, François Lamarche joined Parsifal when he moved from Nancy
in order to find a team better suited for his expertise. Since he was a collaborator of Lutz
Straßburger, the Parsifal team was a natural place for him to reside.
IX.5.2
Focused proof systems The team has enriched, developed, and richly applied the theme of
focused proof systems. While various focused proof systems had been known for linear, intuitionistic, and classical logics, members of the team (and their colleagues) have developed a
comprehensive framework where all the previous such proof systems could be described and
generalized. The team has also applied such proof systems to proof theory (providing a new explanation of parallelism in proof structures) and to computer science (with applications to logic
programming, automated theorem proving, and term representation).
Proof Certificates Another application of focused proof system has been in the area of the ERC
funded project on proof certificates. Focusing provides a means of describing a wide range of
proof evidence as well as a declarative means of executing and validating that proof evidence.
The team has built a reference proof checker that is able to check the proof evidence that appears
in a number of different computational logic systems.
A declarative approach to binding in syntax The treatment of syntax containing bindings has
long been known to be challenging, both for programming language design and theorem provers.
The team as been working for a number of years on theoretical results and on building systems
that provide a fresh new means of dealing with such syntax. In particular, team members have
designed a new quantifier ∇ and new computer systems (the model checker Bedwyr and the
interactive theorem prover Abella) to allow for new means of reasons about such syntax and
specifications involving them.
Deep Inference Members of the team are very active in the area of “deep inference”, which
comprises formal systems like calculus of structures and nested sequents, where inference rules
are allowed to apply deep inside certain structures. Contributions include new deductive systems for logics that cannot be treated by shallow systems, as well as an implementation of a deep
inference prover.
337
CHAPTER IX.5. FICHE RÉSUMÉ : PARSIFAL
338
IX.5.3
IX.5.3.1
Publications
Journaux : 20
During the year 2008-2013 (inclusive) the team has published 20 articles in journals as well
as 53 papers in the proceedings of conferences and workshops. Furthermore, team members
published one book (via Cambridge University Press) and compiled three conference proceedings. Various other papers where made into technical reports while others have been submitted
for publication consideration. Below we single out five “products” of our research.
• The Abella theorem prover is an interactive theorem prover that was released in 2008. This
prover provides new ways to reason about syntax containing binding (which is the case of a
wide range of syntactic systems). This system, which results from a collaboration with the
University of Minnesota, continues to be developed and maintained by the team.
• Programming with Higher-Order Logic by Dale Miller and Gopalan Nadathur (Cambridge
University Press, 2012, 320 pages). This book puts 25 years of experience with higherorder logic programming into a format that is useful for students and researcher working
in computational logic.
• The paper “Focusing and Polarization in Linear, Intuitionistic, and Classical Logics” by
Chuck Liang and Dale Miller (Theoretical Computer Science, 410(46), 2009, pp. 47474768) provides a comprehensive framework for describing focused proof systems in classical and intuitionistic logic.
• The paper “The Focused Calculus of Structures” by Kaustuv Chaudhuri, Nicolas Guenot,
and Lutz Straßburger, (CSL 2011) unites the two pillars of research in the team: it provides
a notion of focusing for the deep inference paradigm.
IX.5.3.2
Rayonnement
• Dale Miller was awarded an ERC Advanced Grant in 2012.
• Dale Miller continues to act as one of the leaders in the area of computational logic via
his appointment as the Editor-in-Chief of the ACM Transactions on Computational Logic
(June 2009 – May 2015) and as a Program Committee Chair for the joint CSL-LICS 2014
meeting. In 2012, he was a Program Committee Chair for three different meetings: the 2nd
International Conference on Certified Programs and Proofs (CPP, Kyoto, Japan, December
2012); the 6th International Joint Conference on Automated Reasoning (IJCAR, Manchester, UK, June 2012); and the 8th Workshop on Fixed Points in Computer Science (FICS,
Tallin, Estonia, February 2012) .
• Lutz Straßburger gave a presentation on “C’est quoi, une preuve ?” within the “Unithé ou
café”-series of popular talks at the INRIA Saclay research center, March 11, 2011.
IX.5.3.3
Team members are routinely involved with teaching along various lines.
1. Stephane Graham-Lengrand is a Chargé d’Enseignement at École Polytechnique where he
teaches various undergraduate and M1 courses. In addition, he also taught at the École
d’ingénieur ESIEA in 2008, 2009 and 2010.
IX.5.3. PRODUCTION SCIENTIFIQUE
339
2. Both Graham-Lengrand and Miller have been teaching a course on proof theory at the
MPRI (“Master Parisien de Recherche en Informatique”), an M2 level course for a number
of years.
3. Miller as taught a number of one or two week graduate courses in Italy: University of Pisa
(September 2011), Bertinoro (April 2011), University of Milan (March 2010), and Universitá Ca’ Foscari di Venezia (April 2009).
4. Lutz Straßburger taught a course titled “Introduction to Proof Theory” at ESSLLI 2010 in
Copenhagen in August 2010.
340
CHAPTER IX.5. FICHE RÉSUMÉ : PARSIFAL
IX.6 Production scientifique : Parsifal
Les publications [877], [878], [872], [923] et [922] sont des publications avec des auteurs dans
des des équipes différentes.
IX.6.1
[820] Bernhard Gramlich, Dale Miller, and Uli Sattler, editors. Automated Reasoning: 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 2012, Proceedings, volume
7364 of LNAI. Springer, 2012.
[821] Chris Hawblitzel and Dale Miller, editors. CPP: Second International Conference on Certified Programs and Proofs, volume 7679 of LNCS. Springer, 2012.
[822] Dale Miller. A proof-theoretic approach to the static analysis of logic programs. In Reasoning in Simple Type Theory: Festschrift in Honor of Peter B. Andrews on His 70th Birthday,
number 17 in Studies in Logic, pages 423–442. College Publications, 2008.
[823] Dale Miller and Gopalan Nadathur. Programming with Higher-Order Logic. Cambridge
University Press, June 2012.
IX.6.2
[824] Beniamino Accattoli and Delia Kesner. Preservation of strong normalisation modulo
permutations for the structural lambda-calculus. Logical Methods in Computer Science,
8(1), 2012.
[825] Kaustuv Chaudhuri, Frank Pfenning, and Greg Price. A logical characterization of forward and backward chaining in the inverse method. J. of Automated Reasoning, 40(23):133–177, March 2008.
[826] Olivier Delande, Dale Miller, and Alexis Saurin. Proof and refutation in MALL as a
game. Annals of Pure and Applied Logic, 161(5):654–672, February 2010.
[827] Murdoch Gabbay and Stéphane Lengrand. The lambda-context calculus. Information
and Computation, 207(12):1369–1400, 2009.
[828] Andrew Gacek, Dale Miller, and Gopalan Nadathur. Nominal abstraction. Information
and Computation, 209(1):48–73, 2011.
[829] Andrew Gacek, Dale Miller, and Gopalan Nadathur. A two-level logic approach to reasoning about computations. J. of Automated Reasoning, 49(2):241–273, 2012.
[830] Alessio Guglielmi and Lutz Straßburger. A system of interaction and structure V: the
exponentials and splitting. Mathematical Structures in Computer Science, 21(3):563–584,
2011.
[831] François Lamarche. Modelling Martin Löf Type Theory in Categories. In Ch. Retoré
and J. Gilibert, editors, Logic, Categories, Semantics, special issue of J. of Applied Logic, Bordeaux, France, June 2012. Ch. Retoré and J. Gilibert, Elsevier North-Holland. Scheduled
to appear in June 2013.
[832] Stéphane Lengrand, Roy Dyckhoff, and James McKinna. A focused sequent calculus
framework for proof search in pure type systems. Logical Methods in Computer Science,
7(1), 2011.
341
BIBLIOGRAPHY
342
[833] Stéphane Lengrand and Alexandre Miquel. Classical Fω , orthogonality and symmetric
candidates. Annals of Pure and Applied Logic, 153(1–3):3–20, March 2008.
[834] Chuck Liang and Dale Miller. Focusing and polarization in linear, intuitionistic, and
classical logics. Theoretical Computer Science, 410(46):4747–4768, 2009.
[835] Chuck Liang and Dale Miller. A focused approach to combining logics. Annals of Pure
and Applied Logic, 162(9):679–697, 2011.
[836] Chuck Liang and Dale Miller. Kripke semantics and proof systems for combining intuitionistic logic and classical logic. Annals of Pure and Applied Logic, 164(2):86–111,
February 2013.
[837] Dale Miller. Formalizing operational semantic specifications in logic. Concurrency Column of the Bulletin of the EATCS, October 2008.
[838] Dale Miller and Elaine Pimentel. A formal framework for specifying sequent calculus
proof systems. Theoretical Computer Science, 474:98–116, 2013.
[839] Vivek Nigam and Dale Miller. A framework for proof systems. J. of Automated Reasoning,
45(2):157–188, 2010.
[840] Alexis Saurin. Typing streams in Λµ-calculus. ACM Transactions on Computational Logic,
11(4), 2010.
[841] Lutz Straßburger. From deep inference to proof nets via cut elimination. J. of Logic and
Computation, 21(4):589–624, August 2010.
[842] Lutz Straßburger. Extension without cut. Annals of Pure and Applied Logic, 163(12):1995–
2007, 2012.
[843] Lutz Straßburger and Alessio Guglielmi. A system of interaction and structure IV: The
exponentials and decomposition. ACM Trans. Comput. Log., 12(4):23, 2011.
[844] Alwen Tiu and Dale Miller. Proof search specifications of bisimulation and modal logics
for the π-calculus. ACM Trans. on Computational Logic, 11(2), 2010.
IX.6.3
[845] Beniamino Accattoli. An abstract factorization theorem for explicit substitutions. In
Ashish Tiwari, editor, 23rd International Conference on Rewriting Techniques and Applications (RTA), volume 15 of Leibniz International Proceedings in Informatics (LIPIcs), pages
6–21. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2012.
[846] Beniamino Accattoli. Proof pearl: Abella formalization of lambda calculus cube property. In Chris Hawblitzel and Dale Miller, editors, Second International Conference on
Certified Programs and Proofs, volume 7679 of LNCS, pages 173–187. Springer, 2012.
[847] Beniamino Accattoli and Delia Kesner. The permutative λ-calculus. In Logic for Programming, Artificial Intelligence, and Reasoning - 18th International Conference (LPAR-18),
volume 7180 of LNCS, pages 23–36. Springer, 2012.
[848] Beniamino Accattoli and Ugo Dal Lago. On the invariance of the unitary cost model
for head reduction. In Ashish Tiwari, editor, 23rd International Conference on Rewriting
Techniques and Applications (RTA), volume 15 of Leibniz International Proceedings in Informatics (LIPIcs), pages 22–37. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2012.
BIBLIOGRAPHY
343
[849] Beniamino Accattoli and Luca Paolini. Call-by-value solvability, revisited. In Eleventh International Symposium on Functional and Logic Programming (FLOPS 2012), volume 7294
of LNCS, pages 4–16. Springer, 2012.
[850] David Baelde. On the expressivity of minimal generic quantification. In A. Abel and C.
Urban, editors, International Workshop on Logical Frameworks and Meta-Languages: Theory
and Practice (LFMTP 2008), number 228 in ENTCS, pages 3–19, 2008.
[851] David Baelde. On the proof theory of regular fixed points. In Martin Giese and Arild
Waller, editors, TABLEAUX 09: Automated Reasoning with Analytic Tableaux and Related
Methods, number 5607 in LNAI, pages 93–107, 2009.
[852] David Baelde, Dale Miller, and Zachary Snow. Focused inductive theorem proving. In J.
Giesl and R. Hähnle, editors, Fifth International Joint Conference on Automated Reasoning,
number 6173 in LNCS, pages 278–292, 2010.
[853] David Baelde and Samuel Mimram. De la webradio lambda à la λ-webradio. In Ensiie
Cedric, editor, Journées Francophones des Langages Applicatifs, pages 47–61. INRIA, 2008.
[854] Alexis Bernadet and Stéphane Lengrand. Complexity of strongly normalising λ-terms
via non-idempotent intersection types. In Martin Hofmann, editor, Proceedings of the
14th international conference on Foundations of Software Science and Computation Structures
(FOSSACS’11), volume 6604 of LNCS. Springer, March 2011.
[855] Alexis Bernadet and Stéphane Lengrand. Filter models: non-idempotent intersection
types, orthogonality and polymorphism. In Marc Bezem, editor, Proceedings of the 20th
Annual conference of the European Association for Computer Science Logic (CSL’11), Leibniz
International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl–Leibniz-Zentrum für
Informatik, September 2011.
[856] Kai Brünnler and Lutz Straßburger. Modular sequent systems for modal logic. In Martin Giese and Arild Waller, editors, TABLEAUX 09: Automated Reasoning with Analytic
Tableaux and Related Methods, number 5607 in LNAI, pages 152–166. Springer, 2009.
[857] Paola Bruscoli, Alessio Guglielmi, Tom Gundersen, and Michel Parigot. A quasipolynomial cut-elimination procedure in deep inference via atomic flows and threshold formulae. In Edmund Clarke and Andrei Voronkov, editors, Proceedings of the 16th International
Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2009),
volume 6355 of LNAI, Dakar, Senegal, April 2010. Springer.
[858] Kaustuv Chaudhuri. Classical and intuitionistic subexponential logics are equally expressive. In Anuj Dawar and Helmut Veith, editors, CSL 2010: Computer Science Logic,
volume 6247 of LNCS, pages 185–199, Brno, Czech Republic, August 2010. Springer.
[859] Kaustuv Chaudhuri. Magically constraining the inverse method using dynamic polarity
assignment. In Christian Fermüller and Andrei Voronkov, editors, Proc. 17th Int. Conf. on
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), volume 6397 of LNCS,
pages 202–216, Yogyakarta, Indonesia, October 2010. Springer.
[860] Kaustuv Chaudhuri. Compact proof certificates for linear logic. In Chris Hawblitzel and
Dale Miller, editors, Proceedings of the Second Internatinal Conference on Certified Programs
and Proofs (CPP), volume 7679 of LNCS, pages 208–223, Kyoto, Japan, December 2012.
Springer.
[861] Kaustuv Chaudhuri. Subformula linking as an interaction method. In Sandrine Blazy,
Christine Paulin-Mohring, and David Pichardie, editors, Proceedings of the 4th Conference
on Interactive Theorem Proving (ITP), volume 7998 of LNCS, pages 386–401. Springer, July
2013.
344
BIBLIOGRAPHY
[862] Kaustuv Chaudhuri and Joëlle Despeyroux. A hybrid linear logic for constrained transition systems. Collected Abstracts of the 19th Conference on Types for Proofs and Programs (TYPES), April 2013. http://chaudhuri.info/papers/abst13hyll.pdf.
[863] Kaustuv Chaudhuri, Damien Doligez, Leslie Lamport, and Stephan Merz. Verifying
safety properties with the TLA+ proof system. In Jürgen Giesl and Reiner Hähnle, editors, Fifth International Joint Conference on Automated Reasoning, volume 6173 of LNAI,
pages 142–148, Edinburgh, UK, July 2010. Springer.
[864] Kaustuv Chaudhuri, Damien Doligez, Stephan Merz, and Leslie Lamport. The TLA+
proof system: Building a heterogeneous verification platform. In Ana Cavalcanti, David
Déharbe, Marie-Claude Gaudel, and Jim Woodcock, editors, Proceedings of the 7th International Colloquium on Theoretical Aspects of Computing (ICTAC), volume 6256 of LNCS,
page 44, Natal, Rio Grande do Norte, Brazil, September 2010. Springer.
[865] Kaustuv Chaudhuri, Nicolas Guenot, and Lutz Straßburger. The Focused Calculus of
Structures. In Computer Science Logic: 20th Annual Conference of the EACSL, Leibniz International Proceedings in Informatics (LIPIcs), pages 159–173. Schloss Dagstuhl–LeibnizZentrum für Informatik, September 2011.
[866] Kaustuv Chaudhuri, Stefan Hetzl, and Dale Miller. A systematic approach to canonicity
in the classical sequent calculus. In Patrick Cégielski and Arnaud Durand, editors, CSL
2012: Computer Science Logic, volume 16 of Leibniz International Proceedings in Informatics
(LIPIcs), pages 183–197. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, September
2012.
[867] Kaustuv Chaudhuri, Dale Miller, and Alexis Saurin. Canonical sequent proofs via
multi-focusing. In G. Ausiello, J. Karhumäki, G. Mauri, and L. Ong, editors, Fifth International Conference on Theoretical Computer Science, volume 273 of IFIP, pages 383–396.
Springer, September 2008.
[868] Zakaria Chihani, Dale Miller, and Fabien Renaud. Checking foundational proof certificates for first-order logic (extended abstract). In J. C. Blanchette and J. Urban, editors,
Third International Workshop on Proof Exchange for Theorem Proving (PxTP 2013), volume
14 of EPiC Series, pages 58–66. EasyChair, 2013.
[869] Zakaria Chihani, Dale Miller, and Fabien Renaud. Foundational proof certificates in
first-order logic. In Maria Paola Bonacina, editor, CADE 24: Conference on Automated
Deduction 2013, number 7898 in LNAI, pages 162–177, 2013.
[870] Agata Ciabattoni, Lutz Straßburger, and Kazushige Terui. Expanding the realm of systematic proof theory. In Erich Grädel and Reinhard Kahle, editors, Computer Science
Logic, CSL’09, volume 5771 of Lecture Notes in Computer Science, pages 163–178. Springer,
2009.
[871] Olivier Delande and Dale Miller. A neutral approach to proof and refutation in MALL.
In F. Pfenning, editor, 23th Symp. on Logic in Computer Science, pages 498–508. IEEE
Computer Society Press, 2008.
[872] Mahfuza Farooque, Stéphane Graham-Lengrand, and Assia Mahboubi. A bisimulation
between DPLL(T) and a proof-search strategy for the focused sequent calculus. In Alberto Momigliano, Brigitte Pientka, and Randy Pollack, editors, Proceedings of the 2013
ACM SIGPLAN Workshop on Logical Frameworks & Meta-Languages: Theory & Practice,
LFMTP’13, pages 3–13. ACM, September 2013.
[873] Murdoch Gabbay and Stéphane Lengrand. The lambda-context calculus. In Brigitte
Pientka and Carsten Schürmann, editors, Revisions from the Second International Workshop
on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2007), volume
196 of Electronic Notes in Theoretical Computer Science, pages 19–35, 2008.
BIBLIOGRAPHY
345
[874] Andrew Gacek. Relating nominal and higher-order abstract syntax specifications. In
Proceedings of the 2010 Symposium on Principles and Practice of Declarative Programming,
pages 177–186. ACM, July 2010.
[875] Andrew Gacek, Dale Miller, and Gopalan Nadathur. Combining generic judgments
with recursive definitions. In F. Pfenning, editor, 23th Symp. on Logic in Computer Science,
pages 33–44. IEEE Computer Society Press, 2008.
[876] Andrew Gacek, Dale Miller, and Gopalan Nadathur. Reasoning in Abella about structural operational semantics specifications. In A. Abel and C. Urban, editors, International
Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2008),
number 228 in ENTCS, pages 85–100, 2008.
[877] Ivan Gazeau, Dale Miller, and Catuscia Palamidessi. A non-local method for robustness
analysis of floating point programs. In Herbert Wiklicky and Mieke Massink, editors,
Proceedings of the 10th Workshop on Quantitative Aspects of Programming Languages and
Systems (QAPL 2012), volume 85 of Electronic Proceedings in Theoretical Computer Science,
pages 63–76, 2012.
[878] Ivan Gazeau, Dale Miller, and Catuscia Palamidessi. Preserving differential privacy under finite-precision semantics. In Proceedings 11th International Workshop on Quantitative
Aspects of Programming Languages and Systems (QAPL), pages 1–18, 2013.
[879] Stéphane Graham-Lengrand. Psyche: a proof-search engine based on sequent calculus
with an LCF-style architecture. In Didier Galmiche and Dominique Larchey-Wendling,
editors, International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (Tableaux’13), LNCS. Springer, September 2013.
[880] Nicolas Guenot. Focused proof search for linear logic in the calculus of structures. In
Manuel V. Hermenegildo and Torsten Schaub, editors, Technical Communications of the
26th International Conference on Logic Programming (ICLP 2010), volume 7 of Leibniz International Proceedings in Informatics (LIPIcs), pages 84–93, Edinburgh, United Kingdom,
July 2010. Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
[881] Nicolas Guenot. Nested proof search as reduction in the lambda-calculus. In Proceedings
of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative
Programming (PPDP), pages 183–194, 2011.
[882] Alessio Guglielmi, Tom Gundersen, and Michel Parigot. A proof calculus which reduces
syntactic bureaucracy. In Christopher Lynch, editor, Proceedings of the 21st International
Conference on Rewriting Techniques and Applications (RTA 2010), volume 6 of Leibniz International Proceedings in Informatics (LIPIcs), pages 135–150, Edinburgh, United Kingdom,
July 2010. Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
[883] Alessio Guglielmi, Tom Gundersen, and Lutz Straßburger. Breaking paths in atomic
flows for classical logic. In Jean-Pierre Jouannaud, editor, 25th Symp. on Logic in Computer
Science, pages 284–293, Edinburgh, United Kingdom, July 2010.
[884] Stefan Hetzl. Project Presentation: Algorithmic Structuring and Compression of Proofs
(ASCOP). In J. Jeuring et al., editor, Conference on Intelligent Computer Mathematics
(CICM) 2012, volume 7362 of Lecture Notes in Artificial Intelligence, pages 437–441.
Springer, 2012.
[885] Stefan Hetzl and Lutz Straßburger. Herbrand-Confluence for Cut-Elimination in Classical First-Order Logic. In Patrick Cégielski and Arnaud Durand, editors, Computer Science
Logic (CSL) 2012, volume 16 of Leibniz International Proceedings in Informatics (LIPIcs),
pages 320–334. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2012.
346
BIBLIOGRAPHY
[886] Kentaro Kikuchi and Stéphane Lengrand. Strong normalisation of cut-elimination that
simulates β-reduction. In Roberto Amadio, editor, 11th International Conference on Foundations of Software Science and Computation Structures (FOSSACS’08), volume 4962 of
LNCS, pages 380–394, Budapest, Hungary, March 2008. Springer.
[887] Chuck Liang and Dale Miller. A unified sequent calculus for focused proofs. In 24th
Symp. on Logic in Computer Science, pages 355–364, 2009.
[888] Chuck Liang and Dale Miller. Unifying classical and intuitionistic logics for computational control. In Orna Kupferman, editor, 28th Symp. on Logic in Computer Science, pages
283–292, 2013.
[889] Dale Miller. Finding unity in computational logic. In Proceedings of the 2010 ACM-BCS
Visions of Computer Science Conference, ACM-BCS ’10, pages 3:1–3:13. British Computer
Society, April 2010.
[890] Dale Miller. A proposal for broad spectrum proof certificates. In J.-P. Jouannaud and Z.
Shao, editors, CPP: First International Conference on Certified Programs and Proofs, volume
7086 of LNCS, pages 54–69, 2011.
[891] Dale Miller. Foundational proof certificates: Making proof universal and permanent. In
Alberto Momigliano, Brigitte Pientka, and Randy Pollack, editors, Proceedings of the 2013
ACM SIGPLAN Workshop on Logical Frameworks & Meta-Languages: Theory & Practice,
LFMTP’13, page 1. ACM, September 2013.
[892] Dale Miller and Zoltán Ésik, editors. Proceedings 8th Workshop on Fixed Points in Computer Science, volume 77 of Electronic Proceedings in Theoretical Computer Science, 2012.
[893] Dale Miller and Alwen Tiu. Extracting proofs from tabled proof search. In Georges
Gonthier and Michael Norrish, editors, Second International Conference on Certified Programs and Proofs, LNCS, Melburne, Australia, December 2013. Springer. To appear.
[894] Vivek Nigam. Using tables to construct non-redundant proofs. In CiE 2008: Abstracts
and extended abstracts of unpublished papers, 2008.
[895] Vivek Nigam and Dale Miller. Focusing in linear meta-logic. In Proceedings of IJCAR:
International Joint Conference on Automated Reasoning, volume 5195 of LNAI, pages 507–
522. Springer, 2008.
[896] Vivek Nigam and Dale Miller. Algorithmic specifications in linear logic with subexponentials. In ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP), pages 129–140, 2009.
[897] Alexis Saurin. On the relations between the syntactic theories of λµ-calculi. In 17th
EACSL Annual Conference on Computer Science Logic 2008 (CSL 2008), LNCS. Spring,
September 2008. To appear.
[898] Alexis Saurin. Towards ludics programming: Interactive proof search. In Logic Programming, 24th International Conference, volume 5366 of LNCS, pages 253–268, December
2008.
[899] Lutz Straßburger. A Kleene theorem for forest languages. In Adrian Horia Dediu,
Armand-Mihai Ionescu, and Carlos Martı́n-Vide, editors, Language and Automata Theory
and Applications, LATA’09, volume 5457 of LNCS, pages 715–727. Springer, 2009.
[900] Lutz Straßburger. Some observations on the proof theory of second order propositional
multiplicative linear logic. In Pierre-Louis Curien, editor, Typed Lambda Calculi and Applications, TLCA’09, volume 5608 of LNCS, pages 309–324. Springer, 2009.
BIBLIOGRAPHY
347
[901] Lutz Straßburger. Cut elimination in nested sequents for intuitionistic modal logics.
In Frank Pfenning, editor, Foundations of Software Science and Computation Structures,
16th International Conference (FOSSACS), volume 7794 of LNCS, pages 209–224. Springer,
2013.
[902] Yuting Wang, Kaustuv Chaudhuri, Andrew Gacek, and Gopalan Nadathur. Reasoning
about higher-order relational specifications. In Tom Schrijvers, editor, Proceedings of the
15th International Symposium on Princples and Practice of Declarative Programming (PPDP),
pages 157–168, Madrid, Spain, September 2013.
IX.6.4
[903] Dale Miller. Formalizing operational semantic specifications in logic. In Proceedings of
the 17th International Workshop on Functional and (Constraint) Logic Programming (WFLP
2008), volume 246, pages 147–165, August 2009.
[904] Dale Miller. Reasoning about computations using two-levels of logic. In K. Ueda,
editor, Proceedings of the 8th Asian Symposium on Programming Languages and Systems
(APLAS’10), number 6461 in LNCS, pages 34–46, 2010.
[905] Lutz Straßburger. What is the problem with proof nets for classical logic? In Fernando
Ferreira, Benedikt Löwe, Elvira Mayordomo, and Luı́s Mendes Gomes, editors, Programs,
Proofs, Processes, 6th Conference on Computability in Europe (CiE 2010), volume 6158 of
LNCS, pages 406–416, Ponta Delgada, Azores, Portugal, June 2010. Springer.
IX.6.5
Logiciel
[906] The Abella prover, 2012. Available at http://abella-prover.org/.
[907] The Bedwyr model checker, 2012. Available at http://slimmer.gforge.inria.fr/
bedwyr/.
[908] Kaustuv Chaudhuri. Profound: a linking-based interactive prover, 2013. Available at:
http://chaudhuri.info/software/profound/.
[909] Kaustuv Chaudhuri, Denis Cousineau, Damien Doligez, Markus Kuppe, Leslie Lamport, Tomer Libal, Stephan Merz, and Hernán Vanzetto. TLAPS: the TLA+ proof system,
2013. Available from http://tla.msr-inria.inria.fr/tlaps/.
[910] Psyche: the Proof-Search factorY for Collaborative HEuristics, 2012. Available at http:
//www.lix.polytechnique.fr/lengrand/Psyche.
IX.6.6
Thèses
[911] David Baelde. A linear approach to the proof-theory of least and greatest fixed points. PhD
thesis, Ecole Polytechnique, December 2008.
[912] Olivier Delande. Symmetric Dialogue Games in the Proof Theory of Linear Logic. PhD
thesis, Ecole Polytechnique, October 2009.
[913] Nicolas Guenot. Nested Deduction in Logical Foundations for Computation. Ph.d. thesis,
Ecole Polytechnique, 2013.
[914] Vivek Nigam. Exploiting non-canonicity in the sequent calculus. PhD thesis, Ecole Polytechnique, September 2009.
BIBLIOGRAPHY
348
[915] Alexis Saurin. Une étude logique du contrôle (appliquée à la programmation fonctionnelle et
logique). PhD thesis, Ecole Polytechnique, September 2008.
IX.6.7
[916] Lutz Straßburger. Towards a Theory of Proofs of Classical Logic. Habiliatation à diriger des
recherches, Université Paris VII, 2011.
IX.6.8
Rapports techniques
[917] David Baelde. On the expressivity of minimal generic quantification: Extended version. Technical Report inria-00284186, INRIA/HAL, 2008. http://hal.inria.fr/
inria-00284186.
[918] Alexis Bernadet and Stéphane Lengrand. Filter models: non-idempotent intersection
types, orthogonality and polymorphism - long version. Technical Report hal-00600070,
Laboratoire d’informatique de l’école polytechnique - LIX, CNRS-Ecole PolytechniqueINRIA, June 2011. http://hal.archives-ouvertes.fr/hal-00600070/en/.
[919] Kaustuv Chaudhuri and Joëlle Despeyroux. A hybrid linear logic for constrained transition systems with applications to molecular biology. Research Report inria-00402942,
INRIA-HAL, 2009. http://hal.archives-ouvertes.fr/inria-00402942/en/.
[920] Mahfuza Farooque and Stéphane Graham-Lengrand. Sequent calculi with procedure
calls. Technical report, Laboratoire d’informatique de l’école polytechnique - LIX,
CNRS-Ecole Polytechnique-INRIA, January 2013. http://hal.archives-ouvertes.fr/
hal-00779199.
[921] Mahfuza Farooque and Stéphane Lengrand. A sequent calculus with procedure calls.
Technical report, Laboratoire d’informatique de l’école polytechnique - LIX, CNRSEcole Polytechnique-INRIA, December 2011. http://hal.archives-ouvertes.fr/
hal-00690577.
[922] Mahfuza Farooque, Stéphane Lengrand, and Assia Mahboubi.
Simulating the
DPLL(T) procedure in a sequent calculus with focusing. Technical report, Laboratoire
d’informatique de l’école polytechnique - LIX, CNRS-Ecole Polytechnique-INRIA, March
2012. http://hal.inria.fr/hal-00690392.
[923] Mahfuza Farooque, Stéphane Lengrand, and Assia Mahboubi. Two simulations about
DPLL(T). Technical report, Laboratoire d’informatique de l’école polytechnique - LIX,
CNRS-Ecole Polytechnique-INRIA, March 2012. http://hal.archives-ouvertes.fr/
hal-00690044.
[924] François Lamarche. Path Functors in Cat. Technical Report hal-00831430, INRIA, 2013.
Submitted, http://hal.inria.fr/hal-00831430.
[925] Laurent Méhats and Lutz Straßburger. Non-crossing tree realizations of ordered degree
sequences. Research Report hal-00649591, INRIA, December 2009. http://hal.inria.
fr/hal-00649591.
[926] Michele Pagani and Alexis Saurin. Stream associative nets and lambda-mu-calculus.
Technical Report 6431, INRIA, January 2008. http://hal.inria.fr/inria-00221221/
en.
IX.6.9. AUTRES
IX.6.9
349
Autres
[927] Alexis Bernadet and Stéphane Graham-Lengrand. A big-step operational semantics via
non-idempotent intersection types. Submitted, April 2013.
[928] Alexis Bernadet and Stéphane Lengrand. Non-idempotent intersection types and strong
normalisation. Submitted, February 2012.
[929] Stefan Hetzl. On the form of witness terms. Draft manuscript, 2009.
350
BIBLIOGRAPHY
IX.7 Annexes : Parsifal
IX.7.1
et d’enseignement
• Stéphane Graham-Lengrand
– est membre élu du Comité Enseignement-Recherche du département d’informatique
de l’Ecole Polytechnique (période 2010-).
– est responsable des programmes de Master 1 Informatique de l’Ecole Polytechnique
(période 2011-).
– est représentant de l’Informatique au Comité des thèses de l’Ecole Doctorale de l’Ecole
Polytechnique (période 2008-).
– est responsable du GT “Logique, Algèbre, Calcul” du GDR Informatique-Mathématique
du CNRS (période 2011-).
IX.7.1.1
ProofCert (2012–2016) (Type: ERC Advanced Grant) Titre: Broad Spectrum Proof Certificates.
Partenaires: University of Minnesota, Hofstra University, UFMG et FUP Brazil. Responsable:
Dale Miller. Montant de la collaboration pour le LIX: 2 200 000 euros.
This grant from the ERC has allowed the team to make a major commitment to the development of a framework for designing, checking, and producing proof certificates. This grant will
fund 8 years of postdoctoral researchers as well as three Ph.D. students. It will also allow us to organize a number of workshops (such as the LIX Colloquium 2013: The Theory and Applications
of Formal Proofs, November 2013). https://team.inria.fr/parsifal/proofcert/
RAPT (2011–2016) (Type: Équipe Associée INRIA) Titre: Applying Recent Advances in Proof
Theory for Specification and Reasoning.
Partenaires: LIX, McGill Univ. (Canada), Carnegie
Mellon Univ. (États-Unis), et Univ. Minnesota (États-Unis). Responsable: Kaustuv Chaudhuri.
Montant de la collaboration pour le LIX: 80 000 euros.
This funding has made it possible to maintain a multi-year association with three research
teams in North America. These three teams have supplied us with summer interns as well as
strong connections with senior researchers working on type systems, logical frameworks, and
systems implementations. http://chaudhuri.info/rapt/
Redo (2009–2010) (Type: INRIA ARC) Titre: Redesigning logical syntax.
Partenaires:
INRIA Nancy–Grand Est, University of Bath, INRIA Saclay–Île-de-France. Responsable: Lutz
Straßburger. Montant de la collaboration pour le LIX: 90 000 euros.
This grant supported one postdoc at LIX and travel expenses for visits between the three sites
and to conferences. http://www.lix.polytechnique.fr/˜lutz/orgs/redo.html
Slimmer (2005-2010) (Type: INRIA Equipe Associée) Titre: Sophisticated Logic Implementations for Modeling and Mechanical Reasoning http:// slimmer.gforge.inria.fr/ . Partenaires:
University of Minnesota and LIX. Responsable: Dale Miller. Montant de la collaboration pour
le LIX: 70 000 euros.
Our collaboration with the University of Minnesota was instrumental for our efforts at developing two computer systems that have become core in our work on computational logic.
351
352
CHAPTER IX.7. ANNEXES : PARSIFAL
From Proofs to Counterexamples for Programming (2012–2013) (Type: PHC PROCOPE) Titre:
From Proofs to Counterexamples for Programming.
Partenaires: INRIA Saclay–Île-de-France,
Universität Bonn. Responsable: Lutz Straßburger. Montant de la collaboration pour le LIX: 6
600 euros.
This grant supports short visits from LIX researchers to Bonn.
Extending the Realm of the Curry-Howard-Correspondence (2011–2012) (Type: PHC GERMAINE DE STAEL) Titre: Extending the Realm of the Curry-Howard-Correspondence.
Partenaires: INRIA Saclay–Île-de-France, Universität Bern. Responsable: Lutz Straßburger. Montant
de la collaboration pour le LIX: 4 300 euros.
This grant supported short visits from LIX researchers to Bern.
Deep Inference and the Essence of Proofs (2007–2008) (Type: PHC GERMAINE DE STAEL)
Titre: Deep Inference and the Essence of Proof.
Partenaires: INRIA Saclay–Île-de-France, Universität Bern. Responsable: Lutz Straßburger. Montant de la collaboration pour le LIX: 4 000
euros.
This grant supported short visits from LIX researchers to Bern.
IX.7.1.2
INFER (2007–2010) (Type: Projet ANR blanc) Titre: Theory and Application of Deep Inference.
Partenaires: LIX, PPS, LORIA. Responsable: Lutz Straßburger. Montant de la collaboration
This three-year ANR project supported a one-year postdoc at LIX and a three-year Ph.D. at
the LORIA (Nancy), as well travel expenses to various conferences and mutual visits. http:
//www.lix.polytechnique.fr/˜lutz/orgs/infer.html
PSI (2009–2013) (Type: Projet ANR JCJC) Titre: Proof-Search control in Interaction with domainspecific methods. Partenaires: LIX. Responsable: Stéphane Graham-Lengrand. Montant de la
This grant supports an a research effort between Parsifal and the Typical teams. It finances
two Ph.D. students under the supervision of Graham-Lengrand as well as providing travel funds.
http://www.lix.polytechnique.fr/˜lengrand/PSI/
Eternal (2011–2013) (Type: INRIA ARC) Titre: Implicit Complexity and Interactive Theorem
Proving for Ressource Analysis. Partenaires: U. Bologna, PPS, LIX. Responsable: Ugo Dal Lago.
Montant de la collaboration pour le LIX: 45000 euros.
These funds allowed for the start of collaboration between Parsifal and research teams at the
University of Bologna and at PPS in Paris. A postdoc at Bologna was supported by these funds.
http://eternal.cs.unibo.it/
IX.7.1.3
STRUCTURAL (2011–2013) (Type: Projet ANR-FWF) Titre: Structural and Computational
Proof Theory. Partenaires: LIX, Univ. Paris 7, University of Innsbruck, et Vienna University of
Technology. Responsable: Lutz Straßburger. Montant de la collaboration pour le LIX: 242 390
euros.
This three-year ANR project supports several postdocs at all four sites, regular workshops,
and travel expenses for mutual visits and for conferences. http://www.lix.polytechnique.
fr/˜lutz/orgs/structural.html
IX.7.2. ADMINISTRATION DE LA RECHERCHE
353
REUSSI (2010-2013) (Type: NSF and INRIA) Titre: Research Experience for US Students at
INRIA. Partenaires: numerous US Universities and various INRIA sites. Responsable: Robert
France. Montant de la collaboration pour le LIX: 3 000 euros.
These funds paid for travel between the USA and France for summer interns working on the
Slimmer and the Rapt projects. http://www.cs.colostate.edu/˜france/REUSSI.htm
CPCFQ (2011-2012) (Type: Quebec Embassy and LIX) Titre: Exchange of junior researchers.
Partenaires: McGill University and Parsifal. Responsable: Dale Miller. Montant de la collaboration pour le LIX: 6 000 euros.
These funds paid for travel and accommodations for junior researchers from Parsifal to travel
to McGill University in Quebec.
IX.7.1.4
Projet CPP (2011–2013) (Type: Projet ANR) Titre: Confidence, Proofs, and Probabilities. Partenaires: LIX, LSV, CEA, Supelec. Responsable: J. Goubault-Larrecq. Montant de la collaboration
These fund supported a Ph.D. student (Gazeau) who was co-advised by the team leaders of
Comète and Parsifal. Work on these funds focus on developing proof methods for establishing
systems that need to compute with real numbers but used fixed precision arithmetic instead.
http://www.lix.polytechnique.fr/˜bouissou/cpp/
Projet Panda (2011–2013) (Type: Projet ANR) Titre: Parallel and Distributed Analysis. Partenaires: LIX, CEA, LIPN, PPS. Responsable: C. Palamidessi. Montant de la collaboration pour le
LIX: 142 000 euros.
The aim of this grant was to bring together different mathematical models of parallel and
concurrent computation different theoretical frameworks for static analysis, in order to guide
the development of software tools that meet industrial needs of program specification and verification. These funds support a Ph.D. student and postdoc (outside of Parsifal). http://www.
lix.polytechnique.fr/˜mh/panda/index.php
IX.7.2
IX.7.2.1
• ACM Transactions on Computational Logic (ACM) Dale Miller (1999-). Voir http://
tocl.acm.org/.
• Journal of Automated Reasoning (Springer) Dale Miller (2011-). Voir http://www.springer.
com/computer/theoretical+computer+science/journal/10817.
• Journal of Applied Logic (Elsevier) Dale Miller (2003-). Voir http://www.journals.
elsevier.com/journal-of-applied-logic/.
• Journal of Logic and Computation (Oxford University Press) Dale Miller (1989-2012).
Voir http://logcom.oxfordjournals.org/.
• Theory and Practice of Logic Programming (Cambridge University Press) Dale Miller
(1999-). Voir http://journals.cambridge.org/action/displayJournal?jid=TLP.
354
• Logical Methods in Computer Science (online publication) Special Issue on Computational
Logic in honour of Roy Dyckhoff Stéphane Graham-Lengrand, LIX
• Electronic Proceedings in Theoretical Computer Science (online publication) Post-proceedings
of the 6th workshop on “Intersection Types and Related Systems” Stéphane Graham-Lengrand,
LIX
IX.7.2.2
Présidence de comités de pilotage
• LICS (Advisory Board for Logic in Computer Science) (2012-). Dale Miller.
• CPP (Steering Committee for Certified Programs and Proofs) (2012-). Dale Miller.
• FICS (Steering Committee for the Workshop on Fixed Points in Computer Science) (2012). Dale Miller.
• IJCAR (Steering Committee for the International Joint Conference on Automated Reasoning) (2011-2012). Dale Miller.
• CSL-LICS (Joint meeting of CSL and LICS 2014) (2014). Dale Miller.
• CPP (Certified Proofs and Programs) (2012). Dale Miller.
• IJCAR (International Joint Conference on Automated Reasoning) (2012). Dale Miller.
• FICS (Workshop on Fixed Points in Computer Science) (2012). Dale Miller.
• Tableaux (Automated Reasoning with Analytic Tableaux and Related Methods) (2013).
Dale Miller.
• CPP (Second International Conference on Certified Programs and Proofs) (2012). Dale
Miller.
• LFMTP (Workshop on Logical Frameworks and Meta-Languages: Theory and Practice)
(2012). Dale Miller.
• LAM (Fifth International Workshop on Logics, Agents, and Mobility) (2012). Dale
Miller.
• LPAR (The 18th International Conference on Logic for Programming, Artificial Intelligence and Reasoning) (2012). Dale Miller.
• FICS (Fixed Points in Computer Science) (2012). Dale Miller.
• IJCAR (International Joint Conference on Automated Reasoning) (2012). Dale Miller.
• LAM (Fourth International Workshop on Logics, Agents, and Mobility) (2011). Dale
Miller.
• MLPA (Modules and Libraries for Proof Assistants) (2011). Dale Miller.
IX.7.2. ADMINISTRATION DE LA RECHERCHE
355
• LICS (Logic in Computer Science) (2011). Dale Miller.
• Tableaux ( 20th International Conference on Automated Reasoning with Analytic Tableaux
and Related Methods) (2011). Dale Miller.
• LPAR (17th International Conference on Logic for Programming Artificial Intelligence
and Reasoning) (2010). Dale Miller.
• PSPL (Workshop on Proof Systems for Program Logics) (2010). Dale Miller.
• LAM (Workshop on Logics for Agents and Mobility) (2010). Dale Miller.
• PSTT (Workshop on Proof-Search in Type Theories) (2010). Dale Miller.
• PLMMS (Workshop on Programming Languages for Mechanized Mathematics Systems)
• IFIP-TCS (International Conference on Theoretical Computer Science) (2010). Dale
Miller.
• GAMES (Workshop on Games, Dialogue and Interaction) (2009). Dale Miller.
• LAM (Logics for Agents and Mobility) (2009). Dale Miller.
• GaLoP (Games for Logic and Programming Languages) (2009). Dale Miller.
• CSL (18th Annual Conference of the European Association for Computer Science Logic)
• LSFA (Fourth Logical and Semantic Frameworks, with Applications) (2009). Dale Miller.
• ICALP (International Colloquium on Automata, Languages and Programming) (2009).
Dale Miller.
• PPDP (10th International ACM SIGPLAN Symposium on Principles and Practice of
Declarative Programming) (2008). Dale Miller.
• ESHOL (Evaluation of Systems for Higher Order Logic) (2008). Dale Miller.
• LAM (Logics for Agents and Mobility Workshop) (2008). Dale Miller.
• LSFA (Third Workshop on Logical and Semantic Frameworks with Applications) (2008).
Dale Miller.
• CSL (17th Annual Conference of the European Association for Computer Science Logic)
• TCS (5th IFIP International Conference on Theoretical Computer Science) (2008). Dale
Miller.
• FOSSACS (Foundations of Software Science and Computation Structures) (2008). Dale
Miller.
• FLOPS (Ninth International Symposium on Functional and Logic Programming) (2008).
Dale Miller.
• FOSSACS (Foundations of Software Science and Computation Structures) (2013). Stéphane
Graham-Lengrand.
• IJCAR (International Joint Conference on Automated Reasoning) (2012). Stéphane GrahamLengrand.
356
• ITRS (Intersection Types and Related Systems) (2012). Stéphane Graham-Lengrand.
• LICS (Logic in Computer Science) (2010). Stéphane Graham-Lengrand.
• CLAC (Classical Logic and Computation) (2010). Stéphane Graham-Lengrand.
• PSTT-PSATTT (Proof-Search in Type Theory, Proof-Search in Axiomatic Theories and
Type Theory) (2008,2009,2010,2011,2013). Stéphane Graham-Lengrand.
IX.7.2.3
• ASL (Special Session on Structural Proof Theory and Computing) (2012). Dale Miller.
• PSTT-PSATTT (Proof-Search in Type Theory, Proof-Search in Axiomatic Theories and
Type Theory) (2008,2009,2010,2011,2013). Stéphane Graham-Lengrand.
• Journées LAC - GeoCal (rencontre commune des groupes de travail GEOCAL (Géométrie
du calcul) et LAC (Logique, Algèbre et Calcul) du GDR Informatique mathématique)
(2011). Stéphane Graham-Lengrand and Lutz Straßburger.
• REDO (Third meeting on Redesigning Logical Syntax, Bath, September 14–16, 2010)
(2010). Lutz Straßburger.
• REDO (First meeting on Redesigning Logical Syntax, Palaiseau, May 26–29, 2009) (2009).
Lutz Straßburger.
• SD09 (Structures and Deduction, Workshop at ESSLLI’09, Bordeaux, July 20–24, 2009)
• CL (Collegium Logicum) (2012). Kaustuv Chaudhuri.
• Structural (Workshop on Structural Proof Theory, Paris, November 19–21, 2008) (2008).
Lutz Straßburger.
• REDO (Second meeting on Redesigning Logical Syntax, Nancy, November 16–18, 2009)
IX.7.2.4
• Beth Dissertation Award (2011-2013) Dale Miller. Member of the selection jury.
• EATCS Award Committee (2013) Dale Miller. Member of the selection jury.
• Herbrand Award Committee (2012) Dale Miller. Member of the selection jury.
• Evaluation of Research at the University of Uppsala (2011) Dale Miller. Member of Evaluation Panel.
Au niveau national
• Comité de programmes (2010-2011) Dale Miller. Member.
IX.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION
357
• INRIA Saclay hiring committee for CR (Dale Miller) 2008
• Comité de sélection sur le poste 27PR90 ‘Logique et vérification’ à Rennes 1 (Dale Miller)
2010
• Université Paris 7, poste MdC (Stéphane Graham-Lengrand) 2010
IX.7.3
IX.7.3.1
• Lutz Straßburger (7 January 2010). Towards a Theory of Proofs of Classical Logic
• Nicolas Guenot (10 April 2013). Nested Deduction in Logical Foundations for Computation. Encadrant: Lutz Straßburger.
• Olivier Delande (15 October 2009). Symmetric Dialogue Games in the Proof Theory of
Linear Logic. Encadrant: Dale Miller.
• Vivek Nigam (18 September 2009). Exploiting non-canonicity in the sequent calculus.
Encadrant: Dale Miller.
• David Baelde (9 December 2008). A linear approach to the proof-theory of least and greatest fixed points. Encadrant: Dale Miller.
• Alexis Saurin (30 September 2008). Une étude logique du contrôle.
Miller.
IX.7.3.2
Encadrant: Dale
Rapports d’habilitations à diriger les recherches
• Stefan Hetzl (5 November 2012). Computational Proof Analysis.
Miller.
Rapporteur: Dale
Rapports de thèse
• Novak Novakovic (8 November 2011). Sémantique algébrique des ressources pour la logique
classique. Institut National Polytechnique de Lorraine, Nancy. Rapporteur: Lutz Straßburger.
• Matthias Puech (8 April 2013). Certificates for incremental type checking. University of
Bologna. Rapporteur: Dale Miller.
• Nicolas Pouillard (13 January 2012). A unifying approach to safely program with firstorder syntax with binders. University of Paris 7. Rapporteur: Dale Miller.
• Anders Starcke Henriksen (10 December 2011). Adversarial Models for Cooperative Interactions. University of Copenhagen. Rapporteur: Dale Miller.
• Daniel Weller (12 January 2011). CERES in Higher-Order Logic. Technische Universität
Wien. Rapporteur: Dale Miller.
• Anders Starcke Henriksen (December 2011).
Dale Miller.
University of Copenhagen. Rapporteur:
358
Jury member
• Robert Simmons (22 October 2012). Substructural Logical Specifications.
Carnegie Mellon University. Dale Miller
Membre:
• Francois Garillot (5 December 2011). Generic Proof Tools and Finite Group Theory. Président:
Ecole Polytechnique. Dale Miller
• Xiaochu Qi (9 September 2009). An implementation of the language λProlog organized
around higher-order pattern unification. Membre: Computer Science Department, University of Minnesota. Dale Miller
• Andrew Gacek (8 September 2009). A framework for specifying, prototyping, and reasoning about computational systems. Membre: Computer Science Department, University of
Minnesota. Dale Miller
• Clement Houtmann (12 March 2010). Représentation et interaction des preuves en superdéduction modulo. Membre: Université Henri Poincaré, Nancy. Dale Miller
• Elie Soubiran (27 September 2010). Modular development of theories and name-space
management for the Coq proof assistant. Président: Ecole Polytechnique. Dale Miller
• Denis Cousineau (1 December 2009). Models and proof normalization. Membre: Ecole
Polytechnique. Dale Miller
• Samuel Mimram (1 December 2008). Asynchronous Games: from Sequentiality to Concurrency. Membre: Université Paris VII. Dale Miller
• Paolo Di Giamberardino (18 April 2008). Jump from Parallel to Sequential Proofs: on
Polarities and Sequentiality in Linear Logic. Membre: University of Rome 3 and University
of the Mediterranean. Dale Miller
IX.7.3.3
• Dale Miller teaches part of “Logique linéaire et paradigmes logiques du calcul”, Course 2-1
at MPRI (2008-2013).
• Stéphane Graham-Lengrand teaches part of “Logique linéaire et paradigmes logiques du
calcul”, Course 2-1 at MPRI (2010-2013).
Jury
• During 2008-2013, Dale Miller has served on 14 juries of Ph.D. students, include 5 (listed
above) where he was also a reporter.
• Miller taught during the CUSO Winter School in Mathematics and Computer Science “Proof
and Computation”, Les Diablerets, Switerland, 27-31 January 2013.
• Miller taught a graduate level course on “Proof theory with applications to computation
and deduction,” Dipartimento di Informatica, Università di Pisa, 19-30 September 2011.
• Miller gave a three hour tutorial at PLS8: 8th Panhellenic Logic Symposium, Ioannina,
Greece, July 4-8, 2011.
• Miller gave six hours of lectures at ISCL: International School on Computational Logic,
Bertinoro, 10-15 April 2011.
IX.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ
359
• Straßburger taught a course on “Introduction to Proof Theory” at ESSLLI’10, Copenhagen,
August 9–20, 2010.
• Miller taught a graduate level course on “Proof search and Computation.” Dipartimento di
Scienze dell’Informazione, Universitá degli studi di Milano, 15-26 March 2010.
• Miller taught a graduate level course on “Proof systems for linear, intuitionistic, and classical logic.” Dipartimento di Informatica, Universitá Ca’ Foscari di Venezia, 15-24 April
2009.
Vulgarisation
• Straßburger gave a talk on “C’est quoi, une preuve ?” at “Unithé ou café” at the INRIA
Saclay research center, March 11, 2011.
IX.7.4
IX.7.4.1
Invitations
• LFMTP 2013: Logical Frameworks and Meta-Languages: Theory and Practice (2013).
Miller gave an invited talk.
• ANR-DFG Hypothese Workshop titled Different Aspects of Proof Theory (2012). Miller
gave an invited talk.
• Journees nationales du GDR-IM (2012). Miller gave an invited talk.
• LMPS 2011: 14th International Congress of Logic, Methodology and Philosophy of Science (2011). Miller gave an invited talk.
• IMLA 2011: Intuitionistic Modal Logics and Applications at LMPS 2011 (2011). Straßburger
gives an invited talk.
• Proof systems at the test of computer science: Foundational and applicational encounters: Symposium at LMPS 2011 (2011). Straßburger gives an invited talk.
• APLAS 2010: Eighth Asian Symposium on Programming Languages and Systems (2010).
• FICS 2010: 7th Workshop on Fixed Points in Computer Science (2010). Miller gave an
invited talk.
• Proof Theory and Computation, Special Session of CiE 2010 (2010). Straßburger gives an
invited talk.
• MLPA: 2nd Workshop on Module Systems and Libraries for Proof Assistants (2010).
• Colloquium on Games, Dialogue and Interaction (2009). Miller gave an invited talk.
• LAM 2009: Logics for Agents and Mobility (2009). Miller gave an invited talk.
• Journées du projet PEPS-Relations (2008). Miller gave an invited talk.
• APS: 4th International Workshop on Analytic Proof Systems (2008). Miller gave an invited talk.
• SOS 2008: Structural Operational Semantics (2008). Miller gave an invited talk.
360
• WFLP 2008: 17th International Workshop on Functional and (Constraint) Logic Programming (2008). Miller gave an invited talk.
• LFMTP 2008: International Workshop on Logical Frameworks and Meta-Languages:
Theory and Practice (2008). Miller gave an invited talk.
• Dimostrazioni, Polaritá e Cognizione (2008). Miller gave an invited talk.
• CLaC 2008: International Workshop on Classical Logic and Computation (2008). GrahamLengrand gave an invited talk.
• ICTAC 2010: 7th International Colloquium on Theoretical Aspects of Computing (2010).
Chaudhuri co-authored an invited paper.
IX.7.4.2
• Dale Miller won the LICS Test-of-Time Award 2011 for a paper he co-authored with Joshua
Hodas in LICS 1991.
• Vivek Nigam won a Fellowship from the Alexander von Humboldt Scholarship after his
Ph.D. studies.
• Alexis Saurin’s thesis won the “Prix de thèse de l’Ecole Polytechnique” and the “Prix de
thèse ASTI 2009”.
PARSIFALParsifal
X Équipe Sysmo (Sysmo)
361
X.1 Liste des membres : Sysmo
X.1.1
X.1.1.1
Membres permanents
Nom
Philippe Baptiste
Claudia d’Ambrosio
Daniel Krob
Leo Liberti
Antoine Rauzy
Fonction
Chargée de recherche
Professeur
Professeur Chargé de Cours
Professeur, PCC
Evelyne Rayssac
David Savourey
Assistante
Ingénieur de recherche
Chargée d’Affaire
Michalis Vazirgiannis
Professeur
Employeur
CNRS
CNRS
Centrale-Supélec, École
Polytechnique
Ecole Polytechnique
CNRS
Ecole
Polytechnique,
DRIP
HDR
HDR
HDR
HDR
HDR
Arrivée
20032011199820062010-
20082004
HDR
2011-
Notes:
• Philippe Baptiste est affilié au LIX mais a été détaché auprès de la direction du CNRS. Il est
au 30 juin 2013 détaché auprès du Ministère de la Recherche.
• Leo Liberti est depuis le 1er Janvier 2013 en congé sans solde et travaille chez IBM Research
(“T.J. Watson” research labs, Yorktown Heights, USA). Il reprendra service en Août 2014.
• Antoine Rauzy est au 30 juin 2013 Professeur à l’Ecole Centrale, et Professeur Chargé de
Cours à temps partiel à l’Ecole Polytechnique.
• La DRIP est la Direction des Relations Industrielles et Partenariales de l’École polytechnique.
X.1.1.2
Doctorants
Nom
Nicolas Bonifas
Dominik Kirchler
Tatiana Prosvirnova
Thomas Friedlhuber
Vu Khac Ky
Gustavo Dias Da Silva
Claire Lizon
Claire Lucas
Yann Hourdel
Abraham Cherfi
Pierre-Antoine Brameret
François Rousseau
Youcef Sahraoui
Christos Giatsidis
Fragiskos Malliaros
Luca Mencarelli
Financement
CIFRE
CIFRE
EDX
CIFRE
Chaire OSD
CNPq (Brésil)
CIFRE
HEC Montreal
Contrat doctoral ENS Lyon
CIFRE
ENS Cachan
DIGITEO
CIFRE
DIGITEO
Google
Projet Europeen
363
Arrivée
2011201020112011201220122011201020112011201120122012200920122013-
Encadrant
Philippe Baptiste
Leo Liberti
Antoine Rauzy
Antoine Rauzy
Leo Liberti
Leo Liberti
Leo Liberti
Leo Liberti
Daniel Krob
Antoine Rauzy
Antoine Rauzy
CHAPTER X.1. LISTE DES MEMBRES : SYSMO
364
Postdoctorants
Nom
Andrea Cassioli
X.1.1.3
Financement
ANR
Dates
2012-
Responsable
Leo Liberti
Autres
Nom
Youssef Hamadi
Leila Kloul
Fonction
Chercheur Microsoft Research
MdC à l’UVSQ
X.1.2
Anciens membres
X.1.2.1
Membres permanents
Nom
Vincent Jost
X.1.2.2
Fonction
Employeur
CNRS
Financement
Chaire OSD
HDR
Dates
2010-
Départ
2008-2013
Position actuelle
CR a G-SCOP
Doctorants
Nom
Johanna Berrebi
Financement
CIFRE
Départ
2010-2013
Encadrant
Daniel Krob
Fabio Roda
CIFRE
2009-2013
Leo Liberti
Alberto Costa
Digiteo
2009-2012
Leo Liberti
Abdelkrim Doufene
Boris Golden
CIFRE
Monge
2010-2013
2009-2013
Daniel Krob
Daniel Krob
Antoine Jeanjean
Giacomo Nannicini
CIFRE
CIFRE
2008-2011
2006-2009
Philippe Baptiste
Leo Liberti
Emilie Winter
CIFRE
2003-2008
Philippe Baptiste
Position actuelle
Ingénieur EADS Innovation & Works
Ingénieur-architecte
à
l’institut C.E.S.A.M.E.S.
Postdoc à Singapore University of Technology and
Design
Postdoc au MIT
Chef de produit chez Viadeo
Recommerce Solutions
Associate Professor à
Singapore University of
Technology and Design
DGA
X.1.2. ANCIENS MEMBRES
365
Postdoctorants
Nom
Dimo Brockhoff
Alvaro Fialho
Financement
Chaire OSD
Chaire OSD
Dates
2010-2011
2010-2011
Responsable
Leo Liberti
Youssef Hamadi
Hassan Hijazi
CNRS
2010-2011
Leo Liberti
Nora Touati
Chaire OSD
2009-2010
Philippe Baptiste
Antonio Mucherino
Sonia Cafieri
Yann Hendel
Klaus Berberich
IDF
ANR
Microsoft
Digiteo
2008-2010
2008-2010
2007-2008
2011
Leo Liberti
Leo Liberti
Philippe Baptiste
M. Vazirgiannis
Dimitrios Thilikos
Vassilis Plachouras
Digiteo
Digiteo
2011
2011
M. Vazirgiannis
M. Vazirgiannis
Mbarka Mabrouki
Michel Batteux
DGA
DGA
2010-2011
2011-2012
Antoine Rauzy
Antoine Rauzy
X.1.2.3
Position actuelle
CR INRIA Lille
chercheur au General
Electric Global Research
à Rio de Janeiro
chercheur au NICTA à
Camberra
Enseingnante à l’ESMESUDRIA
MdC à l’IRISA à Rennes
MdC à l’ENAC à Toulouse
Consultant chez YKems
Postdoc au Max Planck
Institut
DR CNRS
Researcher at ATHENA
Institute, Greece
non connu
Thales
Autres membres
Nom
Pierre Hansen
Financement
DIGITEO
Dates
2008-2013
Invitant
Leo Liberti
Autres
Nom
Michel Batteux
Fonction
Chercher contractuel Valeo
Financement
2012-2013
Dates
Antoine Rauzy
366
CHAPTER X.1. LISTE DES MEMBRES : SYSMO
X.2 Rapport scientifique : Sysmo
X.2.1
X.2.1.1
Introduction
A complex industrial system is a set of interconnected institutions and entities which, together,
provide society with a useful service.
For example, a single airport would be useless without the worldwide flight network it serves;
by contrast, the flight network itself, intended as the set of all airports, airline companies, power
and fuel suppliers, dedicated telecommunication and computer service providers, urban transportation lines, car rental companies, local hotels, all and so on, together with all of their physical, logical and commercial relationships, could be envisaged as a complex industrial systems.
The SYSMO team deals with four major axes:
• Formal Definitions and Modelling of Complex Industrial Systems.
• Optimization of Complex Industrial Systems.
• Safety Assessment of Complex Industrial Systems.
• Data Science and Mining.
These four axes involve modelling, simulating, analyzing and taking rational decisions to ensure
the dynamics, stability and improvements of complex industrial systems.
Given that complex systems are ubiquitous in today’s society, given that they are often themselves interconnected at many different levels, given that a local failure can bring about global
system failures everywhere, research about complex industrial systems is of paramount importance.
Our work borrows tools from axiomatic logic, dynamical systems, graph theory, algorithmics,
and mathematical programming. It also contributes new general-purpose tools back to these
methodological fields. Our theoretical work is applied successfully to industrial problems from
Google, Microsoft, IBM, EDF, Bouygues Telecom, Mediamobile, EADS, Thales, Dassault Systems,
and others. The SYSMO team strikes a remarkable balance between theory and application in
computer science applied to industry.
X.2.1.2
Research themes
The research carried out in the SYSMO team is organized around the following main themes.
Formal definitions and modelling of complex industrial systems As the reader might have
noticed, we initially defined a “complex industrial system” above by means of an example: this is
because delimiting the boundaries of what is a complex industrial system and what is not is very
difficult. Prof. Krob has made fundamental contributions in this sense: by using the concepts of
hierarchical structures applied to dynamical systems, and using an innovative concept of time,
he was able to provide an axiomatic and formal treatment of this subject. Together with his
students, he is pursuing this conceptual work and applies it to concrete industrial systems.
Optimization of Complex Industrial Systems The conception and dynamics of complex industrial systems is influenced by system architects and system agents, through a decision making
process which is aided by mathematical optimization. This is a field, at the interface of computer
science and applied mathematics, which studies the algorithmics and geometry of the optimal
system configurations and states.
A mathematical optimization problem, or mathematical program (MP) is a partial and/or approximate model of a complex industrial system. MP often focus on some combinatorial aspect,
367
368
CHAPTER X.2. RAPPORT SCIENTIFIQUE : SYSMO
or approximate nonlinear behaviour by means of linear functions, or both. A MP consists of: a
set of decision variables, which model the decisions to be taken; a set of constant values, which
are attributed to the known or initial parameters of the system to be optimized; a set of constraints, which, through a declarative programming paradigm, model the system configuration
or its dynamics; and, finally, an objective function which expresses the cost, or convenience,
of the decisions to be taken. The best known type of MP is the linear program (LP), where the
decision variables vary in R and the objective and constraints are linear functions of the decision variables. The newest and most general type of MP is the mixed-integer nonlinear program
(MINLP), which involves both continuous and integer decision variables, as well as linear and
nonlinear objective and constraints.
MP was born in the 1940s out of a need to optimize large-scale production systems. Ever
since, the applications of MP have diversified: we now routinely solve MPs in biology (protein
folding), chemistry (determination of spatial orbitals), mathematics (the Newton-Gregory diatribe on the kissing number) and other fields, although the foremost application field is still in industrial systems. Novel MP applications to industry arise in modern production issues (e.g. platforming), scheduling of online advertisements, embedded systems, routing in geographical networks, production subject to sustainable development restrictions, energy production problems,
and many more. Optimization techniques evolved to deal with several contradicting objective
functions, excessively restrictive constraints, uncertainty in the input data, requirements on solution robustness, hierarchical optimization, et cetera.
At its very core, a MP problem is formulated as follows:


min f (x)

x∈X
(X.2.1)

g(x)
≤ 0, 
where x ∈ Rn , X ⊆ Rp × Zq (with p + q = n), f : Rn → R, and g : Rn → Rm . Assigning a meaning to
x and finding the form of f , g to correctly model the problem at hand is known as modelling the
problem by means of MP. A MINLP is a MP where p, q > 0, and f , g are nonlinear functions.
In general, MINLP are undecidable problems, even when the feasible region is bounded.
Notwithstanding, a ε-approximate algorithm exists which will solve most “reasonable” MINLPs
to any degree of accuracy given by ε > 0. This algorithm is called spatial Branch-and-Bound (sBB):
similarly to the more usual Branch-and-Bound (BB) for Mixed-Integer Linear Programs (MILP),
sBB performs an implicit tree-like search for an approximate global optimum. Instead of a linear
relaxation, it employs a convex relaxation; and instead of branching over those integer variables
whose relaxed optimal value is fractional, it may also choose to branch over continuous values
appearing in nonconvex terms whose convex relaxation value differs from their actual value.
The two members of the SYSMO team who are mainly involved with MP are Liberti and
D’Ambrosio, who are well known and appreciated members of the academic community relating
to MP. They are leading researchers in the following sub-fields of MP: MINLP theory, MINLP
solution methods, applications to protein folding, applications to energy production problems.
They are principal investigators in large-scale industrial projects with Microsoft, EDF, ERDF
and others, as well as academic projects which are funded by various state agencies: FP7, ANR,
ADEME, CNRS and so on. They head a dynamic optimization-oriented research team with 5 to
10 nonpermanent members (PhDs and postdocs).
Safety Analyses of Complex Industrial Systems This theme is leaded by Antoine Rauzy who
is a world expert in mathematical and algorithmic foundations of Probabilistic Safety Analyses
(PSA) and Probabilistic Risk Analyses (PRA). The group arround Antoine Rauzy works on two
main projects:
• The OpenPSA initiative which aims at providing state-of-the-art methods and assessment
tools to handle classical PSA/PRA models (Fault Trees, Event Trees).
• The AltaRica 3.0 project which aims defining the new version of the high level modelling
language AltaRica together with the associated assessment tools.
X.2.1. THÉMATIQUE GÉNÉRALE ET PRINCIPAUX OBJECTIFS
369
Both works are done in continuous collaboration with industrial partners such as EdF, EADS,
Valeo. . . Antoine Rauzy is also the organizer of the ”Séminaire Francilien de Sûreté de Fonctionnement” which is a working group of the ”Institut pour la Maı̂trise des Risques” (IMdR).
Data Science and Mining The activity, lead by Prof M. Vazirgiannis, has accomplished the
following results:
The research conducted in the previous period involved Data and graph mining in which
many complex systems form network structures representing interactions of their constituent
elements. There is a plethora of examples (e.g., protein networks, city networks, etc.) of such
complex networks forming communities and attracting interest from interdisciplinary research
fields. A prominent example is that of social networks. We have explored the potential of graph
degeneracy in the case of community evaluation by extending this concept for the case where
the connections bare non trivia semantics (e.g., a weighted degree of preference). We proposed
new evaluation metrics for the collaboration capabilities of individuals and applied theoretical models and metrics to large real world social networks and produced interesting results.
See http://www.graphdegeneracy.org/ for more details. We also dealt with clustering and community detection for directed graphs, there we have published a survey article and presented
relevant tutorials in international conferences (such as ACM WSDM 2013, WWW 2013).
Another topic within this thematic involved research in the area of Text Mining for Large Dynamic Corpora, where we investigated emerging issues of text mining for the areas of Online
Advertising (sponsored search, textual ads, online advertising campaigns) and Novelty Detection in News Streams. For the former we proposed a methodology, and a functional framework
for automated creation, monitoring, and optimization of cost-efficient pay-per-click campaigns
with budget constraints. We articulated the budget optimization problem as a multiple-choice
knapsack for which we find the most profitable combination of keywords and their bids. We
approximated the solution capitalizing on a Genetic Algorithms for budget optimization with
multiple keyword options. Novelty detection in text streams is a challenging task that emerges
in quite a few different scenarios, ranging from email threads to RSS news feeds on a cell phone.
For the latter issue,we work on novelty scoring functions that are both efficient computationally
and effective. We have proposed a document-to-summary technique based on the idea of maintaining a summary of the collection of previously seen documents that is based on the frequency
of each term. We capture the specificity of each term through its Inverse Document Frequency
(IDF) for a given incoming document and then we show how to compute its overall specificity
through the definition of a novelty score. Since our approach is document-to-summary based,
we do not compare to all the previous documents and thus we can compute the novelty score
faster. At the same time, we have shown through experimental evaluation that our approach
outperforms several commonly used baseline approaches, in certain cases by a wide margin.
X.2.1.3
A game theoretical framework for modeling systems homeostasis A. Douffene and D. Krob
proposed a game theoretical framework for modeling systems homeostasis, what is to say systemic equilibriums. An optimal architecture is indeed the result of balanced interactions between a system and the external systems of its environment. Based on this intuition, A. Douffene
and D. Krob developed a game theory interpretation of systems optimization: in this approach, a
system is competing with its environment in order to achieve a Nash equilibrium and optimizing
the system means being able to compute this last equilibrium. This approach was especially applied in order to address an electrical vehicle ecosystem design problematics where it allowed to
find the optimal parameters (cost, battery weight, battery duration, etc.) for an electrical vehicle
within its environment (consisting here of an electrical distribution infrastructure, competing
electrical vehicles constructors, customers and end-users, etc.).
370
Spatial Branch-and-Bound Leo Liberti was one of the “first wave” of researchers who, already
in the late 1990s, studied and implemented the celebrated ng MINLP, a variant of the Branchand-Bound (BB) algorithm for Mixed-Integer Linear Programs (MILP) which, instead of branching on integer variables, it branches on variables involved in nonconvex terms.
Reformulations in MP Recognizing that the same problem can be formulated differently in
many equivalent ways, and that the formulation would impact the solution efficacy, he contributed to establish a theory of mathematical programming reformulations, i.e. symbolic algorithms which change a given formulation without affecting the optimal solution (or affecting
it in a controlled way).
Symmetry in MINLP BB-type algorithm may be very slow on symmetric problems, because
many of the BB tree branches are completely explored even though they may be isomorphic to
each other. Some work on symmetric MILP was carried out in the early 2000s. Liberti extended
this work to the nonlinear case. This setting is very challenging because decision variables permutations naturally commute with linear forms, but not in general with nonlinear ones. By exploiting symbolic expression trees, Liberti gave a characterization of symmetry in MINLP which
allowed the application of sBB to difficult symmetric MINLP in the open literature.
Heuristics for MINLP Liberti and Nannicini proposed one of the most successful MINLP heuristics in the field, called Relaxed-Exact Continuous-Integer Problem Exploration (RECIPE) algorithm. D’Ambrosio, Liberti and others proposed a special type of heuristic for achieving feasibility: a feasibility pump for MINLP.
Application to energy D’Ambrosio has been working on optimization in the energy production
context for more than 5 years. In particular, she specialized in the hydro unit commitment
and scheduling, a key problem in the short-term planning energy production. Thanks to the
past experience, confirmed by a publication in the top journal of the field, IEEE Transaction
of Power System which counts 82 citations, D’Ambrosio is now involved in the COST Action
“Mathematical Optimization in the Decision Support Systems for Efficient and Robust Energy
Networks” as Management Committee member and in several collaborations with EDF.
Application to protein folding Liberti has been actively working at the intersection of MP
and protein folding for several years. The main objective is to solve the following inverse problem: given a set interatomic distances, estimated via chemical experiments as well as Nuclear
Magnetic Resonance (NMR) ones, determine the possible proteic structure (or structures) which
might have yielded those distances. Since the function of proteins is determined by their 3D
shape, finding the atomic position in space is of paramount importance for understanding how
protein work, what they does, and how to synthesize proteins for a specific need.
X.2.1.4
D. Krob created and coordinates – as general chair – since 2010 the conference series Complex
Systems Design & Management (CSD&M) that are focused on Systems Architecture and Modelling. The aim of the CSD&M conferences is to cover as completely as possible the field of complex systems sciences and practices and to attract equally academic researchers and industrial
actors. They are welcoming both scientific contributions (complex industrial systems analysis,
modelling, simuling, optimization, verification, validation methods and techniques) and industrial contributions (case studies, returns of experience and exchanges of good practices related
to complex industrial systems). Note that the organization of the CSD&M conferences is based
on a key rule of complete parity between academics and industrialists. This principle reflects
in particular in the balanced academic and industrial compositions of the conference program
committee and of the invited speakers. These conferences are now a key scientific animation
X.2.1. THÉMATIQUE GÉNÉRALE ET PRINCIPAUX OBJECTIFS
371
forum for the discipline with a continuous success: the number of attendees grew for instance
from 200 for the initial CSD&M 2010 edition to 270 for the last CSD&M 2012 edition when the
next CSD&M 2013 edition is looking for around 300 attendees. The same principles were also
applied by D. Krob in the Enterprise Architecture domain by creating on the same principles
another conference Digital Enterprise Design & Management (DED&M) that addresses specifically
information systems issues .
Leo Liberti chaired several local and international workshops, is regularly invited to participate in programme committees for prestigious conferences (such as the European Symposium of
Algorithms), is an associate editor of 5 international journal, an editor-in-chief of Springer’s 4OR
journal (jointly owned by the French, Italian and Belgian OR societies), and is regularly invited
as a plenary speaker at several international conferences and workshops. For his work on reformulations in MP he was awarded the second ROADEF “Robert Faure” prize in 2009 (awarded
every three years). He published on top-tier journals such as Mathematical Programming and
SIAM Review.
D’Ambrosio was awarded the prestigious European Doctoral Dissertation Award in 2010,
which marks the best European Ph.D. thesis. Moreover, she was ranked 1st by the CNRS’ comité
national (concours CR2).
Antoine Rauzy chaired several international workshops, is on the board of two international
journals and several international conferences and is regularly invited to deliver talks both in the
academic and the industrial world. The tools and the modelling language he designed (AltaRica)
are daily used in industry worldwide.
Michalis Vazirgiannis has pariticpated int he following Editorial Boards:
• Intelligent Data Analysis, An International Journal, IOS press, ISSN: 1088-467X
• Machine Learning Journal (special issue on ECML PKDD 2011 conference)
• Data Mining & Knowledge Discovery Journal (special issue on ECML PKDD 2011 conference)
Also M. Vazirgiannis has participated in the International Conference Organization - following:
• 2013
19th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) - PC
member
World Wide Web 2013 Conference - Web Search Track - PC member
World Wide Web 2013 Conference - Web Mining Track - PC member
International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
2013 - PC member
• 2012
IEEE ICD? 2012 Conference - PC member
World Wide Web 2012 Conference - Web Mining Track - PC member
International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
2012 - PC member
SIAM International Conference on Data Mining (SDM) 2012 - - PC member
• 2011
IEEE International Conference on Data Engineering (ICDE)2011 - Data Mining Track Chair
The 10th European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) 2011 (Athens) - Prorgramme Co-Chair
• 2010
Nineteenth International World Wide Web Conference (WWW2010) , Raleigh, USA
Third ACM International Conference on Web Search and Data Mining (WSDM) 2010, New
372
York, USA
EDBT 2010 (13th International Conference on Extending Database Technology,Lausanne,
Switzerland,
X.2.1.5
The SYSMO team has a regular seminar series, and also exceptionally invited international speakers to give talks. The last five years have been financially covered by seven CIFRE contracts, three
ANR projects, two European projects, two Endowed Chairs (one with Thales and one with Microsoft), as well as a plethora of other income sources.
X.2.1.6
We are involved with MPRI (Master Parisien en Recherche Informatique), are co-founders of the
MPRO (Master Parisien en Recherche Operationnélle), and founded the COMASIC Master. We
also teach undergraduate level courses at Polytechnique.
X.3 Projet de recherche : Sysmo
X.3.1
X.3.1.1
Formal Definition and Modelling of Complex Industrial Systems
The group around Daniel Krob will go on working on the unified systems semantics framework
that is under development since almost 5 years. The scientific objectives of these works are the
following.
• To provide a formal framework and semantics for systems design.
• To construct on this basis a mathematically sound systems architecture process, in other
words a systems modeling method with a rigorous semantics.
• To implement this approach on practical use cases in order to get concrete feedbacks from
real industrial cases that also provide sound industrial bases to the whole modeling approach.
D. Krob constructed – with M. Aiguier, S. Bliudze and B. Golden – an unified formal framework for addressing systems architecture issues. This systems semantics framework provides in
particular a number of coherent equivalent temporal-oriented visions on systems: a mechanical
interpretation where systems are thought as non-uniform dataflow transformation machines ; a
functional interpretation where systems are defined as transfer functions ; a logical interpretation where systems are defined by means of a formal logics. All these visions rely on the choice of
a formal model of time – defined axiomatically in our approach – which abstracts many different
cases (usual dataflow models, VHDL-like formalisms, non-standard machines, etc.). This framework was in particular recently applied in two practical use cases: on one hand, J. Berrebi proposed for instance in her EADS Cifre-PhD a new wireless network architecture for aircrafts and
helicopters (which has strong specific performance and safety issues) using our methodology; on
the other hand, A. Douffene modeled during his Renault Cifre-PhD electric vehicles engines and
electric vehicles ecosystems using the same techniques which allowed him to propose optimized
architectures for these two types of applications. Currently Y. Hourdel is also working with Zodiac Aerospace in order to develop new models using our approach for the electrical distribution
system of an Airbus aircraft.
X.3.1.2
Optimization of Complex Industrial Systems
SYSMO’s research interests in optimization mostly concern Mathematical Programming (MP),
which is a declarative language for describing applied optimization problems, together with a
set of general-purpose and specific algorithms to find feasible and optimal solutions.
Our efforts over the next five years will focus on four topics:
1. Mixed-Integer Nonlinear Programming (MINLP);
2. Mathematical optimization with big data sets;
3. Applications of MP to energy production problems;
4. Applications of MP to protein folding problems.
Topics 1-2 are theoretical; Topics 3-4 are application fields. Our research plan rests on the fact
that these four topics are highly complementary. Both energy and protein folding problems
involve nonlinear terms, and some degree of combinatorial decisions: thus, MINLP is the correct
setting. On the other hand, both application fields generate very large sized problems, which
373
CHAPTER X.3. PROJET DE RECHERCHE : SYSMO
374
require special purpose methodologies to be dealt with. Finally, energy problems and protein
folding problems often involve quadratic terms.
In the future five years, we plan to extend the theory of mathematical programming to its
extreme generalization: black-box optimization (BBO). In BBO, one is given an oracle to evaluate
f and g, but not their explicit form. This research is actively being pursued by our joint Ph.D. Vu
Khac Ky, funded by a Microsoft Research sponsorship.
“Big data” is a buzzword unlike most others: it actually refers to a solid body of work corresponding to a strong and compelling industrial need. Combinatorial “big data” problems on
graphs and networks are the main interest of Michalis Vazirgiannis. SYSMO’s effort in this sense,
concerning MP, will be to devise new methodologies for approximately solving extremely large
MPs of various kinds, at least with high probability. This is needed for both our flagship applications (see below).
D’Ambrosio has been studying the hydro unit commitment and scheduling in hydro plants.
She plans to extend her research to the hydro valleys both from an operational viewpoint (in
the context of a PhD thesis sponsored by EDF) and a theoretical viewpoint (in the context of a
PGMO (Gaspard Monge Program for Optimization and Operations Research) project). Moreover,
she plans to work on other aspects of energy production and especially to move to energy distribution, a challenging problem arose by the development of new sources of energy production,
like renewable sources, and by the introduction and interconnection of markets within the EU.
The participation to the EU COST Action “Mathematical Optimization in the Decision Support
Systems for Efficient and Robust Energy Networks” for the next 4 years will provide the perfect
environment to make progresses on this real world problem.
Liberti has developed a Branch-and-Prune (BP) method for solving the inverse problem,
called Distance Geometry Problem (DGP). In the next five years, this method will be adapted
to work with uncertain distance values, and applied to real NMR data from proteins with unknown structures (collaboration with Institut Pasteur under an ANR project).
X.3.1.3
Safety Assessment of Complex Industrial Systems
The group arround Antoine Rauzy will go on working in the framework of the OpenPSA initiative
and the AltaRica 3.0 project. The scientific and technological objectives are the following.
• To improve algorithms and heuristics used to assess risk in complex industrial systems.
• To implement these algorithms into high quality level tools so that they can be used to
handle industrial scale examples (and by industrial partners).
• To design the new version of the AltaRica language, to improve modelling methodologies
and develop an eco-system around the language.
• To improve the engineering of safety model and to study how safety studies can be better integrated with other complex system engineering disciplines with a special focus on
system architecture.
X.3.1.4
Data Science and Mining
The future steps in the research theme Data Science for Big data involve, in the topic of Graph
mining the topic of the engagement dynamics of social graphs, i.e., the extend that an individual
is encouraged to participate in the activities of a community. We also plan to investigate the
potential of degeneracy in the graph clustering problem where the intuition we have is that the
clustering structure is maintained in the dense core structures. We also plan to investigate the
issue of degeneracy for weighted directed and signed graphs.
As for the Text Mining for Large Dynamic Corpora are we will focus in the automated production of ad-texts capitalizing on novel methods that produce in an automated manner compact text ads (promotional text snippets), given as input a product description webpage (landing
X.3.1. OBJECTIFS SCIENTIFIQUES
375
page). In addition, we investigate a bold and risky research direction for text retrieval with graph
based document representations and the relevant feature indexing and retrieval mechanism. Initial results are very encouraging.
376
CHAPTER X.3. PROJET DE RECHERCHE : SYSMO
en
ac
es
M
T
m he
of en rec
tu a t o e
le re bse f D nt p
a
re d d n .
a
R se er epa ce Kro rtse ecr arc is rtu of b, tim
L
s
u
st ar it h tr re . cu e i
ro ch m ca on o Lib rr nv
ng er en pa g f S e en ol
ne s in t o bil ly r YS rti a t le veed S f p ity ed MO n av
. ys er of uc ’s d f e
M m t ing t ue
o an he
is e t th am
no nt ea e
w re- m.
a
A F
O M
NEGATIF
•
es
ss
At
ou
ts
•
•
T
S ea
in tro m e
in pa ng xp
du rt in er
st icu du tis
ria la st e.
l c r ria
ha thr l c
irs ou on
. g h ne
t h ct i
e on
tw s,
o
le
s
d
an exng o
iti t
xc ain
,e m
en do
op y
y- ke
el lyrg al
la tri
s
An du e
in lor
p
té
ni
tu
or
pp
O
•
377
e t
pl a
eo es
t p em
en th
an rch
rm a
pe se
h l re
ug al
no le
t e nd
No ha e
• to tak
s
ib
Fa
POSITIF
X.4 Analyse AFOM : Sysmo
INTERNE
EXTERNE
Figure X.4.1: Analyse AFOM de l’équipe Sysmo : Atouts, Faiblesses, Opportunités, Menaces
378
CHAPTER X.4. ANALYSE AFOM : SYSMO
X.5 Fiche résumé : Sysmo
X.5.1
Membres
2013 : 1 chercheur (1 CNRS), 5 enseignants-chercheurs, 1 postdoc, 16 doctorants
Départ de membres de l’équipe
• Philippe Baptiste (Directeur de Recherche, CNRS) (from 2010)
• Christophe Dür (Directeur de Recherche, CNRS) (from 2010)
• Vincent Jost (Chargé de Recherche, CNRS) (from 2013)
• Antoine Rauzy, Professeur à Centrale-Supélec (from 2013),
Nouveaux membres
• Claudia d’Ambrosio, Chargée de recherche CNRS (from 2011),
• Michalis Vazirgiannis (Professeur at École Polytechnique (from 2011),
• Leila Kloul (Maı̂tre de conférence, UVSQ), (from 2012)
X.5.2
A. Douffene and D. Krob proposed a game theoretical framework for modeling systems homeostasis, what is to say systemic equilibriums.
Leo Liberti was one of the “first wave” of researchers who, already in the late 1990s, studied
and implemented the celebrated MINLP, now considered a “hot topic” by the Mathematical Optimization Society as well as INFORMS.
X.5.3
X.5.3.1
Publications
Journaux : 91
X.5.3.2
Rayonnement
D. Krob created and coordinates – as general chair – since 2010 the conference series Complex Systems Design & Management (CSD&M) that are focused on Systems Architecture and Modelling.
Leo Liberti, Claudia d’Ambrosio, Antoine Rauzy and Michalis Varzigianis served as chair, cochair or members of program committee of many international conferences and internal journals.
X.5.3.3
D. Krob created training to System Architecture for engineers.
379
380
CHAPTER X.5. FICHE RÉSUMÉ : SYSMO
X.6 Production scientifique : Sysmo
X.6.1
[930] S.V. Amari, A. Myers, A. Rauzy, and K. Trivedi. Imperfect coverage models: Status and
trends. In K.B. Misra, editor, Handbook of Performability Engineering, pages 321–348. Elsevier, 2008. ISBN 978-1-84800-130-5.
[931] N. Beeker, S. Gaubert, C. Glusa, and L. Liberti. Is the distance geometry problem in NP?
In Distance Geometry: Theory, Methods and Applications. Springer, 2013.
[932] Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti, and AndrewJ. Miller. On the composition of convex envelopes for quadrilinear terms. In Altannar Chinchuluun, Panos M.
Pardalos, Rentsen Enkhbat, and E. N. Pistikopoulos, editors, Optimization, Simulation,
and Control, volume 76 of Springer Optimization and Its Applications, pages 1–16. Springer
New York, 2013.
[933] Pietro Belotti, Leo Liberti, Andrea Lodi, Giacomo Nannicini, and Andrea Tramontani.
Disjunctive Inequalities: Applications And Extensions. John Wiley & Sons, Inc., 2010.
[934] A. Bloch and Daniel Krob. Comment estimer la loi de diffusion d’un nouveau produit?
Proposition d’un modèle de comportement client. In A. Bloch and S. Morin Delerm,
editors, Innovation et création d’entreprise, pages 85–105. Editions ESKA, 2010.
[935] P. Bonami, L. Liberti, A. Miller, and A. Sartenaer, editors. European Workshop on MINLP,
2012. special issue of Mathematical Programming B, 136.
[936] A. Borghetti, C. D’Ambrosio, A. Lodi, and S. Martello. Case studies of realistic applications
of optimum decision making, chapter Optimal scheduling of a multi-unit hydro power station in a short-term time horizon. To appear.
[937] C. Bragalli, C. D’Ambrosio, J. Lee, A. Lodi, and P. Toth. Case studies of realistic applications of optimum decision makin, chapter Optimizing the Design of Water Distribution
Networks Using Mathematical Optimization. To appear.
[938] M. Bruglieri and L. Liberti. Optimally running a biomass-based energy production process. In J. Kallrath, P. Pardalos, S. Rebennack, and M. Scheidt, editors, Optimization in the
Energy Industry. Springer, 2009.
[939] C. D’Ambrosio, J. Lee, and A. Wächter. Mixed-Integer Nonlinear Optimization: Algorithmic
Advances and Applications, volume 154 of The IMA Volumes in Mathematics and its Applications, chapter An algorithmic framework for MINLP with separable non-convexity, pages
315–347. Springer New York, 2012.
[940] Daniel Krob. Eléments d’architecture des systèmes complexes. In A. Appriou, editor,
Gestion de la complexité et de l’information dans les grands systèmes critiques, pages 179–
207. CNRS Editions, 2009.
[941] Daniel Krob. Eléments de modélisation systémique. In R. Mossery and C. Jeandel, editors, L’Energie à découvert, pages 76–77. CNRS Editions, 2013.
[942] Daniel Krob. Eléments de systémique - Architecture de systèmes. In A. Berthoz and J. L.
Petit, editors, Complexité-Simplexité. Editions Odile Jacob, 2013.
[943] C. Lavor, L. Liberti, and N. Maculan. Molecular distance geometry problem. In P. Pardalos and C. Floudas, editors, Encyclopedia of Optimization, 2nd Edition. Springer, 2008.
381
382
BIBLIOGRAPHY
[944] L. Liberti. Symmetry in mathematical programming. In S. Leyffer and J. Lee, editors,
Mixed Integer Nonlinear Programming. Springer, 2012.
[945] L. Liberti, S. Cafieri, and F. Tarissan. Reformulations in mathematical programming:
a computational approach. In A. Abraham et al., editor, Foundations of Computational
Intelligence Vol. 3, Studies in Computational Intelligence. Springer, 2009.
[946] L. Liberti and C. Lavor. On a relationship between graph realizability and distance matrix completion. In A. Migdalas et al., editor, Optimization Theory, Decision Making, and
Operations Research Applications. Springer, 2013.
[947] L. Liberti, C. Lavor, and A. Mucherino. The discretizable molecular distance geometry
problem is easier on proteins. In Distance Geometry: Theory, Methods and Applications.
Springer, 2013.
[948] L. Liberti and E. Ortiz. Ottaviano fabrizio mossotti. In Dizionario Biografico degli Italiani,
vol. 77. Istituto della Enciclopedia Italiana, 2012.
[949] A. Mucherino and L. Liberti. A vns-based heuristic for feature selection in data mining.
In El-Ghazali Talbi, editor, Hybrid Metaheuristics, volume 434 of Studies in Computational
Intelligence, pages 353–368. Springer Berlin Heidelberg, 2013.
[950] G. Nannicini, G. Cornuéjols, M. Karamanov, and L. Liberti. Branching on split disjunctions. In V. Chvátal, editor, Combinatorial Optimization: Methods and Applications. IOS
Press, 2011.
[951] A. Rauzy. BDD for Reliability Studies. In K.B. Misra, editor, Handbook of Performability
Engineering, pages 381–396. Elsevier, 2008. ISBN 978-1-84800-130-5.
[952] H.D. Sherali and L. Liberti. Reformulation-linearization technique for global optimization. In P. Pardalos and C. Floudas, editors, Encyclopedia of Optimization, 2nd Edition.
Springer, 2008.
X.6.2 Édition de livres et de numéros spéciaux de revues
[953] M. Aiguier, F. Bretaudeau, and D. Krob, editors. Proceedings of the First International Conference on Complex Systems Design & Management CSD&M 2010. Springer Verlag, 2010.
[954] M. Aiguier, Y. Caseau, D. Krob, and A. Rauzy, editors. Proceedings of the Third International Conference on Complex Systems Design & Management CSD&M 2012. Springer
Verlag, 2012.
[955] P.J. Benghozi, D. Krob, and F. Rowe, editors. Proceedings of the First International Conference on Digital Enterprise Design & Management DED&M 2013. Springer Verlag, 2013.
[956] P. Bonami, L. Liberti, A. Miller, and A. Sartenaer, editors. Proceedings of the European
Workshop on MINLP, 2010. Marseille.
[957] S. Cafieri, U. Faigle, and L. Liberti, editors. Graphs and Combinatorial Optimization,
2011. special issue of Discrete Applied Mathematics dedicated to the CTW09 Conference, 159(16):1659-1914.
[958] S. Cafieri, L. Liberti, and F. Messine, editors. Toulouse Global Optimization Workshop
2010, 2010. special issue of the Journal of Global Optimization.
[959] S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, and L. Liberti, editors. Proceedings
of CTW09 Conference, 2009. Paris.
X.6.3. DOCUMENTS PÉDAGOGIQUES
383
[960] S. Cafieri, B. Tóth, E. Hendrix, L. Liberti, and F. Messine, editors. Proceedings of the
Toulouse Global Optimization Workshop, 2010. Toulouse.
[961] D. Delling and L. Liberti, editors. 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization and Systems, 2012. OASICS 25, Dagstuhl.
[962] O. Hammami, D. Krob, and J.L. Voirin, editors. Proceedings of the Second International
Conference on Complex Systems Design & Management CSD&M 2011. Springer Verlag,
2011.
[963] L. Liberti and N. Maculan, editors. Reformulation Techniques in Mathematical Programming, 2009. special issue of Discrete Applied Mathematics, 157(6).
[964] Leo Liberti, Thierry Marchant, and Silvano Martello, editors. Eleven surveys in operations
research: III, ANNALS OF OPERATIONS RESEARCH, 2013c.
[965] A. Mucherino, C. Lavor, L. Liberti, and N. Maculan, editors. Distance Geometry: Theory,
Methods and Applications. Springer, New York, 2013.
X.6.3
[966] L. Liberti. C++ Notes. Ecole Polytechnique, 2011. 34 pages.
[967] L. Liberti. Data structures and algorithms. Ecole Polytechnique, 2012. 186 pages.
X.6.4
[968] D. Aloise, S. Cafieri, G. Caporossi, P. Hansen, L. Liberti, and S. Perron. Column generation algorithms for exact modularity maximization in networks. Physical Review E.,
82(4):046112, 9 pages, October 2010.
[969] Daniel Aloise, Pierre Hansen, and Leo Liberti. An improved column generation algorithm for minimum sum-of-squares clustering. Mathematical Programming, 131(1–
2):195–220, 2012.
[970] E. Amaldi, K. Dhyani, and L. Liberti. A two-phase heuristic for the bottleneck khyperplane clustering problem. Computational Optimization and Applications, to appear.
[971] E. Amaldi, L. Liberti, F. Maffioli, and N. Maculan. Edge-swapping algorithms for the
minimum fundamental cycle basis problem. Mathematical Methods of Operations Research,
69:205–233, 2009.
[972] M. Aouchiche, P. Hansen, and C. Lucas. On the extremal values of the second largest
Q-eigenvalue. Linear Algebra and its Applications, 435(10):2591–2606, November 2011.
[973] Philippe Baptiste, Antoine Jouglet, and David Savourey. Lower bounds for parallel
machine scheduling problems. International Journal of Operational Research, 3(6):643–
664, 2008.
[974] P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wächter. Branching and bounds tightening
techniques for non-convex minlp. Optimization Methods and Software, 24(4):597–634,
2009.
[975] A. Bettinelli, P. Hansen, and L. Liberti. Algorithm for parametric communities detection
in networks. Physical Review E, Accepté.
[976] Andrea Bettinelli, Leo Liberti, Franco Raimondi, and David Savourey. The anonymous
subgraph problem. Computers & Operations Research, 2012.
384
BIBLIOGRAPHY
[977] Simon Bliudze and Daniel Krob. Modelling of complex systems: Systems as dataflow
machines. Fundam. Inform., 91(2):251–274, 2009.
[978] C. Bragalli, C. D’Ambrosio, J. Lee, A. Lodi, and P. Toth. On the optimal design of water
distribution networks: a practical minlp approach. Optimization and Engineering, 13:219–
246, 2012.
[979] Nadia Brauner and Vincent Jost. Small deviations, JIT sequencing and symmetric case
of fraenkel’s conjecture. Discrete Mathematics, 308(11):2319–2324, 2008.
[980] M. Bruglieri and L. Liberti. Optimal running and planning of a biomass-based energy
production process. Energy Policy, 36:2430–2438, 2008.
[981] S. Cafieri, G. Caporossi, P. Hansen, S. Perron, and A. Costa. Finding communities in
networks in the strong and almost-strong sense. Physical Review E., 85(4):046113, April
2012.
[982] S. Cafieri, A. Costa, and P. Hansen. Reformulation of a model for hierarchical divisive
graph modularity maximization. Annals of Operations Research, page À paraı̂tre, Accepté.
[983] S. Cafieri, P. Hansen, and Liberti. L. Loops and multiple edges in modularity maximization of networks. Physical Review E., 81(4):046102, 9 pages, 2010.
[984] S. Cafieri, P. Hansen, and L. Liberti. Edge ratio and community structure in networks.
Physical Review E., 81(2):026105, 14 pages, 2010.
[985] S. Cafieri, P. Hansen, and L. Liberti. Locally optimal heuristic for modularity maximization of networks. Physical Review E, 83(5):056105, May 2011.
[986] S. Cafieri, P. Hansen, and L. Liberti. Improving heuristics for network modularity maximization using an exact algorithm. Discrete Applied Mathematics, page À paraı̂tre, Accepté.
[987] S. Cafieri, J. Lee, and L. Liberti. On convex relaxations of quadrilinear terms. Journal of
Global Optimization, 47:661–685, 2010.
[988] S. Cafieri, L. Liberti, F. Messine, and B. Nogarede. Optimal design of electrical machines:
Mathematical programming formulations. COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering, 32(3):977–996, 2013.
[989] Denis Cornaz and Vincent Jost. A one-to-one correspondence between colorings and
stable sets. Oper. Res. Lett., 36(6):673–676, 2008.
[990] G. Cornuéjols, L. Liberti, and G. Nannicini. Improved strategies for branching on general
disjunctions. Mathematical Programming A, 130:225–247, 2011.
[991] A. Costa and P. Hansen. Comment on evolutionary method for finding communities in
bipartite network. Physical Review E, 84(5):058101, 2011.
[992] A. Costa and P. Hansen. A locally optimal hierarchical divisive heuristic for bipartite
modularity maximization. Optimization Letters, page À paraı̂tre, Accepté.
[993] Alberto Costa, Pierre Hansen, and Leo Liberti. On the impact of symmetry-breaking
constraints on spatial Branch-and-Bound for circle packing in a square. Discrete Applied
Mathematics, 161(1–2):96–106, 2013.
[994] Alberto Costa, Leo Liberti, and Pierre Hansen. Formulation symmetries in circle packing. Electronic Notes in Discrete Mathematics, 36:1303–1310, 2010.
BIBLIOGRAPHY
385
[995] C. D’Ambrosio, A. Frangioni, L. Liberti, and A. Lodi. On interval subgradient and nogood cuts. Operations Research Letters, 38:341–345, 2010.
[996] C. D’Ambrosio, A. Frangioni, L. Liberti, and A. Lodi. A storm of feasibility pumps for
nonconvex minlp. Mathematical Programming, 136(2):375–402, 2012.
[997] C. D’Ambrosio and A. Lodi. Mixed integer non-linear programming tools: a practical
overview. 4OR: A Quarterly Journal of Operations Research, 9(4):329–349, 2011.
[998] C. D’Ambrosio and A. Lodi. Mixed integer nonlinear programming tools: an updated
practical overview. Annals of Operations Research, to appear.
[999] Y. Dutuit, F. Innal, A. Rauzy, and J.-P. Signoret. Probabilistic assessments in relationship
with Safety Integrity Levels by using Fault Trees. Reliability Engineering and System Safety,
93(12):1867–1876, December 2008.
[1000] Y. Dutuit, A. Rauzy, and J.-P. Signoret. A snapshot of methods and tools to assess
safety integrity levels of high integrity protection systems. Journal of Risk and Reliability, 222(3):371–379, 2008.
[1001] I. Fernandes, D. Aloise, D.J. Aloise, P. Hansen, and L. Liberti. On the Weber facility
location problem with limited distances and side constraints. Optimization Letters, page
À paraı̂tre, Accepté.
[1002] I. Fernandes, D. Aloise, D.J. Aloise, P. Hansen, and L. Liberti. On the weber facility
location problem with limited distances and side constraints. Optimization Letters, to
appear.
[1003] Gerd Finke, Vincent Jost, Maurice Queyranne, and András Sebö. Batch processing with
interval graph compatibilities between tasks. Discrete Applied Mathematics, 156(5):556–
568, 2008.
[1004] Vassilis Giakoumakis, Daniel Krob, Leo Liberti, and Fabio Roda. Technological architecture evolutions of information systems: Trade-off and optimization. Concurrent Engineering: R&A, 20(2):127–147, 2012.
[1005] Christos Giatsidis, Dimitrios M. Thilikos, and Michalis Vazirgiannis. D-cores: measuring collaboration of directed graphs based on degeneracy. Knowl. Inf. Syst., 35(2):311–
343, 2013.
[1006] Boris Golden, Marc Aiguier, and Daniel Krob. Modeling of complex systems ii: A minimalist and unified semantics for heterogeneous integrated systems. Applied Mathematics
and Computation, 218(16):8039–8055, 2012.
[1007] Maria Halkidi, Diomidis Spinellis, George Tsatsaronis, and Michalis Vazirgiannis. Data
mining in software engineering. Intell. Data Anal., 15(3):413–441, 2011.
[1008] Youssef Hamadi. Conclusion to the special issue on parallel SAT solving. JSAT, 6(4):263,
2009.
[1009] Youssef Hamadi, Saı̈d Jabbour, Cédric Piette, and Lakhdar Sais. Deterministic parallel
DPLL. JSAT, 7(4):127–132, 2011.
[1010] Youssef Hamadi, Saı̈d Jabbour, and Lakhdar Sais. ManySAT: a Parallel SAT Solver. JSAT,
6(4):245–262, 2009.
[1011] Youssef Hamadi, Saı̈d Jabbour, and Lakhdar Sais. Learning for dynamic subsumption.
International Journal on Artificial Intelligence Tools, 19(4):511–529, 2010.
386
BIBLIOGRAPHY
[1012] Youssef Hamadi, Saı̈d Jabbour, and Lakhdar Sais. Learning from conflicts in propositional satisfiability. 4OR, 10(1):15–32, 2012.
[1013] Youssef Hamadi and Georg Ringwelski. Boosting distributed constraint satisfaction. J.
Heuristics, 17(3):251–279, 2011.
[1014] P. Hansen and C. Lucas. An inequality for the signless Laplacian index of a graph using
the chromatic number. Graph Theory Notes of New York, LVII:39–42, 2009.
[1015] P. Hansen and C. Lucas. Bounds and conjectures for the signless laplacian index of
graphs. Linear Algebra and its Applications, 432(12):3319–3336, 2010.
[1016] F. Inal, Y. Dutuit, A. Rauzy, and J.-P. Signoret. New insight into the average probability
of failure on demand and the probability of dangerous failure per hour of safety instrumented systems. Journal of Risk and Reliability, 224(2):75–86, 2010.
[1017] Vincent Jost and David Savourey. A 0–1 integer linear programming approach to schedule outages of nuclear power plants. Journal of Scheduling, pages 1–16, 2013.
[1018] Antoine Jouglet and David Savourey. Dominance rules for the parallel machine total
weighted tardiness scheduling problem with release dates. Computers & Operations Research, 38(9):1259–1266, 2011.
[1019] Antoine Jouglet, David Savourey, Jacques Carlier, and Philippe Baptiste. Dominancebased heuristics for one-machine total cost scheduling problems. European Journal of
Operational Research, 184(3):879–899, 2008.
[1020] George D. Kritikos, Charalampos N. Moschopoulos, Michalis Vazirgiannis, and Sophia
Kossida. Noise reduction in protein-protein interaction graphs by the implementation of
a novel weighting scheme. BMC Bioinformatics, 12:239, 2011.
[1021] C. Lavor, J. Lee, A. Lee-St. John, L. Liberti, A. Mucherino, and M. Sviridenko. Discretization orders for distance geometry problems. Optimization Letters, 6:783–796, 2012.
[1022] C. Lavor, L. Liberti, N. Maculan, and A. Mucherino. The discretizable molecular distance
geometry problem. Computational Optimization and Applications, 52:115–146, 2012.
[1023] C. Lavor, L. Liberti, N. Maculan, and A. Mucherino. Recent advances on the discretizable
molecular distance geometry problem. European Journal of Operational Research, 219:698–
706, 2012.
[1024] C. Lavor, L. Liberti, and A. Mucherino. The interval branch-and-prune algorithm for
the discretizable molecular distance geometry problem with inexact distances. Journal of
Global Optimization, to appear.
[1025] C. Lavor, A. Mucherino, L. Liberti, and N. Maculan. Discrete approaches for solving
molecular distance geometry problems using nmr data. International Journal of Computational Bioscience, 2010:88–94, 2010.
[1026] C. Lavor, A. Mucherino, L. Liberti, and N. Maculan. On the computation of protein
backbones by using artificial backbones of hydrogens. Journal of Global Optimization,
50:329–344, 2011.
[1027] J. Lee and L. Liberti. A matroid view of key theorems for edge-swapping algorithms.
Mathematical Methods of Operations Research, 76:125–127, 2012.
[1028] L. Liberti. Spherical cuts for integer programming problems. International Transactions
in Operational Research, 15:283–294, 2008.
BIBLIOGRAPHY
387
[1029] L. Liberti. Reformulations in mathematical programming: Definitions and systematics.
RAIRO-RO, 43(1):55–86, 2009.
[1030] L. Liberti. Reformulations in mathematical programming: Automatic symmetry detection and exploitation. Mathematical Programming A, 131:273–304, 2012.
[1031] L. Liberti, L. Alfandari, and M.-C. Plateau. Edge cover by connected bipartite subgraphs.
Annals of Operations Research, 188(1):307–329, 2011.
[1032] L. Liberti, C. Lavor, and N. Maculan. A branch-and-prune algorithm for the molecular
distance geometry problem. International Transactions in Operational Research, 15(1):1–
17, 2008.
[1033] L. Liberti, C. Lavor, N. Maculan, and F. Marinelli. Double variable neighbourhood search
with smoothing for the molecular distance geometry problem. Journal of Global Optimization, 43:207–218, 2009.
[1034] L. Liberti, C. Lavor, N. Maculan, and A. Mucherino. Euclidean distance geometry and
applications. SIAM Review, to appear.
[1035] L. Liberti, C. Lavor, N. Maculan, and M.A.C. Nascimento. Reformulation in mathematical programming: an application to quantum chemistry. Discrete Applied Mathematics,
157(6):1309–1318, 2009.
[1036] L. Liberti, C. Lavor, A. Mucherino, and N. Maculan. Molecular distance geometry
methods: from continuous to discrete. International Transactions in Operational Research,
18:33–51, 2010.
[1037] L. Liberti, N. Maculan, and Y. Zhang. Optimal configuration of gamma ray machine
radiosurgery units: the sphere covering subproblem. Optimization Letters, 3:109–121,
2009.
[1038] L. Liberti, B. Masson, J. Lee, C. Lavor, and A. Mucherino. On the number of realizations
of certain henneberg graphs arising in protein conformation. Discrete Applied Mathematics, to appear.
[1039] L. Liberti, N. Mladenović, and G. Nannicini. A recipe for finding good solutions to
minlps. Mathematical Programming Computation, 3:349–390, 2011.
[1040] L. Liberti and J. Ostrowski. Stabilizer-based symmetry breaking constraints for mathematical programs. Journal of Global Optimization, to appear.
[1041] Panagis Magdalinos, Christos Doulkeridis, and Michalis Vazirgiannis. Enhancing clustering quality through landmark-based dimensionality reduction. TKDD, 5(2):11, 2011.
[1042] Fragkiskos D. Malliaros and Michalis Vazirgiannis. Clustering and community detection
in directed networks: A survey. Physics Reports, 2013. (To appear).
[1043] A. Mucherino, C. Lavor, and L. Liberti. The discretizable distance geometry problem.
Optimization Letters, 6(8):1671–1686, 2012.
[1044] A. Mucherino, C. Lavor, and L. Liberti. Exploiting symmetry properties of the discretizable molecular distance geometry problem. Journal of Bioinformatics and Computational
Biology, 10(3):1242009(15), 2012.
[1045] A. Myers and A. Rauzy. Assessment of redundant systems with imperfect coverage by
means of binary decision diagrams. Reliability Engineering and System Safety, 93(7):1025–
1035, 2008.
BIBLIOGRAPHY
388
[1046] G. Nannicini, D. Delling, and D. Schultes. Bidirectional a∗ search on time-dependent
road networks. Networks, 59(2):240–251, 2012.
[1047] G. Nannicini and L. Liberti. Shortest paths on dynamic graphs. International Transactions
in Operations Research, 15:551–563, 2008.
[1048] Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, and Leo Liberti.
Fast paths in large-scale dynamic road networks. Comp. Opt. and Appl., 45(1):143–158,
2010.
[1049] C. Ibà nez Llano, A. Rauzy, E. Meléndez, and F. Nieto. Minimal cutsets-based reduction
approach for the use of binary decision diagrams on probabilistic safety assessment fault
tree models. Journal of Risk and Reliability, 223(4):301–311, 2009.
[1050] C. Ibà nez Llano, A. Rauzy, E. Meléndez, and F. Nieto. Hybrid approach for the assessment of psa models by means of binary decision diagrams. Reliability Engineering and
System Safety, 95(10):1076–1092, 2010.
[1051] O. Nusbaumer and A. Rauzy. Fault tree linking versus event tree linking approaches: a
reasoned comparison. To appear in Journal of Risk and Reliability, 2013.
[1052] A. Rauzy. Guarded transition systems: a new states/events formalism for reliability
studies. Journal of Risk and Reliability, 222(4):495–505, 2008.
[1053] A. Rauzy. Some disturbing facts about depth first left most variable ordering heuristics
for binary decision diagrams. Journal of Risk and Reliability, 222(4):573–582, 2008.
[1054] A. Rauzy. Sequence algebra, sequence decision diagrams and dynamic fault trees. Reliability Engineering and System Safety, 96(7):785–792, 2011.
[1055] Nikos Salamanos and Michalis Vazirgiannis. Diffusion of information and phase transition in the fisher market. IJKL, 8(3/4):259–281, 2012.
[1056] S. Sallaume, S. Martins, L. Satoru Ochi, W. Gramacho, C. Lavor, and L. Liberti. A discrete search algorithm for finding the structure of protein backbones and side chains.
International Journal of Bioinformatics Research and Applications, 9:261–270, 2013.
[1057] H. Sherali, E. Dalkiran, and L. Liberti. Reduced rlt representations for nonconvex polynomial programming problems. Journal of Global Optimization, 52:447–469, 2012.
[1058] Christoph M. Wintersteiger, Youssef Hamadi, and Leonardo Mendonça de Moura. Efficiently solving quantified bit-vector formulas. Formal Methods in System Design, 42(1):3–
23, 2013.
X.6.5
Revues nationales
[1059] A. Mucherino, C. Lavor, L. Liberti, and N. Maculan. On the definition of artificial backbones for the discretizable molecular distance geometry problem. Mathematica Balkanica,
23(3-4):289–302, 2009.
X.6.6
[1060] Marc Aiguier, Boris Golden, and Daniel Krob. An adequate logic for heterogeneous
systems. In Y. Liu and A. Martin, editors, Proceeding of the 18th International Conference
on Engineering of Complex Computer Systems (ICECCS 2013), 2013.
BIBLIOGRAPHY
389
[1061] D. Aloise, I.F. Fernandes, P. Hansen, L. Liberti, and D.J. Aloise. On the facility location
problem with limited distances and side constraints. In Proceedings of TOGO, pages 19–
22, 2010.
[1062] Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron, and Manuel
Ruiz. Modularity maximization in networks by variable neighborhood search. In David
A. Bader, Henning Meyerhenke, Peter Sanders, and Dorothea Wagner, editors, 10th DIMACS Implementation Challenge - Graph Partitioning and Graph Clustering, pages 113–128,
February 2012.
[1063] Nicolas Anciaux, Walid Bezza, Benjamin Nguyen, and Michalis Vazirgiannis. Minexpcard: limiting data collection using a smart card. In EDBT, pages 753–756, 2013.
[1064] Nicolas Anciaux, Benjamin Nguyen, and Michalis Vazirgiannis. Limiting data collection
in application forms: A real-case application of a founding privacy principle. In PST,
pages 59–66, 2012.
[1065] Alejandro Arbelaez and Youssef Hamadi. Exploiting weak dependencies in tree-based
search. In Symposium on Applied Computing, pages 1385–1391, 2009.
[1066] Alejandro Arbelaez and Youssef Hamadi. Improving parallel local search for sat. In
LION, pages 46–60, 2011.
[1067] Alejandro Arbelaez, Youssef Hamadi, and Michèle Sebag. Continuous search in constraint programming. In ICTAI (1), pages 53–60, 2010.
[1068] Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saı̈d Jabbour, and Lakhdar Sais. A
generalized framework for conflict analysis. In SAT, pages 21–27, 2008.
[1069] P. Belotti, S. Cafieri, J. Lee, and L. Liberti. Feasibility-based bounds tightening via fixed
points. In D.-Z. Du, P. Pardalos, and B. Thuraisingham, editors, Combinatorial Optimization, Constraints and Applications (COCOA10), volume 6508 of LNCS, pages 65–76, New
York, 2010. Springer.
[1070] P. Belotti, S. Cafieri, J. Lee, and L. Liberti. On the convergence of feasibility based bounds
tightening. In U. Faigle, editor, Proceedings of the 9th Cologne-Twente Workshop on Graphs
and Combinatorial Optimization, pages 21–24. University of Köln, 2010.
[1071] Thierry Benoist, Antoine Jeanjean, and Vincent Jost. The line traveling salesman with
partial ordering. In 25th European conference on operation research (EURO), page 67, Vilnius, Lithuania, 2012.
[1072] Johanna Berrebi and Daniel Krob. How to use systems architecture to specify the operational perimeter of an innovative product line? In M. Celentano, editor, Proceedings of
INCOSE International Symposium of 2012 (IS 2012), 2012. 15 pages, INCOSE, 2012.
[1073] A. Bettinelli, L. Liberti, F. Raimondi, and D. Savourey. The anonymous subgraph problem. In S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, and L. Liberti, editors,
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
pages 269–274, Paris, 2009. École Polytechnique.
[1074] Lucas Bordeaux, Youssef Hamadi, and Horst Samulowitz. Experiments with massively
parallel constraint solving. In IJCAI, pages 443–448, 2009.
[1075] Nadia Brauner, Gerd Finke, Vincent Jost, Mikhail Kovalyov, Yuri Orlovich, Philip Pronin,
and Ariel Waserhole. Computational complexity of maximum distance-(k, l) matchings
in graphs. In International Congress on Computer Science: Information Systems and Technologies - Minsk, pages 341–346, 2011.
390
BIBLIOGRAPHY
[1076] S. Cafieri, P. Hansen, and L. Liberti. Improving heuristics for network modularity maximization using an exact algorithm. In Proceedings of Matheuristics, Vienne, 2010.
[1077] S. Cafieri, J. Lee, and L. Liberti. Comparison of convex relaxations of quadrilinear terms.
In C. Ma, L. Yu, D. Zhang, and Z. Zhou, editors, Global Optimization: Theory, Methods and
Applications I, volume 12(B) of Lecture Notes in Decision Sciences, pages 999–1005, Hong
Kong, 2009. Global-Link Publishers.
[1078] S. Cafieri, L. Liberti, F. Messine, and B. Nogarède. Discussion about formulations and
resolution techniques of electrical machine design problems. In Proceedings of the XIX
International Conference on Electrical Machines. IEEE, 2010.
[1079] Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, and Frédéric Messine. Compact relaxations for polynomial programming problems. In Ralf Klasing, editor, Experimental Algorithms. Proceedings of the 11th International Symposium, SEA 2012, volume
7276 of Lecture Notes in Computer Science, pages 75–86, Bordeaux, France, June 2012.
Springer.
[1080] G. Cornuéjols, L. Liberti, and G. Nannicini. Improved strategies for branching on general dijunctions. In S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, and L. Liberti,
editors, Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pages 144–145, Paris, 2009. École Polytechnique.
[1081] A. Costa, P. Hansen, and L. Liberti. Formulation symmetries in circle packing. In R.
Mahjoub, editor, Proceedings of the International Symposium on Combinatorial Optimization, volume 36 of Electronic Notes in Discrete Mathematics, pages 1303–1310, Amsterdam,
2010. Elsevier.
[1082] A. Costa, P. Hansen, and L. Liberti. Static symmetry breaking in circle packing. In U.
Faigle, editor, Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization, pages 47–50. University of Köln, 2010.
[1083] A. Costa, P. Hansen, and L. Liberti. Bound constraints for point packing in a square. In
G. Nicosia and A. Pacifici, editors, Proceedings of Cologne/Twente Workshop, Rome, 2011.
Università di Roma 2 — Tor Vergata.
[1084] A. Costa and L. Liberti. Relaxations of multilinear convex envelopes: dual is better than
primal. In R. Klasing, editor, Experimental Algorithms, volume 7276 of LNCS, pages 87–
98, Heidelberg, 2012. Springer.
[1085] A. Costa, L. Liberti, and P. Hansen. Formulation symmetries in circle packing. In P.
Bonami, L. Liberti, A. Miller, and A. Sartenaer, editors, EWMINLP 2010 Proceedings,
pages 219–221, Marseille, France, avril 2010.
[1086] A. Costa, L. Liberti, and P. Hansen. Formulation symmetries in circle packing. In ISCO
Proceedings, Electronic Notes in Discrete Mathematics, volume 36, pages 1303–1310, 2010.
[1087] Alberto Costa, Pierre Hansen, and Leo Liberti. Static symmetry breaking in circle packing. In Ulrich Faigle, Rainer Schrader, and Daniel Herrmann, editors, CTW, pages 47–50,
Cologne, Germany, 2010.
[1088] Alberto Costa, Pierre Hansen, and Leo Liberti. Bound constraints for point packing
in a square. In Ludovica Adacher, Marta Flamini, Gianmaria Leo, Gaia Nicosia, Andrea
Pacifici, and Veronica Piccialli, editors, Proceedings of the 10th Cologne-Twente Workshop
on graphs and combinatorial optimization. Extended Abstracts, pages 126–129, Villa Mondragone, Frascati, Italy, June 2011.
[1089] C. D’Ambrosio and C. Buchheim. A fast exact method for box constrained polynomial
optimization. In ECCO 2013, France, May 2013.
BIBLIOGRAPHY
391
[1090] C. D’Ambrosio, A. Frangioni, L. Liberti, and A. Lodi. Experiments with a feasibility
pump approach for nonconvex MINLPs. In P. Festa, editor, Symposium on Experimental
Algorithms, volume 6049 of LNCS, Heidelberg, 2010. Springer.
[1091] Claudia D’Ambrosio, Antonio Frangioni, Leo Liberti, and Andrea Lodi. Feasibility
Pump algorithms for nonconvex Mixed Integer Nonlinear Programming problems. In
APMOD 2012, Germany, March 2012.
[1092] Claudia D’Ambrosio, Andrea Lodi, Silvano Martello, and Riccardo Rovatti. Optimistic
modeling of non-linear optimization problems by mixed-integer linear programming. In
ISMP 2012, Germany, August 2012.
[1093] Claudia D’Ambrosio, Andrea Lodi, Silvano Martello, and Riccardo Rovatti. Optimistically Approximating Non-linear Optimization Problems through MILP. In EURO 2012,
Lithuania, July 2012.
[1094] A. Dauron, Abdelkrim Doufène, and Daniel Krob. Complex systems operational analysis - A case study for electric vehicles. In O. Hammami, D. Krob, and J. L. Voirin, editors, Posters of the 2nd International Conference on Complex System Design & Management,
(CSDM 2011), 2011. 18 pages, Paris, France, 2011.
[1095] D. Delling and G. Nannicini. Bidirectional core-based routing in dynamic timedependent road networks. In Algorithms and Computation, volume 5369 of LNCS, pages
812–833, New York, 2008. Springer.
[1096] K. Dhyani and L. Liberti. Mathematical programming formulations for the bottleneck
hyperplane clustering problem. In L. Hoai An, P. Bouvry, and P. Dinh Tao (eds.), editors,
Modelling, Computation and Optimization in Information Systems and Management Sciences,
volume 14 of Communications in Computer and Information Science, pages 87–96, Berlin,
2008. Springer.
[1097] Abdelkrim Doufène, H. G. Chalé Gongora, and Daniel Krob. Complex Systems Architecture Framework. Extension to Multi-Objective Optimization. In Y. Caseau, D. Krob,
and A. Rauzy, editors, Proceedings of the 3rd International Conference on Complex System
Design & Management, (CSDM 2012), pages 105–123. Springer Verlag, 2012.
[1098] Abdelkrim Doufène and Daniel Krob. Sharing the Total Cost of Ownership of Electric
Vehicles: A Study on the Application of Game Theory. In Proceeding of INCOSE International Symposium of 2013 (IS2013), 2013.
[1099] S. Epstein, M. Reinhart, and A. Rauzy. Validation project for the open-PSA model exchange using riskspectrum and cafta. In B.P. Hallbert, editor, Proceeding of the PSAM’10
Conference, June 2010. Seatle, USA (also in E. Fadier ed., Actes du congrès LambdaMu’10).
[1100] Álvaro Fialho, Youssef Hamadi, and Marc Schoenauer. Optimizing architectural and
structural aspects of buildings towards higher energy efficiency. In GECCO (Companion),
pages 727–732, 2011.
[1101] Álvaro Fialho, Youssef Hamadi, and Marc Schoenauer. A multi-objective approach to
balance buildings construction cost and energy efficiency. In ECAI, pages 961–966, 2012.
[1102] M. Fischetti and L. Liberti. Orbital shrinking. In R. Mahjoub, V. Markakis, I. Milis, and
V. Paschos, editors, Combinatorial Optimization, volume 7422 of LNCS, pages 48–58, New
[1103] Mary Gerontini, Michalis Vazirgiannis, Alkiviadis C. Vatopoulos, and Michalis Polemis.
Predictions in antibiotics resistance and nosocomial infections monitoring. In CBMS,
pages 1–6, 2011.
392
BIBLIOGRAPHY
[1104] Vassilis Giakoumakis, Daniel Krob, Leo Liberti, and Fabio Roda. Optimal technological architecture evolutions of information systems. In Marc Aiguier, Francis Bretaudeau,
and Daniel Krob, editors, Proceedings of the First International Conference on Complex System Design & Management, (CSDM 2010), pages 137–148. Springer Verlag, 2010. Paris,
France, 2010.
[1105] Christos Giatsidis, Klaus Berberich, Dimitrios M. Thilikos, and Michalis Vazirgiannis.
Visual exploration of collaboration networks based on graph degeneracy. In KDD, pages
1512–1515, 2012.
[1106] Christos Giatsidis, Fragkiskos D. Malliaros, and Michalis Vazirgiannis. Advanced graph
mining for community evaluation in social networks and the web. In WSDM, pages 771–
772, 2013.
[1107] Christos Giatsidis, Fragkiskos D. Malliaros, and Michalis Vazirgiannis. Graph mining
tools for community detection and evaluation in social networks and the web. In WWW,
2013. (Tutorial).
[1108] Christos Giatsidis, Dimitrios M. Thilikos, and Michalis Vazirgiannis. D-cores: Measuring collaboration of directed graphs based on degeneracy. In ICDM, pages 201–210, 2011.
[1109] Christos Giatsidis, Dimitrios M. Thilikos, and Michalis Vazirgiannis. Evaluating cooperation in communities with the k-core structure. In ASONAM, pages 87–93, 2011.
[1110] Boris Golden, Marc Aiguier, and Daniel Krob. Complex systems architecture and modeling. In Marc Aiguier, Francis Bretaudeau, and Daniel Krob, editors, Posters of the First
International Conference on Complex System Design & Management, (CSDM 2010), 2010.
16 pages, Paris, France, 2010.
[1111] E. Goubault, S. Le Roux, J. Leconte, L. Liberti, and F. Marinelli. Static analysis by abstract
interpretation: a mathematical programming approach. In A. Miné and E. RodriguezCarbonell, editors, Proceeding of the Second International Workshop on Numerical and Symbolic Abstract Domains, volume 267(1) of Electronic Notes in Theoretical Computer Science,
pages 73–87. Elsevier, 2010.
[1112] Long Guo, Youssef Hamadi, Saı̈d Jabbour, and Lakhdar Sais. Diversification and intensification in parallel sat solving. In CP, pages 252–265, 2010.
[1113] Youssef Hamadi, Saı̈d Jabbour, and Lakhdar Sais. Control-based clause sharing in parallel sat solving. In IJCAI, pages 499–504, 2009.
In ICTAI, pages 328–335, 2009.
[1115] Youssef Hamadi, Jo ao Marques-Silva, and Christoph M. Wintersteiger. Lazy decomposition for distributed decision procedures. In PDMC, pages 43–54, 2011.
[1116] Youssef Hamadi and Marc Schoenauer, editors. Learning and Intelligent Optimization 6th International Conference, LION 6, Paris, France, January 16-20, 2012, Revised Selected
Papers, volume 7219 of Lecture Notes in Computer Science. Springer, 2012.
[1117] Youssef Hamadi and Christoph M. Wintersteiger. Seven challenges in parallel SAT solving. In AAAI, 2012.
[1118] M. Hibti, T. Friedlhuber, and A. Rauzy. Overview of the open psa platform. In R. Virolainen, editor, Proceedings of International Joint Conference PSAM’11/ESREL’12, June 2012.
[1119] M. Hibti, T. Friedlhuber, and A. Rauzy. Variant management in a modular psa. In R.
Virolainen, editor, Proceedings of International Joint Conference PSAM’11/ESREL’12, June
2012.
BIBLIOGRAPHY
393
[1120] H. Hijazi, A. Diallo, M. Kieffer, L. Liberti, and C. Weidmann. A milp approach for designing robust variable-length codes based on exact free distance computation. In Data
Compression Conference, pages 257–266. IEEE, 2012.
[1121] F. Innal, Y. Dutuit, A. Rauzy, and J.-P. Signoret. New insights into PFDavg and PFH. In
S. Martorell, editor, Proceedings of European Conference on Reliability, ESREL’08, 2008.
[1122] L. Iwaza, M. Kieffer, L. Liberti, and K. Al-Agha. Joint decoding of multiple-description
network-coded data. In Network Coding. IEEE, 2011.
[1123] Margarita Karkali, Vassilis Plachouras, Constantinos Stefanatos, and Michalis Vazirgiannis. Keeping keywords fresh: a bm25 variation for personalized keyword extraction. In
TempWeb, pages 17–24, 2012.
[1124] Margarita Karkali, Dimitris Pontikis, and Michalis Vazirgiannis. Match the news: a
firefox extension for real-time news recommendation. In SIGIR, 2013. (To appear).
[1125] Margarita Karkali and Michalis Vazirgiannis. S-suite: a multipart service oriented architecture for the car rental sector. In BCI, pages 263–266, 2012.
[1126] D. Kirchler, L. Liberti, and R. Wolfler Calvo. A label correcting algorithm for the shortest path problem on a multi-modal route network. In R. Klasing, editor, Experimental
Algorithms, volume 7276 of LNCS, pages 236–247, Heidelberg, 2012. Springer.
[1127] D. Kirchler, L. Liberti, T. Pajor, and R. Wolfler Calvo. Unialt for regular language constrained shortest paths on a multi-modal transportation network. In A. Caprara, editor,
Algorithmic Approaches for Transportation Modelling, Optimization and Systems, volume
ATMOS11 of OpenAccess Informatics. Schloß Dagstuhl, 2011.
[1128] Daniel Krob. Comment sécuriser la conception et le déploiement des logiciels métiers
par une démarche d’architecture collaborative? In Journée Française des Tests Logiciels,
2008. 23 pages, CFTL 2008.
[1129] C. Lavor, A. Mucherino, L. Liberti, and N. Maculan. An artificial backbone of hydrogens
for finding the conformation of protein molecules. In Proceedings of the Computational
Structural Bioinformatics Workshop, pages 152–155, Washington D.C., USA, 2009. IEEE.
[1130] C. Lavor, A. Mucherino, L. Liberti, and N. Maculan. Computing artificial backbones
of hydrogen atoms in order to discover protein backbones. In Proceedings of the International Multiconference on Computer Science and Information Technology, pages 751––756,
Mragowo, Poland, 2009. IEEE.
[1131] Kyriakos Liakopoulos, Stamatina Thomaidou, and Michalis Vazirgiannis. The adomaton
prototype: Automated online advertising campaign monitoring and optimization. In Ad
Auctions Workshop, 13th ACM Conference on Electronic Commerce, 2012.
[1132] L. Liberti. Automatic generation of symmetry-breaking constraints. In B. Yang, D.-Z. Du,
and C.A. Wang, editors, Combinatorial Optimization, Constraints and Applications (COCOA08), volume 5165 of LNCS, pages 328–338, Berlin, 2008. Springer.
[1133] L. Liberti. Modelling rank constraints in mathematical programming. In S. Pickl et
al., editor, Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization, München, 2012. Universität der Bundeswehr.
[1134] L. Liberti, S. Cafieri, and D. Savourey. Reformulation optimization software engine. In K.
Fukuda, J. van der Hoeven, M. Joswig, and N. Takayama, editors, Mathematical Software,
volume 6327 of LNCS, pages 303–314, New York, 2010. Springer.
394
BIBLIOGRAPHY
[1135] L. Liberti, C. Lavor, J. Alencar, and G. Abud. Counting the number of solutions of
k DMDGP instances. In F. Nielsen et al., editor, Geometric Science of Information, LNCS,
New York, 2013. Springer.
[1136] L. Liberti, B. Masson, C. Lavor, and A. Mucherino. Branch-and-Prune trees with
bounded width. In G. Nicosia and A. Pacifici, editors, Proceedings of Cologne/Twente Workshop, Rome, 2011. Università di Roma 2 — Tor Vergata.
[1137] L. Liberti, B. Masson, J. Lee, C. Lavor, and A. Mucherino. On the number of solutions of
the discretizable molecular distance geometry problem. In Combinatorial Optimization,
Constraints and Applications (COCOA11), volume 6831 of LNCS, pages 322–342, New
[1138] L. Liberti, N. Mladenović, and G. Nannicini. A good recipe for solving MINLPs. In V.
Maniezzo, T. Stützle, and S. Voß, editors, Hybridizing metaheuristics and mathematical programming, volume 10 of Annals of Information Systems, pages 231–244, New York, 2009.
Springer.
[1139] L. Liberti, S. Le Roux, J. Leconte, and F. Marinelli. Mathematical programming based debugging. In R. Mahjoub, editor, Proceedings of the International Symposium on Combinatorial Optimization, volume 36 of Electronic Notes in Discrete Mathematics, pages 1311–1318,
Amsterdam, 2010. Elsevier.
[1140] F. Marinelli, A. Mucherino, O. De Weck, D. Krob, and L. Liberti. A general framework
for combined module- and scale-based product platform design. In Proceedings of the 2nd
Int. Symp. on Engineering Systems, Boston, 2009. ESD Division, MIT.
[1141] Julien Moncel, Gerd Finke, and Vincent Jost. A note on single-machine scheduling
problems with position-dependent processing times. In 13th International Conference on
Project Management and Scheduling (PMS), pages 231–234, Leuven, Belgium, 2012.
[1142] Nora Touati Moungla, Pietro Belotti, Vincent Jost, and Leo Liberti. A branch-and-price
algorithm for the risk-equity constrained routing problem. In INOC, pages 439–449,
2011.
[1143] A. Mucherino, C. Lavor, and L. Liberti. A symmetry-driven BP algorithm for the discretizable molecular distance geometry problem. In Proceedings of Computationl Structural Bioinformatics Workshop, pages 390–395. IEEE, 2011.
[1144] A. Mucherino, C. Lavor, L. Liberti, and N. Maculan. On the discretization of distance
geometry problems. In M. Deza, M. Petitjean, and K. Markov, editors, Mathematics of
Distances and Applications, Sofia, 2012. ITHEA.
[1145] A. Mucherino, C. Lavor, L. Liberti, and E-G. Talbi. A parallel version of the branch &
prune algorithm for the molecular distance geometry problem. In ACS/IEEE International
Conference on Computer Systems and Applications (AICCSA10), pages 1–6, Hammamet,
Tunisia, 2010. IEEE.
[1146] A. Mucherino, C. Lavor, and N. Maculan. The molecular distance geometry problem
applied to protein conformations. In S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, and L. Liberti, editors, Proceedings of the 8th Cologne-Twente Workshop on Graphs and
Combinatorial Optimization, pages 337–340, Paris, 2009. École Polytechnique.
[1147] A. Mucherino, C. Lavor, T. Malliavin, L. Liberti, M. Nilges, and N. Maculan. Influence of
pruning devices on the solution of molecular distance geometry problems. In P. Pardalos
and S. Rebennack, editors, Experimental Algorithms, volume 6630 of LNCS, pages 206–
217, Berlin, 2011. Springer.
BIBLIOGRAPHY
395
[1148] A. Mucherino, L. Liberti, and C. Lavor. MD-jeep: an implementation of a branch-andprune algorithm for distance geometry problems. In K. Fukuda, J. van der Hoeven, M.
Joswig, and N. Takayama, editors, Mathematical Software, volume 6327 of LNCS, pages
186–197, New York, 2010. Springer.
[1149] A. Mucherino, L. Liberti, C. Lavor, and N. Maculan. Comparisons between an exact and
a metaheuristic algorithm for the molecular distance geometry problem. In F. Rothlauf,
editor, Proceedings of the Genetic and Evolutionary Computation Conference, pages 333–340,
Montreal, 2009. ACM.
[1150] G. Nannicini, Ph. Baptiste, D. Krob, and L. Liberti. Fast computation of point-to-point
paths on time-dependent road networks. In B. Yang, D.-Z. Du, and C.A. Wang, editors, Combinatorial Optimization, Constraints and Applications (COCOA08), volume 5165
of LNCS, pages 225–234, Berlin, 2008. Springer.
[1151] G. Nannicini, L. Liberti, D. Delling, and D. Schultes. Bidirectional A* search for timedependent fast paths. In C. McGeoch, editor, Workshop on Experimental Algorithms —
WEA, volume 5038 of LNCS, pages 334–346, New York, 2008. Springer.
[1152] Giacomo Nannicini, Philippe Baptiste, Daniel Krob, and Leo Liberti. Fast computation
of point-to-point paths on time-dependent road networks. In COCOA, pages 225–234,
2008.
[1153] C. Iba nez Llano and A. Rauzy. Variable ordering heuristics for bdd based on minimal
cutsets. In E. Zio, editor, Proceeding of the PSAM’9 Conference, 2008. Hong Kong.
[1154] C. Iba nez Llano, A. Rauzy, E. Meléndez Asensio, and F. Nieto Fuentes. Variable ordering techniques for the application of binary decision diagrams on PSA linked fault tree
models. In Proceeding of the ESREL 2008 Conference, 2008.
[1155] O. Nusbaumer and A. Rauzy. Fault tree linking versus event tree linking approaches:
A mathematical and algorithmic reconciliation. In R. Virolainen, editor, Proceedings of
International Joint Conference PSAM’11/ESREL’12, June 2012.
[1156] Cédric Piette, Youssef Hamadi, and Lakhdar Sais. Vivifying propositional clausal formulae. In ECAI, pages 525–529, 2008.
[1157] Cédric Piette, Youssef Hamadi, and Lakhdar Sais. Efficient combination of decision procedures for mus computation. In FroCoS, pages 335–349, 2009.
[1158] Vassilis Plachouras, Matthieu Rivière, and Michalis Vazirgiannis. Named entity recognition and identification for finding the owner of a home page. In PAKDD (1), pages
554–565, 2012.
[1159] Michalis Rallis and Michalis Vazirgiannis. Rank prediction in graphs with locally
weighted polynomial regression and em of polynomial mixture models. In ASONAM,
pages 515–519, 2011.
[1160] A. Rauzy. Anatomy of an efficient fault tree assessment engine. In R. Virolainen, editor,
Proceedings of International Joint Conference PSAM’11/ESREL’12, June 2012.
[1161] F. Roda, P. Hansen, and L. Liberti. The price of equity in the hazmat transportation
problem. In G. Nicosia and A. Pacifici, editors, Proceedings of Cologne/Twente Workshop,
pages 235–238, Rome, 2011. Università di Roma 2 — Tor Vergata.
[1162] F. Roda, L. Liberti, and F. Raimondi. Combinatorial optimization based recommender
systems. In S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, and L. Liberti, editors,
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
pages 175–179, Paris, 2009. École Polytechnique.
BIBLIOGRAPHY
396
[1163] Fabio Roda, Pierre Hansen, and Leo Liberti. The price of equity in the hazmat. In
Ludovica Adacher, Marta Flamini, Gianmaria Leo, Gaia Nicosia, Andrea Pacifici, and
Veronica Piccialli, editors, Proceedings of the 10th Cologne-Twente Workshop on graphs and
combinatorial optimization. Extended Abstracts, pages 235–238, Villa Mondragone, Frascati, Italy, June 2011.
[1164] Francois Rousseau and Michalis Vazirgiannis. Composition of tf normalizations: new
insights on scoring functions for ad hoc ir. In SIGIR, 2013. (To appear).
[1165] Nikos Salamanos, Elli Voudigari, Theodore Papageorgiou, and Michalis Vazirgiannis.
Discovering correlation between communities and likes in facebook. In GreenCom, pages
368–371, 2012.
[1166] Stamatina Thomaidou, Konstantinos Leymonis, Kyriakos Liakopoulos, and Michalis
Vazirgiannis. Ad-mad: Automated development and optimization of online advertising campaigns. In ICDM Workshops, pages 902–905, 2012.
[1167] Stamatina Thomaidou and Michalis Vazirgiannis. Multiword keyword recommendation
system for online advertising. In ASONAM, pages 423–427, 2011.
[1168] Nora Touati-Moungla and Vincent Jost. Combinatorial optimization for electric vehicles management. In International Conference on Renewable Energies and Power Quality
(ICREPQ 11), pages 738–743, 2012.
[1169] Jérémie Vautard, Arnaud Lallouet, and Youssef Hamadi. A parallel solving algorithm for
quantified constraints problems. In ICTAI (1), pages 271–274, 2010.
[1170] Michalis Vazirgiannis. Advanced graph mining and community evaluation metrics for
social networks and the web. In ASONAM, 2012. (Tutorial).
[1171] Vincent Vidal, Lucas Bordeaux, and Youssef Hamadi. Adaptive k-parallel best-first
search: A simple but efficient algorithm for multi-core domain-independent planning.
In SOCS, 2010.
[1172] Elli Voudigari, John Pavlopoulos, and Michalis Vazirgiannis. A framework for web page
rank prediction. In EANN/AIAI (2), pages 240–249, 2011.
[1173] Ariel Waserhole, Vincent Jost, and Nadia Brauner. Pricing for vehicle sharing using
densest oriented subgraph in markov chains. In ECCO, Amsterdam, Hollande, 2012.
[1174] Ariel Waserhole, Vincent Jost, and Nadia Brauner. Pricing techniques for self regulation
in vehicle sharing systems. In INOC - Electronic Notes in Discrete Mathematics, pages 149–
156, 2013.
[1175] Christoph M. Wintersteiger, Youssef Hamadi, and Leonardo Mendonça de Moura. A
concurrent portfolio approach to smt solving. In CAV, pages 715–720, 2009.
[1176] Christoph M. Wintersteiger, Youssef Hamadi, and Leonardo Mendonça de Moura. Efficiently solving quantified bit-vector formulas. In FMCAD, pages 239–246, 2010.
[1177] Boyan Yordanov, Christoph M. Wintersteiger, Youssef Hamadi, and Hillel Kugler. Smtbased analysis of biological computation. In NASA Formal Methods, pages 78–92, 2013.
X.6.7
[1178] D. Aloise, S. Cafieri, G. Caporossi, P. Hansen, L. Liberti, and S. Perron. Algorithms for
network modularity maximization. In Proceedings of ROADEF 2010, Toulouse, France,
février 2010.
BIBLIOGRAPHY
397
[1179] E. Arbaretier, Z. Brick, and A. Rauzy. Sûreté de fonctionnement et analyse de performances. In A. Lannoy, editor, Actes du congrès LambdaMu’16 (actes électroniques), October
2008. Avignon.
[1180] P.A. Brameret, A. Rauzy, and J.M. Roussel. Assessing the dependability of systems with
repairable and spare components. In J.F. Barbet, editor, Actes du Congrès Lambda-Mu 18,
Octobre 2012.
[1181] S. Cafieri and P. Hansen. Modularity clustering on trees. In Proceedings of ROADEF 2012,
Angers, France, avril 2012.
[1182] S. Cafieri, P. Hansen, and L. Liberti. Reformulations between structured global optimization problems and algorithms. In Proceedings of ROADEF 2009, Nancy, France,
février 2009.
[1183] S. Cafieri, P. Hansen, and L. Liberti. Hierarchical clustering for the identification of
communities in networks. In Proceedings of ROADEF 2011, Saint Etienne, France, Mars
2011.
[1184] A. Costa, S. Cafieri, and P. Hansen. Reformulation of a locally optimal heuristic for
modularity maximization. In Proceedings of ROADEF 2012, Angers, France, avril 2012.
[1185] A. Costa, P. Hansen, and L. Liberti. Symmetry breaking constraints for the circle packing
in a square problem. In Proceedings ROADEF 2011, volume 1, pages 63–64, Saint-Etienne,
France, Mars 2011.
[1186] Claudia D’Ambrosio, Antonio Frangioni, Leo Liberti, and Andrea Lodi. Extending Feasibility Pump to nonconvex mixed integer nonlinear programming problems. In ROADEF
2012, France, April 2012.
[1187] C. Dupart, P. Morel, A. Rauzy, and P. Thomas. Allocation de disponibilité avec Aralia. In
E. Fadier, editor, Actes du congrès LambdaMu’17 (actes électroniques), October 2010.
[1188] Giacomo Nannicini, Philippe Baptiste, Daniel Krob, and Leo Liberti. Fast paths on
dynamic road networks. In A. Quillat and Ph. Mahey, editors, Proceedings of ROADEF
2008, 2008. 14 pages, Presses Universitaires de l’Université Blaise Pascal, ClermontFerrand, 2008.
[1189] B. Perrot, T. Prosvirnova, A. Rauzy, and J.-P. Sahut d’Izarn. Arbres de défaillance dynamiques : une bibliothèque pour la nouvelle génération d’altarica. In E. Fadier, editor,
Actes du congrès LambdaMu’17 (actes électroniques). IMdR, October 2010.
[1190] B. Perrot, T. Prosvirnova, A. Rauzy, and J.-P. Sahut d’Izarn. Introduction au nouveau
langage pour la sûreté de fonctionnement : Altarica nouvelle génération. In E. Fadier,
editor, Actes du congrès LambdaMu’17 (actes électroniques). IMdR, October 2010.
[1191] B. Perrot, T. Prosvirnova, A. Rauzy, J.-P. Sahut d’Izarn, and R. Schoening. Expériences
de couplages de modèles AltaRica avec des interfaces métiers. In E. Fadier, editor, Actes
du congrès LambdaMu’17 (actes électroniques). IMdR, October 2010.
[1192] T. Prosvirnova and A. Rauzy. Modélisation des systèmes avec des composants mobiles
en AltaRica. In J.F. Barbet, editor, Actes du Congrès Lambda-Mu 18, Octobre 2012.
[1193] T. Prosvirnova and A. Rauzy. Système de transitions gardées : formalisme pivot de
modélisation pour la sûreté de fonctionnement. In J.F. Barbet, editor, Actes du Congrès
Lambda-Mu 18, Octobre 2012.
[1194] A. Rauzy. Diagrammes binaires de décision pondérés : vieilles idées, nouvelle mise en
œuvre. In E. Fadier, editor, Actes du congrès LambdaMu’17 (actes électroniques), October
2010.
BIBLIOGRAPHY
398
[1195] A. Rauzy. Xfta: Pour que cent arbres de défaillance fleurissent au printemps. In J.F.
Barbet, editor, Actes du Congrès Lambda-Mu 18, Octobre 2012.
[1196] W. van Ackooij, C. D’Ambrosio, G. Doukopoulos, A. Frangioni, C. Gentile, F. Roupin, and
T. Simovic. Optimality for Tough Combinatorial Hydro Valley Problems. In ROADEF
2013, France, February 2013.
[1197] L. Liberti. Distance geometry (plenary), 2009.
[1198] L. Liberti. Symmetry in mathematical programming (plenary), 2009.
[1199] L. Liberti. Distance geometry (plenary), 2010.
[1200] L. Liberti. Symétrie en programmation mathématique (tutorial), 2010.
[1201] L. Liberti. Combinatorial distance geometry (plenary), 2011.
[1202] L. Liberti. Molecular distance geometry (tutorial), 2011.
[1203] L. Liberti. Optimization and sustainable development (plenary), 2012.
[1204] L. Liberti. Symmetry in mathematical programming (plenary), 2012.
[1205] L. Liberti. Symmetry in mathematical programming (tutorial), 2012.
[1206] L. Liberti. History of distance geometry (plenary), 2013.
X.6.8
Brevets
[1207] L. Liberti, G. Barbier, Ph. Baptiste, and D. Krob. Estimation de trafic dans un réseau
routier. Technical Report Brevet no 08104579.1-2215, European Patent Office, Aug 2008.
[1208] A. Rauzy. Xfta. Technical report, Software Protection (APP), 2013.
[1209] M. Thomaidou and M. Vazirgiannis.
AD-MAD softwarer:
automated web advertising.
Technical Report Inter Deposit Digital Number
IDDN.FR.001.240023.000.S.P.2012.000.108005, Software Protection (APP), Aug 2012.
X.6.9
Vulgarisation
[1210] Nicolas Anciaux, Benjamin Nguyen, and Michalis Vazirgiannis. The minimum exposure
project: Limiting data collection in online forms. ERCIM News, 2012(90), 2012.
X.6.10
Thèses
[1211] J. Berrebi. Contribution à l’intégration d’une liaison avionique sans fil – L’ingénierie système
appliquée à une problématique industrielle. PhD thesis, Ecole Polytechnique, 2013.
[1212] A. Costa. Applications of reformulations in mathematical programming. PhD thesis, Ecole
Polytechnique, 2012.
[1213] Douffene. Architecture des systèmes complexes et optimisation – Application aux véhicules
électriques. PhD thesis, Ecole Polytechnique, 2013.
[1214] B. Golden. A unified formalism for complex systems architecture. PhD thesis, Ecole Polytechnique, 2013.
BIBLIOGRAPHY
399
[1215] G. Nannicini. Point-to-point shortest paths on dynamic time-dependent road networks. PhD
thesis, Ecole Polytechnique, 2009.
[1216] F. Roda. Integrating high-level requirements in optimization problems: theory and applications. PhD thesis, Ecole Polytechnique, 2013.
[1217] E. Winter. Des outils d’optimisation combinatoire et d’ordonnancement pour la gestion des
radars embarqués. PhD thesis, Ecole Polytechnique, 2008.
X.6.11
Rapports techniques
[1218] Riccardo Rovatti, Claudia D’Ambrosio, Andrea Lodi, and Silvano Martello. Optimistic
MILP Modeling of Non-linear Optimization Problems. Technical report, Faculty of Engineering [Bologna] , Laboratoire d’informatique de l’école polytechnique - LIX, November
2012. http://hal.archives-ouvertes.fr/hal-00758047.
X.6.12
Autres
[1219] Y. Hamadi and L. Liberti. Microsoft-cnrs “optimization and sustainable development”
polytechnique chair: activity report for 2009-2011, 2011. MSR-TR-2011-42.
CoRR, abs/0904.0029, 2009.
[1221] Guyslain Naves and Vincent Jost. The graphs with the max-Mader-flow-min-multiwaycut property. Preprint, 2010, http://arxiv.org/abs/1101.2061.
[1222] A. Rauzy. A sound semantics for dynamic fault trees. Unpublished yet., 2010.
[1223] A. Rauzy. Probabilistic risk assessment: Mathematical and algorithmic challenges. Notes
from the invited talk given at ESREL2012/PSAM11, to appear in ESRA NewsLetter, 2012.
[1224] Stamatina Thomaidou, Michalis Vazirgiannis, and Kyriakos Liakopoulos. Toward an
integrated framework for automated development and optimization of online advertising
campaigns. CoRR, abs/1208.1187, 2012.
[1225] Ariel Waserhole, Jean-Philippe Gayon, and Vincent Jost. Linear programming formulations for queueing control problems with action decomposability. Preprint, August 2012,
[1226] Ariel Waserhole and Vincent Jost. Vehicle Sharing System Pricing Regulation: A Fluid
Approximation. Preprint, 2012, http://hal.archives-ouvertes.fr/hal-00727041.
[1227] Ariel Waserhole and Vincent Jost. Vehicle Sharing System Pricing Regulation: Transit
Optimization of Intractable Queuing Network. Preprint, November 2012, http://hal.
archives-ouvertes.fr/hal-00751744.
[1228] Ariel Waserhole, Vincent Jost, and Nadia Brauner. Vehicle Sharing System Optimization:
Scenario-based approach. Preprint, August 2012, http://hal.archives-ouvertes.fr/
hal-00727040.
400
BIBLIOGRAPHY
X.7 Annexes : Sysmo
• Leo Liberti
– est membre du comité d’evaluation pour le European Doctoral Dissertation Award
(EDDA) (période 2013).
– est membre de la fondation COIN-OR (période 2012-).
– est vice president du département d’enseignement (période 2010-2012).
– est co-responsable de la Chaire Microsoft-CNRS “Optimisation et Dévéloppement
Durable” (période 2010-).
– est responsable d’équipe (System Modelling and Optimization — SYSMO) (période
2008-2011).
– est éditeur associé de Computational Management Science (période 2011-).
– est éditeur associé de EURO Journal of Computational Optimization (période 2012-).
– est éditeur en chef de 4OR (période 2010-).
– est membre du comité éditorial de Discrete Applied Mathematics (période 2010-).
• Daniel Krob
– est responsable de la chaire Ecole Polytechnique – ENSTA ParisTech – Telecom ParisTech – Dassault Aviation – DCNS – DGA – Thales “Ingénierie des systèmes complexes”
(période 2008-).
– est membre de l’advisory committee de la chaire “Optimisation et Développement
Durable ” Ecole Polytechnique-Microsoft (période 2009-).
– a été membre du groupe de travail 1 (Computational Models) d’Allistène (période
2010).
– a été membre – représentant l’Ecole Polytechnique – pendant deux ans du Comité de
Pilotage du réseau thématique de recherche avancée (RTRA) Digiteo (période 20102011).
– a été membre du comité international de normalisation ISO/TC 184/SC 5 – Study
Group to Explore OPM for Modeling Standards” dédié à la définition du standard
Object-Process Methodology (OPM) de modélisation systémique (période 2010-2011).
– est membre fondateur de l’association Omega Alpha (période 2008-).
– est président de l’association C.E.S.A.M.E.S. (Centre d’Excellence Sur l’Architecture,
le Management et l’Economie des Systèmes (période 2009-).
– a été vice-président pendant 4 ans du club “Systèmes complexes” de la Société de
l’Electricité, de l’Electronique et des Technologies de l’Information et de la Communication (SEE) (période 2010-2013).
• David Savourey est le représentant de l’École Polytechnique dans le bureau du Master
Parisien de Recherche Opérationnelle (période 2012-).
• Pierre Hansen
– est professeur titulaire à HEC Montréal (période 1991-).
– est titulaire de la Chaire d’exploitation des données de HEC Montréal (période 20042015).
401
CHAPTER X.7. ANNEXES : SYSMO
402
X.7.0.1
Optimality for Tough Combinatorial Hydro Valley Problems (2012-2013) (Type: Projet Programme Gaspard Monge pour l’Optimisation) Titre: Optimisation vallées Hydrauliqueshttp:
// www.lix.polytechnique.fr/ ˜ dambrosio/ PGMO.php.
Partenaires: LIX, EdF, Università di
Pisa, CNR (Italie), LIPN (Paris 13). Responsable: Claudia d’Ambrosio. Montant de la collaboration pour le LIX: 65.000 euros.
MINO (2012-2016) (Type: Marie-Curie ITN) Titre: Programmation mathématique nonlinéaire
mixte. Marie Curie Initial Training Network FP7 project. Complex decision-making in enterprises
should involve mathematical optimization methods, because a “best choice” has to be made out
of a huge number of feasible options. A mathematical description of such decision processes typically involves both “continuous” and “discrete” decisions. If the latter are present, the customary modeling approach is to use integer variables, which are also used to represent all possible
nonlinearities, so that the remaining part of the model is linear. Responsable: Leo Liberti.
MSR Thesis Grant (2012-2015) (Type: Microsoft Research PhD thesis award) Titre: Optimisation et simulation pour les smart buildings. Smart buildings integrate architecture, construction,
technology and energy systems; they make use of building automation, safety and telecommunication devices, and they are managed automatically or semi-automatically on the basis of local
information provided by a sensor network. The functioning of such a complex system necessarily depends on several tunable parameters, with respect to which the whole system can
optimized as concerns several objectives (cost, energy efficiency, ambience comfort and so on).
For any given parameter value, system performance can only be evaluated by a computationally
costly simulation procedure. The object of this Ph.D. thesis is to devise new methodologies for
optimizing smart building systems under such computational constraints.
Responsable: Leo
Liberti. Montant de la collaboration pour le LIX: 100.000 euros.
OSD (2009-2013) (Type: Chaire Microsoft pour le Dévéloppement Durable) Titre: The
Microsoft-CNRS chair for Optimization and Sustainable Development (OSD) is an X-chair based on
a contract involving three partners: Microsoft (MS), CNRS and X. The mission of the OSD chair is to
identify and perform research and teaching actions on topics concerning the application of optimization
techniques to real-world problems and issues involving sustainable development.
Responsable:
Leo Liberti. Montant de la collaboration pour le LIX: 540.000 euros.
DGA (2008-2009) (Type: Financement de la Direction Générale de l’Armement) Titre: Modélisation
de systèmes de systèmes.
Responsable: Daniel Krob. Montant de la collaboration pour le LIX:
50.000 euros.
DGA (2009-2010) (Type: Financement de la Direction Générale de l’Armement) Titre: Validation de systèmes de systèmes.
Responsable: Daniel Krob. Montant de la collaboration pour le
LIX: 80.000 euros.
X.7.0.2
Chip2Grid (2012-2015) (Type: Projet ADEME) Titre: Smart Grids. Un consortium d’industriels,
d’écoles et d’universitaires a été constitué afin de bâtir, ensemble, un projet démonstrateur
dénommé “Chip2Grid” dont l’objet principal est de concevoir, développer, installer et tester
l’ensemble des composants constituant une chaı̂ne de communication complète “full CPL G3”
des compteurs jusqu’aux postes sources d’ERDF et s’appuyant sur des ruptures technologiques
(système-sur-puce, coupleurs HTA et capteurs intégrés) offrant des performances supérieures à
l’état de l’art actuel (performances de communication) particulièrement pour le pilotage temps
réel des réseaux électriques intelligents. Tache de l’equipe LIX: le probleme de positionnement
403
des concentrateurs de reseau.
LIX: 200.000 euros.
Responsable: Leo Liberti. Montant de la collaboration pour le
Bip:Bip (2012-2017) (Type: Projet ANR) Titre: Bioinformatique. Bayesian inference paradigm:
Biology in processors. Our project is to promote an integrated use of known and modelled threedimensional structures of proteins as an aid in complete genome annotation. The architectural
organization of biological macromolecules is essential to understand and manipulate their function. Examples are highlighted everyday by powerful methods such as NMR spectroscopy and
X-ray crystallography at atomic resolution. The LIX workpackage will in particular develop two
complementary approaches to generate solutions for 3D structures. Where applicable, all solutions compatible with input data will be generated by branch and prune algorithms, which can
use Bayesian reasoning in a second phase to re-interprete the solutions. When this is not possible, Markov-Chain Monte Carlo methods will be used to generate highly probable solutions.
Partenaires: Lix et Institut Pasteur. Responsable: Leo Liberti. Montant de la collaboration pour
le LIX: 119.000 euros.
IFPen (2011-2014) (Type: Thèse) Titre: techniques MINLP boı̂te-noire appliqués aux problèmes
d’ingenierie des reservoirs. Optimisation non lineéaire mixte en variables entières et réeelles: application au problême de placement des puits en ingénierie de réservoir (contrat d’accompagnement
d’une these industrielle). Partenaires: Lix et IFPen. Responsable: Leo Liberti. Montant de la
collaboration pour le LIX: 30.000 euros.
Mediamobile (2009-2013) (Type: Thèse CIFRE) Titre: Calcul de plus courts chemins multimodaux sur des réseaux routiers dynamiques.
L’objectif du projet consiste à concevoir et à
comparer des algorithmes rapides de recherche de plus courts chemins multimodaux dans des
graphes structurés à dynamique aléatoire (contrat d’accompagnement d’une these CIFRE avec
Mediamobile). Partenaires: Lix et Mediamobile. Responsable: Leo Liberti. Montant de la
collaboration pour le LIX: 57.000 euros.
EWMINLP10 (2010) Titre: Support IBM et TOTAL au colloque. Workshop on Mixed-Integer Nonlinear Programs. Industrial sponsorship..
Responsable: Leo Liberti. Montant de la collaboration pour le LIX: 6000 euros.
ARM (2009-2012) (Type: Emergence Digiteo) Titre: Reformulations en programmation mathématiques.
Optimization problems are widespread in industrial as well as academic fields. Mathematical
programming is the language for expressing such problems formally. A given problem can be
formulated in several ways, which have different effects on the efficiency of the solution algorithms acting on the problem. So, given an optimization problem and a solution algorithm, there
is usually a “best” formulation by which to express the problem. Transforming formulations into
equivalent ones is the field of reformulations. In this project we study automatic reformulations
in three selected areas: embedding reformulations, reformulations and symmetry, and searching
the space of reformulations.
Responsable: Leo Liberti. Montant de la collaboration pour le
LIX: 109.000 euros.
CTW09 (2009) (Type: Support Digiteo) Titre: Conférence. Workshop on graph theory and combinatorics. Institutional support to the workshop organization.
Responsable: Leo Liberti. Montant
de la collaboration pour le LIX: 7500 euros.
RMNCCO (2009-2013) (Type: “Chaire Senior”) Titre: Reformulations en programmation mathématique.
Reformulation Methods In Non-Convex and Combinatorial Optimization. Senior Chair for Prof. Pierre
Hansen (HEC and GERAD, Montreal, Canada). In the proposed research we plan to study systematically reformulation between many classes of structured optimization problems such as
404
signomial geometric programming, polynomial programming, non-convex quadratic programming, bilevel programming, bilinear programming, concave programming, and programming on
the efficient set. Partenaires: Digiteo. Responsable: Leo Liberti. Montant de la collaboration
pour le LIX: 250.000 euros.
ASOPT (2008-2011) (Type: Projet ANR) Titre: Vérification logicielle.
ASOPT is a fundamental research project proposal, involving software development for experimental and dissemination purposes. The purpose of this project is to develop new abstract domains and new
resolution techniques to improve the quality of program analysis, especially for embedded control programs, and in the longer run, for numerical simulations programs.
Responsable: Leo
Liberti. Montant de la collaboration pour le LIX: 700.000 euros (5 partenaires).
PASO (2008-2010) (Type: Projet Digiteo Emergence) Titre: Vérification logicielle. La proposition PASO (Preuve, Analyse Statique et Optimisation) s’inscrit dans le thème 1 “Maitrise du
logiciel”, en se proposant de réunir cinqéquipes (CEA-LIST/MeASI, INRIA Saclay/Maxplus &
CMAP, INRIA Saclay/Typical & LIX, LIX/MeASI et Supelec/L2S) autour de l’analyse et la preuve
de propriétés numériques de programmes, issus en particulier de la modélisation de systèmes
complexes critiques pour la sécurité. L’objectif est d’initier et renforcer des collaborations entre les partenaires autour des interactions possibles entre preuve, analyse statique et optimisation, interactions jusqu’ici peu explorées. Il fédère ainsi 3 équipes d’informaticiens et 2 equipes
d’automaticiens. Responsable: Leo Liberti. Montant de la collaboration pour le LIX: 110.000
euros (4 partenaires).
FLUCTUAT (2008-2009) (Type: Projet Digiteo OMTE) Titre: Vérification logicielle.
Projet
de maturation technico-economique. FLUCTUAT est un analyseur statique de code source C par
interprétation abstraite, qui a été développé originellement par MeASI (CEA LIST), depuis environ 7 ans. FLUCTUAT intéresse dorénavant de nombreux industriels (Airbus, Dassault-Aviation,
Esterel etc.). FLUCTUAT est livré sur site, et utilisé, chez certains de ces industriels. Malgré tout,
FLUCTUAT reste un prototype pré-industriel, et demande encore un certain investissement afin
de pouvoir être transféré plus complètement (éditeur et industriels). Responsable: Leo Liberti.
Montant de la collaboration pour le LIX: 50.000 euros (2 partenaires).
Digiteo Visiting Professor (2008-2009) Titre: 6 mois de salaire pour Pierre Hansen (HEC Montreal, Canada). Auxiliaire au projet RMNCCO (voir plus haut)..
Responsable: Leo Liberti.
X Visiting Professor (2009) Titre: 2 mois de salaire pour Carlile Lavor (UniCamps, Brésil). Development of ideas about Distance Geometry in their applications to protein structure (see Bip:Bip project
above). Part I of a 5-months visit of Prof. Lavor to LIX. .
CNRS Visting Professor (2009) Titre: 3 mois de salaire pour Carlile Lavor (UniCamps, Brésil).
Development of ideas about Distance Geometry in their applications to protein structure (see Bip:Bip
project above). Part II of a 5-months visit of Prof. Lavor to LIX..
X.7.0.3
MINO (2012-2016) (Type: Marie Curie Initial Training Network (EU project)http://www.cost.
eu/domains_actions/ict/Actions/TD1207) Titre: Mixed Integer Nonlinear Optimizationhttp:
// www.mino-itn.unibo.it/ .
Responsable: Andrea Lodi (U. Bologna, Italie). Montant de la
collaboration pour le LIX: roughly 274.000 euros (on a total of 3439077 euros).
X.7.1. ADMINISTRATION DE LA RECHERCHE
405
EU COST Action TD1207 (2013-2017) (Type: EU COST Actionhttp://www.cost.eu/domains_
actions/ict/Actions/TD1207) Titre: Mathematical Optimization in the Decision Support Systems
for Efficient and Robust Energy Networks.
Partenaires: Participating countries AT, BE, CH, CY,
CZ, DE, DK, EE, EL, ES, FR, HU, IE, IL, IR, IT, LT, NL, NO, PT, RS, SI, SK, SE, TR, UK. Responsable: Andrea Lodi (U. Bologna, Italie). Montant de la collaboration pour le LIX: 0 euros (all
money managed by ICOOR).
Projet MORPHEX (2007-2010) (Type: Thème Optimisation et modélisation) Titre: Projet
européen “Morphogenesis and gene regulatory networks in plants and animals: a complex systems
modelling approach”.
Partenaires: Programme “New and Emerging Science and Technology”
(NEST). Responsable: Daniel Krob. Montant de la collaboration pour le LIX: 205.000 euros.
X.7.0.4
ATOMIC (2013-2015) (Type: ANR jcjc) Titre: Air Traffic Optimization via Mixed-Integer Computationhttp:// atomic.recherche.enac.fr/ .
Partenaires: ENAC, LIX, ENSEEIHT-IRIT
(Toulouse). Responsable: Sonia Cafieri (ENAC). Montant de la collaboration pour le LIX: 0
euros (all 189613 euros managed by ENAC).
Projet ModRival (2006-2008) (Type: Thème MoDriVal du projet Usine Logicielle) Titre: Nouveaux modèles pour les systèmes complexes. Partenaires: LIX et pôle de compétitivité System@tic.
Responsable: Daniel Krob. Montant de la collaboration pour le LIX: 120.000 euros.
X.7.0.5
Convention Cifre (2006-2009) Titre: Thèse de G. Nannicini.
Partenaires: Convention avec
Mediamobile. Responsable: Daniel Krob. Montant de la collaboration pour le LIX: 45.000
euros.
Convention Cifre (2010-2012) Titre: Thèse de A. Douffène.
Partenaires: Convention avec
Renault. Responsable: Daniel Krob. Montant de la collaboration pour le LIX: 45.000 euros.
Convention Cifre (2010-2012) Titre: Thèse de J. Berrebi. Partenaires: Convention avec EADS
Innovation Works. Responsable: Daniel Krob. Montant de la collaboration pour le LIX: 45.000
euros.
Contrat MINEFI - IGPDE (2009-2011) Titre: Formation professionnelle continue.
Partenaires: Conception, déploiement et animation d’une formation à l’urbanisation des systèmes
d’information. Responsable: Daniel Krob. Montant de la collaboration pour le LIX: 400.000
euros.
Chaire “Ingénierie des systèmes complexes” (2003-2015) Titre: Convention de mécenat. Partenaires: Développement des activités d’enseignement et de recherche en ingénierie systèmehttp:
//www.enseignement.polytechnique.fr/informatique/chaire-systemes-complexes/. Responsable: Daniel Krob. Montant de la collaboration pour le LIX: 1.000.000 euros.
X.7.1
X.7.1.1
• Computational Management Science (Springer) Leo Liberti (2011-). Voir .
406
• EURO Journal of Computational Optimization (Springer) Leo Liberti (2012-). Voir .
• 4OR (Springer) Leo Liberti (2010-). Voir .
• Discrete Applied Mathematics (Elsevier) Leo Liberti (2010-). Voir .
• International Transactions in Operational Research (Wiley) Leo Liberti (2007-). Voir .
• Journal of Global Optimization (Springer) Leo Liberti (2006-). Voir .
• Journal of Systems and Software Engineering (Systems Engineering) Daniel Krob (2009). Voir --.
• Discrete Mathematics and Theoretical Computer Science (DMTCS) Daniel Krob (2001-).
Voir www.dmtcs.org.
• Intelligent Data Analysis, An International Journal (IOS Press) Michalis Vazirgiannis
(2002-). Voir http://www.iospress.nl/journal/intelligent-data-analysis/.
• Machine Learning (Springer) Michalis Vazirgiannis (2011). Voir http://www.springer.
com/computer/ai/journal/10994.
• Data Mining and Knowledge Discovery (Springer) Michalis Vazirgiannis (2011). Voir
http://www.springer.com/computer/database+management+%26+information+retrieval/
journal/10618.
• the open operational research journal (Betham Science) Pierre Hansen (2008-). Voir www.
benthamscience.com/open/toorj/index.htm.
• journal of classification (Springer) Pierre Hansen (2008-). Voir http://link.springer.
com/journal/357.
• top (Springer) Pierre Hansen (2007-). Voir http://link.springer.com/journal/11750.
• applicable analysis and discrete mathematics (University of Belgrade and Academic
Mind) Pierre Hansen (2007-2013). Voir http://pefmath.etf.rs/.
• computer science and information systems (ComSIS consortium) Pierre Hansen (2005-).
Voir www.comsis.org.
• ejor, european journal of operational research (Elsevier) Pierre Hansen (1999-2010). Voir
www.journals.elsevier.com/european-journal-of-operational-research/.
• international game theory review (Worls Scientific) Pierre Hansen (1998-). Voir www.
worldscientific.com/worldscinet/igtr.
• journal of heuristics (Springer) Pierre Hansen (1995-). Voir http://link.springer.com/
journal/10732.
• yujor, yugoslav journal of operations research (–) Pierre Hansen (1991-). Voir www.yujor.
fon.bg.ac.rs/index.php/journal.
• rairo, recherche opérationnelle (Cambridge university Press) Pierre Hansen (1991-). Voir
.
• annals of operations research (Springer) Pierre Hansen (1984-). Voir http://link.springer.
com/journal/10479.
• discrete applied mathematics (Elsevier) Pierre Hansen (1979-). Voir http://www.journals.
elsevier.com/discrete-applied-mathematics/.
407
• Discrete Applied Mathematics (Reformulation techniques in Mathematical Programming) Leo Liberti avec Nelson Maculan
X.7.1.2
Présidence de comités de pilotage
• CSDM (Complex Systems Design and Management) (2009-). Daniel Krob.
• DEDM (Digital Enterprise Design and Management) (2012-). Daniel Krob.
• CWMINLP (COST Workshop on Mixed Integer Non Linear Programming) (2013). Claudia D’Ambrosio.
• EURO-INFORMS (Mixed-Integer Non Linear Programming stream at EURO-INFORMS
conference) (2013). Claudia D’Ambrosio.
• MIP (Mixed Integer Programming workshop) (2012). Claudia D’Ambrosio.
• EURO (Mixed-Integer Non Linear Programming stream at EURO conference) (2012).
Claudia D’Ambrosio.
• CTW (Cologne-Twente Workshop on Graphs and Combinatorial Optimization) (2008-).
Leo Liberti.
• SdS (Ecoles d’été “Systèmes de systèmes” de la Direction Générale de l’Armement (DGA))
(2007-). Daniel Krob.
• ECML PKDD (Steering Committee of the European Conference on Machine Learning
and Principles and Practice of Knowledge Discovery in Databases ) (2011-14). Michalis
Vazirgiannis.
• ATMOS 2012 (12th Workshop on Algorithmic Approaches for Transportation Modelling,
Optimization, and Systems) (2012). Leo Liberti.
• COGIS 2009 (COgnitive systems with Interactive Sensors 2009) (2009). Daniel Krob.
• ECMLPKDD (The 10th European Conference on Machine Learning and Principles and
Practice of Knowledge Discovery in Databases (ECML PKDD)) (2011). Michalis Vazirgiannis.
• EURO XXVIII (EURO Mini Conference XXVIII on Variable Neighbourhood Search)
(2012). Pierre Hansen.
• GOW (Global Optimization Workshop 2012) (2012). Pierre Hansen.
• SEA (Symposium on Experimental Algorithms) (2013). Leo Liberti.
• ESA (European Symposium on Algorithms) (2013). Leo Liberti.
• SEA (Symposium on Experimental Algorithms) (2012). Leo Liberti.
408
• MECVNS (Mini Euro Conference on Variable Neighbourhood Search) (2012). Leo Liberti.
• (MatHeuristics) (2012). Leo Liberti.
• ICORES (International Conference on Operational Research and Entreprise Systems)
(2012). Leo Liberti.
• ESCAPE (European Symposium on Computer Aided Process Engineering) (2012). Leo
Liberti.
• (MatHeuristics) (2010). Leo Liberti.
• TOGO (Colloque international sur l’optimisation globale) (2010). Leo Liberti.
• (Comité de programme de Digiteo) (2008-2009). Leo Liberti.
• UML-AADL (6-ième workshop IEEE UML and AADL 2011, Las Vegas, USA) (2011).
Daniel Krob.
• ICECCS 2011 (16-ième conférence IEEE “International Conference on Engineering of
Complex Computer Systems” (ICECCS 2011), Las Vegas, USA) (2011). Daniel Krob.
• KDD (19th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD))
(2013). Michalis Vazirgiannis.
• WWW (22nd International World Wide Web Conference (WWW) - Web Search Track)
• WWW (22nd International World Wide Web Conference (WWW) - Web Mining Track)
• ASONAM (The 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)) (2013). Michalis Vazirgiannis.
• WWW (21st International World Wide Web Conference (WWW) - Web Mining Track)
• ASONAM (The 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)) (2012). Michalis Vazirgiannis.
• SDM (SIAM International Conference on Data Mining (SDM)) (2012). Michalis Vazirgiannis.
• ICDE (IEEE International Conference on Data Engineering (ICDE)- Data Mining and
Knowledge Discovery Area Chair) (2012). Michalis Vazirgiannis.
• ICDE (IEEE International Conference on Data Engineering (ICDE)- Data Mining and
Knowledge Discovery Area Chair) (2011). Michalis Vazirgiannis.
• WWW (21st International World Wide Web Conference (WWW) ) (2010). Michalis
Vazirgiannis.
• WSDM (Third ACM International Conference on Web Search and Data Mining, New
York, USA ) (2010). Michalis Vazirgiannis.
• EDBT (13th International Conference on Extending Database Technology ) (2010). Michalis
Vazirgiannis.
X.7.1.3
409
• MATHEU (Third Matheuristics 2010) (2010). Pierre Hansen.
• MATHEU (Second Matheuristics 2008) (2008). Pierre Hansen.
• EXDO (École d’été 2008 sur les progrès de l’exploitation de données) (2008). Pierre
Hansen.
• CWMINLP (COST Workshop on Mixed Integer Non Linear Programming) (2013). Leo
Liberti.
• (Exploiting Symmetry in Optimization) (2010). Leo Liberti.
• HybridNL (satellite de CPAIOR) (2010). Leo Liberti.
• EWMINLP () (2010). Leo Liberti.
• CTW (Cologne-Twente Workshop on Graphs and Combinatorial Optimization) (2009).
Leo Liberti.
• BR-OPT (satellite de CPAIOR) (2009). Leo Liberti.
• CSDM 2010 (Complex Systems Design and Management 2010) (2010). Daniel Krob.
• ICECCS 2012 (Dix-septième conférence IEEE “International Conference on Complex
Computer Systems (ICECCS 2012)”, Ecole Normale Supérieure) (2012). Daniel Krob.
• DEDM 2013 (Complex Systems Design and Management 2013) (2013). Daniel Krob.
• DSBDE (Data Science in the Big Data Era Workshop, Paris) (2013). Michalis Vazirgiannis.
• Digiteo Web Mining (Digiteo Workshop on Web Mining, Paris) (2011). Michalis Vazirgiannis.
• Organization of the workshop Pretty Structures 2011 (IHP, Paris, May 2011, with J. Edmonds)
• é (période p). riode 2011). Conf2010Organisation de la sixième journée Optimeo (Paris,
mars 2010)
• Comité d’organisation de la conférence internationale CSDM 2010
• é (période p). riode 2010). Conf2008Organisation de la première journée “Optimeo 2008”
410
X.7.1.4
Au niveau national
• DGA (2005-2011) Daniel Krob. Président du Comité d’évaluation de l’activité “Architecture et évaluation des systèmes de systèmes” de la Direction Générale de l’Armement.
• ONERA (2008-2013) Daniel Krob. Président du Comité d’évaluation et d’orientation du
département “Traitement de l’information et modélisation” de l’ONERA.
• SystemX (2013-) Daniel Krob. Membre du Comité de Programme “Systèmes de systèmes”
– Institut de Recherche Technologique SystemX.
• Université de Rennes (Leo Liberti) 2011
• Université de Paris UMPC (Leo Liberti) 2007-2010
• Université de Paris Sud (Leo Liberti) 2007-2008
• Département d’informatique de l’Ecole Polytechnique (Daniel Krob) 2001• Ecole Centrale de Paris - 27-ième section (Daniel Krob) 2011
• Département d’informatique de l’Ecole Polytechnique (David Savourey) 2011-
X.7.2
X.7.2.1
• G. Nannicini (2009). Point-to-point shortest paths on dynamic time-dependent road networks. Encadrant: Leo Liberti et Daniel Krob.
• A. Costa (2012). Applications of reformulations in mathematical programming. Encadrant: Leo Liberti.
• F. Roda (2013). Integrating high-level requirements in optimization problems: theory and
applications. Encadrant: Leo Liberti.
• J. Berrebi (21 Février 2013). Contribution à l’intégration d’une liaison avionique sans fil
– L’ingénierie système appliquée à une problématique industrielle. Encadrant: Daniel
Krob.
• A. Douffène (5 Mars 2013). Architecture des systèmes complexes et optimisation – Application aux véhicules électriques. Encadrant: Daniel Krob.
• B. Golden (Mai 2013). A unified formalism for complex systems architecture. Encadrant:
Daniel Krob.
• E. Winter (20 Octobre 2008). Des outils d’optimisation combinatoire et d’ordonnancement
pour la gestion des radars embarqués. Encadrant: Philippe Baptiste.
X.7.2. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION
X.7.2.2
411
Rapports de thèse
• Pete Janes (Juillet 2012). Australian National University. Rapporteur: Leo Liberti.
• Mohammed Alfaki (Juin 2012). Bergen University. Rapporteur: Leo Liberti.
• C.B. Ould El Mounir (Septembre 2008). Extensions premières et optimisation des graphes
décomposables. Université d’Amiens. Rapporteur: Daniel Krob.
• Alexandre Borghi (Octobre 2011). Thèse d’Université. Rapporteur: Université Paris Sud
11. Daniel Krob
X.7.2.3
• Programmation Mathématique Avancée (PMA) au Master Parisien de Recherche Opérationnelle
(MPRO)
• Programmation Mathématique Avancée. Donné a l’MPRO, CNAM. 15 étudiants. Amphis:
8h. Niveau: M2.
• Recherche Operationnelle et Développement Durable. Donné a l’MPRO, CNAM. 15
étudiants. Amphis: 8h. Niveau: M2.
• Ordonnancement, programmation linéaire et problèmes de flots. Donné à l’Université
Paris VI pour le Master Parisien en Recherche Informatique (MPRI), 2 fois, avec C. Dürr et
Ph. Baptiste. 35 étudiants. Amphis: 8 heures. Niveau: M2.
• Année 2008/2009 :
– Introduction aux systèmes industriels complexes, Master “Ingénierie des systèmes industriels complexes”, Ecole Polytechnique, INSTN, Université Paris Sud
– Eléments d’architecture logicielle, Cycle C, Conservatoire National des Arts et Métiers
• Année 2009/2010 :
– Introduction aux systèmes industriels complexes, Master “Conception et management
des systèmes informatiques complexes”, Ecole Centrale de Paris, Ecole Polytechnique,
Ecole Supérieure d’Electricité, INSTN, Télécoms Paristech, Université Paris Sud
• Année 2010/2011 :
– Eléments d’architecture des systèmes complexes, Master “Conception et management des
systèmes informatiques complexes”, Ecole Centrale de Paris, Ecole Polytechnique,
• Année 2011/2012 :
412
x
• Année 2012/2013 :
• Machine Learning for Bigdata URL: http://moodle.lix.polytechnique.fr/moodle/course/view.php?id=2
• MPRI, Optimisation, 2009-2011
• MPRO, Graphes, 2011-2013
• MPRO, Initiation a la recherche, 2011-2013
• MPRO (Master Parisien de Recherche Opérationnelle) : Bases de l’Ordonnancement, 2012,2013
• MPRO (Master Parisien de Recherche Opérationnelle) : Programmation Par Contraintes,
2012,2013
Jury
• Septembre 2009: Membre du jury pour la thèse de Doctorat de Makhlouf Hadji (Telecom
SudParis et Paris 6).
• Octobre 2008: Membre du jury pour la thèse de Doctorat de Ronald Zumkeller (École
Polytechnique).
• Octobre 2008: Membre du jury pour la thèse de Doctorat de Cheikh Brahim Ould El
Mounir (Université d’Amiens).
• C.B. Ould El Mounir, Thèse d’Université, Extensions premières et optimisation des graphes
décomposables, Université d’Amiens, Septembre 2008 (Rapporteur)
• A. Chapoutot, Thèse d’Université, Simulation abstraite :une analyse statique de modèles Simulink,
Ecole Polytechnique, Décembre 2008
• G. Nannicini, Thèse d’Université, Calcul des chemins les plus rapides dans des réseaux structurés à dynamique aléatoire: une application aux réseaux routiers, Ecole Polytechnique, Juin
2009 (Directeur)
• N. Ayache, Thèse d’Université, Vérification formelle, compositionnelle et automatique de systèmes
de composants, Université Paris Sud, Janvier 2010
• S. Peyronnet, Habilitation à diriger des recherches, Université Paris Sud, Décembre 2010
(Président)
• M. Mabrouki, Thèse d’Université, Étude de la préservation des propriétés temporelles des réseaux
de régulation génétique au travers du plongement : vers une caractérisation des systèmes complexes par l’émergence de propriétés, Université d’Evry Val d’Essonne, Décembre 2010
• Alexandre Borghi, Thèse d’Université, Université Paris Sud, Octobre 2011 (Rapporteur)
• Bilal Kanso, Thèse d’Université, Modélisation et validation des systèmes à base d’états, Ecole
Centrale de Paris, Novembre 2011
X.7.3. AUTRES ÉLÉMENTS DE VISIBILITÉ
413
• Urbanisation des systèmes d’information et alignement stratégique, Tutoriel 2.1, conférence
invitée, Ecole des Systèmes de systèmes, DGA, Paris, Avril 2008
• Architecture système et réduction de la complexité, conférence invitée, Ingénierie des Grands
Projets et Systèmes Complexes, 3-ième édition, Arcachon, Juin 2008
• Elements of complex systems architecture, conférence invitée, Genetic Regulatory Networks
and other Complex Systems, GENNETEC Training Course, Paris, Janvier 2009
• A short presentation of the Ecole Polytechnique chair ‘èngineering of Complex Systems”, conférence
invitée, 2-ième “International Engineering Systems Symposium”, MIT, Cambridge (USA),
Juin 2009
• Systemic Modelling, conférence invitée, special session on Combinatorics, Physics and Complexity, 3rd International Conference on Complex Systems and Applications, ICCSA 2009,
Le Havre, Juin 2009
• Comment transformer efficacement l’organisation et le système d’information grâce à l’architecture
d’entreprise ?, conférence invitée, “Après 10 ans d’urbanisation, l’architecture d’entreprise”,
Marcus Evans Conferences, Paris, Avril 2010
• Architectures modulaires : mythe ou réalité ?, conférence invitée, Conférence ”Ingénierie des
Grands Projets et Systèmes Complexes”, 6-ième édition, Arcachon, Juin 2011
• Elements of requirements engineering, conférence invitée, 3rd International Workshop on
Model Based Safety Assessment, Versailles, Mars 2013
• Tutorial in the WWW 2013 conference - Rio de Janeiro, ”Advanced graph mining for community evaluation in social networks”
• Tutorial in the ACM International Conference on Web Search and Data Mining - WSDM
2013 - Rome - Italy, ”Advanced graph mining for community evaluation in social networks
and the Web” ( link )
• Invited Tutorial in the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining ASONAM 2012 26-29 August, 2012, Turkey - entitled ”Advanced graph mining & community evaluation metrics for social networks and the Web”
• M. Vazirgiannis ”Web Mining - a Predictive approach” , invited Tutorial in the ”‘Brazilian
Data Base Symposium”’, October 2010
Vulgarisation
• Animation d’activités de vulgarisation à l’architecture des systèmes au sein de l’association
CESAMES
X.7.3
X.7.3.1
Invitations
• Singapore University of Technology and Design, Singapore (2013). Claudia D’Ambrosio
a été invité a tenir un seminaire. .
• EDF R&D, Clamart (2012). Claudia D’Ambrosio a été invité a tenir un seminaire. .
• PGMO Seminars, Palaiseau (2012). Claudia D’Ambrosio a été invité a tenir un seminaire.
.
414
• Technische Universität Dortmund, Germany (2012). Claudia D’Ambrosio a été invité a
tenir un seminaire. .
• LIF, Marseille (2012). Claudia D’Ambrosio a été invité a tenir un seminaire. .
• GYSS 2013 (2013). Claudia D’Ambrosio a été invité au GLOBAL YOUNG SCIENTISTS
SUMMIT 2013 (GYSS), Singapour.
• DGA13 (Juin 2013). Leo Liberti a été invité à donner une conférence plénière.
• GOW12 (Juin 2012). Leo Liberti a été invité à donner une conférence plénière.
• GSC12 (Juin 2012). Leo Liberti a été invité à donner une conférence plénière.
• LION6 (Janvier 2012). Leo Liberti a été invité à donner une conférence plénière.
• BALCOR11 (Septembre 2011). Leo Liberti a été invité à donner une conférence plénière.
• HybridNL11 (Mai 2011). Leo Liberti a été invité à donner une conférence plénière.
• ORBEL10 (Février 2011). Leo Liberti a été invité à donner une conférence plénière.
• JFRO10 (Mars 2010). Leo Liberti a été invité à donner une conférence plénière.
• SOBRAPO09 (Septembre 2009). Leo Liberti a été invité à donner une conférence plénière.
• IFI09 (Juillet 2009). Leo Liberti a été invité à donner une conférence plénière.
• JPOC06 (Juin 2009). Leo Liberti a été invité à donner une conférence plénière.
• PGMO (Septembre 2012). Leo Liberti a été orateur invité.
• MIP11 (Juin 2011). Leo Liberti a été orateur invité.
• Pretty Structures 2011 (Mai 2011). Leo Liberti a été orateur invité.
• AUSSOIS11 (Janvier 2011). Leo Liberti a été orateur invité.
• ewMINLP (Décembre 2010). Leo Liberti a été orateur invité.
• AUSSOIS10 (Janvier 2010). Leo Liberti a été orateur invité.
• CIMINLP (Mars 2009). Leo Liberti a été orateur invité.
• DIIGA, Università Politecnica delle Marche (2012). Leo Liberti a donné un séminaire.
• Comp. Sci. Dept., IIT Delhi (2012). Leo Liberti a donné un séminaire.
• LIPN6, Université Paris XIII (2011). Leo Liberti a donné un séminaire.
• COPPE, Universidade Federal do Rio de Janeiro; et IMECC, Universidade Estadual de
Campinas (2011). Leo Liberti a été invité un mois et a donné deux séminaires.
• CERFACS, Toulouse (2010). Leo Liberti a donné un séminaire.
• Tepper School of Business, Carnegie-Mellon University (2009). Leo Liberti a donné un
séminaire.
• Chemical Engineering, Carnegie-Mellon University (2009). Leo Liberti a donné un séminaire.
• T.J. Watson IBM Research Center, Yorktown Heights (2008). Leo Liberti a donné un
séminaire.
• Google EMEA faculty summiti (2011). Mihalis Vazirgiannis a été invité. .
X.7.3. AUTRES ÉLÉMENTS DE VISIBILITÉ
415
• Google EMEA faculty summiti (2012). Mihalis Vazirgiannis a été invité. .
• TOGO10 Global Optimization (2010). Pierre Hansen a été conférencier pléniers lors du
congrès.
• International Conference on Mathematical Chemistry (2010). Pierre Hansen a été conférencier
pléniers lors du congrès.
• EURO XXVI Lisbon (2010). Pierre Hansen a été conférencier pléniers lors du congrès.
• Journée sur la théorie des graphes (2010). Pierre Hansen a été conférencier pléniers lors
du congrès.
• Journée sur la théorie des graphes (2009). Pierre Hansen a présenté la conférence inaugurale lors du congrès.
• SIMOPSYS08 (2008). Pierre Hansen a été conférencier pléniers lors du congrès.
• Stochastic and Global Optimization (2008). Pierre Hansen a été conférencier pléniers lors
du congrès.
• Palaiseau, France (octobre 2008–mars 2009, novembre 2009, mai–juin 2010, mai–août 2011,
septembre–novembre 2012). Pierre Hansen a été invité par École Polytechnique..
• Londres, Angleterre (2008). Pierre Hansen a été invité 1 mois par Brunel University..
X.7.3.2
• Certificat d’excellence au 10th DIMACS Implementation Challenge – Graph Partitioning
and Graph Clustering, Pierre Hansen, 2012.
• Colloque international, TOGO2010, Toulouse Global Optimization 2010, organisé à l’occasion
de mon 70e anniversaire, Pierre Hansen, 2010.
• Prix de recherche Pierre-Laurin, HEC Montréal,Pierre Hansen,2010.
• Prix Jacques-Rousseau de l’ACFAS (Association francophone pour le savoir), Pierre Hansen,
2008.
• 2ème position dans la section “Modularity Clustering Quality Challenge” du 10ème DIMACS Implementation Challenge 2012.
• 2ème prix “Robert Faure” 2009 de la ROADEF (prix tri-annuel de la société Française de
recherche operationelle).
• Prix “meilleur poster” à Digiteo Annual Forum 2008.
• Digiteo Chair grant (2010-2013) - LEVETONE
• Google Phd Scholarship for his student F. Malliaros (2012-2015)
• Vincent Jost et David Savourey ont remporté le challenge ROADEF-EURO-EDF dans la
catégorie Senior, 2010
SYSMOSysmo
416
XI Équipe Typical (Typical)
417
XI.1 Liste des membres : Typical
XI.1.1
XI.1.1.1
Membres permanents
Nom
Bruno Barras
Ian Mackie
Jean-Marc Notin
Benjamin Werner
Valérie Lecomte
XI.1.1.2
Fonction
CR
CR
IR
Professeur
Assistant
Employeur
INRIA
CNRS
CNRS
INRIA
HDR
Arrivée
Oui
1994
2005
Oui
2010
Doctorants
Nom
Alexis Bernadet
Victor Magron
Financement
Allocation couplée ENS Cachan
FORMATH
XI.1.2
Anciens membres
XI.1.2.1
Membres permanents
Nom
Gilles Dowek
Germain Faure
Hugo Herbelin
Assia Mahboubi
Enrico Tassi
Fonction
Professeur
CR
CR
CR
CR
Employeur
INRIA
INRIA
INRIA
INRIA
419
Arrivée
2010
Oct. 2010
HDR
Oui
Oui
Encadrant
Stéphane Graham-Lengrand
B. Werner
Départ
Oct. 2010
Aug. 2011
Dec. 2008
Jun. 2012
Jun. 2012
Position actuelle
DR INRIA, équipe Deducteam
Professeur des écoles
DR INRIA, équipe πr 2
CR INRIA, équipe SpecFun
CHAPTER XI.1. LISTE DES MEMBRES : TYPICAL
420
XI.1.2.2
Doctorants
Nom
Lisa Allali
Départ
Sep. 2009
Encadrant
G. Dowek
Bruno Bernardo
Éric Biagoli
Mathieu Boespflug
Cyril Cohen
Financement
Région Îlede-France
DGA
INRIA
AMN
AMN
2012
Sep. 2010
Jan. 2011
Oct. 2012
Denis Cousineau
François Garillot
MENRT
INRIA
2009
2011
B. Barras
B. Werner
G. Dowek
A. Mahboubi B. Werner
G. Dowek
B. Werner
Danko Ilik
Monge
Dec. 2008
H. Herbelin
Chantal Keller
Sylvain Lebresne
ENS Lyon
MENRT
Jun. 2013
Dec. 2008
B. Werner
H. Herbelin
Vincent Silès
Élie Soubiran
AMN
Dec. 2008
Dec. 2008
H. Herbelin
H. Herbelin
Arnaud Spiwack
Pierre-Yves Strub
Roland Zumkeller
AMN
EADS
MESR
Mar. 2011
Sep. 2008
Oct. 2008
B. Werner
J.-P. Jouannaud
B. Werner
Position actuelle
Web development Company,
Berlin
Trusted Lab, France
Postdoc à McGill University
Postdoc, Göteborg
Prove and Run, France
Software Engineer, Typesafe,
Switzerland
Researcher,
Macedonian
Academy of Sciences
Engineer,
DataStax,
Besançon
Prove and Run, France
R&D
Engineer,
Alstom Transport
Postdoc, ENS
IMDEA, Madrid
Knight Capital Group
Postdoctorants
Nom
Benoı̂t Valiron
Enrico Tassi
XI.1.2.3
Financement
ANR Paral-ITP
Dates
2009
2011
Responsable
G. Dowek
A. Mahboubi
Position actuelle
Postdoc à l’INRIA Paris-Rocquencourt
Autres membres
Stagiaires Master 2
Nom
Mathias Puech
Éric Biagoli
Cyril Cohen
Chantal Keller
Maxime Dénès
Aloı̈s Brunel
Financement
Dates
2008
2009
2009
2009
2010
2010
Responsable
H. Herbelin
B. Werner
A. Mahboubi
B. Werner
G. Dowek
G. Dowek
Position actuelle
ATER à l’Université Paris Diderot
Postdoc, Göteborg
PhD student
Thèse à l’INRIA Sophia-Antipolis
Thèse au LIPN
Nom
Jianhua Gao
Qian Wang
Financement
Institute of Software, Science Academy of China
Tsinghua University
Dates
2010
Jan. 2011 to Oct. 2012
Invitant
G. Dowek
B. Barras
XI.1.2. ANCIENS MEMBRES
421
Autres
Nom
Vincent Gross
Fonction
Ingénieur
Financement
INRIA
Dates
2008
422
CHAPTER XI.1. LISTE DES MEMBRES : TYPICAL
XI.2 Rapport scientifique : Typical
XI.2.1
XI.2.1.1
Current Context
The team in its present form is clearly in a restructuring state. It is a descendant of Gérard Huet’s
INRIA Coq team. During the evaluation period, the following changes occured :
• In 2009, Hugo Herbelin moved to Paris 7 to create the INRIA PiR2 team with Pierre-Louis
Curien. This team focuses on the development of Coq, and the semantic aspects of the
Curry-Howard isomorphism.
• In 2010, Gilles Dowek left Polytechnique and the team. He was the driving force in the
study and implementation of deduction modulo.
• In 2009, Benjamin Werner was appointed as head of the Computer Science Department
of Ecole Polytechnique. He headed the department and the team in parallel for a while,
but asked to be discharged of the INRIA team direction in 2012; the INRIA team was thus
terminated end of 2013. It still exists as a LIX team though.
• Following this, Assia Mahboubi created a new INRIA team with Frédéric Chyzak, named
SpecFunc, focusing on formally certified Computer Algebra. This team is located in the
same building as LIX, but currently not part of LIX. One can image that it (re-)joins LIX at
some future point though.
• Bruno Barras has completed the writing of his HDR and discussions start about him leading
a new (LIX+INRIA) team.
In spite of all this, there is, we believe, a coherent scientific project underlying the work done
during this time, which we try to present in this document.
Note also that during the evaluation period, two young researchers were hired as INRIA
Chargés de Recherche at Typical (Germain Faure and Enrico Tassi), Assia Mahboubi having been
hired in 2007.
XI.2.1.2
Introduction
The use of computing power has dramatically increased for the past decades, in all fields of human activity, including most branches of sciences, causing a general need for reliable computing.
It also often lies the bases for new interdisciplinary interactions.
On one hand, Mathematics is among the many human activities that have been transformed
by the invention of the computer. Mathematicians can use the computer as a tool to carry out
operations that were too long to be executed by hand. Like the use of the telescope in astronomy,
the use of the computer opened many new prospects in mathematics.
One of these prospects is the use of proof assistants to mechanically check the correctness of a
mathematical proof.
This participates in the quest for a new step in mathematical rigor: the point where nothing
is understated or left ambiguous, and where the reader can therefore be replaced by a program.
This quest for rigor is specially important for the large proofs, either hand written or computer
aided, that mathematicians have built since the middle of the 20th century. For instance, without
using a proof assistant, it is quite difficult to establish the correctness of a proof which involves
symbolic computations on polynomials formed by hundreds of monomials, or a case analysis
requiring the inspection of several hundreds of cases, or establishing that a complex object such
as a long program or a complex digital circuit verifies a given property.
423
CHAPTER XI.2. RAPPORT SCIENTIFIQUE : TYPICAL
424
On the other hand, the ubiquitousness of more and more complex software, whose correctness and safety rely on more and more complex abstract arguments gives a new importance to
being able to assert such properties with an (almost) total certainty.
We thus say that there is more software in mathematics, but also more mathematics in software. Furthermore these two developments go hand in hand and enrich each other.
The main effort of the Typical team is to contribute to this progress through the development
of proof assistants. In particular, our team participates to the development of various aspects of
the Coq system. Coq is a processor of mathematical proofs allowing an interactive development
of specifications and proofs. It is used in hundreds of sites, and has demanding users in the
academic world and in industry.
We believe that the development of a proof assistant cannot be accomplished without a joint
reflection about the structure of mathematical proofs and about the use of proof assistants in
various applicative domains. We also believe that proof assistants should take benefit of the use
of automated deduction tools. Thus, the questions addressed in the team range from questions
related to the Coq system, such as “What will be the features of the next version of Coq?”, to
more theoretical questions of logic, such as “What is a proof?” and more applied ones, such as
“How can I delegate part of the proof search to automated tools?” or “How can we use a proof
assistant to check whether a protocol is free of deadlocks?”.
Computation and deduction
The proof system Coq is the result of a continuous implementation effort of more than 25 years
by teams from french institutions (INRIA, CNRS, Polytechnique, universities/dots). It is worth
noting that this implementation was, from the start on, built on a (then) new logical formalism
which had been itself invented for facilitating the construction and checking of formal proofs
(the Calculus of Constructions).
One important feature of the Calculus of Constructions is that it also includes a functional
programming language. Furthermore, the formalism of Coq evolved in parallel with the implementation, and these additional features generally meant making the embedded programming
language more powerful: addition of inductive and later co-inductive types, or more refined
elimination schemes (aka. pattern-matchings).
The fact that the formalism is computational means that functions are primitively defined as
actually executable programs (thus intentionally); this is not the common set-theoretical practice
where they are defined as relational graphs (thus extensionally). The now paradigmatical example
is the proof of 2+2 = 4. Since addition is a program, 2+2 can be evaluated to 4. Thus, in turn, the
proposition 2 + 2 = 4 evaluates to the proposition 4 = 4, and these two propositions are logically
identified. This means that 2 + 2 = 4 can be proved by one single deduction step, namely the
principle of reflexivity.
The research activity of TypiCal is centered on studying and exploiting this interaction between computation and deduction in order to improve the means to build, automatize and check
formal proofs. It should be mentioned that this is generally not done by focusing on the CurryHoward isomorphism.
XI.2.1.3
Logical formalisms A proof system implements a logical formalism in the way a compiler implements a programming language. Similarly, the choice of the formalism is crucial for the success of the proof system. As already mentioned, the type theory underlying Coq is still evolving;
and one of the main line of research of the team is to study or invent type theories that are
well-adapted to the formalization of mathematics.
It is thus crucial to assess that its new features do not jeopardize consistency, which is obviously in turn essential for the correctness of the crucial property of a proof system itself. Hence
the importance of the study of the models of the meta-theory of the Coq proof assistant. Another
issue is the interoperability of the various proof systems used to formalize mathematics in the
XI.2.1. THÉMATIQUE GÉNÉRALE ET PRINCIPAUX OBJECTIFS
425
world-wide community of users of proof assistants, and the design of a system which could serve
as a back-end to front-end implementing various formalisms and proof languages.
Libraries of formalized mathematics It is well known that advanced mathematics can play a
crucial role in the design and correctness of sophisticated and sometimes critical software. In
some cases, using a proof system is the only option to mechanize the correctness of such programs. This can require the formalization of a wide variety of mathematical theories, and a
careful design of these formal libraries for them to be maintainable, combinable and reusable.
Furthermore, the ability to formalize advanced contemporary mathematics is still a form of ultimate quality tests for proof systems, and also a way to gain visibility.
One of our objectives is to make modern and large pieces of mathematics available as usable
formal libraries. Recent examples of complex proofs (Four Color Theorem, Kepler conjecture,
classification of finite groups, Fermat theorem) challenge the way the mathematical literature is
refereed and published. We think that the development of these formal libraries of mathematics
may also change the way certain mathematical result become accepted as theorems.
Crafting large bodies of formalized mathematics is a challenging task. These libraries obey
similar requirements as software : modularity and usability stem from appropriate data structures, design patterns and corpus of lemmas. But the appropriate methodology leading to the
relevant solutions is often far from obvious, and this is where research has to be done and knowhow has to be gained. Up to recently, formal developments were seldom collaborative and rarely
benefitted from reusable previous work. The maturity of proof assistants is now sufficient to
envision a more modern conception of formal software, as required by large scale verification
projects like T. Hales’ proof of the Kepler conjecture or the Feit-Thompson theorem. Several
members of the TypiCal team are committed in such big formalization projects, or in more specific but related side projects.
New Proof languages The development of new proofs and libraries goes hand in hand with
enhancing the way proof can be described and constructed by the user. The Small Scale Reflexion (SSR) package is an add-on to Coq developed by the joint INRIA-MSR effort “mathematical
components”, of whom TypiCal researchers are an important part.
Proof search and automated procedures Interactive proof assistants provide a very expressive
logical formalism, rich enough to allow extremely precise descriptions of complex objects like
the meta theory of a programming language, a model of C compiler, or the proof of the Four
Color Theorem. This description includes logical statements of the properties required by the
objects of interest but also their formal proofs, checked by the merciless proof-checker of the
system, which should be a small hence trusted piece of code. These systems provide the highest
formal guarantee, for instance, of the correctness with respect to the mathematical specification
of a code.
Proof-search is a central issue in such a formalization of mathematics. It is also a common
aspect of automated reasoning and high-level programming paradigms such as Logic programming. However specific applications commonly involve specific logics or theories, like for instance linear arithmetic. Whether or not such a logical framework can express these at all, it is
unlikely that its generic proof-search mechanisms can replace the methods that are specific to a
logic or theory. Either because this specific domain lies outside the reach of generic proof-search
or simply because generic proof-search is less efficient therein than a purpose-made procedure
(typically a decision procedure).
But to enlarge the scope where a specific method applies, one can combine both generic proof
search mechanisms with specific methods. We hence investigate how to craft formal proof producing decision procedures in the context of an interactive proof assistant. This activity includes
understanding the impact of proof-search mechanism (polarization, focusing, etc.), the implementation of efficient connections between domain specific automated decision procedures (SMT
solvers, polynomial optimization tools, etc.) with a proof assistant, and the combination of these
426
two aspects in the design of a unique logical framework where a generic notion of proof-search
could serve each of the above purposes.
XI.2.1.4
Interfacing Coq and SMT provers SMT (SAT Modulo Theory) is an automatic proof search
technology which enjoys increasing use and success in various fields, notably for checking correctness properties for software and algorithms. This makes them a natural candidate for proof
automation in Coq. Chantal Keller, in collaboration with the team Marelle at INRIA-Sophia, has
developed Coq-SMT which allows importing results from various SMT-provers, including INRIA’s VeriT and Microsoft’s Z3. This is done by instrumenting these provers in order to produce
proof traces which can be efficiently re-checked in Coq. It is worth noting that this latter checking
is efficient enough for the time-limiting factor being generally on the SMT-prover side.
Formalization of the semantics of type theories and intuitionistic set theories Bruno Barras
has formalized the set-theoretical semantics of various type theories related to the formalism of
Coq. The targetted formalisms include the Calculus of Constructions and its extensions with
predicative universes and inductive types. All these systems are at the same time a logic and
a calculus. He has built two kinds of models: one that allows to prove the consistency of the
logic, and also realizability models which implies the strong normalization property of those
calculus. In order to reduce the axioms used to carry out this formalization, he has investigated
the representation of intuitionistic set theories in Coq.
All these results have been published in the manuscript of his habilitation thesis “Semantical
Investigations in Intuitionistic Set Theory and Type Theories with Inductive Families”, which
will be defended in fall 2013.
A formal proof of the Odd Order Theorem Cyril Cohen and Assia Mahboubi have actively
participated to the collaborative effort which led in September 2012 to a complete machinechecked proof of the Odd Order Theorem, by the Mathematical Components team at the Inria –
Microsoft Research Joint Centre.
This result, originally due to W. Feit and J. G. Thompson in 1963 is a milestone in the classification of finite simple groups. Its proof is significantly long and difficult, even for expert
researchers in finite group theory. The success of this large scale, collaborative, formalization
project demonstrates that verifying modern results of research level mathematics with a computer is now within reach.
A significant part of the Coq formal libraries that have been developed during this six-year
project deal with algebraic theories that are not specific to the field of finite group theory. These
formal libraries actually cover at least the material taught in algebra at an undergraduate level.
The availability of this material and the methodology which emerges from this large scale project
should ease and allow for more further formalized material in mathematics. We actually expect
to attract the attention of scientific communities that were previously not represented among the
users of proof assistants.
XI.2.1.5
Logiciels
Coq TypiCal contributes to the well-known proof system Coq, whose development is coordinated by Hugo Herbelin (INRIA).
SSReflect Through its participation to the MSR-INRIA joint lab, TypiCal contributes to the development the SSReflect proof-language package for Coq. This effort is led by Georges Gonthier.
For TypiCal, Assia Mahboubi has been important for documenting this package and its novel
approach.
XI.2.1. THÉMATIQUE GÉNÉRALE ET PRINCIPAUX OBJECTIFS
427
SMT-Coq Chantal Keller developed, together with INRIA-Sophia a package allowing importing to Coq proofs from SMT solvers (VeriT, Z3).
This package is available at:
http://www.lix.polytechnique.fr/˜keller/Recherche/smtcoq.html.
HOL-Coq Chantal Keller and Benjamin Werner developed a package allowing to import developments for HOL-light into Coq. This has recently been extended to other HOL implementations
using the Open Theory interface.
This package is available at:
http://www.lix.polytechnique.fr/˜keller/Recherche/hollightcoq.html.
Dedukti Mathieu Boespflug developped the first version of the universal proof checker Dedukti. It is developped in Haskell and uses higher-order abstract syntax to handle terms, and
normalization by evaluation to reduce terms.
It is publicly available at:
http://hackage.haskell.org/package/dedukti.
Formal optimization Roland Zumkeller developed Sergei, a package for polynomial optimization, written in Haskell and using Bernstein polynomials. This software is freely available, and
serves as a prototype for a possible Coq implementation. This package is available free of charge.
Victor Magron developed a package for sum-of-square based polynomial optimization, which
can also be used for semi-algebraic expressions, and even non algebraic expressions using the
template method.
Proof developments Some large formal proof developments can qualify as “software”. In the
case of TypiCal, this includes the proof of the Feit-Thompson theorem, and Bruno Barras’ formal
metatheory of Coq.
XI.2.1.6
Team’s members enjoy a certain visibility in the domain of formal proofs. Assia Mahboubi and
Enrico Tassi were parts of the formalization effort of the Feit-Thompson team, Assia Mahboubi
and Bruno Barras were invited to the Institute of Advanced Studies for three months as part of
the special year organized by vladimir Voevodsky.
We are also happy with the various national and european projects (see corresponding section).
Cyril Cohen received a Prix de Thèse from Ecole Polytechnique, for his PhD advised by Assia
Mahboubi and Benjamin Werner.
428
XI.3 Projet de recherche : Typical
XI.3.1
As mentioned above, the team deals with various aspects of formal proofs, especially aspects
where computation and logical deduction interact. This is the common factor of the following
objectives, which cover various aspects of the crafting and checking of formal proofs.
We believe there is still a lot to be done to take advantage of the computing abilities of Coq in
order to enhance the abilities of the system. Be it for better automation or better proof libraries.
Current Context
The team is obviously being re-organized now. As a result, the computer algebra formalization
is now done, and is actually the base of the work of, the SpecFunc team of Inria Saclay1 . This
evaluation arrives precisely at the point where reflections are under way about which structure
is better suited at succeeding TypiCal.
Numerical computational proofs : integers
Computational proofs can be much shorter than their traditional counter-parts. More precisely,
a computational proof exchanges deduction steps against computational steps, the latter being
not stored in the proof witness. Numbers are obviously objects over which computers are able
to perform fast and large computations, and thus a domain where computers give access to new
results; for instance the primality of large numbers. Such results being only accessible through
mechanical computation, they can only be formalized through computational proofs.
A first important step was made in 2006 when Grégoire, Théry and Werner used Pocklington certificates for proving primality of integer numbers in Coq. This proof follows a scheme
that is shared with several enhancements of this work: a certificate is computed by an external
(unchecked) software, and this certificate is checked by a program written, proved correct and
running in Coq.
TypiCal contributes to making Coq yet a better system for this approach by accelerating computations. This aim involves combining logical issues on one hand, and programming language
and compilation issues on the other. TypiCal has contributed largely through the work of Arnaud
Spiwack.
Numerical computational proofs : reals
The question of computations in proofs also applies to the continuum and to real numbers. Representing real numbers in a computational proof obviously involves compromises, either using
approximations (floating point numbers) or giving up decidability of equality (constructive reals). Thus, the question of libraries is even more important than for integers. Applied mathematics are today, largely, the mathematics which lead to algorithms that can effectively be run on a
computer. And when they are run on a computer, these algorithms establish mathematical facts.
In other words, applied mathematics are largely a huge corpus waiting to be formalized.
Victor Magron (starting from the sum of square techniques) and Roland Zumkeller (Berstein
polynomials) have imported such technology to the world of formal proofs; let us remark that
Magron’s PhD is in collaboration with the mathematical team MaxPlus (S. Gaubert). But this is
definitively not the end of the story. Even in the domain of real inequalities, various approaches
are still to be investigated, like amoeba skelettons.
But more generally, applied mathematics provide plenty of techniques meant to establish
results in the world of the continuum of real numbers. Identifying the next good candidates for
formalization, and then effectively performing this formalization is a general task for us.
1 On the side, and since this team is located in the same building, one can regret that it is currently not part of LIX.
429
CHAPTER XI.3. PROJET DE RECHERCHE : TYPICAL
430
XI.3.1.1
Better numbers in Coq
The work done at TypiCal involving real analysis relies on numerical computations performed
inside Coq. Currently, Coq provides reasonably efficient computation on integers, including
large (arbitrary size) integers. This, in turn, is used to provide a library of arbitrary large rational numbers. It is also used for computable reals (that is real numbers represented through a
program that computes any desired number of digits). Finally, a library of floating pint numbers
has been developed (largely at Saclay and Lyon). It is clear that floating point numbers provides
best computational performances. It is also clear that, although these performances are obtained
at the cost of a certain precision loss (rounding error) these computations can often assess some
mathematical certainty (by taking the rounding error into account).
By building on the tools developed around Sylvie Boldo and Guillaume Melquiond (INRIASaclay Tocatac, ex-Proval), we should be able to better actually use these results in formal Coq
proofs.
Automation through computation
Using computation in proofs allows automation: general purpose proof-search (checking SMT
traces), checking equalities in algebraic structures like rings (Coq’s ring tactic), or more specialized routines (like the cylindrical algebraic decomposition). Obviously, such automatizations are
important for the usability of Coq. Including such automatization involves understanding the
logical and mathematical concepts involved, the interfacing with existing Coq libraries, which
tasks are to be performed in Coq and which ones should be delegated to external tools.
Giving the Coq users access to the high-performance automatic proof search of SMT provers
is, in our mind, an important success. We should build on this success by:
• Allowing SMT to work for more theories, especially ones which will allow to automatize
correctness proofs for programs correctness proofs, which will themselves contribute to the
computational performances of Coq.
• Integrate SMTCoq better with various other automated deduction techniques.
XI.3.1.2
Formal Computer Algebra
A field where computation and deduction naturally meet is computer algebra. Coq is today a
good tool for formally proving CA algorithms, and thus re-injecting the results of these algorithms in further proofs. This approach also gives a new reliability to CA, and allows to combine
it with other techniques.
A safer Coq
Because the logical formalism implemented by Coq is a complex type theory, and because fast
execution involves advanced compilation techniques, assessing the correctness of the proofchecking kernel of Coq is a difficult issue. TypiCal has an expertise in formally studying type
theories, in order to (1) check the correctness of the formalism (through set-theoretical semantics) and (2) prove the correctness of a type checker. This is an important contribution of Bruno
Barras’ HDR thesis.
There are still some points through which Coq’s formalism could be changed in ways making
the proof system more efficient and user friendly. This includes the termination criterions for recursive functions, or the possibility to erase non-computational parts of the proofs at conversion
check.
Our expertise with the formalism puts us in a good position to judge how this could be done.
XI.3.1. OBJECTIFS SCIENTIFIQUES
431
Generic formalism, generic checker
The quest for a more generic approach and study of formalisms has led to the invention of deduction modulo, which has since been refined into λΠ modulo. This work, largely impulsed by Gilles
Dowek, raises numerous theoretical questions (about the formalisms) and implementation issues
(a generic proof-checker). This line of work mainly takes place in the Deducteam team (INRIA
Paris) since 2010.
432
CHAPTER XI.3. PROJET DE RECHERCHE : TYPICAL
XI.4 Fiche résumé : Typical
XI.4.1
Membres
2008 : 6 chercheurs (1 CNRS, 5 INRIA), 1 enseignant-chercheur, 1 ingénieur CNRS, 10 doctorants
2013 : 2 chercheurs (1 CNRS, 1 INRIA), 1 enseignant-chercheur, 1 ingénieur CNRS, 2 doctorants
Départ de membres de l’équipe Hugo Herbelin (πr 2 , INRIA/PPS), Gilles Dowek (Deducteam,
INRIA Rocquencourt), Germain Faure (First grade teacher), Assia Mahboubi (SpecFun, INRIA
Saclay), Enrico Tassi (SpecFun, INRIA Saclay)
XI.4.2
A formal proof of the Feit-Thomson theorem The Feit-Thompson is an important theorem
stating that every finite group of odd order is solvable. It is an important step in the classification
of finite groups. Its proof is remarkable through its difficulty and its length (more than 1000
pages of dense mathematical text).
This proof was entirely formalized in Coq. This effort was started six years ago, as a joint
project of the project teams Typical, Marelle (Sophia-Antipolis) and the Inria-MSR joint center,
under the supervision of Georges Gonthier. The proof was finished in september 2012 and is
considered a remarkable achievement. It also gave birth to several side products, such as enhancements of the SSReflect proof language. For Typical, Assia Mahboubi, Enrico Tassi and Cyril
Cohen were instrumental in this effort.
Formal Semantics of Type Theory Bruno Barras finished an extensive formalization of Coq’s
type theory in Coq, as well as a large formalization of set theory. This work includes several new
results and insights in the study of Type Theory and is the body of Barras’ habilitation thesis to
be defended in fall 2013.
Interfacing Coq and SMT provers SAT Modulo Theory (SMT) is an automatic proof search
technology which enjoys increasing use and success in various fields, notably for checking correctness properties for software and algorithms. This makes them a natural candidate for proof
automation in Coq. Chantal Keller and Benjamin Werner, in collaboration with the team Marelle
at INRIA-Sophia has developed a library which allows importing results from various SMTprovers, including INRIA’s VeriT and Microsoft’s Z3. This is done by instrumenting these provers
in order to produce proof traces which can be efficiently re-checked in Coq. It is worth noting that
this latter checking is efficient enough, for the time-limiting factor being generally on the SMTprover side.
XI.4.3
XI.4.3.1
Publications
Journaux : 24
433
CHAPTER XI.4. FICHE RÉSUMÉ : TYPICAL
434
XI.4.3.2
Rayonnement
• The members of TypiCal are regularly involved in the organization of international workshops and conferences, either as program committee members or as steering committee
members. Those include well established events in the field of logic, type theory and functional programming.
• Some members of the TypiCal team have been involved in the organization of large international events in the field of theoretical computer science like the International Joint
Conference on Automated Reasoning (IJCAR) or the Annual ACM/IEEE Symposium on
Logic in Computer

Laboratoire d`Informatique de l`X - LIX

Transcription

Similar documents

Collation des grades - Polytechnique Montréal

Essentiels des offres OpenTouch Personal Cloud

CONFERENCE Verbal Adjectives and Participles in the Indo

Bilan - Institut d`électronique et d`informatique Gaspard

aerothermie - Jurapac Pompes à chaleur

La validation des systèmes informatisés en environnement

Collation - Polytechnique Montréal

Industrial Property Journal (June 2015)

Bulletin de l`UIESP N°23 : Juin 2011