Laboratoire d Informatique de l X

Transcription

1 Dossier d Evaluation d une Unité de Recherche Vague E: Campagne d Evaluation Laboratoire d Informatique de l X LIX UMR 7161 Ecole Polytechnique Palaiseau Cedex Nom de l unité: Acronyme: Nom du directeur pour le contrat en cours: Nom du directeur pour le contrat à venir: Laboratoire d Informatique de l X LIX Olivier Bournez Olivier Bournez Type de demande: Renouvellement avec modifications Choix de l évaluation interdisciplinaire de l unité de recherche: Non.

2 2

3 Préambule Ce document décrit les activités scientifiques et administratives du Laboratoire d Informatique de l X (LIX), UMR 7161, Ecole Polytechnique - CNRS, pour la période allant du 1er janvier 2008 au 30 juin 2013, en les positionnant dans la perspective d un nouveau mandat de l unité. Ce document s accompagne d un autre document, contenant les annexes, dans l ordre suggéré par le site de l AERES. Plusieurs des informations dans ces annexes sont dupliquées dans ce document, pour rendre ce document facilement lisible, en particulier, pour permettre une lecture aisée des activités des équipes évitant les aller-retour entre documents. La première partie de ce document présente l unité, ses réalisations, les activités de l unité dans la formation dans la recherche, et des éléments de positionnement, stratégie et perspectives pour le futur contrat. Ce document se poursuit par un chapitre par équipe du laboratoire. Pour chaque équipe, on présente la liste des membres et ses évolutions, un rapport sur les activités effectuées dans ce mandat, et des éléments de perspective pour le mandat à venir, une fiche résumée, ainsi qu une liste des réalisations. Chaque équipe propose par ailleurs une auto-analyse AFOM (Atouts, Faiblesses, Opportunités, Menaces) (parfois aussi appelée SWOT). On trouvera dans l autre document reproduit les fiches résumées par équipe. On trouvera par ailleurs un organigramme fonctionnel, copie du règlement intérieur de l unité, et une liste exhaustive des publications de chacune des équipes, et de leurs contrats. Il se termine par une liste des thèses en cours et thèses soutenues, ainsi que par une liste de personnel Notre laboratoire a la chance de compter parmi ses membres de nombreuses nationalités: le dernier recensement 1 dénombrait 16 nationalités au LIX. Les langues les plus parlées quotidiennement dans nos équipes sont le français, l anglais, l allemand et l italien. Pour la rédaction du présent rapport, nous avons retenu le français et l anglais pour que les auteurs de chaque équipe puissent retranscrire au plus juste leur pensé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 comité AERES, mis en en place au printemps, qui par ses réunions régulières a permis que ce document soit ce qu il est. Merci à Daniel Augot, Vincent Pilaud, Dominique Rossin, pour leur aide quasi quotidienne, ainsi qu à Catuscia Palamidessi et Benjamin Werner pour toute leur aide. Les responsables d équipe et les correspondants par équipe, en particulier Thomas Clausen, Miki Hermann, Grégoire Lecerf, François Morain, Jean-Marc Notin, Yann Ponty, Antoine Rauzy, David Savourey, Lutz Strasβurger, Frank Valencia ont été d une aide précieuse, et un moyen de relais incessant. Je voudrais adresser des remerciements tout particuliers aux relecteurs, en particulier à Kaustuv Chaudhuri pour des retours très détaillés, à François Morain pour un énorme travail autour de la bibliographie, en plus du reste, et à Grégoire Lecerf pour des propositions de formulation souvent très fines et judicieuses de certaines parties. Enfin, tout cela n aurait pas pu exister sans le travail quotidien de James Régis, aux moyens informatiques, et de Sylvie Jabinet, Valérie Lecomte, Christelle Liévin, et Evelyne Rayssac pour obtenir toutes les données nécessaires. Merci à Sylvie et Evelyne en particulier pour leur patience à produire et reproduire certaines données de multiples fois au gré des demandes pour permettre à ce rapport d être dans l état où il est. October 15, 2013 Olivier Bournez Directeur du LIX

4 Table des matières I Présentation du laboratoire 19 TYPICAL SYSMO ARSIFAL MAX IPERCOM CRYPTO Comète I.1 Le LIX 21 I.1.1 Présentation de l unité I Introduction I Structuration scientifique I Photographie au 30 Juin I Vie scientifique de l unité I Effectifs du laboratoire I Gouvernance du laboratoire I Administration et services I Moyens et évolutions I.1.2 Réalisations I Production scientifique sur le mandat I Le LIX dans son environnement I Animation I Évolutions sur le mandat I.1.3 Implication du LIX dans la formation par la recherche I Le Département d Informatique de l X I Formation au niveau L I Formation en Master I Pilotage de Master 2. Enseignement en Master I Accueil de doctorants au LIX I.1.4 Stratégie et perspectives scientifiques pour le futur contrat I Axe: Algorithmes, Combinatoire, Modèles I Axe: Informatique distribuée et sécurité I Axe: Calcul symbolique et preuve I.2 Analyse AFOM du laboratoire 53 Rapport et projet scientifique par équipe 57 COMBI AMIB AlCo LIX II Équipe Algorithmique et Complexité (AlCo) 59 II.1 Liste des membres : Algorithmique et Complexité 61 II.1.1 Liste actuelle des membres II Membres permanents II Doctorants et postdoctorants II.1.2 Anciens membres II Membres permanents II Doctorants et postdoctorants II Autres membres

5 TABLE DES MATIÈRES 5 II.2 Rapport scientifique : Algorithmique et Complexité 63 II.2.1 Thématique générale et principaux objectifs II Introduction II Thémes de recherche II Exemples de résultats significatifs II Animation scientifique, rayonnement, prix et récompenses II Fonctionnement interne II Formation par la recherche II.3 Projet de recherche : Algorithmique et Complexité 67 II.3.1 Objectifs scientifiques II Complexity of Constraint Satisfaction problems II Counting Complexity II Computations over the continuum II.3.2 Mise en oeuvre II.4 Analyse AFOM : Algorithmique et Complexité 69 II.5 Fiche résumé : Algorithmique et Complexité 71 II.5.1 Membres II.5.2 Résultats scientifiques II.5.3 Production scientifique II Publications II Rayonnement II Actions de formation II.6 Production scientifique : Algorithmique et Complexité 73 II.6.1 Livres et chapitres de livres II.6.2 Documents pédagogiques II.6.3 Revues internationales II.6.4 Conférences internationales II.6.5 Conférences nationales II.6.6 Conférences invitées II.6.7 Thèses II.6.8 Habilitation à diriger des recherches II.7 Annexes : Algorithmique et Complexité 81 II.7.1 Participations à la communauté scientifique et responsabilités administratives 81 II Responsabilités de projets internationaux II Responsabilités de projets nationaux II Participation à des projets internationaux II Participation à des projets nationaux II.7.2 Administration de la recherche II Activités éditoriales II Gestion scientifique de conférences II Organisation d événements scientifiques II Participation à des comités et jurys scientifiques II.7.3 Activités de formation, encadrement et évaluation II Liste des thèses et HDR soutenues II Liste de rapports de thèses et HDR II Enseignements dispensés II.7.4 Autres éléments de visibilité II Invitations II Prix et distinctions TYPICAL SYSMO PARSIFAL MAX HIPERCOM CRYPTO Comète COMBI AMIB AlCo LIX

6 6 TABLE DES MATIÈRES III Équipe Bio-Informatique (AMIB) 89 III.1 Liste des membres : Bio-Informatique 91 III.1.1 Liste actuelle des membres III Membres permanents III Doctorants et postdoctorants III Visiteurs et autres membres III.1.2 Anciens membres III Membres permanents III Doctorants et postdoctorants III Autres membres TYPICAL SYSMO ARSIFAL MAX IPERCOM CRYPTO Comète COMBI AMIB AlCo LIX III.2 Rapport scientifique : Bio-Informatique 93 III.2.1 Thématique générale et principaux objectifs III Introduction III Thèmes de recherche III Exemples de résultats significatifs III Animation scientifique, rayonnement, prix et récompenses III Fonctionnement interne III Formation par la recherche III.3 Projet de recherche : Bio-Informatique 99 III.3.1 Objectifs scientifiques III Sequences : combinatorics and algorithms III RNA structures III D modeling of macromolecules and their interactions III Cell metabolism III.3.2 Mise en oeuvre III.4 Analyse AFOM : Bio-Informatique 105 III.5 Fiche résumé : Bio-Informatique 107 III.5.1 Membres III.5.2 Résultats scientifiques III.5.3 Production scientifique III Publications III Rayonnement III Actions de formation III.6 Production scientifique : Bio-Informatique 109 III.6.1 Livres et chapitres de livres III.6.2 Revues internationales III.6.3 Conférences internationales III.6.4 Conférences nationales III.6.5 Conférences invitées III.6.6 Thèses III.6.7 Rapports techniques III.6.8 Logiciels III VARNA Visualizing and editing RNA secondary structure III GenRGenS Generation of Random Genomic Sequences III ESBTL (Easy Structural Biology Template Library) III DiMoVo - DIscriminate between Multimers and MOnomers by VOronoi tessellation III VorScore - Voronoi Scoring Function Server

7 TABLE DES MATIÈRES 7 III.7 Annexes : Bio-Informatique 117 III.7.1 Participations à la communauté scientifique et responsabilités administratives 117 III Responsabilités de projets internationaux III Participation à des projets nationaux III Participation à des projets locaux III.7.2 Administration de la recherche III Activités éditoriales III Gestion scientifique de conférences III Organisation d événements scientifiques III Participation à des comités et jurys scientifiques III.7.3 Activités de formation, encadrement et évaluation III Liste des thèses et HDR soutenues III Liste de rapports de thèses et HDR III Enseignements dispensés III.7.4 Autres éléments de visibilité III Rencontres scientifiques sur invitation III Invitations III.8 Références externes 125 TYPICAL IV Équipe Combinatoire (COMBI) 127 IV.1 Liste des membres : Combinatoire 129 IV.1.1 Liste actuelle des membres IV Membres permanents IV Doctorants et postdoctorants IV Visiteurs et autres membres IV.1.2 Anciens membres IV Membres permanents IV Doctorants et postdoctorants IV Autres membres IV.2 Rapport scientifique : Combinatoire 131 IV.2.1 Introduction IV.2.2 Thèmes de recherche IV.2.3 Exemples de résultats significatifs IV.2.4 Animation scientifique, rayonnement, prix et récompenses IV Fonctionnement interne IV Formation par la recherche IV.3 Projet de recherche : Combinatoire 137 IV.3.1 Introduction IV.3.2 Objectifs scientifiques et mise en œuvre IV.4 Analyse AFOM : Combinatoire 141 IV.5 Fiche résumé : Combinatoire 143 IV.5.1 Membres IV.5.2 Résultats scientifiques IV.5.3 Production scientifique IV Publications IV Rayonnement IV Actions de formation SYSMO PARSIFAL MAX HIPERCOM CRYPTO Comète COMBI AMIB AlCo LIX

8 8 TABLE DES MATIÈRES IV.6 Production scientifique : Combinatoire 147 IV.6.1 Livres et chapitres de livres IV.6.2 Revues internationales IV.6.3 Conférences internationales IV.6.4 Thèses IV.6.5 Autres IV.6.6 Communications à des conférences nationales sans actes TYPICAL SYSMO ARSIFAL MAX IV.7 Annexes : Combinatoire 157 IV.7.1 Participations à la communauté scientifique et responsabilités administrative 157 IV Responsabilités de projets internationaux IV Responsabilités de projets nationaux IV Participation à des projets internationaux IV Participation à des projets nationaux IV Participation à des projets locaux IV.7.2 Administration de la recherche IV Activités éditoriales IV Gestion scientifique de conférences IV Organisation d événements scientifiques IV Participation à des comités et jurys scientifiques IV.7.3 Activités de formation, encadrement et évaluation IV Liste des thèses et HDR soutenues IV Liste de rapports de thèses et HDR IV Enseignements dispensés IV.7.4 Autres éléments de visibilité IV Exposés invités en conférences IV Participation à des workshops sur invitations IV Invitations à l étranger IV Exposés en séminaires IV Prix et distinctions IPERCOM CRYPTO Comète COMBI AMIB AlCo LIX V Équipe Concurrency, Mobility and Transactions (Comète) 165 V.1 Liste des membres : Concurrency, Mobility and Transactions 167 V.1.1 Liste actuelle des membres V Membres permanents V Doctorants et postdoctorants V Visiteurs et autres membres V.1.2 Anciens membres V Membres permanents V Doctorants et postdoctorants V Autres membres V.2 Rapport scientifique : Concurrency, Mobility and Transactions 171 V.2.1 Thématique générale et principaux objectifs V Introduction V Thèmes de recherche V Exemples de résultats significatifs V Animation scientifique, rayonnement, prix et récompenses V Fonctionnement interne V.3 Projet de recherche : Concurrency, Mobility and Transactions 177 V.3.1 Objectifs scientifiques

9 TABLE DES MATIÈRES 9 V Objectif 1: Privacy protection in trace-based services V Objectif 2: Extending the Theory of Quantitative Information Flow V Objectif 3: Epistemic and Spatial Reasoning for Distributed Systems with Applications to Social Networks V.4 Analyse AFOM : Concurrency, Mobility and Transactions 183 V.5 Fiche résumé : Concurrency, Mobility and Transactions 185 V.5.1 Membres V.5.2 Résultats scientifiques V.5.3 Production scientifique V Publications V Rayonnement V Actions de formation V.6 Production scientifique : Concurrency, Mobility and Transactions 189 V.6.1 Livres et chapitres de livres V.6.2 Revues internationales V.6.3 Conférences internationales V.6.4 Conférences invitées V.6.5 Thèses V.6.6 Rapports techniques V.7 Annexes : Concurrency, Mobility and Transactions 199 V.7.1 Participations à la communauté scientifique et responsabilités administrative 199 V Responsabilités de projets internationaux V Responsabilités de projets nationaux V Participation à des projets internationaux V Participation à des projets nationaux V Contrats et bourses V.7.2 Administration de la recherche V Activités éditoriales V Gestion scientifique de conférences V Organisation d événements scientifiques V Participation à des comités et jurys scientifiques V.7.3 Activités de formation, encadrement et évaluation V Liste des thèses et HDR soutenues V Liste de rapports de thèses et HDR V Enseignements dispensés V.7.4 Autres éléments de visibilité V Invited Presentations V Participations sur invitation à des rencontres scientifiques V Prix et distinctions VI Équipe Cryptographie (CRYPTO) 213 VI.1 Liste des membres : Cryptographie 215 VI.1.1 Liste actuelle des membres VI Membres permanents VI Doctorants et postdoctorants VI Visiteurs et autres membres VI.1.2 Anciens membres VI Membres permanents TYPICAL SYSMO PARSIFAL MAX HIPERCOM CRYPTO Comète COMBI AMIB AlCo LIX

10 10 TABLE DES MATIÈRES VI Doctorants et postdoctorants VI Autres membres VI.2 Rapport scientifique : Cryptographie 217 VI.2.1 Thématique générale et principaux objectifs VI Introduction VI Thèmes de recherche VI Exemples de résultats significatifs VI Animation scientifique, rayonnement, prix et récompenses VI Local positionning VI Fonctionnement interne VI Formation par la recherche TYPICAL SYSMO ARSIFAL MAX IPERCOM CRYPTO Comète COMBI AMIB AlCo LIX VI.3 Projet de recherche : Cryptographie 223 VI.3.1 Objectifs scientifiques VI Basic Number Theory VI Isogeny and Endomorphism Computations VI Algebraic Geometry Codes VI Unique, List and Local Decoding VI.4 Analyse AFOM : Cryptographie 227 VI.5 Fiche résumé : Cryptographie 229 VI.5.1 Membres VI.5.2 Résultats scientifiques VI.5.3 Production scientifique VI Publications VI Rayonnement VI Actions de formation VI Software VI.6 Production scientifique : Cryptographie 231 VI.6.1 Livres et chapitres de livres VI.6.2 Documents pédagogiques VI.6.3 Revues internationales VI.6.4 Conférences internationales VI.6.5 Conférences nationales VI.6.6 Vulgarisation VI.6.7 Logiciel VI Multiprecision VI Integer Factorization VI Elliptic curves over finite fields: SEA VI Coding theory VI.6.8 Thèses VI.6.9 Brevets VI.6.10 Rapports techniques VI.6.11 Autres VI.7 Annexes : Cryptographie 239 VI.7.1 Participations à la communauté scientifique et responsabilités administrative 239 VI Participation à des projets nationaux VI Participation à des projets locaux VI Contrats bilatéraux VI.7.2 Administration de la recherche

11 TABLE DES MATIÈRES 11 VI Activités éditoriales VI Gestion scientifique de conférences VI Organisation d événements scientifiques VI Participation à des comités et jurys scientifiques VI.7.3 Activités de formation, encadrement et évaluation VI Liste des thèses et HDR soutenues VI Liste de rapports de thèses et HDR VI Enseignements dispensés VI.7.4 Autres éléments de visibilité VI Invitations VI Prix et distinctions VII Équipe High-Performance Communications (Hipercom) 249 VII.1 Liste des membres : High-Performance Communications 251 VII.1.1 Liste actuelle des membres VII Membres permanents VII Doctorants et postdoctorants VII.1.2 Anciens membres VII Membres permanents VII Doctorants et postdoctorants VII Autres membres VII.2 Rapport scientifique : High-Performance Communications 253 VII.2.1 Thématique générale et principaux objectifs VII Introduction VII Thèmes de recherche VII Exemples de résultats significatifs VII Animation scientifique, rayonnement, prix et récompenses VII Fonctionnement interne VII Formation par la recherche VII.3 Fiche résumé : High-Performance Communications 259 VII.3.1 Membres VII.3.2 Résultats scientifiques VII.3.3 Production scientifique VII Publications VII Rayonnement VII Actions de formation VII.4 Production scientifique : High-Performance Communications 263 VII.4.1 Livres et chapitres de livres VII.4.2 Revues internationales VII.4.3 Conférences internationales VII.4.4 Thèses VII.4.5 Normalisation - Ratified Standards VII.4.6 Normalisation - Contributions VII.4.7 Rapports techniques VII.4.8 Autres VII.5 Annexes : High-Performance Communications 277 VII.5.1 Participations à la communauté scientifique et responsabilités administrative 277 VII Responsabilités de projets internationaux TYPICAL SYSMO PARSIFAL MAX HIPERCOM CRYPTO Comète COMBI AMIB AlCo LIX

12 12 TABLE DES MATIÈRES VII Responsabilités de projets nationaux VII.5.2 Administration de la recherche VII Activités éditoriales VII Organisation d événements scientifiques VII.5.3 Activités de formation, encadrement et évaluation VII Enseignements dispensés VII.5.4 Autres éléments de visibilité VII Invitations VIII Équipe Modélisation Algébrique et Calcul Symbolique (MAX) 283 TYPICAL SYSMO ARSIFAL MAX IPERCOM CRYPTO Comète COMBI AMIB AlCo LIX VIII.1Liste des membres : Modélisation Algébrique et Calcul Symbolique 285 VIII.1.1 Liste actuelle des membres VIII Membres permanents VIII Autres membres VIII.1.2 Anciens membres VIII Doctorants et postdoctorants VIII Autres membres VIII.2Rapport scientifique : Modélisation Algébrique et Calcul Symbolique 287 VIII.2.1 Introduction VIII.2.2 Thèmes de recherche VIII.2.3 Logiciels VIII.2.4 Exemples de résultats significatifs VIII.2.5 Animation scientifique, rayonnement, prix et récompenses VIII.2.6 Fonctionnement interne VIII.2.7 Formation par la recherche VIII.2.8 Création d entreprise VIII.3Projet de recherche : Modélisation Algébrique et Calcul Symbolique 293 VIII.3.1 Objectifs scientifiques VIII Algorithmes fondamentaux pour le calcul formel VIII Algorithmes fondamentaux pour le calcul analytique VIII Résolution de systèmes polynomiaux invariants sous un groupe VIII Résolution réelle des systèmes polynomiaux VIII Résolution des systèmes différentiels VIII Développement de méthodes diverses en automatique et traitement du signal VIII Refondation de la théorie des séries temporelles VIII Logiciels de calcul formel et analytique VIII Plateforme d édition et de calcul scientifiques VIII.3.2 Mise en œuvre VIII.4Analyse AFOM : Modélisation Algébrique et Calcul Symbolique 297 VIII.5Fiche résumé : Modélisation Algébrique et Calcul Symbolique 299 VIII.5.1 Membres VIII.5.2 Résultats scientifiques VIII.5.3 Production scientifique VIII Publications VIII Rayonnement VIII Actions de formation VIII.6Production scientifique : Modélisation Algébrique et Calcul Symbolique 301

13 TABLE DES MATIÈRES 13 VIII.6.1 Livres et chapitres de livres VIII.6.2 Documents pédagogiques VIII.6.3 Revues internationales VIII.6.4 Conférences internationales VIII.6.5 Conférences nationales VIII.6.6 Conférences invitées VIII.6.7 Brevets VIII.6.8 Thèses VIII.6.9 Logiciels VIII.6.10 Rapports techniques VIII.6.11 Autres VIII.7Annexes : Modélisation Algébrique et Calcul Symbolique 311 VIII.7.1 Participations à la communauté scientifique et responsabilités administratives 311 VIII Responsabilités de projets internationaux VIII Responsabilités de projets nationaux VIII Participation à des projets internationaux VIII Participation à des projets nationaux VIII.7.2 Administration de la recherche VIII Activités éditoriales VIII Gestion scientifique de conférences VIII Organisation d événements scientifiques VIII Participation à des comités et jurys scientifiques VIII.7.3 Activités de formation, encadrement et évaluation VIII Liste des thèses et HDR soutenues VIII Liste de rapports de thèses et HDR VIII Enseignements dispensés VIII.7.4 Autres éléments de visibilité VIII Invitations VIII Prix et distinctions TYPICAL SYSMO PARSIFAL MAX IX Équipe Parsifal (PARSIFAL) 321 IX.1 Liste des membres : Parsifal 323 IX.1.1 Liste actuelle des membres IX Membres permanents IX Doctorants et postdoctorants IX Visiteurs et autres membres IX.1.2 Anciens membres IX Membres permanents IX Doctorants et postdoctorants IX Autres membres IX.2 Rapport scientifique : Parsifal 325 IX.2.1 Introduction IX.2.2 Research Themes IX.2.3 Software IX.2.4 Exemples de résultats significatifs IX.2.5 Animation scientifique, rayonnement, prix et récompenses IX.2.6 Fonctionnement interne IX.3 Projet de recherche : Parsifal 331 IX.3.1 Objectifs scientifiques HIPERCOM CRYPTO Comète COMBI AMIB AlCo LIX

14 14 TABLE DES MATIÈRES IX Proof Certificates IX Focused proof systems for arithmetic IX Instantiation of variables beyond first-order logic IX Extending and enhancing our computational tools IX Deep Inference IX Proof Complexity IX Geometry of Rewriting IX.4 Analyse AFOM : Parsifal 335 IX.5 Fiche résumé : Parsifal 337 IX.5.1 Membres IX.5.2 Résultats scientifiques IX.5.3 Production scientifique IX Publications IX Rayonnement IX Actions de formation TYPICAL SYSMO ARSIFAL MAX IPERCOM CRYPTO Comète COMBI AMIB IX.6 Production scientifique : Parsifal 341 IX.6.1 Livres et chapitres de livres IX.6.2 Revues internationales IX.6.3 Conférences internationales IX.6.4 Conférences invitées IX.6.5 Logiciel IX.6.6 Thèses IX.6.7 Habilitation à diriger des recherches IX.6.8 Rapports techniques IX.6.9 Autres IX.7 Annexes : Parsifal 351 IX.7.1 Participations à la communauté scientifique et responsabilités administrative 351 IX Responsabilités de projets internationaux IX Responsabilités de projets nationaux IX Participation à des projets internationaux IX Participation à des projets nationaux IX.7.2 Administration de la recherche IX Activités éditoriales IX Gestion scientifique de conférences IX Organisation d événements scientifiques IX Participation à des comités et jurys scientifiques IX.7.3 Activités de formation, encadrement et évaluation IX Liste des thèses et HDR soutenues IX Liste de rapports de thèses et HDR IX Enseignements dispensés IX.7.4 Autres éléments de visibilité IX Invitations IX Prix et distinctions AlCo LIX X Équipe Sysmo (Sysmo) 361 X.1 Liste des membres : Sysmo 363 X.1.1 Liste actuelle des membres X Membres permanents

15 TABLE DES MATIÈRES 15 X Doctorants et postdoctorants X Visiteurs et autres membres X.1.2 Anciens membres X Membres permanents X Doctorants et postdoctorants X Autres membres X.2 Rapport scientifique : Sysmo 367 X.2.1 Thématique générale et principaux objectifs X Introduction X Research themes X Exemples de résultats significatifs X Animation scientifique, rayonnement, prix et récompenses X Fonctionnement interne X Formation par la recherche X.3 Projet de recherche : Sysmo 373 X.3.1 Objectifs scientifiques X Formal Definition and Modelling of Complex Industrial Systems X Optimization of Complex Industrial Systems X Safety Assessment of Complex Industrial Systems X Data Science and Mining X.4 Analyse AFOM : Sysmo 377 X.5 Fiche résumé : Sysmo 379 X.5.1 Membres X.5.2 Résultats scientifiques X.5.3 Production scientifique X Publications X Rayonnement X Actions de formation X.6 Production scientifique : Sysmo 381 X.6.1 Livres et chapitres de livres X.6.2 Édition de livres et de numéros spéciaux de revues X.6.3 Documents pédagogiques X.6.4 Revues internationales X.6.5 Revues nationales X.6.6 Conférences internationales X.6.7 Conférences nationales X.6.8 Brevets X.6.9 Vulgarisation X.6.10 Thèses X.6.11 Rapports techniques X.6.12 Autres X.7 Annexes : Sysmo 401 X Responsabilités de projets internationaux X Responsabilités de projets nationaux X Participation à des projets internationaux X Participation à des projets nationaux X Participation à des projets locaux X.7.1 Administration de la recherche TYPICAL SYSMO PARSIFAL MAX HIPERCOM CRYPTO Comète COMBI AMIB AlCo LIX

16 16 TABLE DES MATIÈRES X Activités éditoriales X Gestion scientifique de conférences X Organisation d événements scientifiques X Participation à des comités et jurys scientifiques X.7.2 Activités de formation, encadrement et évaluation X Liste des thèses et HDR soutenues X Liste de rapports de thèses et HDR X Enseignements dispensés X.7.3 Autres éléments de visibilité X Invitations X Prix et distinctions XI Équipe Typical (Typical) 417 TYPICAL SYSMO ARSIFAL MAX IPERCOM CRYPTO Comète COMBI AMIB AlCo LIX XI.1 Liste des membres : Typical 419 XI.1.1 Liste actuelle des membres XI Membres permanents XI Doctorants et postdoctorants XI.1.2 Anciens membres XI Membres permanents XI Doctorants et postdoctorants XI Autres membres XI.2 Rapport scientifique : Typical 423 XI.2.1 Thématique générale et principaux objectifs XI Current Context XI Introduction XI Thèmes de recherche XI Exemples de résultats significatifs XI Logiciels XI Animation scientifique, rayonnement, prix et récompenses XI.3 Projet de recherche : Typical 429 XI.3.1 Objectifs scientifiques XI Better numbers in Coq XI Formal Computer Algebra XI.4 Fiche résumé : Typical 433 XI.4.1 Membres XI.4.2 Résultats scientifiques XI.4.3 Production scientifique XI Publications XI Rayonnement XI Actions de formation XI.5 Production scientifique : Typical 435 XI.5.1 Livres et chapitres de livres XI.5.2 Documents pédagogiques XI.5.3 Revues internationales XI.5.4 Conférences internationales XI.5.5 Conférences nationales XI.5.6 Logiciels XI.5.7 Thèses

17 TABLE DES MATIÈRES 17 XI.5.8 Habilitation à diriger des recherches XI.5.9 Rapports techniques XI.5.10 Autres XI.6 Annexes : Typical 443 XI.6.1 Participations à la communauté scientifique et responsabilités administrative 443 XI Responsabilités de projets internationaux XI Responsabilités de projets nationaux XI Participation à des projets internationaux XI Participation à des projets nationaux XI Participation à des projets locaux XI.6.2 Administration de la recherche XI Activités éditoriales XI Gestion scientifique de conférences XI Organisation d événements scientifiques XI Participation à des comités et jurys scientifiques XI.6.3 Activités de formation, encadrement et évaluation XI Liste des thèses et HDR soutenues XI Liste de rapports de thèses et HDR XI Enseignements dispensés XI.6.4 Autres éléments de visibilité XI Invitations

18 18 TABLE DES MATIÈRES

19 I Présentation du laboratoire 19

20

21 I.1 Le LIX I.1.1 I Présentation de l unité Introduction Le sigle LIX désigne le Laboratoire d Informatique de l École Polytechnique, la lettre X désignant l École polytechnique dans la tradition française. À ce titre, le LIX se doit d être une vitrine de la recherche en informatique dans la compétition internationale académique, être une vitrine du monde de la recherche pour les élèves de la formation d ingénieur de l école, et d être à la hauteur du prestige et des fonctions occupées par certains de ses anciens. Cela nécessite une palette d activités aussi large que possible, une recherche de qualité 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. Être un acteur visible et reconnu dans chacune de ces directions et couvrir l ensemble de ce spectre mène parfois le laboratoire à des activités qui peuvent paraîtres orthogonales, à la fois liées à une recherche académique de premier plan, des relations fortes avec le monde industriel et partenarial, et des activités de développement logiciel fortes. Le Laboratoire d Informatique de l X (LIX) est une unité mixte de recherche (UMR 7161) de l É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 relève de l Institut National des Sciences de l Information et de leurs Interactions (INS2I) du CNRS. Les thèmes présents au laboratoire relèvent pour leur énorme majorité de la section 06 du Comité National du CNRS. Certaines activités relèvent de la section 41 (ex section 01), et de la section 07. L École polytechnique est organisée en départements enseignement-recherche. Le Département d Informatique est nommé DIX pour Département d Informatique de l X. DIX et LIX entretiennent des liens très é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 DIX 1. Les chercheurs du LIX entretiennent historiquement des liens étroits avec INRIA. Le LIX compte en 2013 en effet 4 Equipes Projets Communes (EPC) avec INRIA. Le LIX a été crée le 28 juin Il a été associé au CNRS et à l INRIA à partir de Le LIX est localisé sur le campus de l École polytechnique. Il occupe depuis septembre 2012 le bâtiment Alan-Turing. Il garde quelques bureaux dans ses anciens locaux dans l aile 0 de l aile des laboratoires de l École polytechnique. Direction La direction du laboratoire sur la période du 1er janvier 2008 à 2013 a été exercé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 à fait suite au départ de Philippe Baptiste pour la direction de l Institut National des Sciences de l Information et de leurs Interactions (INS2I) du CNRS. I Structuration scientifique La structuration du laboratoire en juin 2013 est pour l essentielle celle du mandat : elle s organise autour de trois thèmes: l algorithmique, les réseaux, et les méthodes formelles. Le thème Algorithmes est composé des équipes: Algorithmes et Complexité, surnommée AlCo, dirigée par Miki Hermann. 1 Concrètement, le DIX est constitué des membres du LIX et des enseignants à temps partiels en informatique à l École polytechnique. 21

22 22 CHAPTER I.1. LE LIX Cette équipe s intéresse aux problèmes de satisfaction de contraintes et à leur complexité, aux modèles de calculs et dans une vision plus large aux questions d algorithmique et de théorie de la complexité. Bio-Informatique, surnommée AMIB, dirigée par Mireille Régnier. Cette équipe s intéresse à la biologie structurale: les protéines, l ARN et leurs interactions, et aux problèmes combinatoires liés au séquençage de nouvelle génération. Elle étudie la modélisation du métabolisme du cycle cellulaire. Modèles Combinatoires, surnommée COMBI, dirigée par Gilles Schaeffer. Cette équipe s intéresse aux descriptions combinatoires de structures géométriques, couvrant des problèmes issus de contextes variés (physique statistique, compression de données, topologie énumérative, etc...), et une méthodologie relevant principalement de l algorithmique discrète et de la combinatoire énumérative. Modèles Algébriques et Calculs Symboliques, surnommée MAX, dirigée par Marc Giusti. Cette équipe s intéresse aux calculs symboliques (résolution de systèmes algébriques ou différentiels algébriques), aux applications à la théorie du contrôle, à l analyse complexe effective, et au développement logiciel. Modèles et Systèmes, surnommée SYSMO, dirigée par Antoine Rauzy. Cette équipe s intéresse à l étude des systèmes industriels complexes. Organisée scientifiquement autour de quatre axes (l architecture, l optimisation et la sûreté de fonctionnement des systèmes industriels complexes d une part, la fouille de données d autre part), elle se caractérise scientifiquement par l utilisation d outils formels issus de l informatique théorique pour aborder des problèmes industriels concrets via de nombreux partenariats académiques et hors-académiques. Thème Réseaux composé des équipes: Hipercom, dirigée par Thomas Clausen. Cette équipe s intéresse à la conception et à l optimisation d algorithmes pour les télécommunications pour obtenir les meilleures performances du medium de communication sans fil. Cryptologie, surnommée CRYPTO, dirigée par Daniel Augot. Cette équipe s intéresse: aux algorithmes de base sur les entiers (primalité, factorisation) et sur les courbes algébriques (courbes elliptiques ou hyperelliptiques); aux cryptosystèmes basés sur la théorie algorithmique des nombres; aux codes correcteurs algébriques. En théorie algorithmique des nombres, elle produit des logiciels rapides permettant d établir des records. Thème Méthodes formelles composé des équipes: Comète, dirigée par Catuscia Palamidessi. Cette équipe s intéresse aux fondements du calcul distribué, au développement de méthodes pour la protection de la vie privée, l anonymat et du secret dans les systèmes d informations. Parsifal, dirigée par Dale Miller. Cette équipe s intéresse à l exploration des fondements logiques de la programmation et de la vérification, à la théorie de la preuve, avec l objectif d applications à la conception d outils de preuve et à leur possibilité de partage de preuves en confiance entre outils. Typical, dirigée par Benjamin Werner. Cette équipe vise à contribuer aux formalismes logiques qui permettent la preuve formelle d assertions mathématiques, avec l objectif de preuve assistée de démonstrations mathématiques complexes.

23 I.1.1. PRÉSENTATION DE L UNITÉ 23 I Photographie au 30 Juin 2013 Visibilité scientifique académique Le LIX est un laboratoire très visible sur le plan scientifique et académique: Il a publié 372 articles dans des revues internationales, et 508 articles dans des conférences internationales sur la période du 1ier janvier 2008 au 30 juin Il héberge des chercheurs et enseignants-chercheurs très visibles dans la compé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 très actifs dans la communauté scientifique, et prennent part à des comités éditoriaux de journaux réputés, de nombreux comités de programmes, et aux instances de pilotage des plus grands organismes de recherche. Par exemple: Marc Giusti est rédacteur en Chef exécutif ( Managing Editor-in-Chief ) du journal AAECC (Applicable Algebra in Engineering, Communication and Computing). Léo Liberti est rédacteur en chef de 4OR. Dale Miller est rédacteur en chef de ACM Transactions on Computational Logic (Juin 2009 Mai 2015). Le LIX participe via ses membres aux comités é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 Mathematicum 3, 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-académique: Sur la période 2008 à 2013, il a entrenu en particulier des relations et des contrats avec l ADEME, la DIRIF, les société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 à deux dispositifs Carnot. Il participe, via ses EPC INRIA, au Carnot INRIA. Il est membre dans son intégralité du Carnot Telecom & Société du Numérique. Le LIX contribue de façon très visible et notable à des actions de transfert de technologie, et en particulier de normalisation autour des réseaux de télécommunications. Cela se manifeste par une participation active dans groupes de travail de l IETF. Sur la période 2008 à 2013, 8 standards IETF internationaux ratifiés ont pour auteur des membres du LIX, et certains de ses enseignants-chercheurs (Thomas Clausen) sont extrêmement visibles à l IETF. 2 Ce qui fait près de 3,68 publications par an et par chercheurs+enseignant-chercheurs, le nombre de permanent moyen étant fixé à sa moyenne sur la période, soit 43,42. 3 Jusqu en 2011.

24 24 CHAPTER I.1. LE LIX Les travaux issus du LIX sont aussi à l origine de création de startup et d entreprises. En particulier, la société AL.I.E.N. (acronyme de ALgèbre pour Identification et Estimation Numériques), spin-off de l École polytechnique et de l Université de Lorraine a été fondée à la toute fin de l année 2011 par Cédric Join (Université de Lorraine) et Michel Fliess (LIX). La société AL.I.E.N. a obtenu en 2011 le prix OSEO en catégorie émergence. Le LIX est aussi à l origine de brevets 4 Par exemple, ses collaborations avec EDF et la DIRIF ont conduit à deux brevets dont l École polytechnique est partie prenante. Le brevet avec EDF a obtenu le prix de l innovation en 2010, catégorie brevet. Le LIX participe par ailleurs via ses membres et le DIX à deux chaires industrielles. La chaire Ingéniérie des systèmes complexes, qui est une chaire École polytechnique ENSTA ParisTech Telecom ParisTech Dassault Aviation DCNS DGA Thalès, coordonnée par Daniel Krob. La chaire Optimisation et développement durable, qui est une chaire École polytechnique MICROSOFT CNRS, coordonnée successivement sur la période 2008 à 2013 par Philippe Baptiste et Léo Liberti. Le LIX, via sa chaire Ingéniérie des systèmes complexes est aussi à l origine des séries de confé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 académiques autour des systèmes industriels complexes, avec un comité de programme à parité. Développement logiciel Le LIX est un laboratoire avec une activité forte de productions en logiciels, ou contributions logicielles. Il développe 5 ou contribue au dé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 développés par le laboratoire et des détails dans les détails des contributions de chacune de nos équipes. Certains sont des prototypes, spécialisés et focalisés, et d autres sont des systèmes plus impactants, en dehors de la seule communauté de recherche concernée, et consécutifs à plusieurs années de développement. On peut citer par exemple GNU TEXmacs présent par défaut dans la grande majorité des distributions Linux. Des paquets binaires pour Windows et Mac OS X sont disponibles depuis nos sites Internet. Le logiciel Varna est très populaire parmi les acteurs de la bioinformatique des ARN, et est mis en avant dans le rapport annuel du CNRS en Le système de preuve COQ ou Altarica utilisés et bien connus dans le monde industriel familles de brevets récents, dont 4 sur la période 2008 à dépôts APP avec l École polytechnique et CNRS.

25 I.1.1. PRÉSENTATION DE L UNITÉ 25 La période En 2013, la situation au laboratoire est calme. Cependant, l histoire du laboratoire sur la période 2008 à 2013 reste marquée par une période de fortes turbulences liées à une période de conflit explicite sur la période de 2009 à mi Les origines de ce conflit semblent anciennes, mais le déclencheur semble avoir été la succession à la présidence du département d informatique. Cette période de crise a eu des effets directs et indirects qui se sont manifestés par le départ de plusieurs cadres, chercheurs et enseignants chercheurs du laboratoire. A la fin de cette période le département d informatique de l école polytechnique et le LIX avaient changé respectivement de président et directeur. Les tutelles, et en particulier le CNRS et son comité national ont su aider à cette situation en permettant l arrivée de plusieurs nouveaux jeunes chercheurs, et à faire qu en 2013 le principal employeur au laboratoire soit le CNRS. Cependant, une des conséquences directe ou indirecte mesurables de cet état de fait est d une part une population relativement différente entre le début et la fin du mandat, et d autre part, une pyramide des âges assez différente. En 2013 le LIX souffre d un déficit clair d agents entre 40 et 50 ans, ce qui se manifeste au quotidien par un déficit de cadres. Pyramide des âges. Janvier 2008 Pyramide des âges. Juin 2013 Locaux Le LIX, qui est LE laboratoire d informatique de l École polytechnique, est situé sur le campus de l École polytechnique. Le mandat a vu son déménagement en 2012 pour partie dans ses nouveaux locaux, situés dans le bâtiment Alan Turing du campus de l École polytechnique. Nous écrivons pour partie, car malheureusement, en juin 2013, le LIX est scindé physiquement en deux parties: il occupe pour majorité le bâtiment Alan Turing, mais il garde des bureaux dans ses anciens locaux situés aile 0 de l aile des laboratoires de l École polytechnique. Ce déménagement a cependant clairement permis un gain de surface global pour le laboratoire. Les travaux pour l extension du bâtiment Alan Turing devraient débuter dans l année qui vient (2014) et permettre au LIX de retrouver son unité physique et mettre fin à un problème de locaux freinant sa croissance ou son accueil de personnels. I Séminaires Vie scientifique de l unité La vie scientifique du laboratoire est essentiellement centrée autour de la vie de ses équipes de recherche et des séminaires hebdomadaires du laboratoire. Il est à noter que les séminaires sont parfois transverses à la notion formelle d équipe, ou communs à des laboratoires du plateau de Saclay ou de la région parisienne, et qu ils sont tous ouverts à la libre participation de tous 6 Les séminaires réguliers incluent: Le séminaire d algorithmique et de complexité du plateau de Saclay. Ce séminaire commun au LIX, LRI, PRISM, SUPELEC se réunit au minimum une fois toutes les 2 semaines 6 Hors séminaire des doctorants où les permanents ne sont pas autorisés, sauf autorisation exceptionnelle.

26 26 CHAPTER I.1. LE LIX en période scolaire. Le lieu du séminaire alterne entre les laboratoires chaque année. Le LIX a accueilli les exposés pendant l année scolaire Il est animé par Manuel Bodirsky du LIX, Johanne Cohen et Yannis Manoussakis. Un séminaire commun de l équipe AMIB se réunit chaque semaine, généralement au LRI, en alternant les exposés internes et les invitations. L équipe participe au séminaire biannuel BioNumeo, réunissant les acteurs du plateau en sciences du vivant. L équipe COMBI organise un séminaire hebdomadaire au LIX, essentiellement constitué de présentations de résultats récents par des chercheurs extérieurs au LIX. Ce séminaire est aussi un lieu de rencontre et de réflexion pour les chercheurs de l équipe. Par ailleurs, plusieurs membres de l équipe COMBI assistent régulièrement à d autres séminaires de combinatoire de la région parisienne. Le séminaire Comète-PARSIFAL qui a lieu régulièrement depuis Ce séminaire accueille aussi bien des orateurs locaux qui présentent leur travail en cours comme les visiteurs nombreux de ces équipes. Ce séminaire a été le lieu d échange et de fertilisation croisée des idées entre les deux équipes puisque la logique computationnelle et la théorie de la concurrence jouent un rôle important dans les fondements de leurs recherches. Les équipes MAX et CRYPTO organisent de façon ponctuelle des exposés de séminaire réunissant les membres de ces deux équipes. Ils assistent également aux exposés du séminaire Computations and Proofs organisé par l équipe SpecFun 7 dans le bâtiment Alan Turing. Un séminaire des doctorants a lieu deux fois par mois. Il permet des présentations scientifiques entre doctorants. Les chercheurs permanents ne peuvent pas y assister. Ce séminaire est animé en juin 2013 par J.-P. Meline, qui a succédé à Claire Lucas qui a contribué à sa mise en place en De février 2008 à juillet 2009, un séminaire mensuel de calcul formel pour doctorants appelé Cal4Doc réunissait les doctorants et post-docs des equipes CRYPTO et MAX. Le laboratoire est aussi animé régulièrement par des exposés spontanés qui ne sont pas couverts formellement par ces séminaires. L annonce de tous les séminaires se fait par les listes de courriers du laboratoire, un affichage sur le site du laboratoire, et parfois via les téléviseurs du bâtiment Alan Turing, partagés avec INRIA. Colloque annuel Le laboratoire organise chaque année 8 à l automne son LIX colloquium, qui vise à rendre très visible l une des thématiques du laboratoire. Cet événement, public, visible et attractif, met en avant chaque année un sujet ou un groupe de personnes au laboratoire. Les derniers LIX colloquium ont été: 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 Équipe INRIA Saclay dirigée par F. Chyzak, non rattachée au LIX mais située dans le bâtiment Alan Turing. 8 L édition 2012 initialement prévue a du être annulée.

27 I.1.1. PRÉSENTATION DE L UNITÉ 27 Le LIX colloquium a lieu chaque année sur le site du laboratoire. Pour l organisation d événements ou de séminaires, une des difficultés du LIX est cependant qu il est en région parisienne, mais pas facilement joignable en un temps raisonnable depuis la capitale, en particulier pour des invités étrangers, ou pour des visiteurs pour un événement sur le site. Une des explications 9 étant l absence de logements et de vraie vie sociale à proximité à proposer aux invités ou visiteurs. L École polytechnique offre toutefois un hotel, permettant de s épanouir scientifiquement en soirée sur le site. Appel à postdoc QUALCOMM-CARNOT Le laboratoire a bénéficié pendant le mandat d un don généreux de la société américaine QUALCOMM ( $ US), fléché pour le LIX pour du ressourcement scientifique et des postdoctorants sur les thèmes du laboratoire. Le LIX émet chaque année un appel compétitif international à candidats post-doctorant sur toutes ses thématiques, financé par ce don. La sélection se fait sur une base compétitive basée sur l excellence. Cet événement fait clairement partie de la visibilité du laboratoire à l international et de sa vie scientifique. Le ressourcement obtenu par le CARNOT Telecom & Société du Numérique vient maintenant en complément de la donation QUALCOMM qui arrive à épuisement. Le laboratoire recrute de 1 à 2 postdoctorants par an par ce moyen, en plus des nombreux autres financements provenant de contrats ou projets du laboratoire permettant des recrutements plus ciblés. I Effectifs du laboratoire En Juin 2013, le laboratoire est constitué de 127 membres, se décomposant en 43 chercheurs et enseignants chercheurs, 10 ingénieurs et techniciens administratifs, 2 émérites, 17 post-doctorants, 40 doctorants, et 15 autres (visiteurs, stagiaires). Sa population chercheur et enseignant-chercheur se décompose en 19 chercheurs CNRS, 11 chercheurs INRIA, et 11 enseignants-chercheurs de l École polytechnique. Les 2 émérites sont respectivement 1 professeur émérite et 1 directeur de recherche émérite. La population du LIX est jeune: l âge moyen des permanents est de 41 ans en juin Le CNRS est en 2013 le principal employeur des permanents du laboratoire (44% des chercheurs/ enseignants-chercheurs permanents 10 ). Les autres employeurs sont INRIA (25%), et l École polytechnique (25%). Il est à noter qu en 2008, le rapport entre employeurs n était pas le même: le tableau suivant reprend les évolutions en terme de pourcentages arrondis à l entier inférieur. Fin Juin 2013 Chercheurs CNRS 35% 34% 38% 39% 40% 40% 44% Enseignants-Chercheurs X 25% 28% 25% 25% 22% 22% 25% Chercheurs INRIA 35% 34% 31% 31% 32% 30% 25% Le laboratoire a considérablement évolué sur la période , avec une phase d expansion claire, qui s est suivie plutôt d une décroissance, décroissance s expliquant au moins pour partie par des effets directs ou indirects des turbulences en déjà évoquées (et avec un effet de retard prévisible vu la gestion administrative des mutations). 9 Cet état de fait explique aussi que beaucoup d événements organisés par le LIX ou ses membres, sont à Paris ou ailleurs, et ne sont pas toujours par conséquent aussi perçus en tant que tel, la référence au LIX ne correspondant au plus qu à un logo pour un visiteur lambda. 10 Les 2 émérites ne sont pas comptés dans ces pourcentages.

28 28 CHAPTER I.1. LE LIX Sur une fenêtre de vision plus large, il est à noter que la phase d expansion évoquée n a pas été amorcée en 2008, mais qu elle était déjà très forte dans le mandat précédent. La projection des effectifs en 2008 est déjà très fortement en progression par rapport à 2007 et Fin Juin 2013 Chercheurs ou Enseignants Chercheurs PostDoc Doctorants Ingénieurs Techniciens Administratifs Autre (Visiteur, Stagiaires) Total Graphiquement: Pour les chercheurs et enseignants-chercheurs (décompte hors émérites):

29 I.1.1. PRÉSENTATION DE L UNITÉ 29 Fin Juin 2013 Total Chercheurs Enseignants-Chercheurs Dont chercheurs CNRS Enseignants-Chercheurs X Chercheurs INRIA Autre I Gouvernance du laboratoire Situation actuelle La direction du laboratoire est assurée par son directeur, Olivier Bournez, assisté d une directrice adjointe Catuscia Palamidessi. Le LIX a été historiquement construit autour du concept d équipes, souvent portées par une personnalité très visible, souvent avec une taille réduite. Depuis sa création, le LIX fonctionne sans conseil de direction, avec un conseil de laboratoire ou l ensemble des responsables d équipes sont membres de droit. Le nombre d équipes, et donc de membres de droit, ramenés au nombre de candidats potentiels pour être élu en conseil de laboratoire fait que le conseil de laboratoire a un fonctionnement en pratique proche de celui normalement associé aux assemblées générales. Le laboratoire convoque toutefois sur une base au minimum annuelle des assemblées générales, conformément à son règlement intérieur. Ce règlement intérieur, mis en place début 2012, fixe pour l essentiel 11 des règles conformes au fonctionnement usuel du laboratoire. Le transfert d informations s effectue en pratique soit par l intermédiaire de points d informations en conseil de laboratoire, conseils de laboratoire qui fonctionnent souvent sur un mode d assemblée générale mensuelle, soit pour l essentiel via des messages électroniques via les différentes listes de diffusion du laboratoire, organisées par équipe, et type de personnels. Evolutions envisagées pour le nouveau mandat Le directeur a proposé à l Assemblée Générale (AG) du laboratoire le 14 mai 2013 la mise en place d un conseil de direction. Après un exposé du directeur expliquant les raisons l invitant à faire cette proposition, l Assemblée Générale a voté à 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 été soumise au vote en assemblée générale. Sur toute la période , le laboratoire était organisé en 3 thèmes, chaque thème contenant des équipes. La notion de thème est essentiellement utilisée pour présenter le laboratoire. Le laboratoire et son directeur, en accord et sur invitation des tutelles, après consultation des responsables d équipes, à proposé vers fin mai 2013 d organiser dorénavant le laboratoire en axes, avec une notion plus forte d axe, permettant une meillleure gouvernance du collectif. Chaque axe possédant un coordinateur d axe. Après consultation des responsables d équipes, le directeur a proposé un découpage en trois axes (présenté plus loin), dont les coordinateurs sont respectivement Daniel Augot, Dale Miller, et Gilles Schaeffer. Ce découpage a été présenté en conseil de laboratoire et aux responsables d é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 président de département d informatique de l École polytechnique, et les responsables d axes. Le fonctionnement proposé est le suivant. Chaque axe est constitué d équipes. Chaque membre du laboratoire est membre d une équipe, et donc d un axe. Le rôle des coordinateurs d axe 11 En créant cependant formellement l assemblée des responsables d équipes.

30 30 CHAPTER I.1. LE LIX est de contribuer au pilotage du laboratoire via le conseil de direction et la définition, en accord avec les responsables d équipes, du projet scientifique du laboratoire et des axes. Le conseil de direction, qui vise à se réunir chaque semaine, a pour but d aider le directeur pour la prise de décisions à échéances rapides, en complément de l assemblée des responsables d équipes ou du conseil de laboratoire qui se réunit sur une base mensuelle. Un des rôles des responsables d axes et du conseil de direction proposé est d aider à la diffusion d informations ascendantes et descendantes, et à l interface avec les sollicitations nombreuses extérieures. Le directeur souhaite soumettre à l approbation en assemblée générale le fonctionnement adopté dès que possible. Plusieurs éléments sont encore à préciser, ou en discussions au moment où ces lignes sont écrites. On trouvera un organigramme fonctionnel dans le document contenant les annexes (Annexe 4). I Administration et services Le laboratoire dispose d un secrétariat, composé de Sylvie Jabinet (CNRS) et d Evelyne Rayssac (École polytechnique), ainsi que Valérie Lecomte et Christelle Liévin, Assistantes d Equipes de Recherche (AER) INRIA. Chaque équipe du laboratoire se voit affecter une de ces quatre assistantes. L assistante d équipe est l interlocutrice privilégiée des membres de l équipe. En pratique, Sylvie Jabinet et Evelyne Rayssac assurent la supervision respectivement CNRS et X de l unité, en plus de la gestion des équipes qui leur sont affectées 12. Le service informatique du LIX est constitué en juin 2013 d une unique personne, James Régis. Un poste d IE CNRS au concours va permettre de revenir à une situation tolérable normalement au 1er décembre En 2008, le service informatique du LIX contenait trois ingénieurs. Il a principalement en charge la gestion du réseau, des terminaux lé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 matériel individuels. Une des fonctions principales est de faire évoluer l architecture systèmes du laboratoire en fonction des besoins des équipes administratives et de recherche du laboratoire. Le système d information du LIX doit aussi être disponible 24h/24, 7jours/7 pour permettre aux nombreux membres de se connecter, quelles que soient leurs localisations. Le LIX possède également un ensemble de commissions en charge de questions spécifiques: La commission en charge de la sélection des postdocs Qualcomm/Carnot. Le directeur nomme chaque année en conseil de laboratoire une personne chargée de superviser la sélection des postdocs. Cette personne doit mettre en place un comité de sélection, réprésentant les domaines variés de recherche au LIX. Le comité de sélection propose un classement des meilleurs candidats au directeur du LIX, aprè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 priorités, le suivi des projets en cours avec le service informatique, et de veiller à la diffusion de l information, et à détecter les besoins en formation des utilisateurs. La commission en charge de l affectation des bureaux. Cette commission réduite à une personne, a en charge l affectation des bureaux. Dans nos nouveaux locaux, les membres d une même équipe sont à proximité. La plupart de nos membres permanents ont un bureau seul ; une minorité est dans des bureaux partagés (deux par bureau). Les post-doctorants et doctorants sont installés dans des bureaux partagés (trois par bureau). Grâce au travail de cette 12 Valérie Lecomte et Christelle Liévin ont par ailleurs régulièrement des sollicitations venant de leur organisme employeur pour des tâches non-couvertes par le LIX.

31 I.1.1. PRÉSENTATION DE L UNITÉ 31 commission pendant ce mandat, la gestion des bureaux est en 2013 partiellement automatisée: lorsqu un nouvel arrivant arrive au LIX, leur chef d équipe ou assistante dépose une demande de bureau via un formulaire web. Sous réserve de disponibilité des bureaux, un bureau lui est proposé. La commission a en charge de proposer des solutions au mieux pour les cas qui ne peuvent pas être gérés directement. La commission a eu par ailleurs un travail ponctuel, mais substantiel, lors du déménagement partiel du laboratoire dans le bâtiment Alan Turing. Concernant l hygiène et sécurité, le LIX possède un assistant de prévention. L assistant de prévention (James Régis en juin 2013) contribue à la mise en œuvre de la politique de santé et de sécurité au travail dans le laboratoire. Sa mission est d assister et d alerter le directeur d unité dans la démarche d évaluation des risques, dans la mise en œuvre d une politique de prévention des risques et dans la mise en place des règles de sécurité et d hygiène au travail. Depuis notre arrivée dans le bâtiment Alan Turing en copropriété avec INRIA, le travail de l assistant de prévention du LIX se fait en coordination avec l assistant de prévention INRIA du bâtiment, dans la mesure du possible. L École polytechnique possède par ailleurs un comité hygiène et sécurité, commun avec le CNRS, qui assure un suivi de l ensemble des questions reliées sur le site, et avec lequel nous travaillons en relation directe. I Moyens et évolutions Le budget du laboratoire dépend essentiellement des sources de financement suivant: les tutelles CNRS et École polytechnique, l ANR, la Commission Européenne et des contrats industriels directs. Cas particulier des EPC INRIA Les équipes projets communes (EPC) avec INRIA reçoivent par ailleurs des financements via INRIA: le directeur ne possédant pas toutes les informations 13 requises pour en parler avec le même niveau de détails que les autres financements, il fait le choix de discuter des ressources hors ressources géré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 (à gauche) et Dépenses (à droite) de 2008 à Ces données sont hors salaires des permanents, et hors financements gérés par INRIA. Les figures suivantes présentent l évolution de nos ressources et dépenses. 13 Il ne les reçoit pas spontanément. Il en a fait la demande le 27 Septembre A la date du 15 Octobre 2013, il estime ne pas avoir suffisemment d informations pour donner de vrais détails.

32 32 CHAPTER I.1. LE LIX Figure I.1.2: Ressources de 2008 à juin 2013 (en euros). Ces données sont hors salaires des permanents, et hors financements gérés par INRIA. Les données 2013 ne correspondent pas à une année complète et sont donc difficiles à interpréter. Figure I.1.3: Dépenses de 2008 à juin 2013 (en euros). Ces données sont hors salaires des permanents, et hors financements gérés par INRIA. Les données 2013 ne correspondent pas à une année complète et sont donc difficiles à interpréter. Comme nous l avons déjà écrit, le LIX a bénéficié de façon notable d une donation de la société QUALCOMM sur la période Il a utilisé cette ressource pour le recrutement de postdocs et de missions reliées. Le laboratoire n impose pas ses équipes sur leurs contrats. Le Carnot Telecom & Société du Numérique permet cependant un retour sur les activités partenariales de ses équipes. Les subventions directes des tutelles, le don QUALCOMM et l argent résultant des retours Carnot constituent donc les uniques ressources pour le fonctionnement du laboratoire proprement dit. Ce budget est utilisé pour couvrir toutes les dépenses relevant du fonctionnement global du laboratoire: fournitures, achats de serveurs, d ordinateurs, photocopies, etc. Une partie des ressources est affectée par le directeur aux é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 équipe.

33 I.1.2. RÉALISATIONS 33 I.1.2 Réalisations I Production scientifique sur le mandat On trouvera un détail des réalisations sur le mandat dans les fiches de chacune des équipes: en particulier, on trouvera une fiche résumée présentant une synthèse volontairement très courte. Nous ne reprendrons pas ici les éléments déjà mis en avant dans ce document. Voici quelques éléments macroscopiques non encore cités: Bilan quantitatif Bilan quantitatif du mandat 2008-Juin 2013: Livres, chapitres de livres, numéros spéciaux, édition d actes 83 Documents pédagogiques 9 Revues internationales 372 Revues nationales 10 Conférences internationales 508 Conférences nationales 26 Logiciels 22 Brevets 5 Normalisation (RFC) 9 Normalisation (Contributions) 80 Thèses 53 HDR 4 Conférences Invitées 27 Rapports techniques 65 Autres 49 Figure I.1.4: Bilan quantitatif Janvier 2008-Juin Distinctions et prix 2013: 2012: 2011: L ANR GAIA, dans laquelle Frank Nielsen était largement impliqué, a reçu en 2013 le grand prix ANR du numérique. Dale Miller a reçu la très prestigieuse ERC Advanced Grant pour la période pour son projet ProofCert. Romain Lebreton a remporté le prix du meilleur article étudiant à la conférence internationale ISSAC 12, et le prix du meilleur poster de la part du Fachgruppe Computer Algebra à ISSAC 12. Léo Liberti a terminé en 2ème position dans la section Modularity Clustering Quality Challenge du 10ème DIMACS Implementation Challenge en Dale Miller a remporté le LICS Test-of-Time Award en 2011 pour un article co-écrit avec Joshua Hodas dans LICS 1991.

34 34 CHAPTER I.1. LE LIX 2010: 2009: 2008: Ben Smith a reç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 réelle. Vincent Jost et David Savourey et leur équipe ont remporté le challenge ROADEF- EURO-EDF dans la catégorie Senior en Michel Fliess a reçu le Prix de l innovation de l École polytechnique 2010, catégorie brevet, pour un brevet sur les aménagements hydroélectriques. Claudia D Ambrosio a reçu le prestigieux European Doctoral Dissertation Award en 2010 qui détermine la meilleure thèse en Europe. François Morain est détenteur de plusieurs records mondiaux avec fasteccp, qu il améliore de façon continue, à partir de programe de preuve de primalité ECPP développé dès le début des années Son record personnel est à environ chiffres, présenté à la conférence ECC2010, pour les 25 ans de la cryptographie à courbes elliptiques. Le travail de Léo Liberti en reformulation en programmation mathématique a reçu le 2ième prix ROADEF Robert Faure en 2009 (prix décerné tous les 3 ans par la société Française de recherche operationelle ). Luca De Feo a reçu le SIGSAM Distinguished Student Paper Award à ISSAC 09. La thèse d Alexis Saurin a remporté le Prix de thèse de l École polytechnique et le Prix de thèse ASTI Christoph Dürr a obtenu le prix du meilleur article dans la conférence European Symposium on Algorithms (ESA) en G. Chapuy a obtenu le prix du meilleur article étudiant à la conférence FPSAC 2009 pour son article A new combinatorial identity for unicellular maps, via a direct bijective approach. Ben Smith a reçu comme seul auteur le Eurocrypt 2008 best paper award. Konstantinos Chatzikokolakis, doctorant au LIX, a reçu l accessit du Prix de thèse Gilles Kahn en Novembre Andreas Enge a reçu le Selfridge Prize of the Number Theory Foundation pour le meilleur article présenté à ANTS-VIII, I Le LIX dans son environnement L École polytechnique Le DIX Le LIX est le laboratoire d informatique de l École polytechnique qui compte 20 laboratoires. Nous détaillons ci-après la part importante prise par le LIX dans la formation par la recherche. Plus généralement, l enseignement à l École polytechnique est, pour une large part, effectué par des enseignants à temps partiel, le plus souvent titulaires d un emploi principal de chercheur (CNRS, INRIA... ) et d enseignants-chercheurs en université. C est la politique actuelle du dé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 résidents sont naturellement plus proches des élèves, et d autre part pour favoriser l attractivité du LIX. Un peu moins de 20 membres permanents du LIX sont titulaires d un contrat d enseignant ou d enseignant-chercheur, à temps plein ou à temps partiel, avec l École polytechnique. Un nombre

35 I.1.2. RÉALISATIONS 35 comparable de membres du LIX interviennent dans les enseignements de l École (de L3 à M2) comme vacataires. Les membres du LIX sont aussi structurants pour le département (DIX): Benjamin Werner est président du DIX, Olivier Bournez et François Morain en sont viceprésidents. Dominique Rossin, Stéphane Lengrand, Luca Castelli et Philippe Chassignet sont membres du comite enseignement-recherche du département. Jean-Marc Steyaert et Stéphane Lengrand sont membres de la commission des thèses de l EDX (École Doctorale de l X). Gilles Schaeffer représente l École polytechnique à la commission des études du MPRI, Leo Liberti joue un rôle similaire au MPRO, Daniel Krob anime le Master COMASIC. etc... Les laboratoires de l École polytechnique Les laboratoires de l École polytechnique avec lesquels le LIX entretient au jour le jour le plus de contacts scientifiques sont le CMAP, laboratoire de mathématiques appliquées de l École, ainsi que le CMLS, laboratoire de mathématiques pures, et le LOB, laboratoire d optique et biosciences, avec lequel il entretient principalement des collaborations sur les aspects biologie/bio-informatique. Les réunions mensuelles des directeurs de laboratoires permettent des échanges réguliers sur la vie et la stratégie scientifique de l École Polytechnique, et sur les évolutions de notre environnement en particulier dans le contexte de l Université Paris Saclay. Le LIX bénéficie grandement de l efficacité de membres du service des relations industrielles et partenariales (DRIP) de l École polytechnique (tout particulièrement Sylvie Tonda) dans le cadre de ses interactions avec le monde non académique. L École polytechnique a mis en place plus récemment une direction de l innovation et de l entrepreneuriat qui nous attire de nouveaux contacts industriels. Les doctorants du LIX sont pour leur énorme majorité inscrits à l École Doctorale de l X (EDX) qui offre les avantages d une école doctorale pluridisciplinaire et de taille raisonnable. Le CNRS Le LIX dont son ensemble est fortement impliqué 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 contribué à mettre en place l Institut National des Sciences de l Information et de leurs Interactions (INS2I) du CNRS. Il l a dirigé de 2010 à Dominique Rossin est membre du conseil scientifique de l INS2I. Plusieurs membres du LIX participent au comité national du CNRS: Yann Ponty est membre élu du comité national du CNRS, en Sciences de l information : fondements de l informatique, calculs, algorithmes, représentations, exploitations (section 6) et Modélisation et analyse des données et des systèmes biologiques : approches informatiques, mathématiques et physiques (CID 51). Dominique Rossin a été membre du comité national du CNRS en section 07. Le LIX est par ailleurs très actif dans plusieurs GdR du CNRS. Gilles Schaeffer a été responsable du pôle Algorithmique et combinatoire du GdR Informatique Mathématique du CNRS. Stéphane Graham-Lengrand est responsable du groupe de travail Logique, Algèbre, Calcul du même GdR.

36 36 CHAPTER I.1. LE LIX Yann Ponty est animateur de l axe Structure et interactions des macromolécules du GDR 3003 Bioinformatique Moléculaire. Plus généralement, de nombreux membres du LIX participent à des jurys ou commissions du CNRS. INRIA Les membres du LIX entretiennent des relations très étroites et actives avec INRIA. En particulier, en 2008, 7 des équipes sur 10 étaient, ou étaient en passe de devenir, ou hébergeaient des Equipes Projets Communes (EPC) INRIA. Actuellement, 4 équipes du LIX sont, ou hébergent une partie d une EPC INRIA. À savoir: l équipe Comète correspond à l EPC du même nom; l équipe PARSIFAL correspond à l EPC du même nom; l équipe CRYPTO correspondait à l EPC TANC, qui a donné naissance à l EPC GRACE; l équipe AMIB héberge une partie de l EPC AMIB répartie sur le LIX et le LRI. Par ailleurs, l équipe TYPICAL a hébergé l EPC du même nom qui prenait la suite de l EPC LOGICAL. Elle s est arrêtée au 31/12/2012. L équipe MAX hébergeait une partie de l EPC ALIEN répartie sur le LIX et le LAGIS (École Centrale Lille). Cette EPC s est arrêtée au 31/12/2010. L équipe HIPERCOM hébergeait une partie d une EPC répartie sur le LIX, le LRI et le centre INRIA-Rocquencourt. Cette EPC s est arrêtée au 31/12/2012. Depuis plusieurs années, de nombreux membres du LIX sont impliqués dans différents comités et instances de l INRIA. On signalera entre autres, au niveau local (pour le centre Saclay-Île-de- France), les participations de D. Augot, M. Régnier, D. Miller et C. Palamidessi au comité des projets, de B. Smith comme membre élu du comité de centre et de D. Augot à la direction du suivi doctoral. Au niveau national, C. Palamidessi est depuis 2007 membre du Comité d Orientation Scientifique et Technique, O. Bournez a siégé en 2011 au membre du jury d admission CR et B. Werner a été membre du conseil scientifique de 2008 à Depuis 2012, le LIX est dans le bâtiment Alan Turing qui est en copropriété avec INRIA, qui en assure la gestion. Cette présence géographique a clairement pour effet une meilleure connaissance mutuelle et plus d échanges scientifiques et sociaux. Stratégiquement, plusieurs projets d équipes communes avec INRIA sont envisageables, dépassant le seul cadre du LIX. Le directeur du LIX avoue cependant déplorer une difficulté de cogestion avec la gouvernance INRIA, INRIA ne reconnaissant pas clairement la notion d UMR, et donc le rôle du directeur d unité. Les accords récents INRIA/CNRS, et la déclinaison locale pour le LIX avec l École polytechnique devraient être des avancées dans ce sens 14. Le CEA L équipe MeASI était en 2008 en partie commune avec le CEA. Seule la partie relevant strictement du LIX apparaissait dans le rapport d activité, en raison des termes de l accord régissant le statut de cette équipe avec le CEA. Nous continuons à entretenir des liens forts avec l équipe du CEA-List dirigé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 à la structuration en équipes (et en thèmes) du LIX. On peut citer par exemple: des publications communes avec l équipe SYSMO, un projet ANR ASOPT et un projet OMTE DIGITEO communs avec SYSMO; 14 Même si depuis qu un projet de texte est discuté, il n y a plus de réunions de site entre X, CNRS et INRIA. La dernière réunion de site remonte à mars 2011.

37 I.1.2. RÉALISATIONS 37 le projet ANR PANDA et le projet ANR CPP communs avec l équipe Comète et l équipe PARSIFAL; et un projet DIGITEO PASO commun avec les équipes SYSMO et TYPICAL; et plus généralement beaucoup d échanges scientifiques aussi bien sur la sémantique du parallé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 École polytechnique, avec un professeur à temps partiel et un chargé d enseignement partiel et de nombreux vacataires, avec en particulier des cours en L3, M1 et la responsabilité d une filière du M2 COMASIC. L ERC MeASI a également accueilli en stage des élè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 été systématiquement été inscrits à l École Doctorale de l École polytechnique, avec notablement Olivier Bouissou (2ème prix Gilles Kahn 2009) et Xavier Allamigeon (1er prix Gilles Kahn 2010). L université de Paris Saclay L UPSay L ensemble des établissements et des laboratoires du plateau de Saclay (et donc le LIX) sont impliqués dans la construction de l université de Paris-Saclay (UPSay). Il s agit d un projet extrêmement ambitieux, visant à construire une université des premiers rangs mondiaux, construite par la collaboration de 23 établissements partenaires. Le campus Paris-Saclay est une fondation de coopération scientifique (FCS) en charge de ce projet. Les 23 partenaires de la Fondation de Coopération Scientifique Campus Paris-Saclay. Le projet de l UPSay est un gigantesque chantier très ambitieux, nécessitant de faire coopérer différents organismes et entités au fonctionnement à priori assez différents. Grâce à l initiative IDEX, un financement important soutient la création de l UPSay: un capital de 900 Meuros est détenu par la fondation, dont les intérêts vont à l UPSay. Les partenaires évoqués précédemment du LIX, à savoir l École polytechnique, le CNRS et l INRIA, et le CEA en sont des partenaires. En considérant l informatique en général, Télécom ParisTech, l ENS Cachan, le CEA, l université Paris-Sud, et l université de Versailles Saint-Quentin en Yvelines sont aussi partenaires. Les objectifs identifiés comme devant concourir à la création de l UPSay sont: un unique diplôme de doctorat, des diplômes de master avec des cours en anglais, des publications scientifiques signées par des scientifiques s affiliant à l université de Paris-Saclay, un campus attractif rapidement mis en place, pour les étudiants, les enseignants et les chercheurs, des services de soutien à l accueil des étrangers. On parle ici de étudiants et de chercheurs (ordre de grandeur / les chiffres sont variables suivant les sources).

38 38 CHAPTER I.1. LE LIX Création de l UPSay Pour réaliser ces objectifs, et pour encourager, organiser la communauté, les structures suivantes ont été créées ou existent déjà à ce jour: un comité exécutif; un sénat académique; 11 laboratoires d excellences (LABEX) ont été sélectionnés dont le LABEX Digicosme, qui est celui consacré au STIC, voir plus bas; différents outils: des chaires, des projets exploratoires et de soutien (PEPS), des projets phares... Quand l UPSay verra le jour (printemps 2014, première année académique démarrant en septembre 2015), elle devrait être structurée comme suit: onze schools pour l enseignement, dont une intitulée school for Engineering, Information Science and Technology; 17 écoles doctorales 15. Une grande école doctorale (900 étudiants), ED-STIC, sera consacrée aux STIC. Cette école rassemblera et unifiera des écoles doctorales déjà présentes sur plusieurs sites: l EDITE (UPMC and Télécom ParisTech), celles de l ENS Cachan, de l École Centrale Paris, l école doctorale en informatique de l université Paris- Sud et de Supélec, de l École polytechnique, de l université d Évry val-d Essonne, de l université Versailles Saint-Quentin. Le Labex Digicosme, voir plus bas. Des départements pour la recherche, parmi lesquels un département STIC. Le RTRA Digiteo (voir plus bas) a vocation à construire le département STIC, et le Labex Digicosme à représenter un périmètre plus étroit dans ce département. Un Equipex Digiscope pour la visualisation à base de calcul à haute performance, dont le LIX n est pas partenaire, qui sera au sein du département STIC. Un institut de la société du numérique, porté par l INRIA, est en train de se mettre en place, pour aborder les questions sociétales liées à la diffusion massive des technologies numériques dans la société. Il sera dans le département STIC. D autres instituts existent en dehors de nos domaines. Un Institut de recherche technologique, l IRT SystemX. Il est dédié à l ingénierie numérique des systèmes du futur. Ses deux programmes de recherche Systèmes de systèmes et Technologies & outils d ingénierie numérique sont dédiés aux priorités technologiques que sont l énergie, les transports et la mobilité, les télécommunications, et la sécurité et la défense. Rassemblant d ores et déjà 44 partenaires dont 35 industriels, l IRT SystemX a comme rôle de faciliter le transfert de technologies et de compétences vers l industrie. Il se veut un véritable accélérateur d innovation pour les produits et services des entreprises partenaires, leur permettant ainsi d améliorer leurs performances socio-économiques et s appuiera sur les trois instituts Carnot leaders dans le numérique : CEA, INRIA et Institut Mines-Telecom. Le LIX participe à sa hauteur à cette construction. En particulier, via sa représentation à différents groupes de travail, à la construction de l ED-STIC, la construction du département STIC, ou sa participation au sénat académique (le directeur du LIX est membre élu du collège des directeurs de ce sénat / Eric Goubault de l ERC MEASI est membre élu du collège des chercheurs de ce sénat). 15 Alors que 24 existent maintenant.

39 I.1.2. RÉALISATIONS 39 Il est très difficile d énumérer les différents groupes de travail à ce jour, et le LIX participe à plusieurs d entres eux. Par exemple, Julie Bernauer représente l INRIA dans le groupe de travail Biologie de l IDEX, et Benjamin Werner repré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 théorie, la conception, le développement et la vérification de systèmes logiciels. C est une fonction de coopération scientifique créée par les acteurs principaux du plateau de Saclay dans le domaine: à l origine le CEA, le CNRS, l INRIA, l École polytechnique, Supélec et l université Paris- Sud, rejoints ensuite par l ENS Cachan, l École Centrale de Paris, l ENSTA Paris-Tech, Mines ParisTech, TelecomParisTech and l UVSQ. Ces institutions sont représentées dans le comité de pilotage, dirigé par M. Robin. Digiteo a aussi géré les fonds de l Île-de-France alloué au DIM SLC: domaine d intérêt majeur en logiciel et systèmes complexes. Il possède un comité de pilotage auquel le LIX est représenté par Olivier Bournez et Benjamin Werner, et un comité de programme en charge de sélectionner les demandes de financement, dont Daniel Augot et Mireille Régnier font partie. Un objectif visible de ce réseau est d attirer des jeunes chercheurs. En sus des financements de post-doctorants, de doctorants, et d invitations courtes, Digiteo a financé onze chaires accueillant des scientifiques étrangers séjournant au moins trois mois par an dans un laboratoire membre de Digiteo. Le LIX a été partenaire de cinq chaires, dont un des bénéficiaires, M. Vazirgiannis, a finalement été recruté par l École polytechnique en Digiteo vise aussi à animer la collectivité, en organisant des journées thématiques, un séminaire -digiteo-seminar-, un forum annuel et un soutien aux manifestations scientifiques. Digiteo accomplit aussi une mission de valorisation à travers le dispositif des opérations de maturation technique et économique (OMTE) visant à amplifier le transfert des technologies abouties issues de la recherche. Ce dispositif est à l origine de la proposition d une société d accélération de transfert de technologies (SATT) dans l université de Paris-Saclay. Un partenariat privilégié avec le pôle de compétitivité Systematic a conduit à la cré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 sélectionné dans l appel LABEX. Il s agit de la proposition de LABEX qui a émané de la communauté STIC du plateau de Saclay. Par rapport au RTRA Digiteo, il est plus restrictif sur ses domaines de couverture et vise à créer une organisation cohérente et visible de la recherche et de l enseignement dans nos disciplines. Digicosme diffère de Digiteo principalement dans deux aspects: le labex est plus ciblé scientifiquement à travers trois tâches (SciLex, ComEx, DataSense), et s investit de manière nette dans l enseignement. Les trois tâches ciblées par Digiteo sont: Scilex (sécurité et sémantique), ComEx (réseaux et télécoms), DataSense (données et visualisation). Toutes les équipes du LIX prennent part à DigiCosme: AlCo, Comète, CRYPTO, MAX, PAR- SIFAL, SYSMO relativement à la tâche SciLex, HIPERCOM à la tâche Comex, et AMIB, COMBI à la tâche DataSense. Les moyens proposés par Digicosme pour renforcer l intégration de la recherche en informatique dans l UPSay sont pour l instant: une conférence annuelle, des écoles de jeunes chercheurs, et des journées industrielles. Un autre moyen d action dont s est doté Digicosme pour une part importante de son budget est le financement d étudiants étrangers pendant leurs deux années de master, ainsi que des thèses. Le processus d attribution des financements de thèse est partagé avec celui de Digiteo, dont les classements issus du comité de programme sont utilisés par Digicosme. Le labex soutiendra aussi des initiatives pédagogiques comme des mini-cours par des professeurs invités, l accès à des plateformes de recherche, et des projets de transfert, d innovation et d entrepreneuriat. Sa coordinatrice est Christine Paulin-Mohring (LRI). Il possède un comité exécutif, un conseil des tutelles, un conseil scientifique, une commission recherche et innovation, et une commission formation. Cette commission de formation a déjà établi un programme commun d enseignement

40 40 CHAPTER I.1. LE LIX en informatique au niveau L3 devant être adopté par tous les établissements d enseignement de l UPSay. Les laboratoires impliqués dans DigiCosme sont: LRI UMR 8623 U. Paris-Sud, CNRS LIMSI/CHM UPR 3251 CNRS LIST CEA MAS EA 4037 École Centrale Paris UEI ENSTA LSV UMR 8643 ENS Cachan, CNRS LIX UMR 7161 Polytechnique, CNRS CRI Saclay Île-de-France INRIA CRI Paris Rocquencourt INRIA LTCI UMR 5141 Télécom ParisTech, CNRS SAMOVAR UMR 5157 Télécom SudParis, CNRS E3S EA 4454 Supélec L2S UMR 8506 Supélec, U. Paris-Sud, CNRS PRISM UMR 8144 U. Versailles St-Quentin, CNRS Laboratoires impliqués dans Digicosme. Olivier Bournez est membre du comité de pilotage du labex Digicosme (le LIX est dans la catégorie des membres fondateurs). Catuscia Palamidessi représente le LIX dans la commission recherche et innovation de Digicosme. B. Werner (resp. D, Augot) représente le DIX (resp. INRIA) dans la commission commission formation de Digicosme. Environnement scientifique national Les équipes du LIX collaborent avec de nombreuses autres équipes d autres laboratoires français: on peut mentionner par exemple des collaborations formalisé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 énumérées en annexe par équipes, avec quelques lignes relatives au sujet de chacune. Environnement scientifique International Il serait très pénible d énumérer ici toutes nos relations à l international: elles sont décrites ou peuvent se retrouver facilement à partir des parties relatives à chaque équipe. Par ailleurs, beaucoup de nos équipes sont constituées pour leur forte majorité d étrangers et sont spontanément internationales. On peut toutefois citer plusieurs collaborations formalisées par des projets internationaux avec l Allemagne (Bonn, Bern, Sarrebruck), l Argentine (Buenos Aires), l Autriche (Vienne, Innsbruck), le Brésil (Sao Paulo), le Canada (Montréal McGill), la Colombie (Santiago de Cali), le Chili (Santiago), la Chine (Hong Kong, Pékin, Shanghai), l Italie (Bologne, Pise), le Portugal (Lisbonne), la Russie (Moscou), les USA (Stanford, Pittsburgh CMU, Univ. Minnesota). I Nationale Animation Le LIX est fortement impliqué dans la vie et l animation des GdR du CNRS: voir le texte plus haut pour le CNRS. Le LIX est aussi fréquemment impliqué dans des missions classiques d expertise au niveau national pour le monde académique: comités ANR, comités d évaluation DGA, ONERA, participation aux groupes de travail d Allistène, participation à des comités scientifiques d universités ou d écoles d ingénieurs.

41 I.1.2. RÉALISATIONS 41 Hors du monde purement académique, il a aussi été impliqué dans des comités de normalisation, ou des convocations à des auditions par des missions de l Assemblée nationale (concernant la loi Hadopi et concernant les droits de l individu dans la révolution numérique). On retrouvera ces éléments détaillés par équipe. Internationale Outre sa participation à différents comités éditoriaux de revues internationales (voir section I.1.1.3), les membres du LIX prennent aussi part à des comités de programme et/ou de pilotage de conférences ou de société savantes, ou à l organisation d événements. On peut par exemple citer: Comités de programmes et/ou de pilotage de conférences ou sociétés savantes : AAAI, ANTS, CADE, CSDM, CSL, CONCUR, CPP, DEDM, DISC, EATCS, ESOP, ETAPS, FCT, FOSSACS, FP- SAC, ICALP, IJCAR, ISMB/ECCB, ISSAC, LICS, LPAR, MEGA, POST, SODA, STACS, TAMC, WCC Organisation de conférences internationales : par exemple ANTS-IX, ICMS 2010, ECML/PKDD 2011, WCC 2011, ISSAC 2012, FPSAC 2013 Le LIX est aussi fréquemment impliqué dans des missions classiques d expertise au niveau international comme par exemple des comités d évaluation d universités étrangères, jury de prix de thèses internationaux, jury de sélection de projets pour la commission européenne, jury internationaux de meilleurs papiers ou de prix internationaux. Il intervient aussi pour des agences nationales étrangères comme par exemple pour les déclinaisons des agences de recherche en Belgique, Canada, Italie, Grèce, Pays-Bas, Roumanie, Suisse et Taiwan. On retrouvera ces éléments détaillés par équipe. Vulgarisation et diffusion scientifiques Les membres du LIX sont fortement impliqués dans la diffusion scientifique sous des formes variées: Rédaction d articles dans les revues et journaux de vulgarisation comme La recherche, Interstices ou interview pour des vidéos de vulgarisation. Intervention dans des écoles primaires, Lycées, ou devant des professeurs de lycée, ou dans des salons comme Culture et jeux mathématiques ou au Festival PariScience. Intervention dans la nuit des chercheurs, événement annuel organisé sur le site de l École polytechnique, ou à la fête de la science chaque année. Participation à Unithé ou café, séminaire de vulgarisation de l INRIA Saclay. Les membres du LIX sont aussi régulièrement invités à faire des exposés invités à des conférences internationales. Citons par exemple des invitations de membres du LIX à ANTS-8, ECC 9 à ECC 13, LICS 2010, ICALP I Évolutions sur le mandat Evolutions de structuration La structuration du laboratoire en équipe a été modifiée en février 2010 juste avant le départ de son précédent directeur (Philippe Baptiste) pour l INS2I: la partie du LIX qui est désignée par MEASI dans le rapport d activité pour le précédent mandat, désigne l union des équipes actuelles AlCo et SYSMO du LIX. En 2008, MEASI était constituée en effet d une partie du LIX (devenu AlCo et SYSMO) et de l équipe du CEA LIST dirigée par Eric Goubault.

42 42 CHAPTER I.1. LE LIX Conformément aux textes régissant avec le CEA l équipe du CEA LIST dirigée par Eric Goubault, il n avait pas été possible de faire figurer au rapport d activité du LIX, l ensemble de l équipe MEASI comme une seule équipe. L acronyme MeASI désigne de fait dorénavant l équipe du CEA LIST dirigée par Eric Goubault. Cette équipe, désignée par le vocable équipe associée, correspondant à une équipe qui n est pas membre du LIX au sens de notre rapport d activités. La structuration du laboratoire n a pas été modifiée depuis 2010, même si plusieurs responsables d équipes ont été changés. Recrutements/Départs sur le mandat Par équipe Si l on étudie l évolution en termes d effectifs chercheurs et enseignants-chercheurs des équipes, on obtient le tableau suivant 16 Fin Juin 2013 AlCo AMIB COMBI MAX SYSMO HIPERCOM GRACE Comète PARSIFAL TYPICAL Exprimé en termes de pourcentages de l effectif chercheurs/enseignants-chercheurs: Graphiquement: Fin Juin 2013 AlCo 6% 10% 9% 8% 8% 8% 6% AMIB 9% 7% 11% 12% 12% 10% 13% COMBI 6% 10% 15% 16% 16% 18% 18% MAX 9% 7% 9% 10% 10% 10% 9% SYSMO 6% 7% 6% 8% 10% 10% 9% HIPERCOM 9% 7% 6% 6% 8% 6% 2% GRACE 9% 10% 9% 8% 8% 10% 11% Comète 9% 7% 6% 6% 8% 8% 9% PARSIFAL 12% 10% 11% 10% 10% 10% 11% TYPICAL 19% 18% 13% 12% 10% 10% 6% Janvier 2008 Juin Pour les équipes AlCo et SYSMO la lecture n est pas aisée pour une année antérieure à 2010, en raison du redécoupage évoqué en Le choix fait dans ce tableau est de considérer que chaque chercheur ou enseignantchercheur appartient sur l ensemble du mandat à son équipe actuelle.

43 I.1.2. RÉALISATIONS 43 Sous forme de courbe d évolution: On peut y observer une stratégie de recrutement forte pour deux équipes: l équipe Bio- Informatique (AMIB) et l équipe Combinatoire (COMBI) en lien respectivement avec les volontés de renforcer la bio-informatique et la combinatoire autour de l ERC de Gilles Schaeffer, volontés présentes dans le document rendu pour le précédent mandat. Par contre, le départ de personnel INRIA à la tête d équipes a entraîné une forte décroissante des équipes Typical (TYPICAL), High-Performance Communications (HIPERCOM). La réduction des forces en réseaux est contraire à la priorité affichée de développer les réseaux que l on trouve dans le document rendu pour le précédent mandat. Par thème Projeté sur les thèmes. Fin Juin 2013 Thème Algorithmes Thème Réseaux Thème Méthodes formelles Soit en terme de pourcentage de l effectif chercheur/enseignant-chercheur: Fin Juin 2013 Thème Algorithmes 38% 44% 52% 56% 56% 56% 58% Thème Réseaux 19% 18% 15% 14% 16% 16% 13% Thème Méthodes formelles 41% 36% 31% 29% 28% 28% 27% Graphiquement:

44 44 CHAPTER I.1. LE LIX Janvier 2008 Juin 2013 Observons que cette projection est relativement trompeuse pour ce qui concerne le thème Réseaux, car la relative stabilité du thème Réseaux est surtout expliquée par la progression des effectifs de l équipe Cryptographie (CRYPTO), sur des aspects au final non centrés sur les réseaux. I.1.3 I Implication du LIX dans la formation par la recherche Le Département d Informatique de l X Le LIX est l unique laboratoire d Informatique de l École polytechnique, et correspond donc à la composante recherche du Département d Informatique (DIX). Il incombe au DIX de former à l informatique et à la recherche en informatique les 500 élèves qui constituent les promotions annuelles de l École polytechnique, auxquels s ajoutent les étudiants masters venant de l extérieur. Les élèves se spécialisant en informatique (en troisième année) sont de l ordre de 60 étudiants chaque année. Donner une plus grande importance à la recherche dans la formation polytechnicienne est une priorité de l École polytechnique depuis plus de dix ans. Cela se traduit aussi bien en interne dans l offre faite aux étudiants, qu en externe (l importance de la recherche est par exemple mise très en avant dans la communication pour les levées de fond de l École polytechnique). On peut noter qu aujourd hui un tiers des polytechniciens passent une thèse, et que cela approche les 50% en informatique. La plus grande part des enseignements du DIX sont effectués et pilotés par des membres du LIX, qui contribue donc fortement à la formation par le recherche par ce moyen. I Formation au niveau L3 Ce niveau correspond à la 2e année de scolarité et est fortement pluri-disciplinaire. Elle est composée d une part par des cours structurants sur un modèle classique (cours magistraux, TDs, projets) qui sont, pour l informatique, largement assurés par des membres du LIX. En outre, et malgré un emploi du temps chargé, cette année comporte un certain nombre d ouvertures vers la recherche, qui comptent parmi les réussites de l enseignement de l informatique à polytechnique. Les Modules en Laboratoire sont un élément obligatoire de la scolarité polytechnicienne. Le département propose de tels modules sur des sujets divers, comme les réseaux, l image, la bio-informatique, la préparation des olympiades ACM, la vérification et les langages et outils du web. L offre du département d Informatique est extrêmement populaire, puisqu un tiers de chaque promotion demande à effectuer son module en Informatique. Cela est très important pour améliorer et renouveler l image de la discipline auprès des étudiants. Les Projets Scientifiques Collectifs sont également un élément de la 2 e année. Effectués en équipe, ils laissent la voie libre à la créativité des élèves, sous la supervision d un tuteur. Plusieurs projets sont encadrés chaque année au LIX. De manière générale, tradionnellement, les enseignements à l École polytechnique, s accompagnent nécessairement de production de documents pédagogiques de qualité, et qui se doivent d être de

45 I.1.4. STRATÉGIE ET PERSPECTIVES SCIENTIFIQUES POUR LE FUTUR CONTRAT 45 référence. Les membres du LIX/DIX produisent donc aussi des polycopiés de cours considérés souvent comme références. I Formation en Master 1 La troisième année de scolarité à l École polytechnique joue le rôle d un master 1 spécialisé. Elle accueille également des étudiants rejoignant l école en master. On peut considérer que plus de 50 polytechniciens suivent un M1 d informatique à l école. Ce master dispose d une offre d une vingtaine de cours, dont plus de la moitié est assurée par des membres du LIX. Cette année est cruciale, car c est en général à ce moment que les étudiants polytechniciens décident de poursuivre leur formation par un M2 et une thèse. Il est possible aux étudiants de remplacer un cours par un projet personnel en laboratoire, sous la supervision d un chercheur du LIX. En 2013, 30 étudiants de M1 effectuent un tel projet. La plupart au LIX. Une autre particularité du M1 de polytechnique est que le 3e trimestre est consacré à un stage de recherche. Un certain nombre de ces stages ont lieu au LIX. Plus généralement, l organisation et la supervision de ces stages, même lorsqu il ont lieu dans d autres laboratoires, est un travail important entièrement effectué par les enseignants membres du LIX. I 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 École polytechnique, et qui est également une source première de thésards de qualité pour le LIX. L École polytechnique, via le LIX, est membre fondateur de ce master. Des membres du laboratoire interviennent également dans le Master Parisien de Recherche Opérationnelle (MPRO), dont Polytechnique est un des porteurs, de même que le Master Bioinformatique et Statistiques (BIBS). A travers Daniel Krob, l École polytechnique joue un rôle crucial dans le master Comasic positionné à l articulation entre recherche académique et industrielle dans le domaine des systèmes complexes et particulièrement de la sûreté des logiciels embarqués critiques. I Accueil de doctorants au LIX Le LIX accueille par ailleurs de nombreux doctorants, leur très grande majorité venant de l extérieur 17 (i.e. hors École polytechnique). On trouvera la liste des thèses soutenues au LIX dans la période , et les thèses en cours au 30 juin 2013 dans l annexe 7. Sur la période du 1ier janvier 2008 au 30 juin 2013, les membres du LIX ont fait soutenir 53 thèses. En juin 2013, la population doctorante s élève à 40 personnes. La durée moyenne d une thèse au LIX est de 40,06 mois, si l on met de côté le cas d une unique thèse dans une situation très particulière, et de 40,72 mois sinon. I.1.4 Stratégie et perspectives scientifiques pour le futur contrat Comme évoqué précédemment, nous proposons dans le cadre du futur mandat de l unité: 1. une évolution de notre gouvernance avec la création d un conseil de direction, et 2. une évolution de notre structuration pour une nouvelle structuration en trois axes. 17 Par exemple sur les 33 inscriptions à l EDX (Ecole Doctorale de l X) pour l année , 3 ont pour établissement d origine déclaré l École polytechnique.

46 46 CHAPTER I.1. LE LIX L idée de cette évolution vers des axes, n est pas de se substituer aux projets scientifiques des équipes, qui sont présentés plus loin par équipe, mais de les appuyer par une structuration. La structuration que nous proposons est issue d un débat et d une concertation entre responsables d équipes, et d échanges au niveau du laboratoire avec ceux qui ont spontanément pris part à ce débat. Elle est au final basée sur une logique d implication de notre recherche dans le tissu social et économique et non pas seulement du point de vue des collaborations scientifiques effectives durant la période concernée par cette évaluation. Nous pensons qu elle aidera en particulier à une logique d explications et de présentation vis-à-vis de nos partenaires, en particulier non académiques, qui ne comprennent pas toujours spontanément les découpages fins de nos disciplines. Comme expliqué dans la partie présentant la gouvernance, le rôle précis des coordinateurs d axes est encore pour partie en discussion. Il sera présenté en AG, et voté dès que possible. Un rôle important des coordinateurs est d aider à 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 équipes et les interfaces extérieures du laboratoire, et un meilleur suivi de la stratégie globale du laboratoire et des équipes. Nous proposons en effet de structurer le laboratoire en trois axes. Chaque axe est constitué par le regroupement d équipes, chaque équipe étant dans l un des trois axes. Un des rôles des axes est de présenter une vitrine du travail effectué par ses équipes. Ces axes seront cependant clairement conçus comme poreux, avec en particulier nos séminaires déjà existants, basés souvent sur une logique de fondements scientifiques communs 18, qui continueront à compléter cette logique transverse d axes, elle basée sur des domaines d applications. I Axe: Algorithmes, Combinatoire, Modèles. Coordinateur: Gilles Schaeffer. Présentation L informatique a vu le développement depuis son avènement d un socle d outils théoriques qui lui sont propres, tels que l algorithmique discrète, la théorie des automates ou de la complexité, ou qu elle partage avec des disciplines connexes, tels que la combinatoire ou la programmation mathé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 idée que ces outils ont une portée au delà de leur seule valeur pour la science informatique: les sciences naturelles, physique, biologie, ou mathématiques, posent des questions qui, traduites dans le langage de l informatique, sont d intéressants champs d application ou défi pour nos outils, et on peut faire la même observation pour de nombreux problèmes industriels. 18 Rappelons que beaucoup de nos séminaires sont dores et déjà transverses à la structuration en équipes.

47 I.1.4. STRATÉGIE ET PERSPECTIVES SCIENTIFIQUES POUR LE FUTUR CONTRAT 47 Composition L axe Algorithmes, Combinatoire, Modèles du LIX regroupe des équipes issues du thème algorithmique et qui développent ainsi des travaux en forte interaction avec d autres disciplines: l équipe AlCo se concentre sur les problèmes de satisfaction de contraintes et leur complexité et sur les modèles de calculs, en lien notamment avec des questions de logique et d analyse probabiliste. l équipe AMIB construit une approche à la biologie structurale qui va la combinatoire des séquences à l analyse de structures tridimensionnelles, avec un intérêt particulier porté aux interactions moléculaires. Elle possède un fort socle scientifique en combinatoire, géométrie algorithmique et mathématiques discrètes. Son originalité réside dans la combinaison de stratégies classiques de biophysiques et de modélisatoin avec des stratégies d apprentissage automatique et de statistiques, ainsi que de pattern matching ou d échantillonage. Dans le future, de nouvelles contraintes émergeant de technologies évoluant continuement devront être introduits dans les modèles et l analyse. Le niveau de la cellule sera étudié avec la simulation de cycles métaboliques, avec un accent particulier sur les environnements cancéreux. L équipe COMBI s intéresse aux liens entre combinatoire et géométrie et applique des méthodes algorithmiques et d énumération à des problèmes issus de contextes variés, allant de la physique statistique, à la compression de données ou la topologie énumérative. Le programme actuel de cette équipe est d étendre son champs de compétence de la géométrie 2 dimensionnelles aux dimensions supérieures et à des problèmes combinatoires de nature quasi-géométriques. L équipe SYSMO s intéresse à la modélisation et l optimisation de systèmes industriels complexes ainsi qu aux grandes données. Les équipes de cet axe sont issues de l équipe Algorithmique historique du LIX, et leurs membres partagent pour la plupart une culture commune en informatique fondamentale classique. Il est indéniable que la variété des champs d interactions abordés conduit de fait à des trajectoires centrifuges mais un second point d ancrage commun reste la notion de modèles: une partie de notre travail est de faire entrer des objets d études non informatique dans des cadres algorithmiques ou formels de notre discipline. Cette amorce de cohésion est renforcée par de nombreux intérêts communs bilatéraux plus concrets: l aléa discret et la géométrie algorithmique pour Combi et Bioinfo, la géométrie polyédrale et le traitement des grands graphes pour Combi et Sysmo, la programmation mathématique pour AlCO et Sysmo, le repliement tridimensionnel des structures d ANR pour BioInfo et Sysmo. À côté de collaborations nationales et internationales variées, les équipes de cet axes sont largement dans des actions autour du plateau de Saclay, et plus généralement en région parisienne: AMIB est une EPC INRIA jointe avec une équipe BioInfo au LRI. AMIB collabore aussi étroitement avec les laboratoires d informatique de l UVSQ et de l université d Évry Vald Essonne, et les laboratoires de biologie du plateau (LOB à l École polytechnique, l IGM à l université Paris-Sud, ou à Paris avec l université Paris-Diderot. L équipe Combinatoire mène des collaborations active avec avec les labos de physiques théoriques du plateau, à l X, à Orsay et au CEA Saclay, ainsi qu avec l équipe Geometrica de l INRIA Saclay, et dans la région, avec le LIAFA à l université Paris-Diderot. L équipe AlCo collabore avec l équipe de logique mathématique à Paris 7. L équipe Sysmo est largement impliquée dans les deux chaires industrielles associées au laboratoire.

48 48 CHAPTER I.1. LE LIX I Coordinateur: Axe: Informatique distribuée et sécurité Daniel Augot. Présentation La sécurité, la protection de la vie privée, la sûreté et la fiabilité contribue à affermir la confiance que l homme peut avoir dans un système, qu il soit une machine, un système centralisé, un système mobile et distribué, ou le réseau lui même. Maintenant qu Internet et le Web ont acquis une certaine maturité, mais que toutefois de nouvelles classes d entités apparaissent, par exemple, l Internet des objets, nous proposons de contribuer à établir ces propriétés suivant les notions suivantes: la sécurité des systèmes (le système est-il protégé contre toute intrusion?), une vision quantitative et sociologique de la vie privée (les humains semblent prêts à tolérer un certain niveau de perte d intimité en échange d un plus haut niveau de service), et l étude de la tolérance aux fautes, pannes, désynchronisations (le système fonctionnera-t-il correctement quand certains de ses composants tombent en panne?). Composition Trois équipes sont regroupées au vu de ce large domaine d application: Comète (Concurrency, Mobility and Transactions) définit des modèles venant des algèbres de processus ou de la théorie de l information pour les adapter à la sécurité et à la protection de la vie privée; GRACE (Geometry, arithmetic, Algorithms, Codes, Encryption) est experte des mathématiques et algorithmes à la base de la cryptographie et de la théorie des codes; NETWORKS, ex-hipercom, se concentre aussi bien sur les algorithmes et protocoles de routage, que sur l architecture de réseaux, très grands, très dynamiques ou encore contraints. Les trois équipes ont déjà coopéré: GRACE et HIPERCOM ont mené une opération de maturation technologique et économique Digiteo (OMTE CryptoNet), pour intégrer de la cryptographie à base de courbes elliptiques dans la fameux protocole de routage OLSR. GRACE et Comète sont très impliqués, au sein de l université de Paris-Saclay, dans le montage de l Institut de la société du numérique notamment dans son volet portant sur la vie privée. Bien sûr, ces équipes ont aussi une partie de leur activité qui n est pas directement orientée vers ces domaines d application. Par exemple, GRACE a une part importante de son activité portant sur la théorie algorithmique des nombres, Comète sur la théorie des modèles formels. Dans les détails, l équipe Comète étudie les problèmes des systèmes distribués et ubiquitaires, dont les réseaux sociaux, le fameux cloud, et les applications mobiles sont des exemples frappants. La sécurité est un problème fondamental, et le respect de la vie privée est devenu un objet de préoccupation majeur, depuis que les menaces pesant sur elle ont grandi en puissance de plusieurs ordres de grandeur. La méthodologie centrale de Comète est de construire des formalismes, des méthodes de raisonnement et des outils, pour spécifier les systèmes et les protocoles, et pour garantir qu ils remplissent bien les propriétés de sécurité et de vie privée souhaitées. Les recherches dans Comète peuvent être réparties dans quatre thèmes: l étude probabiliste de la fuite d information dans les flux de données, en utilisant la théorie de l information, plus particulièrement la min-entropie de Rényi; le model-checking pour vérifier des propriétés qui combinent les probabilités, la mobilité et la sécurité; la programmation concurrente par contrainte, concurrent constraint programming, augmentée d un formalisme qui modèlise la notion de spatialité et d information épistémique; les problèmes d expressivité de ces modèles. En algorithme distribuée, l équipe étuide la correction d algorithmes distribués sous des hypothèses d asynchronisme et en présence d erreurs; la conception et l analyse de la complexité d algorithmes distribué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 mobilité des agents. Comète a par exemple généralisé la notion de differential privacy, à l origine construite pour la communauté des bases de données statistiques, et basée sur la distance de Hamming, à tous

49 I.1.4. STRATÉGIE ET PERSPECTIVES SCIENTIFIQUES POUR LE FUTUR CONTRAT 49 les domaines pourvus de n importe quelle distance. Cette notion a aussi été liée à celle de fuite d information. Ce cadre conceptuel a trouvé une application très pratique et facile à expliquer pour protéger la vie privée dans les systèmes utilisant la géolocalisation. GRACE s est donné trois domaines de recherche: la théorie algorithmique des nombres, les primitives cryptographiques et le codage algébrique. Au centre de ces trois domaines, le ciment est l arithmétique des courbes sur les entiers ou les corps finis: elle apparait dans le logiciel fastecpp de preuve de primalité; dans la cryptographie à base de courbes elliptiques ou hyperelliptiques, et dans le codage algébrique (codes de Goppa géométriques). L équipe a une tradition de programmes rapides permettant d établir des records en théorie des nombres: primalité, factorisation (en collaboration avec l équipe CARAMEL du LORIA de Nancy). En codage algébrique, le groupe construit de nouveaux bons codes, cherche à les décoder, mais aussi s intèresse à leur utilisation dans le système de cryptographie McEliece ou dans les algorithmes de chiffrements par blocs. Au nombre des succès de GRACE, on compte les attaques de B. Smith sur les courbes elliptiques de genre 3, son comptage de points de courbes à multiplication réelle (meilleurs papiers aux conférences Asiacrypt et Eurocrypt). En codage algébrique, A. Couvreur a élucidé les phénomènes du code de sous-corps dans le contexte général des codes de Goppa géométriques. F. Morain a présenté son dernier record de primalité à la conférence ECC2010. NETWORKS, ex-hipercom, s intéresse particulièrement au routage, dont le rôle est de garder Internet connexe, même face à la vague des nouveaux objets, nouveaux utilisateurs, et nouveaux usages. Un enjeu qui émerge est celui de la transition vers les communications de machine à machine, où par exemple le lave-vaisselle familial communiquera directement avec le compteur d électricité, pour être contrôlé à distance par la centrale nucléaire la plus proche, pour optimiser et faire correspondre au mieux la consommation à la production. L équipe a développé de fortes collaborations bilatérales (avec financement) avec des industriels: des fournisseurs (EDF, ERDF); des fabricants d équipement (Sagemcom, ST Micro); ce qui lui a permis de dé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 coté de cette activité sur l Internet des objets, l équipe a aussi un intérêt historique dans les réseaux dits MESH et MANET, et a développé le protocole de routage dominant dans ce domaine, OLSR, utilisé à la fois dans le monde militaire par l OTAN comme standard de référence pour les réseaux tactiques, mais aussi dans le monde civil pour établir des réseaux communautaires ou d intervention d urgence. Cette activité sera maintenue dans la continuité, encore en coopération industrielle avec BAE systems et Hitachi. Ces équipes ont notamment les collaborations locales et nationales suivantes: Comète collabore avec le LRI et d autres laboratoires, soit informatiques, soit juridiques, soit économiques, de l Île-de-France, dans le contexte de l action interdisciplinaire Institut de la Société du Numérique au sein de l IDEX Université de Paris-Saclay, sur le thème de la protection de la vie privée. Au niveau national, Comète participe à l action d envergure INRIA CAPPRIS, toujours sur la protection de la vie privée, qui réunit plusieurs laboratoires en France et aussi un en Belgique. GRACE collabore avec le laboratoire PRISM de l UVSQ, le PRISM de Télé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 équipe ARITH du LIRMM de Montpellier. NETWORKS a des collaborations industrielles au niveau national, grâce à son implication importante dans le projet ADEME SOGrid, où sont impliqués EDF, ERDF, Nexans, IGPN, Sagemcom, Landis+Gyr, Trialog, ST Microelectronics et Cap Gemini. Ce projet vise à définir une architecture de communication pour une grille électrique nationale, et d intégrer un système complet implémantant cette architecture.

50 50 CHAPTER I.1. LE LIX I Coordinateur: Axe: Calcul symbolique et preuve Dale Miller. Présentation Il est devenu banal de faire remarquer qu une multitude de systèmes informatique jouent un rôle critique dans notre vie courante. Ces machines et leur logiciels contrôlent une bonne part des infrastructures des sociétés occidentales: on peut penser à des exemples aussi différents que les systèmes bancaires via la dématérialisation de la gestion des flux financiers, les pilotes automatiques des avions, ou la régulation et la surveillance du réseau de distribution électrique. Notre sécurité et la gestion de nos données privées sont prises en charge par les logiciels de nos smartphones, web browsers, caméra digitales et autres voitures modernes: il est fréquent que des erreurs dans les logiciels de bas niveau (telles que de simples débordements de buffers) soient exploitées pour attaquer ces instruments. Bien qu il y ait plusieurs approches pour traiter ces questions de qualités du matériel et du logiciel, telles que par exemple la systématisation du développement logiciel ou le test extensif, il y a peu d espoir que le monde connaisse des logiciels sûrs et corrects sans que de grands progrès soient fait dans l utilisation de méthodes formelles. Composition L axe Calcul Symbolique et Preuve du LIX réunit trois équipes dont la recherche tend à contribuer à l objectif général d améliorer notre compréhension de la preuve et au développement d outils d aide au raisonnement correct. Ces équipes ont leur champs de compétence dans trois domaines reconnus et bien établis du raisonnement formel en mathématique et informatique. MAX se concentre sur l efficacité et la robustesse des algorithmes de calcul symbolique et des outils pour l algèbre, le calcul différentiel et la géométrie. L importance de ces questions pour la modélisation de systèmes physiques dans un large champs d applications industrielles est reconnue de longue date. Cette équipe met à disposition TeXmacs et Mathemagix, deux outils pour la présentation et resolution des problemes mathematiques par l ordinateur. PARSIFAL développe et exploite la théorie des preuves, un sujet lancé par Gentzen dans les années 30, réannimé par Girard dans les années 80 et 90 et maintenant appliqué largement aux fondations de l informatique. TYPICAL développe et exploite la théorie des types, un sujet lancé par de Bruijn et Martin-löf dans les années 30 et pour lequel des systèmes tels que Coq ont été développés et employés avec succès aussi bien dans la recherche académique que dans l industrie ou à des fins éducatives. Ces trois équipes ont des profils en partie similaire en ce qu elles portent un effort équitable sur trois aspects de leur disciplines: les fondations théoriques, les applications pratiques, et le développement d outils informatiques. De fait, ces trois facettes interagissent largement. Ainsi la fréquentation régulière de questions applicatives permet de comprendre quel genre d outils il est utile de développer. La mise au point et l implantation effective de ces outils logiciels amène de nouvelles considérations théoriques. Enfin, pour fermer la boucle, les progrès fondamentaux rendent possible l exploration de nouvelles applications à partir du coeur de compétence d une équipe. Les thématiques scientifiques couvertes par ces trois équipes se chevauchent et ce chevauchement donne une cohérence naturelle à l axe. Ainsi le calcul symbolique au sens de MAX nécessite de faire certaines déductions formellement: par exemple, il peut s avérer nécessaire de prouver que le dénominateur d une fraction n est jamais nul ou que trois points dans l espace ne sont pas colinéaires. De la même manière, une grande part des déductions sont souvent des calculs (voire même des calculs symboliques) et lorsqu on cherche à créer des preuves vérifiables la séparation entre calcul et déduction est une question subtile. Un autre aspect commun d étude des trois

51 I.1.4. STRATÉGIE ET PERSPECTIVES SCIENTIFIQUES POUR LE FUTUR CONTRAT 51 équipes sont les langages mis au point et utilisés par les matématiciens: ainsi les problématiques autour des notions de parsing, printing, typesetting et du stockage de telles expressions linguistiques sont partagées par ces équipes. Si chacunes des trois équipes cultive des collaborations internationnales, toutes trois bénéficient aussi grandement de leur présence sur le plateau de Saclay et en région parisienne en géné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 équipe Specfun et l équipe Mathematical Components sur la formalisation des mathématiques. Alors que les assistants de preuves interactifs TLA+ a été conçu par Leslie Lamport et ses collègues, Parsifal a été impliqué dans l implémentation et l utilisation du système de preuve TLA+. Le laboratoire PPS (Preuves, Programmes et Systèmes) de l université Paris Diderot: des membres aussi bien de Typical que de Parsifal interagissent fréquemment avec des membres de PPS, notamment au travers de séminaires, de groupes de travail, et d articles en commun, voire de systèmes codéveloppés (tels que Coq). Le CEA (Saclay Plateau) aligne un large éventail de chercheurs dans tous les domaines de l informatique. Typical a eu des collaborations sur des sujets tels que les procédures de décisions coopérative, l analyse statique, l optimisation globale. L équipe Parisfal a collaboré avec le CEA-LIST à la preuve de robustesse de logiciel de calcul sur les réels. Le LRI (Laboratoire de Recherche en Informatique) contient plusieurs chercheurs et équipes qui travaillent sur l applications de méthodes formelles au calcul et à la déduction. En particulier les équipes ForTesSE (Test Formel et Exploration de Systèmes) et Toccata explorent des sujets quelque peu liés à ceux de l axe. Les séries de séminaires activement portées par ces deux équipes (avec le soutien de Digiteo) attirent des visiteurs importants et sont largement suivis par les personnels du LIX.

52 52 CHAPTER I.1. LE LIX

53 I.2 Analyse AFOM du laboratoire Sous forme graphique: INTERNE POSITIF forte activit e de publications fortes relations partenariales fortes activit es en productions logicielles forte population CNRS et INRIA visibilit e internationale de nombreux membres visibilit e et attractivit e de l ecole polytechnique capacit e et efficacit e de travail moyenne au LIX Atouts Universit e Paris-Saclay RTRA DIGITEO, Departement STIC, LABEX DIGICOSME, etc. De nombreuses interactions scientifiques avec les autres partenaires `a proximit e envisageables et envisag es Opportunit es A F O M un d eficit de cadres et des cadres ou cadres potentiels surcharg es une gouvernance surcharg ee et parfois fatigu ee non-homog en eit e scientifique du collectif LIX une structuration en equipes parfois de tr`es petites tailles inertie li ee au fonctionnement historique du laboratoire lorsqu il etait d une autre taille Faiblesses Menaces Les etudiants form es `a l Ecole polytechnique ne vont pas au LIX, mais surtout `a l etranger ou hors du monde acad emique Goulot d etranglement actuel et `a venir sur les promotions Les activit es partenariales reposent sur quelques personnes et des profils sur lesquels nous ne pouvons pas recruter La cr eation de l Universit e Paris-Saclay est un challenge extrˆemement consommateur en temps et en energie NEGATIF EXTERNE Figure I.2.1: Analyse AFOM du laboratoire: Atouts, Faiblesses, Opportunités, Menaces Sous forme textuelle: Atouts: Le LIX est un laboratoire extrêmement productif: avec 372 articles dans des revues internationales, et 508 articles dans des conférences internationales sur la pé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 extrêmement haut. Le LIX possède de nombreuses relations partenariales actives, participe à la création d entreprises et de start-ups, à des actions de normalisation, à la production de brevets, et via le DIX à 53

54 54 CHAPTER I.2. ANALYSE AFOM DU LABORATOIRE des chaires industrielles. Le LIX est aussi très actif et visible pour le développement logiciel, en contribuant à des prototypes spécialisés et focalisés, mais aussi à des outils grand public, ou à public hors monde académique. Le nombre de chercheurs CNRS et INRIA est clairement une force du laboratoire. Beaucoup des membres du laboratoire sont des chercheurs très visibles dans la compétition internationale de la recherche. La proximité de l École polytechnique et les interactions avec la formation à la recherche pour les étudiants de École polytechnique via le DIX est clairement une force visible, qui est attractive à la fois pour nous attirer des contacts, des relations, et des étudiants. Enfin, même si cela est difficile à quantifier, force est de constater que la quantité de travail des chercheurs et enseignants-chercheurs du LIX est très élevée. Faiblesses: La pyramide des âges du LIX en 2013 fait que le LIX souffre d un déficit clair de cadres ou de cadres potentiels (en particulier sur la tranche ans) pour un fonctionnement à la hauteur de ce que doit être le laboratoire. Cet état de fait exerce au quotidien de la pression et de la fatigue pour un travail optimal sur la gouvernance et les cadres présents au LIX. Contrairement à certains autres laboratoires, le LIX est constitué de plusieurs thématiques, et n est pas homogène thématiquement. Cela s explique au moins en partie par la nécessité pour faire fonctionner le DIX de couvrir thématiquement l informatique pour les étudiants de l École polytechnique, avec des enseignants selectionnés parmi les meilleurs spécialistes des domaines. Le LIX a bénéficié d une très forte croissante sur les 10 dernières années. Il a été mis en place avec un modèle basé sur la notion d équipes de très petites tailles, souvent centrées autour d un scientifique très visible. Ce modèle souffre de défauts comme celui d être très sensible aux mouvements de personnel et d induire une certaine inertie. Opportunités: L Université Paris-Saclay, en création, est clairement une force pour une visibilité encore plus grande de notre travail, au sein d une université de premier rang mondial. L Université Paris-Saclay est d ores et déjà munie de très nombreux outils pour développer la recherche et les collaborations entre universités et à l international: par exemple le RTRA DIGITEO, le Département STIC en construction, le LABEX DIGICOSME, l IRT Systemix, etc.... Chacun de ces dispositifs permet clairement potentiellement de démultiplier nos forces, et nous les utilisons. Ils offrent par ailleurs une très grande variété de sources de financements. La création de cette université s accompagne de nombreuses interactions entre partenaires sur le plateau. Cela permet de renforcer ou de développer de multiples collaborations scientifiques.

55 55 Menaces: Les membres du LIX sont fortement impliqués dans la formation par la recherche en particulier à l École polytechnique. Cependant, la plupart des étudiants que nous formons ne viennent pas dans les laboratoires d informatique français d une part, mais vont surtout au final à l étranger ou dans des carrières hors du monde académique. La France et le LIX ne bénéficient donc pas autant qu ils le devraient de ce travail. La pyramide des ages au laboratoire, avec un très grand nombre de chercheurs et enseignantschercheurs jeunes entraîne déjà et va continuer à entraîner un goulot d étranglement pour les promotions des membres du LIX. Le LIX est un laboratoire qui bénéficie et contribue beaucoup à des relations industrielles et partenariales hors monde académique. La capacité à entretenir et développer des relations avec le monde non académique repose en pratique sur quelques personnes et sur des profils très particuliers. Les critères de recrutement de chercheurs et enseignants-chercheurs font qu il est extrêmement difficile de recruter de tels profils. Enfin, si la création de l Université Paris-Saclay est source d opportunités à terme, elle est à court terme extrêmement consommatrice en temps et en énergie, et occupe l énergie d une grande part de la direction, des cadres, des chercheurs et des enseignants-chercheurs du LIX.

56 56 CHAPTER I.2. ANALYSE AFOM DU LABORATOIRE

57 Rapport et projet scientifique par équipe 57

58

59 II Équipe Algorithmique et Complexité (AlCo) 59

60

61 II.1 Liste des membres : Algorithmique et Complexité II.1.1 II Liste actuelle des membres Membres permanents Nom Fonction Employeur HDR Arrivée Manuel Bodirsky CR CNRS HDR Olivier Bournez Professeur École Polytechnique HDR Miki Hermann CR CNRS HDR Sylvie Jabinet Assistante CNRS II Doctorants et postdoctorants Doctorants Nom Financement Arrivée Encadrant François Bossièrre ERC CSP-Complexity M. Bodirsky Jonas Lefèvre AMN ENS-Lyon O. Bournez Jean Philippe Meline ANR Alcoclan M. Hermann Amaury Pouly Monge Ecole Polytechnique O. Bournez Mikaël Rabie AMN ENS-Lyon O. Bournez Postdoctorants Nom Financement Dates Responsable Marcello Mamino ERC CSP-Complexity 09/2013- M. Bodirsky András Pongrácz ERC CSP-Complexity 09/2012- M. Bodirsky II.1.2 II Anciens membres Membres permanents Nom Fonction Employeur HDR Départ Position actuelle Florent Madelaine Délégation Université HDR 09/2011- MdC Université CNRS Clermont- 08/2012 Clermont-Ferrand Ferrand Christoph Dürr Chercheur CNRS HDR DR CNRS Paris 6 II Doctorants et postdoctorants Doctorants Nom Financement Départ Encadrant Position actuelle Xavier Kœgler AMN ENS-Ulm O. Bournez Ingénieur (Computer Scientist) chez Smart AdServer Florian Richoux Ecole Polytechnique M. Hermann MdC Université de Nantes Kim Thang Nguyen Ecole Polytechnique C. Dürr MdC Univ. Evry Mathilde Durand Ecole Polytechnique C. Dürr Google Zurich 61

62 62 CHAPTER II.1. LISTE DES MEMBRES : ALGORITHMIQUE ET COMPLEXITÉ Postdoctorants Nom Financement Dates Responsable Position actuelle Jan Foniok ERC CSP-Complexity 01/01/ /8/2011 M. Bodirsky Postdoc Queen s University Barnaby Martin ANR Alcoclan 10/ /2012 M. Hermann MdC à Middlesex University, UK Gustav Nordh Egide 09/ /2008 M. Hermann MdC à l Université de Linköping Johan Thapper ERC CSP-Complexity 01/10/ /9/2012 M. Bodirsky MdC à l Université Paris-Est Marne-la- Vallée Johan Thapper LIX-Qualcomm Fellowship 01/10/ /9/2011 M. Bodirsky MdC à l Université Paris-Est Marne-la- Vallée II Stagiaires Master 2 Autres membres Nom Financement Dates Responsable Position actuelle Edouard Bonnet MPRI 2010 M. Bodirsky Thésard au LAMSADE François Bossière Master Logique Paris M. Bodirsky Thésard au LIX Vincent Rudelli MPRI 2008 M. Hermann Professeur au lycée à Bordeaux Trung van Pham MPRI 2010 M. Bodirsky Thésard au Vietnam Visiteurs de longue durée Nom Financement Dates Invitant Víctor Dalmau Ecole Polytechnique 11/ /2009 M. Bodirsky Hubie Chen ERC CSP-Complexity 03/ /2011 M. Bodirsky Pavol Hell ANR Alcoclan 04/2012 M. Hermann Michał Wrona DGA 2/2011-4/2011 et 10/2010 M. Bodirsky

63 II.2 Rapport scientifique : Algorithmique et Complexité II.2.1 Thématique générale et principaux objectifs II 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 Thé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(Γ ) NP under deterministic polynomial-time manyone reductions. Here, CSP(Γ ) NP 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 64 CHAPTER II.2. RAPPORT SCIENTIFIQUE : ALGORITHMIQUE ET COMPLEXITÉ 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): , 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 # Opt k P and # Opt k P[logn]. 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

65 II.2.1. THÉMATIQUE GÉNÉ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 Exemples de ré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 ẏ = p(y) with initial condition y(t 0 ) = y 0 R d at time t 0 + T with precision e µ where p is a vector of polynomials can be done in time polynomial in the value of T, µ and Y = sup t0 u T 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 Animation scientifique, rayonnement, prix et récompenses 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 ) HyperNet 2011 Physics and Computations (PC ) Development of Computational Models (DCM 2010) Computability in Europe (CiE 2009, 2014)

66 66 CHAPTER II.2. RAPPORT SCIENTIFIQUE : ALGORITHMIQUE ET COMPLEXITÉ 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), May th conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2010), Yogyakarta (Indonesia), October th conference on Artificial Intelligence (AAAI 2010), Atlanta (Georgia, USA), July nd Conference on Automated Deduction (CADE 2009), Montreal (Canada), 2-7 August II Fonctionnement interne The AlCo research group created and is involved in the Séminaire algorithmique du plateau de Saclay, a joint algorithms and complexity seminar of the laboratories LIX, LRI, and PRISM. This seminar was established in The first year the seminar took place at the LRI. During the academic year 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 ( ) with TU Wien, Austria. Manuel Bodirsky is the leader of an ERC Starting Grant, called CSP-Complexity ( ). 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 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 Mathématique et Fondements de l Informatique). We are regularly involved in the supervision of PhDs and students. This includes: Nathan Grosshans, Complexité des contraintes semi-algébriques convexes, stage M1, Ecole Polytechnique (2013) François Bossiè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 Opé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).

67 II.3 Projet de recherche : Algorithmique et Complexité II.3.1 Objectifs scientifiques II 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 {(x 1,...,x n,y) f (x 1,...,x n ) = 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 68 CHAPTER II.3. PROJET DE RECHERCHE : ALGORITHMIQUE ET COMPLEXITÉ II 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 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 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 Méline, since November Manuel Bodirsky s research is funded by by an ERC Starting Grant, called CSP-Complexity. He has two post-doctoral researchers: András Pongrá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, François Bossièrre. Olivier Bournez s research is funded by the ANR DISPLEXITY and by DGA CALCULS project. His project involves currently three PhD students: Jonas Lefèvre, Amaury Pouly, and Mikaë 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.

69 II.4 Analyse AFOM : Algorithmique et Complexité INTERNE POSITIF Strong common background in Computational Complexity Strong common background on Constraint Satisfaction Problems Shared research contacts and visitors Strong international collaboration Existing and possible collaborations with other teams in the Saclay and Paris area Atouts Opportunit es A F O M Faiblesses Not many common publications Menaces Small number of permanent researchers NEGATIF EXTERNE Figure II.4.1: Analyse AFOM de l équipe Algorithmique et Complexité : Atouts, Faiblesses, Opportunités, Menaces 69

70 70 CHAPTER II.4. ANALYSE AFOM : ALGORITHMIQUE ET COMPLEXITÉ

71 II.5 Fiche résumé : Algorithmique et Complexité II.5.1 Membres 2008 : l équipe de recherche a été créée en 2010 (par scission d une équipe existante) donc indiquer la situation en 2008 est difficile ou non totalement pertinent : 2 chercheurs (2 CNRS), 1 enseignant-chercheur, 1 postdoc, 6 doctorants Départ de membres de l équipe Christophe Dürr (DR à LIP6) II.5.2 Résultat 1: Résultats scientifiques Trichotomies in the complexity of minimal inference Résultat 2 : Complexity of omega-categorical CSPs is captured by the topological polymorphism clone of the constraint language Résultat 3 : A complete complexity classification for Graph-SAT problems: all the problems in this large class are either in P or NP-complete. Résultat 4: Ordinary differential equation with polynomial right hand side can be solved in polynomial time II.5.3 Production scientifique II Publications Journaux : 37 Confé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): , M. Hermann et R. Pichler. Counting complexity of propositional abduction. Journal of Computer and System Sciences, 76(7): , 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): , M. Bodirsky and H. Chen. Quantified equality constraints. SIAM Journal on Computing, 39(8): , M. Bodirsky and J. Kára. The complexity of temporal constraint satisfaction problems. Journal of the ACM, 57(2): 1 41, Olivier Bournez, Daniel Graça and Emmanuel Hainry. Computation with perturbed dynamical systems. Journal of Computer System Science, 79(5): Manuel Bodirsky et Olivier Bournez sont arrivés au LIX en février et septembre 2008 respectivement. 71

72 72 CHAPTER II.5. FICHE RÉSUMÉ : ALGORITHMIQUE ET COMPLEXITÉ II 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 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 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) 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) 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 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 Actions de formation Manuel Bodirsky and Miki Hermann teach the course 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 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, Modèles, Calculs from 2011 to 2013 at Ecole Polytechnique. He also taught in the course INF561 entitled Complexité 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 lycées.

73 II.6 Production scientifique : Algorithmique et Complexité Les publications [5], [6], et [20] sont des publications avec des auteurs dans des des équipes différentes. II.6.1 Livres et chapitres de livres [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 [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 Springer, [3] Manuel Bodirsky and Michael Pinsker. Reducts of Ramsey structures. AMS Contemporary Mathematics, vol. 558 (Model Theoretic Methods in Finite Combinatorics), pages , [4] Olivier Bournez and Manuel L. Campagnolo. New Computational Paradigms. Changing Conceptions of What is Computable, chapter A Survey on Continuous Time Computations, pages Springer-Verlag, New York, [5] Olivier Bournez and Gilles Dowek. Physics and computation special issue. Natural Computing, 11(1):1, [6] Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, and Sophie Tison. L I.A. frontières et Applications, volume 3 of Panorama de l Intelligence Artificielle, chapter Informatique théorique : calculabilité, décidabilité et logique. Cépaduès Editions, [7] Olivier Bournez and Igor Potapov, editors. Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, Proceedings, volume 5797 of Lecture Notes in Computer Science. Springer, [8] Olivier Bournez and Igor Potapov. In Reachability Problems (RP 2009) Special Issue, volume 22 of International Journal of Foundations of Computer Science, II.6.2 Documents pédagogiques [9] Olivier Bournez. Algorithmes et Complexité. Polycopié du cours INF561 de l Ecole Polytechnique. Ecole Polytechnique, pages. [10] Olivier Bournez. Fondements de l Informatique: Logique, Modèles, Calculs. Polycopié du cours INF423 de l Ecole Polytechnique. Ecole Polytechnique, pages. II.6.3 Revues internationales [11] Konstantin Artiouchine, Philippe Baptiste, and Christoph Dürr. Runway scheduling with holding loop. European Journal of Operational Research, 189(3): , [12] Guillaume Aupy and Olivier Bournez. On the number of binary-minded individuals required to compute. Theoretical Computer Science, 411(22): ,

74 74 BIBLIOGRAPHY [13] Dominique Barth, Olivier Bournez, Octave Boussaton, and Johanne Cohen. Distributed learning of equilibria in a routing game. Parallel Processing Letters, 19: , June [14] Manuel Bodirsky and Hubie Chen. Relatively quantified constraint satisfaction. Constraints, 14(1):3 15, [15] Manuel Bodirsky and Hubie Chen. Peek arc consistency. Theor. Comput. Sci., 411(2): , [16] Manuel Bodirsky and Hubie Chen. Quantified equality constraints. SIAM Journal on Computing, 39(8): , [17] Manuel Bodirsky, Hubie Chen, Jan Kára, and Timo von Oertzen. Maximal infinitevalued constraint languages. Theoretical Computer Science, 410: , [18] Manuel Bodirsky, Hubie Chen, and Michael Pinsker. The reducts of equality up to primitive positive interdefinability. Journal of Symbolic Logic, 75(4): , [19] Manuel Bodirsky and Víctor Dalmau. Datalog and constraint satisfaction with infinite templates. Journal on Computer and System Sciences, 79:79 100, [20] Manuel Bodirsky, Éric Fusy, Mihyun Kang, and Stefan Vigerske. Boltzmann samplers, Pólya theory, and cycle pointing. SIAM J. Comput., 40(3): , [21] Manuel Bodirsky, Clemens Gröpl, and Mihyun Kang. Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms, 32(2): , [22] Manuel Bodirsky, Miki Hermann, and Florian Richoux. Complexity of existential positive first-order logic. Journal of Logic and Computation, 23(4): , [23] Manuel Bodirsky and Martin Hils. Tractable set constraints. Journal of Artificial Intelligence Research, 45: , [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), [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): , [26] Manuel Bodirsky, Peter Jonsson, and Timo von Oertzen. Essential convexity and complexity of semi-algebraic constraints. Logical Methods in Computer Science, 8(4), [27] Manuel Bodirsky and Markus Junker. ℵ 0 -categorical structures: interpretations and endomorphisms. Algebra Universalis, 64(3-4): , [28] Manuel Bodirsky and Jan Kára. The complexity of equality constraint languages. Theory of Computing Systems, 3(2): , [29] Manuel Bodirsky and Jan Kára. The complexity of temporal constraint satisfaction problems. Journal of the ACM, 57(2):1 41, [30] Manuel Bodirsky and Jan Kára. A fast algorithm and Datalog inexpressibility for temporal reasoning. ACM Transactions on Computational Logic, 11(3), [31] Manuel Bodirsky and Daniel Král. Limit behavior of locally consistent constraint satisfaction problems. SIAM J. Discrete Math., 25(2): , 2011.

75 BIBLIOGRAPHY 75 [32] Manuel Bodirsky and Jens K. Mueller. Rooted phylogeny problems. LMCS, 7(4), [33] Manuel Bodirsky, Gustav Nordh, and Timo von Oertzen. Integer programming with 2-variable equations and 1-variable inequalities. Information Processing Letters, 109(11): , [34] Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, and Mikaël Rabie. Population protocols that correspond to symmetric games. International Journal of Unconventional Computation, 9(1 2):5 36, [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): , [36] Olivier Bournez, Walid Gomaa, and Emmanuel Hainry. Algebraic characterizations of complexity-theoretic classes of real functions. IJUC, 7(5): , [37] Olivier Bournez, Daniel S. Graça, and Emmanuel Hainry. Computation with perturbed dynamical systems. Journal of Computer System Science, 79(5): , [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): , [39] N. Creignou, Miki Hermann, A. Krokhin, and G. Salzer. Complexity of clausal constraints over chains. Theory of Computings Systems, 42(2): , [40] A. Durand and Miki Hermann. On the counting complexity of propositional circumscription. Information Processing Letters, 106(4): , [41] A. Durand, Miki Hermann, and G. Nordh. Trichotomies in the complexity of minimal inference. Theory of Computings Systems, 50(3): , [42] Christoph Dürr and Mathilde Hurand. Finding total unimodularity in optimization problems solved by linear programs. Algorithmica, [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): , [44] Miki Hermann. On Boolean primitive positive clones. Discrete Mathematics, 308(15): , [45] Miki Hermann and R. Pichler. Complexity of counting the optimal solutions. Theoretical Computer Science, 410(38-40): , [46] Miki Hermann and R. Pichler. Counting complexity of propositional abduction. Journal of Computer and System Sciences, 76(7): , [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.

76 76 BIBLIOGRAPHY II.6.4 Conférences internationales [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 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 ICST (Institute for Computer Sciences, Social- Informatics and Telecommunications Engineering). [50] Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jež, Łukasz Jež, and Grzegorz Stachowiak. Collecting weighted items from a dynamic queue. In Proc. of the ACM-SIAM Symposium on Discrete Algorithms (SODA), [51] Manuel Bodirsky and Hubert Chen. Qualitative temporal and spatial reasoning revisited. In Proceedings of CSL, pages , [52] Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, and Michael Pinsker. Distance constraint satisfaction problems. In Petr Hlinený and Antonín Kučera, editors, Proceedings of Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, pages Springer Verlag, August [53] Manuel Bodirsky and Martin Grohe. Non-dichotomies in constraint satisfaction complexity. In Ivan Damgard Luca Aceto, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, and Igor Walukiewicz, editors, Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, pages Springer Verlag, July [54] Manuel Bodirsky, Miki Hermann, and Florian Richoux. Complexity of existential positive first-order logic. In K. Ambos-Spies, B. Lö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 Springer-Verlag, July [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 AAAI, July [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 IEEE Computer Society, July [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 Springer Verlag, July [58] Manuel Bodirsky and Jan Kára. The complexity of temporal constraint satisfaction problems. In Cynthia Dwork, editor, Proceedings of the Annual Symposium on Theory of Computing (STOC), pages ACM, May [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 ACM, March 2010.

77 BIBLIOGRAPHY 77 [60] Manuel Bodirsky, Gustav Nordh, and Timo von Oertzen. Integer programming with 2-variable equations and 1-variable inequalities. In CTW, pages , [61] Manuel Bodirsky and Michael Pinsker. Schaefer s theorem for graphs. In Proceedings of the Annual Symposium on Theory of Computing (STOC), pages , [62] Manuel Bodirsky, Michael Pinsker, and Todor Tsankov. Decidability of definability. In Proceedings of the Annual Symposium on Logic in Computer Science (LICS), pages , [63] Manuel Bodirsky and Stefan Wölfl. RCC8 is tractable on instances of bounded treewidth. In Toby Walsh, editor, Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI), pages AAAI, July [64] Manuel Bodirsky and Michal Wrona. Equivalence constraint satisfaction problems. In Proceedings of Computer Science Logic, volume 16 of LIPICS, pages Dagstuhl Publishing, September [65] Olivier Bournez, Jérémie Chalopin, Johanne Cohen, and Xavier Koegler. Playing with population protocols. In The Complexity of a Simple Program, Cork, Irland, December 6-7th [66] Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, and Mikaël Rabie. Computing with Pavlovian populations. In Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, Proceedings, volume 7109 of Lecture Notes in Computer Science, pages Springer, [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 [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 Springer, [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, Proceedings, volume 7287 of Lecture Notes in Computer Science, pages Spinger-Verlag, [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, [71] Olivier Bournez, Daniel S. Graça, and Emmanuel Hainry. Robust computations with dynamical systems. In Petr Hlinený and Antonín Kucera, editors, Mathematical Foundations of Computer Science, MFCS 2010, volume 6281 of Lecture Notes in Computer Science, pages Springer, [72] Olivier Bournez, Daniel S. Graça, and Amaury Pouly. On the complexity of solving initial value problems. In Joris van der Hoeven and Mark van Hoeij, editors, ISSAC, pages ACM, 2012.

78 78 BIBLIOGRAPHY [73] Olivier Bournez, Daniel S. Graç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, Proceedings (TAMC 2013), volume 7876, pages Springer, [74] Olivier Bournez, Daniel Graç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 , [75] Olivier Bournez, Daniel S. Graça, Amaury Pouly, and Ning Zhong. Computability and computational complexity of the evolution of nonlinear dynamical systems. In Paola Bonizzoni, Vasco Brattka, and Benedikt Löwe, editors, Computability in Europe (CIE 2013), Lecture Notes in Computer Science, pages Springer, [76] Olivier Bournez, Jonas Lefèvre, and Mikaël Rabie. Trustful population protocols. In International Symposium on Distributed Computing (DISC 2013), [77] Olivier Bournez and Jonas Lefè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, [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 IEEE Computer Society, May [79] Marek Chrobak, Christoph Dü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 , [80] Marek Chrobak, Christoph Dü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), [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 , August [82] Christoph Dü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, [83] Christoph Dürr, Łukasz Jež, 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), [84] Christoph Dürr and Nguyen Kim Thang. Non-clairvoyant scheduling games. In Proc. of the 2nd International Symposium on Algorithmic Game Theory (SAGT), [85] Pavol Hell, Miki Hermann, and M. M. Nevisi. Counting partitions of graphs. In Kun- Mao 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 Springer-Verlag, December 2012.

79 II.6.5. CONFÉ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 Springer-Verlag, June [87] Miki Hermann and R. Pichler. Counting complexity of minimal cardinality and minimal weight abduction. In S. Hö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 Springer-Verlag, [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 Springer-Verlag, February [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 [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 Springer-Verlag, February [91] Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö, and Michail Prilutskii, editors. Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, Proceedings, volume 7353 of Lecture Notes in Computer Science. Springer, [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 , [93] Florent R. Madelaine and Barnaby Martin. Containment, equivalence and coreness from CSP to QCSP and beyond. In CP, pages , [94] Florent R. Madelaine and Barnaby Martin. QCSP on partially reflexive cycles - the wavy line of tractability. CoRR, abs/ , Accepted at CSR 13. [95] Florent R. Madelaine, Barnaby Martin, and Juraj Stacho. Constraint satisfaction with counting quantifiers. In CSR, pages , [96] Walid Gomaa Olivier Bournez and Emmanuel Hainry. Implicit complexity in recursive analysis. In Logic and Computational Complexity, [97] Johan Thapper and Stanislav Živný. The power of linear programming for valued CSPs. In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 12), pages IEEE Computer Society, II.6.5 Conférences nationales [98] M. Hermann and F. Richoux. Sur la complexité algorithmique des problèmes de satisfaction de contraintes disjonctifs. In Actes 4ièmes Journées Francophones de Programmation par Contraintes (JFPC 2008), Nantes (France), pages , June 2008.

80 80 BIBLIOGRAPHY II.6.6 Conférences invitées [99] Homogeneous structures, ramsey classes, and constraint satisfaction. In RaTLoCC (Ramsey Theory in Logic, Combinatorics and Complexity), Bertinoro, [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 [101] Manuel Bodirsky. Constraint satisfaction: Finite model theory meets infinite model theory. In L éritage d Alan Turing : logique, calcul et complexité, Lyon, June [102] Miki Hermann. The constraint satisfaction problem: Complexity and approximability. In Séminaire 09441, Schloß Dagstuhl (Allemagne), October [103] Miki Hermann. What makes minimal inference tractable. In International Workshop on Tractability, Cambridge (Grande Bretagne), July Microsoft Research. [104] Miki Hermann. SAT interactions. In Séminaire 12471, Schloß Dagstuhl (Allemagne), November [105] Miki Hermann. How hard it is to count easily. In Séminaire Computational Counting, Schloß Dagstuhl (Allemagne), January II.6.7 Thèses [106] Xavier Koegler. Population protocols, games, and large populations. PhD thesis, Paris 7, [107] Florian Richoux. Toward a complexity classification of CSP through kernel width. PhD thesis, Ecole Polytechnique, II.6.8 Habilitation à diriger des recherches [108] Manuel Bodirsky. Complexity classification in infinite-domain constraint satisfaction. Mémoire d habilitation à diriger des recherches, Université Diderot Paris 7, 2012.

81 II.7 Annexes : Algorithmique et Complexité II.7.1 Participations à la communauté scientifique et responsabilités administratives Responsabilités administratives des membres de l équipe incluants responsabilité de recherche et d enseignement Olivier Bournez est directeur du LIX (période 2008-). est membre élu du collège des directeurs d unités du sénat académique de l université Paris Saclay (période 2013-). est membre du comité de pilotage du RTRA DIGITEO (période 2011-). est membre du comité de pilotage du LABEX DIGICOSME (période 2011-). est membre du bureau du réseau Computability in Europe pmt6sbc/cie.html. Il est coordinateur national pour ce réseau. (période 2008-). est vice-président du Département d informatique de l Ecole Polytechnique (période 2010-). est membre du comité enseignement recherche du département d Informatique de l Ecole Polytechnique. Il est responsable des stages de recherche de 3ième année pour le département d informatique (période 2009-). Christoph Dürr est responsable de l équipe Algorithmique et Complexité (période ). Miki Hermann est responsable de l équipe AlCo (période 2010-). II Responsabilités de projets internationaux Projet ALCOCLAN ( ) (Type: ANR Blanc International) Titre: Algorithmes et Complexité des Langages de Contraintes. Partenaires: LIX et Université technique de Vienne. Responsable: Miki Hermann. Montant de la collaboration pour le LIX: euros. PHC Amadeus ( ) (Type: PHC Amadeus) Titre: Problèmes de satisfaction de contraintes. Partenaires: LIX et Université Technique de Vienne. Responsable: Miki Hermann. Montant de la collaboration pour le LIX: euros. ERC Starting grant ( ) (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: euros. Projet ComputR ( ) (Projet Equipe associé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 82 CHAPTER II.7. ANNEXES : ALGORITHMIQUE ET COMPLEXITÉ II Responsabilités de projets nationaux Projet SOGEA ( ) (Type: Projet ANR) Titre: Security of Games, Equilibria and Distributed Algorithms. Ce projet ANR visait à réunir plusieurs groupes français travaillant sur la théorie algorithmique des jeux, dans des contextes différents (Complexité, Réseaux, Algorithmique Distribuée) pour la conception de jeux distribués aux propriétés garanties. http: //sogea.loria.fr. Partenaires: LIX, PRISM, LRI. Responsable: Olivier Bournez. Montant de la collaboration pour le LIX: euros (sur un montant total de euros). Projet DGA Calculs ( ) (Type: Financement DGA.) Ce projet vise à é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 euros chaque année sur la durée d existence du projet. II Participation à des projets internationaux Projet franco-chilien ( ) (Type: Projet ECOS) Titre: réalisation de graphes avec contraintes de degrés. Partenaires: LIX, LIP, LIFO, DIM U.Chili. Responsable: Christoph Dürr. Montant de la collaboration pour le LIX: 3 keuros. II Participation à des projets nationaux ENUM ( ) (Type: Projet ANR) Titre: Problèmes d énumération dans les structures. Partenaires: Equipe de Logique de Paris 7, LIX. Responsable: Miki Hermann. ARS ( ) (Type: Projet ANR) Titre: Automatic Reformulation Search. Responsable: Christoph Dürr. Alpage ( ) (Type: Projet ANR) Titre: ALgorithmique des Plates-formes A Grande Echelle. perso/ obeaumon/ alpage.html. Partenaires: LIX, LRI, LaBRI, LIP, ID, IRISA. Responsable: Christoph Dürr. Montant de la collaboration pour le LIX: euros. DISPLEXITY ( ) (Type: Projet ANR) Titre: Distributed Computing : computability and complexity. Ce projet ANR vise à proposer une théorie de la calculabilité et la complexité pour les systèmes distribués qui concilie différentes approches dans la communauté distribuée. displexity/site/displexity.html. Partenaires: LIX, LIAFA, LABRI, IRISA. Responsable: (local) Olivier Bournez. Montant de la collaboration pour le LIX: quelques missions. Financement géré par IRISA. SHAMAN ( ) (Type: Projet ANR) Titre: SHAMAN (Self-organizing and Healing Architectures for Malicious and Adversarial Networks). Projet ANR autour de l algorithmique distribuée en présence de pannes, d anonymat et de joueurs malicieux. Les contributions du LIX ont tournées autour d études du cas où les joueurs jouent un jeux au sens de la théorie des jeux: en l occurence, une étude des protocoles de populations pavloviens. shaman/. Partenaires: LIP6, LIAFA, IRISA, Ecole Polytechnique, Orange Labs. Responsable: (local) Olivier Bournez. Montant de la collaboration pour le LIX: euros (sur un total de euros).

83 II.7.2. ADMINISTRATION DE LA RECHERCHE 83 II.7.2 II Administration de la recherche Activités éditoriales Membres de comités éditoriaux Central European Journal of Computer Science (Versita) Miki Hermann (2010-). Voir versita.com/cejcs/. Computability (Springer) Olivier Bournez (2011-). Voir journal/. Edition de numéros spé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 Gestion scientifique de conférences Participation à des comités de pilotage RP (Reachability Problems) (2006-). Olivier Bournez. Présidence de comités de programme RP (Reachability Problems) (2006-). Olivier Bournez. Participation à des comité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. RP (Reachability Problems) (2006-). Olivier Bournez. 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) ( ). Olivier Bournez.

84 84 CHAPTER II.7. ANNEXES : ALGORITHMIQUE ET COMPLEXITÉ Hypernet 2011 (HyperNet) (2011). Olivier Bournez. PC 2009, 2010, 2011 (Physics and Computations) ( ). 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) ( ). 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 Dürr. II Organisation d événements scientifiques Présidence de comités d organisation RP (Reachability Problems RP 2009) (2009). Olivier Bournez. PC (Physics and Computation PC 2009) (2009). Olivier Bournez et Gilles Dowek. Participation à des comités d organisation RP (Reachability Problems) (2006-). Olivier Bournez. CTW (Cologne-Twente Workshop on Graphs and Combinatorial Optimization) (2009). Christoph Dürr. II Participation à des comités et jurys scientifiques Au niveau international NTU/Paris Tech (2011-) Olivier Bournez. Membre du Joint PhD program de Nanyang Technologcal University (Singapore) / ParisTech. Commission Europé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 comité scientifique du laboratoire d Informatique d Orléans (LIFO), Université d Orléans / ENSI de Bourges. FNRS (2010-) Olivier Bournez. Membre de la liste des experts du Fond National de la Recherche Scientifique (Belgique). Participation à 4/5 expertises par an.. INRIA (2011) Olivier Bournez. Membre du jury d admission INRIA.

85 II.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION 85 Commission de sélection Paris 12 (Olivier Bournez) Université d Avignon (Olivier Bournez) 2013 Paris 7 (Olivier Bournez) 2012 Paris 7 (Manuel Bodirsky) 2012 Université d Orléans (Olivier Bournez) 2012 Université d Orléans (Olivier Bournez) 2009 Université Paris 11, Orsay (Manuel Bodirsky) 2012 Université de Marne la Vallée (Christoph Dürr) 2009 Université de Paris-Sud (Christoph Dürr) 2009 Université d Evry (Christoph Dürr) 2010 II.7.3 Activités de formation, encadrement et évaluation II Liste des thèses et HDR soutenues Habilitations à dirigers les recherches Manuel Bodirsky (January 2012). Complexity Classification in Infinite-Domain Constraint Satisfaction Théses de doctorat Mathilde Hurand (2008). A contribution to optimization for Scheduling and some other problems. Encadrant: Christoph Dürr. Nguyen Kim Thang (2009). Pure Equilibria: Existence, Inefficiency and Online Auction. Encadrant: Christoph Dürr. Florian Richoux (2009). Toward a Complexity Classification of CSP Through Kernel Width. Encadrant: Miki Hermann. Encadrant: Population pro- Xavier Koegler (2012). Olivier Bournez et Pierre Fraignaud. tocols: games, and large populations. Rappor- II Liste de rapports de thèses et HDR Rapports d habilitations à dirigers les recherches Emmanuel Jeandel (2011). Propriétés structurelles et calculatoires des pavages. teur: Olivier Bournez. Sylvain Peyronnet (2010). Approximation and Verification. Rapporteur: Olivier Bournez. Nicolas Ollinger (2010). Programmation et indécidabilités dans les systèmes complexes. Rapporteur: Olivier Bournez. Florent Madelaine (2012). Rapporteur: Manuel Bodirsky. Julia Kempe (2010). Calcul quantique. Rapporteur: Christoph Dürr.

86 86 CHAPTER II.7. ANNEXES : ALGORITHMIQUE ET COMPLEXITÉ Rapports de thèse Pierre Coucheney (2011). Université de Grenoble I. Rapporteur: Olivier Bournez. Mathieu Tracol (2010). LRI. Rapporteur: Olivier Bournez. Udi Boker (2009). Université de Tel Aviv, Israel. Rapporteur: Olivier Bournez. Mathieu Hoyrup (2010). ENS Paris. Rapporteur: Olivier Bournez. Johann Brault-Baron (2013). De la pertinence de l énumeration. Rapporteur: Manuel Bodirsky. Université de Caen. Nina Runge (2008). Problèmes d ordonnancement avance-retard avec et sans préemption. Université Pierre et Maire Curie. Rapporteur: Christoph Dürr. Marc Kaplan (2009). Méthodes combinatoires et Algébriques en Complexité de la Communication. Université Paris-Sud. Rapporteur: Christoph Dürr. Jurys de thèse Fabio Roda (2013). Président: Olivier Bournez. Alberto Costa (2012). Président: Olivier Bournez. Romain Testylier (2012). Pierre Coucheney (2011). André Chailloux (2011). Président: Olivier Bournez. Membre: Olivier Bournez. Membre: Olivier Bournez. Mathieu Tracol (2010). Membre: Olivier Bournez. Udi Boker (2009). Membre: Olivier Bournez. Chahinez Hamlaoui (2009). Kim Thang Nguyen (2009). Membre: Olivier Bournez. Membre: Olivier Bournez. Mathieu Hoyrup (2008). Florian Richoux (2009). Membre: Olivier Bournez. Membre: Manuel Bodrisky. Johann Brault-Baron (2013). Johann Brault-Baron (2013). Membre: Miki Hermann. Membre: Manuel Bodrisky. II Enseignements dispensés Cours universitaires en M2 Cours Algorithmes et Complexité des Problèmes de Satisfaction des Contraintes du MMPRI (Miki Hermann, Manuel Bodirsky) Cours Ordonnancement du MPRI (Philippe Baptiste, Christoph Dürr, Vincent Jost, Leo Liberti) Cours Théorie des Calculs du MPRI (Olivier Bournez)

87 II.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ 87 Cours à l Ecole Polytechnique Cours INF421 Fondements de l algorithmique et de la programmation en 2008, 2009 et 2010 (Olivier Bournez). Cours INF423 Logiques, Modèles, Calculs (Olivier Bournez). Cours INF561 Complexité en 2009 et 2010 (Olivier Bournez). Ecoles thématiques et cours spécialisés Winter school Lyon (Spring 2013) ER03: Problèmes de satisfaction de contraintes, one weak research winter school at ENS Lyon (organised by Pascal Koiran), with Michael Pinsker. 2009, école d été à Valparaiso (Chili), Algorithmic game theory (Christoph Dürr) Vulgarisation M. Hermann et P. Lescanne. Le plus difficile des problèmes difficiles. Les Dossiers de La Recherche, 37:54 57, trimestriel novembre II.7.4 Autres éléments de visibilité II Invitations Participation à des rencontres scientifiques sur invitation seulement Fields Institute Toronto (2011). Manuel Bodirsky. Dagstuhl (2008). Manuel Bodirsky. AIM (2008). Manuel Bodirsky. Dagstuhl (2010). Manuel Bodirsky. Dagstuhl (2012). Manuel Bodirsky. Leeds (2011). Manuel Bodirsky. Prague (2012). Manuel Bodirsky. Schloß Dagstuhl (13-18 janvier 2013). Miki Hermann. Séminaire Computational Counting, Contribution: How Hard It Is To Count Easily. Schloß Dagstuhl (18-23 novembre 2012). Miki Hermann. Séminaire SAT Interactions. Microsoft Research, Cambridge (5-6 juillet 2010). Miki Hermann. International Workshop on Tractability. Contribution: What Makes Minimal Inference Tractable.. Schloß Dagstuhl (2009) octobre Miki Hermann. Séminaire The Constraint Satisfaction Problem: Complexity and Approximability. Séjours invités TU Wien (2009). Miki Hermann a été invité 1 mois pour un séjour scientifique. TU Wien (2010). Miki Hermann a été invité 1 mois pour un séjour scientifique. TU Wien (2012). Miki Hermann a été invité 1 mois pour un séjour scientifique. TU Wien (2013). Miki Hermann a été invité 1 mois pour un séjour scientifique.

88 88 CHAPTER II.7. ANNEXES : ALGORITHMIQUE ET COMPLEXITÉ II Prix et distinctions Christoph Dürr a obtenu le prix du meilleur article dans la conférence European Symposium on Algorithms (ESA) en 2009 AlCoAlgorithmique et Complexité

89 III Équipe Bio-Informatique (AMIB) 89

90

91 III.1 Liste des membres : Bio-Informatique III.1.1 III Liste actuelle des membres Membres permanents Nom Fonction Employeur HDR Arrivée Julie Bernauer CR, CHE INRIA, École Polytechnique 2010 Philippe Chassignet Maitre de conférence École Polytechnique 1984 Yann Ponty CR CNRS 2009 Mireille Régnier Directeur de recherche INRIA HDR 2009 Jean-Marc Steyaert Professeur École Polytechnique HDR 1978 Evelyne Rayssac Assistant École Polytechnique III Doctorants et postdoctorants Doctorants Nom Financement Arrivée Encadrant Antoine Soulé McGill/X 2012 J.-M. Steyaert Adrien Guilhot-Gaudeffroy UPSud 2011 J. Bernauer Daria Iakovishina X 2011 M. Regnier Erwan Bigan 2012 J.-M. Steyaert Postdoctorants Nom Financement Dates Responsable Rasmus Fonseca INRIA 2012 J. Bernauer III Visiteurs et autres membres Visiteurs de longue durée Nom Financement Dates Invitant Laurent Schwartz AP-HP 2013 J.-M. Steyaert III.1.2 III Anciens membres Membres permanents Nom Fonction Employeur HDR Départ Position actuelle Pierre Nicodème Chargé de recherche CNRS 2011 Retraité III Doctorants et postdoctorants Doctorants Nom Financement Départ Encadrant Position actuelle Thuong Van Du Tran J.-M. Steyaert Postdoc Mahsa Behzadi J.-M. Steyaert PostDoc Audrey Sedano J.-M. Steyaert on leave 91

92 92 CHAPTER III.1. LISTE DES MEMBRES : BIO-INFORMATIQUE Postdoctorants Nom Financement Dates Responsable Position actuelle Saad Sheikh CNRS/INRIA M. Régnier Ingénieur R&D (Bing, Microsoft), USA Valentina Boeva CNRS M. Régnier Chercheur, Institut Curie, France Balaji Raman X J.-M. Steyaert Assistant professeur, IIT, Inde Loïc Paulevé X M. Régnier CR2-CNRS, LRI, France III Stagiaires Master 2 Autres membres Nom Financement Dates Responsable Position actuelle Antoine Soulé X 2012 J.-M. Steyaert/Y. Ponty Thèse LIX/McGill Alice Jacquot ENS 2010 Y. Ponty Thèse LIPN Angela Yen X/MIT 2011 Y. Ponty Thèse MIT Moustadrani Saïd Ibrahim DIGITEO 2010 Y. Ponty Ingénierie Al Habib Ibrahim Arabie Saoudite 2013 Ph. Chassignet Ingénierie Arax Martirosyan INRIA 2012 M. Régnier Thèse IPCF- CNR Leonid Uroshlev INRIA 2012 J. Bernauer Thèse Université de Moscou Visiteurs de longue durée Nom Financement Dates Invitant Robert Giegerich DGAR Mai 2012-Juin 2012 Y. Ponty Peter Clote DIGITEO Juin 2009-Juin 2012 J.-M. Steyaert Vsevolod Makeev DIGITEO Septembre 2010 M. Regnier Autres Nom Fonction Financement Dates Invitant Evgenia Furletova Co-adv. PhD Univ. Moscou (4 months) M. Regnier

93 III.2 Rapport scientifique : Bio- Informatique III.2.1 Thématique générale et principaux objectifs III 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 Thè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 three- 93

94 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

95 III.2.1. THÉMATIQUE GÉNÉ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 96 CHAPTER III.2. RAPPORT SCIENTIFIQUE : BIO-INFORMATIQUE 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 Exemples de résultats significatifs 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

97 III.2.1. THÉMATIQUE GÉNÉ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. Azé (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. Nicodè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 Animation scientifique, rayonnement, prix et récompenses 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 Fonctionnement interne Amib est un projet Inria commun au Lix, au Lri et au CNRS : UMR 7161 et Il est bilocalisé entre le Lix et le Lri. Un séminaire commun de l équipe se réunit chaque semaine, généralement au Lri, en alternant les exposé internes et les invitations. Les principaux financement de l équipe sur la période sont un contrat Digiteo ( ) impliquant le Lri et Boston College ( Euros, une bourse post-doctorale de 3 ans et une bourse de thèse), un contrat industriel ( ) avec Philip Morris ( euros) et des contrats internationaux d équipes associées d Inria et du Mesr pour un total de Euros. S y ajoutent un soutien Inria, un partenariat Anr ( euros) et divers petits contrats ou subventions. Deux bourses post-doctorales ont été financées par Inria. III Formation par la recherche Notre appartenance en tant que groupe d enseignement à la communauté bioinformatique est un atout certain. Nous avons et renforçons un groupe d étudiants à compétences multidisciplinaires aux niveaux Master et PhD. Notre équipe est aussi très impliquée dans deux programmes d études majeurs en France. Elle a contribué à la création du Master Bibs (Bioinformatique et Biostatistique) de l Université Paris-Sud, cohabilité par l Ecole Polytechnique depuis 2010, qui devrait devenir le Master de Bioinformatique de l Université de Paris-Saclay. Elle assure le parcours d Approfondissement en Bioinformatique de l Ecole Polytechnique. Des échanges sont en cours pour favoriser des stages de Polytechniciens et d étudiants de Master dans des services opérationnels de l AP-HP.

98 98 CHAPTER III.2. RAPPORT SCIENTIFIQUE : BIO-INFORMATIQUE Trois thèses ont été soutenues, avec des financements du Ministere et de l Ecole Polytechnique et quatre sont en préparation, dont une en co-tutelle avec l Université de McGill. M. Régnier a coencadré à l Université de Moscou la thèse d E. Furletova et á l Université Al-Farabi (Kazkhstan) les thè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. Régnier suivent ou ont suivi la thèse de deux doctorants de l Université de Moscou, (E. Furletova (2012) et L. Uroshlev (2014)). Deux post-doctorants Ercim ont été accueillis pour un mois par Amib, dans le cadre du cursus externe d Ercim. Trois étudiants ont été soutenus par Google dans le cadre du programme Google summer of code pour intégrer notre logiciel Varna, et plus généralement des fonctionalités spécifiques à l ARN, au sein du logiciel JalView, populaire éditeur d alignements multiples. Nous participons depuis 2013 à un réseau d étudiants entre l Univerité de McGill et Paris- Sud/Ecole Polytechnique. Ce partenariat franco-canadien soutient des stages co-encadrés (3-6 mois) et des cotutelles de thèses. Des stagiaires internationaux sont régulièrement accueillis dans l équipe (3/4 par an) dans le cadre des programmes internationaux de l Ecole Polytechnique et d Inria.

99 III.3 Projet de recherche : Bio- Informatique III.3.1 Objectifs scientifiques 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 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 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

101 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 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 Université Paris-Descartes (Pharmacie) and A.Denise (Lri, Université 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 102 CHAPTER III.3. PROJET DE RECHERCHE : BIO-INFORMATIQUE 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 D 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.5Å 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.

103 III.3.2. MISE EN OEUVRE 103 III 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. Israë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. Paulevé 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/É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 Université Paris-Sud/École Polytechnique and the parcours d Approfondissement en Bioinformatique at É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 École Polytechnique in 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 104 CHAPTER III.3. PROJET DE RECHERCHE : BIO-INFORMATIQUE

105 III.4 Analyse AFOM : Bio-Informatique INTERNE POSITIF Interdisciplinarit e R eseau international Projet Inria AMIB, commun LRI M ethodes g en eriques, permettant une transposition `a d autres applications Cr eation institut de mod elisation des sciences de vivants Ecosyst`eme foisonnant dans les sciences du vivant Atouts Opportunit es A F O M Manque de doctorants Peu de publications communes Peu de collaborations avec exp erimentalistes Faiblesses Menaces Masse critique Evolution rapide des th ematiques et questions pertinentes en biologie NEGATIF EXTERNE Figure III.4.1: Analyse AFOM de l équipe Bio-Informatique : Atouts, Faiblesses, Opportunités, Menaces 105

106 106 CHAPTER III.4. ANALYSE AFOM : BIO-INFORMATIQUE

107 III.5 Fiche résumé : 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 Départ de membres de l équipe Pierre Nicodème (Actuellement Retraité) Nouveaux membres M. Régnier (Mutation INRIA), Y. Ponty (Recrutement CR CNRS), J. Bernauer (Mutation INRIA), L. Schwartz (Pr., mise à disposition AP-HP). III.5.2 Résultats scientifiques Ré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]. Ré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]. Ré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]. Ré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 Production scientifique III Publications Journaux : 34 Conférences internationales :

108 108 CHAPTER III.5. FICHE RÉSUMÉ : BIO-INFORMATIQUE 5 productions scientifiques marquantes: 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 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 Actions de formation 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 Université Paris-Sud/École Polytechnique and the parcours d Approfondissement en Bioinformatique at É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. Régnier took an active part to the creation of Computer Science speciality at the French Agrégation de Mathématiques in 2006 and has been a member of the committee until 2012.

109 III.6 Production scientifique : Bio- Informatique III.6.1 Livres et chapitres de livres [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 [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, III.6.2 Revues internationales [111] Frédérique Bassino, Julien Clément, and Pierre Nicodème. Counting occurrences for a finite set of words: combinatorial methods. ACM Transactions on Algorithms (TALG), 8(3):1 28, [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), [113] Julie Bernauer, Samuel Flores, Xuhui Huang, Seokmin Shin, and Ruhong Zhou. MULTI- SCALE MODELLING OF BIOSYSTEMS: FROM MOLECULAR TO MESOCALE - Session Introduction. Pacific Symposium on Biocomputing, pages , [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): , June [115] Jérémie Bourdon and Mireille Regnier. Large deviation properties for patterns. Journal of Discrete Algorithms, JDA534, in press. [116] Thomas Bourquard, Julie Bernauer, Jérôme Azé, and Anne Poupon. A collaborative filtering approach for protein-protein docking scoring functions. PLoS ONE, 6(4):e18541, [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, [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 [119] Kévin Darty, Alain Denise, and Yann Ponty. VARNA: Interactive drawing and editing of the RNA secondary structure. Bioinformatics, 25(15):1974 5, August [120] Alain Denise, Yann Ponty, and Michel Termier. Controlled non uniform random generation of decomposable structures. Theoretical Computer Science, 411(40-42): , [121] Lou Feng and Peter Clote. Thermodynamics of RNA structures by wang landau sampling. Bioinformatics, 26: ,

110 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, Jérôme Azé, Seren Soner, Sefik Kerem Ovali, Pemra Ozbek, Nir Ben Tal, Türkan Haliloglu, Howook Hwang, Thom Vreven, Brian G Pierce, Zhiping Weng, Laura Pérez-Cano, Carles Pons, Juan Ferná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): , November [123] Samuel Flores, Julie Bernauer, Xuhui Huang, Ruhong Zhou, and Seokmin Shin. MULTI- RESOLUTION MODELING OF BIOLOGICAL MACROMOLECULES - Session Introduction. Pacific Symposium on Biocomputing, 15: , [124] Samuel C Flores, Julie Bernauer, Seokmin Shin, Ruhong Zhou, and Xuhui Huang. Multiscale modeling of macromolecular biosystems. Briefings in Bioinformatics, 13(4): , July [125] Adeline Guais, Gérard Brand, Laurence Jacquot, Mélanie Karrer, Sam Dukan, Georges Grévillot, Thierry Jo Molina, Jacques Bonte, Mireille Regnier, and Laurent Schwartz. Toxicity of carbon dioxide: A review. Chemical Research in Toxicology, 24(12): , December [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, [127] Assel Issabekova, Olga Berillo, Mireille Regnier, and Anatoly Ivashchenko. Interactions of intergenic micrornas with mrnas of genes involved in carcinogenesis. Bioinformation, 8(11): , June [128] Anatoly Ivashchenko, Galina Boldina, Aizhan Turmagambetova, and Mireille Régnier. Using profiles based on hydropathy properties to define essential regions for splicing. International Journal of Biological Sciences, 5:13 19, [129] Alex Levin, Mieszko Lis, Yann Ponty, Charles W O Donnell, Srinivas Devadas, Bonnie Berger, and Jérôme Waldispühl. A global sampling approach to designing and reengineering RNA secondary structures. Nucleic Acids Research, 40(20): , November [130] Andy Lorenz and Yann Ponty. Non-redundant random generation algorithms for weighted context-free languages. Theoretical Computer Science, 502: , September 2013.

111 BIBLIOGRAPHY 111 [131] Sé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 [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):E , June [133] Gayun Park, Hsien-Kuei Hwang, Pierre Nicodème, and Wojciech Szpankowski. Profile of tries. SIAM Journal on Computing, 38(5): , [134] Vladimir Reinharz, Yann Ponty, and Jérôme Waldispühl. A weighted sampling algorithm for the design of RNA sequences with targeted secondary structure and nucleotide distribution. Bioinformatics, 29(13):i308 i315, July [135] Cédric Saule, Mireille Regnier, Jean-Marc Steyaert, and Alain Denise. Counting RNA pseudoknotted structures. Journal of Computational Biology, 18(10): , October [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): , August [137] Laurent Schwartz, Adeline Guais, Maurice Israë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 [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 [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, [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): , April [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 [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, [143] Thuong Van Du Tran, Philippe Chassignet, and Jean-Marc Steyaert. On permuted super-secondary structures of transmembrane β-barrel proteins. Theoretical Computer Science, Accepted, to appear. [144] Jérôme Waldispü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): , November 2011.

112 112 BIBLIOGRAPHY [145] Yang Zhang, Yann Ponty, Mathieu Blanchette, Eric Lecuyer, and Jérôme Waldispühl. SPARCS: a web server to analyze (un)structured regions in coding RNA sequences. Nucleic Acids Research, 41(Web Server issue):w480 5, III.6.3 Conférences internationales [146] Patrick Amar and Loïc Paulevé. 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 [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 , pages , Kyoto, Japon, 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 , volume 113 of Discrete Mathematics and Theoretical Computer Science Proceedings, pages 35 48, Vienna, Autriche, June 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 , volume 113 of Discrete Mathematics and Theoretical Computer Science Proceedings, pages 49 64, Vienna, Autriche, Discrete Mathematics and Theoretical Computer Science. [150] Thomas Bourquard, Julie Bernauer, Jérôme Azé, 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 , Copenhagen, Danemark, June 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, [152] Jérémie Du Boisberranger, Daniè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 , volume dmaq01 of Discrete Mathematics and Theoretical Computer Science Proceedings, pages , Montreal, Canada, 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 , Orlando, États-Unis, IEEE Computer Society. [154] Yann Ponty and Cé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 , Saarbrucken, Allemagne, Springer Berlin Heidelberg.

113 III.6.4. CONFÉRENCES NATIONALES 113 [155] Vladimir Reinharz, Yann Ponty, and Jérôme Waldispü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 , Beijing, Chine, Springer. [156] Vladimir Reinharz, Yann Ponty, and Jérôme Waldispü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 , volume 29 of Bioinformatics, pages i308 i315, Berlin, Allemagne, 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 , Ljubljana, Slovénie, 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 , Beijing, Chine, Springer. [159] Saad Sheikh, Rolf Backofen, and Yann Ponty. Impact of the energy model on the complexity of RNA folding with pseudoknots. In Juha Kärkkäinen and Jens Stoye, editors, CPM - 23rd Annual Symposium on Combinatorial Pattern Matching , volume 7354 of Lecture Notes in Computer Science, pages , Helsinki, Finlande, 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 , Orlando, FL, États-Unis, February IEEE Computer Society. [161] Jérôme Waldispü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 , volume 6577 of Lecture Notes in Computer Science, pages , Vancouver, Canada, Springer Berlin / Heidelberg. [162] Yu Zhou, Yann Ponty, Stéphane Vialette, Jérôme Waldispü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 , Bethesda, Washigton DC, États-Unis, September ACM digital libraries. III.6.4 Conférences nationales [163] Erwan Bigan, Jean-Marc Steyaert, and Stéphane Douady. Properties of random complex chemical reaction networks and their relevance to biological toy models. In Proceedings of Journées Ouvertes en Biologie, Informatique et Mathématiques (JOBIM 13), page à paraître, Toulouse, France, 2013.

114 114 BIBLIOGRAPHY [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, Journées Ouvertes en Biologie, Informatique et Mathématiques (JOBIM), pages , Nantes, France, July Société Française de Bioinformatique. III.6.5 Conférences invitées [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, Schloss Dagstuhl Leibniz-Zentrum fuer Informatik. [166] Jérôme Waldispü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 , Halifax, Canada, SIAM Activity Group on Discrete Mathematics. III.6.6 Thèses [167] Mahsa Behzadi. Un modèle mathématique de la biosynthèse des phospholipides. These, Ecole Polytechnique X, July [168] Philippe Chassignet. Modelisation et analyse automatisée de la radiographie de la main de l enfant. These, Ecole Polytechnique X, November [169] Thuong Van Du Tran. Modeling and predicting super-secondary structures of transmembrane beta-barrel proteins. These, Ecole Polytechnique X, December III.6.7 III.6.8 Rapports techniques Logiciels III 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 lines of code in 250 classes. It has been downloaded times and is cited by 150 research manuscripts (source: Google Scholar). Availability: Distributed under the GPL v3 licence since 2009 at III 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...

115 III.6.8. LOGICIELS 115 GenRGenS currently ships in its 2.0 version, and consists in lines of code in 120 Java classes. It has been downloaded times and is cited by 55 research manuscripts (source: Google Scholar). Availability: Distributed under the GPL v3 licence since 2006 at genrgens/ III 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 net/ III 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, (5): Availability: (Since 2008) III 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, (5): for further details. Availability: (Since 2007)

116 116 BIBLIOGRAPHY

117 III.7 Annexes : Bio-Informatique III.7.1 Participations à la communauté scientifique et responsabilités administratives Responsabilités administratives des membres de l équipe incluant responsabilités de recherche et d enseignement J. Bernauer Membre du Bureau du Comité des Projets (période ). Correspondante INRIA au GT IDEX Biologie de l Université Paris-Saclay (période ). Y. Ponty Membre élu du comité national du CNRS en section 6 : Sciences de l information : fondements de l informatique, calculs, algorithmes, représentations, exploitations (période ). Membre élu du comité national du CNRS en CID 51 : Modélisation et analyse des données et des systèmes biologiques : approches informatiques, mathématiques et physiques (période ). Animateur de l axe Structure et interactions des macromolécules du GDR 3003 Bioinformatique Moléculaire (période ). Membre suppléant du conseil de laboratoire, et membre de la commission système du LIX (période ). M. Régnier Responsable de l équipe-projet Amib (période ). Jury de l agrégation de mathématiques (période ). J.-M. Steyaert III Correspondant à Polytechnique pour le master MPRI et membre du Comité de direction. (période ). Co-responsable du master BIBS (BioInformatique et BioStatistiques), cohabilité Paris- Sud/Polytechnique depuis Y. Ponty, M. Régnier et J.-M. Steyaert sont co-responsables des matières CASM (YP/MR/JMS) et AAO (JMS). (période ). Président du Comité scientifiquede l ESIEA (période 2013-). Responsabilités de projets internationaux Projet MIGEC ( ) (Type: Equipe associée INRIA) Titre: Mathé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. Régnier. Montant de la collaboration pour le LIX: 50000/10000 euros. 117

118 118 CHAPTER III.7. ANNEXES : BIO-INFORMATIQUE Projet CARNAGE ( ) (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. Partenaires: INRIA/LIX, IN- RIA/MAGNOME et VIGG (Moscow, Russia). Responsable: M. Régnier. Montant de la collaboration pour le LIX: 25000/25000 euros. Projet GNAPI ( ) (Type: Equipe associé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. GNAPI/. Partenaires: INRIA/LIX and Stanford University School of Medicine (USA). Responsable: J. Bernauer. Montant de la collaboration pour le LIX: / euros. Projet ITSNAP ( ) (Type: Equipe associé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. 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: / euros. Projet CompMiRNA ( ) (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 Participation à des projets nationaux Projet MAGNUM ( ) (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: rossin/anr/magnum/www/. Partenaires: LIX, LIP6, INRIA, LIAFA, LIGM et LIPN. Responsable: Y. Ponty. Montant de la collaboration pour le LIX: euros/ euros.

119 III.7.2. ADMINISTRATION DE LA RECHERCHE 119 Projet Prométéines (2011) (Type: PEPS CNRS) Titre: Approches combinatoires pour la prédiction des interactions ARN-proté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: 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: heures CPU. III Participation à des projets locaux RNAomics ( ) (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 ( 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: euros with euros for the LIX. Projet BioStat ( ) (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: euros. III.7.2 Administration de la recherche III Activités éditoriales Membres de comités éditoriaux Journal of Virology (ASM) Jean-Marc Steyaert (2009-). Voir III Gestion scientifique de conférences Présidence de comités de programme PSB (Session Multi-resolution Modeling of Biological Macromolecules) (2010,2011). J. Bernauer. Participation à des comités de programme 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. Régnier. BICOB (Conference on Bioinformatics and Computational Biology) (2012, 2013). Y. Ponty, M. Régnier, et J.-M. Steyaert. JOBIM (Journées Ouvertes en Biologie, Informatique et Mathématiques) (2011, 2012, 2013). Y. Ponty. WRSBS (Robustness and Stability of Biological Systems and Computational Solutions) (2012). J. Bernauer, Y. Ponty et M. Régnier.

120 120 CHAPTER III.7. ANNEXES : BIO-INFORMATIQUE CPM (Combinatorial Pattern Matching) (2011). M. Ré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. Régnier. III Organisation d événements scientifiques Présidence de comités d organisation 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. Régnier et Y. Ponty. Bioinformatics after Next Generation Sequencing workshop (France-Russia year labellized event) (2010). M. Régnier et V. Makeev. Participation à des comités d organisation MCCMB (Moscow conference on computational molecular biology) (2009,2011,2013). M. Régnier. ALEA (Journées/Ecole thématique CNRS ALEA ) (2011). Y. Ponty. Models for Cell Metabolism (Journée d exposés invités) (2012,2013). J. Bernauer, M. Ré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 Participation à des comités et jurys scientifiques Au niveau international Arbitrage appel à projet UEFISCDI (2011, 2013) Y. Ponty. Research Council Romania. Commission de recrutement (2013) M. Régnier. Université de Taiwan. Au niveau national ANR ( ) M. Régnier. Comité d évaluation des projets.. Digiteo ( ) M. Régnier. Comité de programmation et d évaluation des projets.. Arbitrage appel à projet EMERGENCE(S) (2011) Y. Ponty. Mairie de Paris.

121 III.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION 121 Commission de sélection INRIA (J.Bernauer) Membre. Jury Recrutement CR cocnrs ( ) Y. Ponty. Membre élu du comité national du CNRS, à la fois en section 6 (Sciences de l information : fondements de l informatique, calculs, algorithmes, représentations, exploitations) et CID 51 (Modélisation et analyse des données et des systèmes biologiques : approches informatiques, mathématiques et physiques).. IGR UFR, LIP6, Université Pierre et Marie Curie (Y. Ponty) 2013 MCF UFR, PRISM, Université de Versailles/St Quentin (Y. Ponty) 2012 MCF IUT, PRISM, Université de Versailles/St Quentin (Y. Ponty) 2011 MCF UFR, LaBRI, Université de Bordeaux I (M. Régnier) 2012 Chaire Inria-Paris XI (M. Régnier) 2010 INRIA (M. Régnier) Représentation scientifique dans des recrutements administratifs. Jury interne Postdoc QUALCOMM, LIX, Ecole Polytechnique (Y. Ponty) 2011 Postdoc QUALCOMM, LIX, Ecole Polytechnique (J. Bernauer) 2012 III.7.3 III Activités de formation, encadrement et évaluation Liste des thèses et HDR soutenues Thèses de doctorat Thuong Van Du Tran (Décembre 2011). Modeling and predicting super-secondary structures of transmembrane beta-barrel proteins. Encadrant: J.-M. Steyaert. Mahsa Behzadi (Juillet 2011). Un modèle mathématique de la biosynthèse des phospholipides. Encadrant: J.-M. Steyaert. Philippe Chassignet (29 novembre 2012). Modélisation et analyse automatisée de la radiographie de la main de l enfant. Encadrant: J.-M. Steyaert. III Liste de rapports de thèses et HDR Jurys d habilitations à diriger des recherches Jérémie Bourdon (5 Décembre 2012). Sources probabilistes des séquences aux systèmes. Membre: Laboratoire d informatique de Nantes-Atlantique (Lina). M. Régnier Rapports de thèse Cédric Loi (31 Mai 2011). Inférence bayésienne Markov, Processus de Modèle de Markov Caché Modèle de croissance de plantes Plantes Croissance Processus stochastiques. Ecole Centrale de Paris. Rapporteur: Mireille Régnier. Oumarou Abdou Arbi (30 septembre 2013). Etude de la variabilité des contributions de nutriments à un réseau métabolique : modélisation, optimisation et application en nutrition. Université de Rennes 1. Rapporteur: Mireille Régnier.

122 122 CHAPTER III.7. ANNEXES : BIO-INFORMATIQUE Jurys de thèse Y. Ponty, M. Régnier et Jean-Marc Steyaert ont participé à des jurys de thèse à l Ecole Polytechnique, Paris-Sud, ESIEA, Clermont-Ferrand, Laval, Lille, Nancy et Nantes. III Enseignements dispensés Cours universitaires en M2 Jury Master BIBS, Paris XI/Ecole Polytechnique Cours : Combinatoire, Algorithmes, Séquences et Modélisation (CASM) (4 28h). Intervenant(s): Y. Ponty, M. Régnier et J.-M. Steyaert Master BIBS, Paris XI/Ecole Polytechnique Cours : Advanced Algorithms and Optimization (AAO) (4 28h). Intervenant(s): J.-M. Steyaert Master BIBS, Paris XI/Ecole Polytechnique Cours : Informatique théorique et Programmation Python (20h). Intervenant(s): J. Bernauer Master BIM, Université Pierre et Marie Curie, Paris Cours : Modé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. Régnier Master of Science Computational Biology, Université de Nice Cours : Algorithmic Problems in Computational Structural Biology (9h). Intervenant(s): J. Bernauer Agrégation de Mathématiques Option Informatique ( ). M. Régnier. Ecole Polytechnique Concours d admission, validation de 3e et 4e année. J.-M. Steyaert. Ecoles thématiques et cours spécialisés Formation professeurs des classes préparatoire, CIRM Cours : Mots et motifs: combinatoire et asymptotique (5h). Intervenant(s): M. Régnier Retraite de l IGM (Paris-Sud), Seillac Cours : A brief tutorial on RNA folding methods and resources... (2h). Intervenant(s): Y. Ponty EMBO Tutorial at VIZBI 12, EMBL Heidelberg 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 Cours : Dock blaster tutorial (3h). Intervenant(s): J.Bernauer Vulgarisation Lycée Blaise Pascal Séminaire de vulgarisation (2h) en direction de 50 élèves de terminales, autour du repliement et design de l ARN, et co-organisé par l Inria et l académie de Versailles. Intervenant(s): Y. Ponty Nuit des chercheurs, Ecole Polytechnique Animation ARN Kezako?, dédiée aux repliement et design de l ARN. Intervenant(s): J. Bernauer, Y. Ponty et M. Régnier

123 III.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ 123 Interview sur le site Interstices Titre: Mieux comprendre certaines molécules biologiques grˆace à l informatique. Intervenant(s): Y. Ponty Évènement Unithé ou café de l Inria Saclay Avril Présentation Faire danser virtuellement des ARN. Intervenant(s): Y. Ponty Fête de la science à Saclay Animation du stand de l Inria. Intervenant(s): J. Bernauer, Y. Ponty et M. Régnier 12e Salon Culture et Jeux Mathématiques, Paris Animation Construisons des ARN! à l occasion de l année de la chimie. Intervenant(s): J. Bernauer, Y. Ponty et M. Régnier III.7.4 Autres éléments de visibilité III Rencontres scientifiques sur invitation TBI WinterSeminar (2013). Y. Ponty à participé à la retraite du Theoretical Biochemistry Institute (Bled, Slovénie) et exposé Parameterized-complexity algorithms for the sequence/structure alignment problem.. VIZBI (2012). Y. Ponty a participé à la conférence VIZBI 12, consacrée à la visualisation de données biologique. Présentation d un tutorial invité 1/2/3D visualization of RNA avec Jim Procter (Univ. Dundee, Ecosse) et d un exposé long Visualizing 2D & 3D Structures of RNA. Benasque RNA meeting (2009 et 2012). Y. Ponty a été invité par E. Rivas et E. Westhof à présenter ses travaux en bioinformatique des ARN (6 exposés au total répartis sur les des deux éditions) lors de l évènement. LPS&LAW (2012). M. Régnier a été invitée par L. Mouchard à présenter un exposé. Séminaire Dagstuhl Combinatorial and Algorithmic Aspects of Sequence Processing, (Saarbrücken, Allemagne) (2011). Y. Ponty a été invité à présenter des travaux en algorithmique des séquences. Boston (2011). Jean-Marc Steyaert a présenté un mini-cours sur les méthodes asymptotiques en combinatoire des structures à une école d été sur l ARN. International Conference on Biomolecular Dynamics: Experiment Meet Computation, KAUST, Saudi Arabia (2013). Julie Bernauer a présenté 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 présenté ses travaux sur le Multi-scale modelling for RNA structures: a challenge.. III Invitations McGill University (2010, 2011, 2012). Y. Ponty a été invité (30 j. au total) dans le cadre d une collaboration avec J. Waldispühl.

124 124 CHAPTER III.7. ANNEXES : BIO-INFORMATIQUE

125 III.8 Réfé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 [171] J. Bernauer, J. Azé, J. Janin, and A. Poupon. A new protein-protein docking scoring function based on interface residue properties. Bioinformatics, 23(5): , Mar [172] Julie Bernauer, Ranjit Prasad Bahadur, Francis Rodier, Joë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 [173] Julie Bernauer, Anne Poupon, Jérôme Azé, and Joël Janin. A docking analysis of the statistical physics of protein-protein recognition. Phys Biol, 2(2):S17 S23, Jun [174] Valentina Boeva, Andrei Zinovyev, Kevin Bleakley, Jean-Philippe Vert, Isabelle Janoueix- Lerosey, Olivier Delattre, and Emmanuel Barillot. Control-free calling of copy number alterations in deep-sequencing data using gc-content normalization. Bioinformatics, 27(2): , [175] Rhiju Das. Four small puzzles that Rosetta doesn t solve. PLoS One, 6(5):e20044, [176] Hugo Devillers and Sophie Schbath. Separating significant matches from spurious matches in DNA sequences. Journal of Computational Biology, 19(1):1 12, [177] Philippe Flajolet and Robert Sedgewick. Analytic combinatorics. cambridge University press, [178] Uri Keich and Pavel A. Pevzner. Subtle motifs: defining the limits of motif finding algorithms. Bioinformatics, 18(10): , [179] Marc F. Lensink and Shoshana J. Wodak. Docking and scoring protein interactions: Capri Proteins, 78(15): , Nov [180] D. Manocha, Y. Zhu, and W. Wright. Conformational analysis of molecular chains using nano-kinematics. Comput Appl Biosci, 11(1):71 86, Feb [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): , May [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, [183] Guillermo Rodrigo, Thomas E. Landrain, Eszter Majer, José-Antonio Darò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):e , Aug [184] Wojciech Szpankowski. Average Case Analysis of Algorithms on Sequences. Wiley Series in Discrete Mathematics and Optimization. Wiley-Interscience, AMIBBio-Informatique 125

126 126 BIBLIOGRAPHY

127 IV Équipe Combinatoire (COMBI) 127

128

129 IV.1 Liste des membres : Combinatoire IV.1.1 IV Liste actuelle des membres Membres permanents Nom Fonction Employeur HDR Arrivée Gilles Schaeffer DR, PCC CNRS, École Polytechnique HDR Ekaterina Vassilieva CR CNRS Luca Castelli-Aleardi MdC École Polytechnique Éric Fusy CR, CHE CNRS, École Polytechnique Marie Albenque CR CNRS Dominique Rossin CR, PCC CNRS, École Polytechnique HDR Vincent Pilaud CR CNRS Maks Ovsjanikov MDC CNRS, École Polytechnique Sylvie Jabinet Assistant CNRS IV Doctorants et postdoctorants Doctorants Nom Financement Arrivée Encadrant Gwendal Collet AMN É. Fusy Olivier Schwander AMN F. Nielsen Postdoctorants Nom Financement Dates Responsable Viorica Patraucean Qualcomm M. Ovsjanikov IV Visiteurs et autres membres Visiteurs de longue durée Nom Financement Dates Invitant Menelaos Karavelas DIGITEO Mar L. Castelli Aleardi Stagiaires Master 2 Nom Financement Dates Responsable Position actuelle Quentin de Mourgues ANR Magnum Juin-Aout 2013 D. Rossin Etudiant en thèse Autres Nom Fonction Financement Dates Anatoly Kostrygin Stagiaire M1 École Polytechnique Avril

130 130 CHAPTER IV.1. LISTE DES MEMBRES : COMBINATOIRE IV.1.2 IV Anciens membres Membres permanents Nom Fonction Employeur HDR Départ Position actuelle Frank Nielsen Professeur École Polytechnique HDR Sony Dominique Poulalhon MdC Paris Paris 7 IV Doctorants Doctorants et postdoctorants Nom Financement Départ Encadrant Position actuelle Guillaume Chapuy AMN 2009 G. Schaeffer CR CNRS au LIAFA Postdoctorants Nom Financement Dates Responsable Position actuelle Axel Bacher ERC G. Schaeffer Post-doc Sylvain Boltz Qualcomm F. Nielsen Office européen des brevets Chris Dowden ERC G. Schaeffer Post-doc Juanjo Rué ERC G. Schaeffer Post-doc Vincent Garcia ANR F. Nielsen Ingénieur R&D IV Autres membres Visiteurs de longue durée Nom Financement Dates Invitant Alejandro H. Morales ERC Juin-Août 2008 G. Schaeffer & E. Vassilieva Alain Goupil ERC Sept-Oct 2011 G. Schaeffer Louis François Preville Ratelle NSERC Nov 2011-Feb 2012 G. Schaeffer & E. Vassilieva Michael Albert DIGITEO Oct 2012 D. Rossin

131 IV.2 Rapport scientifique : Combinatoire IV.2.1 Introduction Composante historique du LIX, l équipe de Combinatoire s est restructurée au début de la période autour du projet ExploreMaps soutenu par l ERC au titre des Research Starting Grants, en se donnant comme thème principal de recherche, la combinatoire énumérative et l algorithmique des cartes, ie des représentations combinatoires de plongements de graphes dans une surface. Autrement dit, le projet initial de l équipe était celui d explorer une combinatoire de la géométrie, avec un intérêt particulier pour les objets de nature essentiellement bidimensionnelle, et à partir de compétences méthodologiques allant de l énumération exacte et asymptotique à l analyse d algorithmes ou la combinatoire algébrique, de la génération aléatoire à la conception de structures de données succinctes et au dessin de graphe. Au fil de l extension de notre champs de recherche et de la croissance de l équipe, nous avons entrepris l exploration d autres facettes de la relation entre combinatoire et géométrie, autour d objets tels que les revêtements ramifiés ou les polytopes, et c est finalement cette coloration géométrique/topologique de la combinatoire qui nous intéresse qui fait la spécificité de notre équipe dans le paysage national et international. Au plan local, c est aussi ce qui nous a amené à abriter au sein de l équipe des thèmes de recherche connexes autour de l analyse de données géométriques et de l analyse géométrique de données: si les outils mis là en œuvre sont différents, une partie des objets manipulés sont communs, ce qui permet une certaine convergence d intérêts. IV.2.2 Thèmes de recherche La combinatoire bijective, les cartes Nous voyons les objets combinatoires fondamentaux tels que les permutations, les arbres ordonnés ou les graphes comme les formes mathématiques élémentaires que peuvent prendre les structures discrètes. La combinatoire bijective peut être comprise comme une façon d aborder l étude des propriétés premières de ces objets. Il est alors naturel d attendre que tout progrès significatif dans la compréhension des propriétés combinatoires de ces objets ait en particulier des retombées en algorithmique, en mathématique, voire dans les autres sciences naturelles qui utilisent des objets discrets pour leur modélisation, notamment la physique statistique ou la génomique. Notre intérêt pour les cartes procède de cette démarche. De même qu on peut dire des arbres combinatoires qu ils capturent les propriété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 delà de la combinatoire, un écho plus particulier en géométrie algorithique, en physique autour de questions de construction de modèles de la gravité quantique, et en mathématique autour de questions de probabilités et de topologie énumérative. Dans ces travaux fondamentaux les questions d énumération nous servent à la fois de motivation initiale et de guide pour avancer: lorsqu un calcul montre l existence d une formule d énumération simple pour une famille d objets combinatoires, nous l interprétons comme la trace d une propriété structurelle sous-jacente encore à découvrir. Cette démarche, héritée de la grande école bordelaise de combinatoire bijective, se révèle particulièrement fructueuse pour l étude des cartes. Exploration de cartes, arbres et orientations Cette première direction de recherche est née de l observation par des membres de l équipe au début des années 2000 qu un certain nombre d algorithmes classiques d exploration de graphes (parcours en largeur, parcours en profondeur, parcours eulériens, etc) sont naturellement associés à des familles de cartes pour lesquelles ils conduisent à des décompositions bijectives en terme de familles simples d arbres. 131

132 132 CHAPTER IV.2. RAPPORT SCIENTIFIQUE : COMBINATOIRE Ces résultats d énumération bijective de cartes ont connu un retentissement certain, à la fois pour leur élégance il s agit des premières preuves éclairantes de vieux résultats d énumération particulièrement simples et restés jusque là mystérieux et pour les avancé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 étude probabiliste de modèles de surfaces aléatoires issus de la gravité quantique (voir plus bas). De nombreuses variantes ou extensions de ces premières constructions ont été obtenues au fil des ans, par des membres de l équipe et d autres combinatoristes (Bernardi, Bousquet-Mélou,... ), mais aussi par des probabilistes (Miermont, Bettinelli,... ) ou des physiciens (Bouttier, di Francesco, Guitter, Budd,... ). Il est ainsi apparu petit à petit que certaines orientations, les α-orientations minimales, jouent un rôle crucial pour plusieurs de ces bijections. Technique d énumération La combinatoire énumérative est passée lors des 50 dernières années du status de bric-à-brac d astuces que critiquait les mathématiciens sérieux du siecle dernier à celui d une discipline bien établie sur quelques fondements qu on réunit aujourd hui sous les termes de méthode symbolique et combinatoire analytique, pour reprendre la terminologie de l un des maîtres à penser du domaine, Philippe Flajolet. Malgré ce tableau bucolique, la frontière du domaine reste toujours peuplée d équations exotiques résolues par des tours de force et d ingéniosité. Nous nous intéressons dans ce domaine plus particulièrement aux équations à variables catalytiques, qui interviennent fréquemment dans les questions d énumérations de cartes: si les équations polynomiales à une variables catalytiques sont maintenant bien comprises grâce aux travaux de Bousquet-Mélou notamment, les équations même linéaires à plusieurs variables catalytiques ou leurs variantes exp/ log continuent de poser de nombreuses questions. Aléa discret Notre é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 théoriques et de la théorie des langages (au sens initial de Chomsky-Schützenberger), de la combinatoire énumérative et analytique et des probabilités autour d objets aléatoires issus de l analyse d algorithmes, des mathématiques discrètes ou de la physique. Une question fondamentale de ce domaine est de savoir décrire des structures aléatoires de grande taille. L exemple de base est celui de l analyse du temps d exécution moyen de l algorithme de tri quicksort randomisé, qui se ramène à la question de connaître le comportement moyen d un certain paramètre des grandes permutations aléatoires uniformes. Une variante jusqu ici relativement moins étudiée de ces analyses en moyenne (de la complexité) d algorithmes est celle de l analyse en moyenne de leur qualité de sortie, dont nous avions proposé un premier exemple il y a quelques années dans le contexte du dessin de graphe. La question est de dessiner une triangulation à n sommets en plaçant ses sommets sur d une grille N N aussi petite que possible. Alors que la complexité dans le pire cas dit que N doit être égal au moins à n 2, nous avons montré que pour une triangulation aléatoire, la taille de la grille nécessaire est sensiblement plus petite en moyenne. Enfin un outil fondamental de l étude de l aléa discret est fourni par les algorithmes de génération aléatoire. En permettant d engendrer des objets aléatoires de grande taille selon une distribution prescrite à l avance, ces algorithmes offrent la possibilité d observer in silico les propriétés limites d objets rétifs à l analyse. Utilisés de longue date en physique statistique, la génération aléatoire a longtemps fait appel quasi exclusivement à la méthode de simulation de chaine de Markov: cette méthode permet dans de nombreux cas d obtenir facilement des objets aléatoires dont la distribution tends vers la distribution souhaitée, mais à quelques rares exceptions près, la qualité de l approximation obtenue n est pas facilement controlable. Sous l impulsion notamment de Philippe Flajolet, se sont développées des techniques de génération aléatoire alternatives telles que la génération récursive ou plus récemment la génération Bolzmanienne, à l emergence de laquelle plusieurs membres de l équipe ont contribué. Ces approches donnent des algorithmes beaucoup plus efficaces et elles sont automatisables pour de

133 IV.2.2. THÈMES DE RECHERCHE 133 grandes classes de structures dites décomposables. Un des challenges de ce domaine est de faire entrer des objets complexes, non facilement décomposables, dans le champs d application de ces méthodes. Compression et structures de données compactes Parmi les applications algorithmiques de la combinatoire des cartes, l une des plus importantes est le codage de structures données. Plusieurs membres de notre équipe ont contribué avec leurs travaux aux domaines de la compression de données et de la conception de représentations compactes. En particulier, les décompositions bijectives à base d arbres bourgeonnants ont conduit aux premièrs codages optimaux pour des objets tels que les triangulations et les graphes 3-connexes, correspondant à la connectivité sousjacente aux maillages triangulaires et polygonaux (le problème de comprimer efficacement de telles structures avait fait l objet de nombreux travaux dans les communautés de la géométrie algorithmique et de la modélisation geómétrique). En plus des questions de simple compression, l attention a été aussi portée sur l étude de structures de données nécessitant une petite quantité de ressource mémoire et permettant de répondre à des requêtes locales en temps constant. Dans ce cadre, nous nous sommes interessés à la conception de solutions théoriques (représentations succinctes) dont la coût mémoire est asymptotiquement optimal, ainsi qu à la réalisation pratique de structures de données compactes, dont l implémentation garantit en pratique un bon compromis entre l espace mémoire utilisé et l efficacité de la navigation et de la mise à jour. Encore une fois, les propriétés combinatoires mentionnées auparavant (décompositions bijectives et orientations minimales) ont joué un rôle crucial dans l obtention de telles structures. Géométrie de la combinatoire L idée de mettre en évidence géométriquement des propriétés combinatoires est ancienne et naturelle: rien ne montre de manière plus convaincante la symétrie d un objet abstrait que d en donner une réalisation concrète symétrique. Au delà de cet exemple naïf, une façon fondamentale de donner une géométrie à une structure combinatoire est de la réaliser sous forme d un polyèdre, de sorte que les propriétés de ce polyèdre (dimension, convexité, sphéricité, shellability, etc) en reflettent ou expliquent les propriétés combinatoires. Pour illustrer cette approche par des exemples en relation directe avec les travaux de l équipe, citons d une part l existence d un polytope dont les sommets correspondent aux α-orientations d un graphe donné, qui sont des outils fondamentaux pour l étude des cartes planaires, et d autre part les constructions récentes de l associaèdre qui mettent en lumière les connexions entre les triangulations d un (n+3)-gone convexe et les permutations de [n+1]. Cette approche, très éclairante lorsqu elle s applique, est cependant réputée difficile: les polyèdres sont des objets en grande dimension, qui ne deviennent réellement accessibles que lorsqu on peut décrire algorithmiquement leur construction et leur géométrie. Ce point de vue, apporté récemment dans l équipe par Pilaud, vient enrichir notre dialogue entre combinatoire et géométrie. Analyse de données et géométrie Les interactions entre analyse de données et géométrie forment un champs d investigation extrêmement large au sein duquel deux grands axes nous concernent particulièrement. D un côté pour les données d origine géométrique (images, modèles 3d, etc) Ovsjanikov et ses collaborateurs travaillent sur des questions de mise en correspondance de formes non-rigides: le challenge est ici de développer des méthodes robustes, capables de passer à l échelle sur des donné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 côté, une des idées qui sous-tendent les travaux de Nielsen et ses collaborateurs est que les techniques d analyse géométriques peuvent être adaptées à l étude d objets de nature a priori non géométrique, en les voyant justement comme munie d une géométrie propre dans un espace de paramètres bien choisi, notamment dans le cadre de la géométrie de l information. L application de ces idées à l apprentissage (machine learning), au traitement du langage (pattern matching), ou à la bioinformatique conduit à considérer des géométries très différentes de la géométrie euclidienne usuelle mais qui rentrent souvent dans le cadre des mesures de distorsion de Bergman et des familles exponentielles. Le défi relevé est

134 134 CHAPTER IV.2. RAPPORT SCIENTIFIQUE : COMBINATOIRE alors, plutôt que de travailler au cas par cas, d étendre d abord les outils d analyses géométriques à ce cadre très général. IV.2.3 Exemples de résultats significatifs Vers une théorie des bijections entre cartes et arbres L un des objectifs fondamentaux du projet ExploreMaps était de réaliser l unification des nombreuses bijections entre cartes et arbres apparues depuis le début des années 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 résultats permettent de présenter sous un même cadre la quasi totalité des bijections développées jusqu ici pour les cartes, que ce soit vers des mobiles étiquetés ou vers des arbres bourgeonnants. Cartes unicellulaires et surfaces de genre supérieur Si les arbres jouent un rôle central dans la combinatoire bijective des cartes planaires, le passage à des surfaces de genre supérieur conduit à 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 énumération. Le résultat central des travaux de thèse de Guillaume Chapuy [326] ont permis de franchir une étape importante dans la compréhension de ces objets qui a finalement débouché dans les travaux récents de Chapuy, Feray et Fusy [277] sur la première preuve bijective directe de la formule de récurrence de Harer et Zagier. En parallèle, les travaux de Vassilieva et ses coauteurs ont permis de comprendre bijectivement l interprétation des formules à la Harer et Zagier en terme de cartes colorées et d arriver ainsi à traiter le cas le plus général des constellations unicellulaires [256, 236, 325], ainsi qu à obtenir des résultats dans le cas plus difficile des cartes sur des surfaces non orientées [289, 324]. Grands graphes et grandes cartes aléatoires Le comportement asymptotique des graphes et des cartes planaires aléatoires de taille tendant vers l infini fait l objet d une intense activité ces dernières années, à laquelle participe activement l équipe. Albenque et Addario-Berry ont montré [327] que les triangulations simples aléatoires uniformes à 2n arêtes de longueur renormalisée ( 4n 3 ) 1/4 convergeaient vers la carte brownienne. Ce résultat, le premier portant sur la convergence d un modèle de cartes satisfaisant des contraintes de connexité, vient renforcer l hypothèse d universalité selon laquelle tous les modèles raisonnables de cartes convergent vers le même objet. Si pour les cartes de nombreux résultats ont déjà été obtenus, le cas des graphes aléatoires est beaucoup plus difficile. Fusy et ses collaborateurs [278] ont obtenu un premier résultat dans cette direction et ont montré que le diamètre des graphes planaires aléatoires uniformes à n sommets est concentré autour de n 1/4. Ordres canoniques et bois de Schnyder Les travaux de Castelli Aleardi et Fusy, avec Devillers [272] et Lewiner [210, 275], illustrent parfaitement les retombées algorithmiques que nous attendons de l étude des orientations dans les cartes: dans le premier cas l étude des bois de Schnyder sur un cylindre permettent de développer de nouveaux algorithmes de dessins planaires périodiques de graphes toriques, tandis que dans le second cas l extension au genre supé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 résolu un vieux problème ouvert posé par Knuth dans les années 60, le status polynomial ou NP de la reconnaissance des permutations triables par deux piles en séries. Ce travail passe par la caractérisation fine d une nouvelle sous classe de permutations triables suivant une politique particulière (pushall sortable

135 IV.2.4. ANIMATION SCIENTIFIQUE, RAYONNEMENT, PRIX ET RÉCOMPENSES 135 permutations) [332]. Grâce à ce premier résultat, techniquement particulièrement difficile, ils obtiennent dans [333] un algorithme polynomial pour le problème de Knuth. Décomposabilité des polytopes simpliciaux Pilaud et ses collaborateurs Hähnle et Klee ont donné dans [233] des obstructions à la décomposabilité faible pour les polytopes simpliciaux qui ferment une approche possible de la conjecture de Hirsch polynomiale. Cette conjecture, en étroite relation avec le problème de déterminer la complexité de l algorithme du simplexe pour la programmation linéaire, a suscité d importantes recherches motivées par le récent contreexemple de Santos à la conjecture de Hirsch classique. Apprentissage rapide de modèles de mélange avec des outils géométriques Dans les articles [320] [321], Schwander et Nielsen étendent l approche proposée par Nielsen pour les mélanges de familles exponentielles. Cette généralisation, qui permet d utiliser des composantes de mélanges issues de plusieurs familles exponentielles, permet d apprendre efficacement des mélanges de Gaussiennes généralisées et de lois Gamma pour lesquels les outils sur les familles exponentielles au sens strict étaient inapplicables. Symétries et appariements d objets géométriques Dans l article [247], Ovsjanikov, Patraucean et leur collègues introduisent une nouvelle méthode pour l appariement de formes non rigides présentant des symétries intrinsèques (par ex. une paire de formes humaines). Alors que la majorité des travaux existants s efforcent de surmonter cette ambiguité en échantillonant un ensemble de correspondences de motifs caractéristiques (landmark correspondence), l idée est de travailler directement dans l espace quotienté par les symétries présentes. La comparaison de cette technique avec les meilleures méthodes actuelles montre que des résultats supérieurs peuvent ainsi être obtenu aussi bien dans le cas où la symétrie est connue que dans le cas où elle doit être estimée. IV.2.4 Animation scientifique, rayonnement, prix et récompenses Les membres de l équipe participent à plusieurs comités éditoriaux et de nombreux comités de programme dont le comité restreint du Journal of Combinatorial theory, Series A et le comité du nouveau journal édité par la société européenne de mathématique Annals of IHP: Combinatorics, Physics and Applications. L é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 était l un des principaux acteurs a obtenu le Grand Prix ANR du Numérique en IV Fonctionnement interne Depuis la mise en place du projet européen ExploreMaps, l équipe organise un séminaire hebdomadaire au LIX. Les besoins financiers de l équipe sur la période ont été en grande partie couverts par le soutien de l ERC au projet ExploreMaps pour ce qui touche aux activités autour des cartes, par l ANR Magnum pour les activités autour des permutations, ainsi que par l ANR GAIA pour les activités autour de l analyse géométrique de données. De manière plus marginale, nous avons pris part au projet ANR A3. Enfin nous avons bénéficié du soutien de Qualcomm au LIX. Ces projets ont notablement permis de financer 72 mois de postdocs et 48 mois de détachements CNRS au sein de l équipe. Plus récemment, les nouveaux membres de l équipe sont impliqués dans plusieurs projets nationaux (ANR JCJC Carteaplus et EGOS, chaire d excellence CNRS), ou internationaux (projet FP7 CIG et Google Faculty Award).

136 136 CHAPTER IV.2. RAPPORT SCIENTIFIQUE : COMBINATOIRE Au total l équipe a bénéficié sur la période d environ euros de financement (majoritairement en frais de personnel), et l avenir est assuré à l horizon de 2/3 ans grâce aux projets engagés. IV Formation par la recherche L équipe est impliquée dans la formation sur ses thèmes de recherche principalement au travers du cours 2-10 du MPRI, aspects algorithmiques. de la combinatoire. Les thèses effectuées dans l équipe ont été financées par des bourses d allocataires normaliens.

137 IV.3 Projet de recherche : Combinatoire IV.3.1 Introduction Une des forces de l équipe Combinatoire est de réunir en son sein des compétences très variées autour d une thématique commune relativement bien définie: les interactions entre combinatoire et géomé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 à décrire ci-dessous, en mettant l accent sur les outils et les objets fondamentaux: suivant notre philosophie, si la théorie est bonne les applications suivront. Par ailleurs, tous membres de l équipe ont leur specialité propre et leur réseau de collaborations extérieures qui ne sont pas détaillés ici. Nous considérons fondamental que chacun cultive ainsi une spécificité individuelle et une ouverture sur le monde extérieur, la plupart des membres de l équipe étant voués à établir leur autonomie scientifique et à prendre leur envol à plus ou moins brève échéance. IV.3.2 Objectifs scientifiques et mise en œuvre Surfaces, orientations Comme cela est expliqué dans les pages précédentes, la théorie bijective des cartes est bien avancée dans le cas planaire: les algorithmes classiques d exploration de graphe y jouent un rôle fondamental, de même que les treillis d orientations. Plusieurs avancé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 porté: cependant ces résultats sont encore relativement isolés, en particulier faute d une bonne compréhension des propriétés des orientations dans ce contexte. Nous pensons qu il reste là, pour employer l expression consacrée, un verrou scientifique majeur: c est pourquoi nous voulons porter un effort particulier sur l étude des propriétés à la fois structurelle et énumérative de ces orientations. Certains aspects de ce problème sont au cœur du projet ANR JCJC EGOS dont l équipe est partie prenante, d autres font l objet du démarrage d une thèse en cotutelle avec l équipe combinatoire du LIAFA. Enfin, si les surfaces non-orientées paraissent encore hors de porté pour les techniques à base d orientations, les récentes avancées bijectives dans le cas unicellulaire non-orienté ouvrent des perspectives intéressantes. Technique d énumération et aléa discret La confluence des outils bijectifs, algébriques, probabilistes et algorithmiques qui caractérise la communauté ALÉA se retrouve, toute proportion gardée, dans notre équipe. Les compétences pointues dans chacun de ces différents domaines de certains membres de l équipe donnent régulièrement lieu à des collaborations individuelles extérieures sur des sujets aussi variés que la bioinformatique, l étude de modèles d urnes ou la résolution de systèmes d équations fonctionnelles combinatoires exotiques et, comme cela a déjà été dit, nous pensons que cela est sain. Quant aux travaux que nous menons autour des cartes, ils se prolongent naturellement par l étude de modèles de surfaces aléatoires. Les résultats déjà mentionnés d Albenque avec Addario- Berry appellent plus généralement à décrire des conditions suffisantes auxquelles une décomposition bijective en termes d arbre donne des résultats de convergence vers la carte Brownienne. En particulier on pourrait espérer obtenir par ce genre de méthodes la convergence vers la carte Brownienne d un modèle assez différent comme celui des revêtements ramifiés simples comptés par la formule d Hurwitz et pour lesquels Duchi, Poulalhon et Schaeffer ont récemment donné une construction en terme d arbres de Cayley. 137

138 138 CHAPTER IV.3. PROJET DE RECHERCHE : COMBINATOIRE Dans le contexte quelque peu différent de la géométrie algorithmique, se pose la question de définir combinatoirement des sous-classes de surfaces ayant une géométrie typique de type euclidienne. Un objectif à moyen terme dans ce contexte serait de développer des versions paramétriques des générateurs aléatoires de cartes permettant de contraindre simultanément les degré des sommets et des faces, afin de comprendre où se situe la transition entre les cartes aléatoires uniformes (qui converge vers la carte Brownienne, dont la géométrie n est pas du tout euclidienne) et les réseaux réguliers. Algorithmique combinatoire Comme expliqué ci-dessus, nous attendons naturellement de nos travaux combinatoires qu ils débouchent sur des résultats algorithmiques. Ainsi dans le domaine du dessin automatique de graphes, nos travaux sur les orientations minimales nous permettent de proposer de nouvelles stratégies de dessin contraints sur grilles et d en mener l analyse en moyenne pour montrer qu elles apportent un gain de compacité. Deux directions se proposent naturellement: étendre la pratique de l analyse en moyenne de qualité de sortie pour des algorithmes de dessin existant, et étendre les résultats de dessin périodique (ou dessin sur un cylindre) aux autres algorithmes de dessin planaires à base d orientations et de décompte de faces. Dans le domaine du codage compact, nous travaillons à des représentations optimales de familles de maillages, et à la conception de structures de données succinctes: dans ce dernier contexte une difficulté récurrente est de trouver des compromis entre résultats combinatoires, qui conduisent à des structures optimales mais très rigides, et contraintes pratiques de simplicité et de flexibilité. Ainsi les travaux récents de Castelli-Aleardi et ses coauteurs ont permis d obtenir des structures de données compactes pour les triangulations dont l implémentation pratique garantit un bon compris entre taux de compression et temps de requête. Ces représentations ont été conçues à l aide au départ d outils combinatoires tels que les bois de Schnyder. Il serait intéressant de pousser les stratégies utilisées dans ce cadre (entre autres, le calcul d une permutation des sommets et cellules du maillage de départ), afin d obtenir des structures de données pour des classes plus générales de maillages. On pourrait tirer profit encore une fois des propriétés des décompositions bijectives à base d arbres bourgeonnants. En plus d avoir des représentations bien plus générales, on pourrait aussi espérer un meilleur taux de compression et une réduction du coût mémoire dans la phase de construction de la structure. Le cas 3D (maillages volumiques) reste presque totalement à explorer, que ce soit du point de vue de la compression que de celui des structures de données compactes: nous espérons pouvoir tirer profit d éventuelles caractérisations combinatoires (généralisations des orientations de Schnyder) des complexes de dimension 3, qui font actuellement l objet d étude de plusieurs membres de notre équipe. Motifs, permutations et cartes Les liens entre énumération de cartes et motifs exclus dans les permutations remontent aux travaux de Goulden et West et de Guibert dans les années 90 et sont restés un peu oubliés jusqu à ce que le sujet soit relancé tout récemment par de nouveaux exemples présentés par Kitaev et ses coauteurs. Au delà du plaisir de comprendre les coïncidences énumératives qui surgissent dans ce contexte, nous pensons qu il y a un réel intérêt à croiser le point de vue algorithmique sur les motifs exclus porté par Rossin dans son projet de recherche personnel et les compétences autour de l aléa discret présentes dans l équipe: ainsi nous nous proposons de revisiter la conception d algorithmes de tri linéaire dans le pire cas pour des familles de permutations définies par motifs exclus à la lumière de l analyse en moyenne, avec l espoir qu il soit plus facile de construire systématiquement des algorithmes linéaires en moyenne pour ces classes. Géométrie de la combinatoire Les travaux menés par Pilaud dans ce cadre autour de la combinatoire et la géométrie de complexes de sous-mots associés aux groupes de Coxeter et sur la réalisation par polytopes de struc-

139 IV.3.2. OBJECTIFS SCIENTIFIQUES ET MISE EN ŒUVRE 139 tures combinatoires offrent plusieurs points de rencontre avec l étude des cartes: on peut citer par exemple l interprétation en termes de cartes des factorisations dans le groupe symétrique et la question d en donner des analogues pour les autres groupes de Coxeter. Dans le but de développer les interactions au sein de l équipe autour de ces thèmes plusieurs séances du séminaire y ont été consacrées et à l occasion du séjour dans l équipe de Holweg à l automne 2013 nous prévoyons qu il nous donne un cours interne sur le sujet. D autres thèmes seront aussi abordés, en particulier la dynamique et les propriétés limites des racines d un groupe de Coxeter infini, et les possibles applications aux constructions géométriques pour les treillis Cambriens de groupes infinis. Ces sujets sont dans le prolongement direct des travaux de plusieurs membres de l équipe sur les connexions entre le groupe symétrique et le treillis de Tamari sur les triangulations d un polygone convexe. Outils spectraux, géométriques et combinatoires pour l analyse de graphes quasi-géométriques L analyse et le traitement de grands graphes (type réseaux sociaux, graphe de l internet, ou graphes d interaction d usagers) font couramment appel à des techniques d analyse spectrale: ainsi les valeurs et vecteurs propres de diverses matrices Laplaciennes permettent de décrire la structure des communautés dans ces réseaux. Cependant une observation récente et encore peu exploitée est que nombre de ces graphes présentent une nature quasi-géométrique liée au fait que le monde physique dans lequel évoluent les usagers influencent les relations qu ils entretiennent. Dans cette direction notre but est d exploiter l expertise de l équipe autour du dessin de graphe, du codage de maillage et des outils spectraux pour développer des outils et des techniques pour analyser, compresser et traiter de tels grands graphes. L idée est en particulier de tirer partie du lien entre la géométrie du plongement sous-jacent du graphe et sa structure en communauté décrite par les propriétés spectrales: en effet la présence d une structure géométrique, peu exploité jusqu ici, est susceptible d avoir un profond impact sur les propriétés du graphe, mais aussi de permettre d importer dans ce nouveau contexte des techniques de compression, d exploration ou traitement à grande échelle issues de l informatique géométrique. Dimensions supérieures La plupart des résultats présentés dans ce rapport portent sur des modèles de surfaces aléatoires. Quid des dimensions supérieures? Jusqu ici aucun modèle intéressant combinatoirement, ou plus généralement avec des propriétés probabilistes convaincantes, n a vraiment été trouvé: c est à la fois un problème notoirement difficile de topologie énumérative et un défi majeur de la gravité quantique de le faire. Notre intention est de concentrer nos efforts sur cette direction dans les années à 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 à la représentation des maillages 3d, comme déjà mentionné plus haut. D autre part, en collaboration avec des physiciens du plateau et du LIPN nous avons entrepris l étude des propriétés énumératives de modèles de complexes simpliciaux inspiré par des modèles de tenseurs aléatoires: nous avons obtenu un premier résultat important en obtenant l asymptotique des complexes colorés en dimension D de degré k quelconque (seul les cas k = 0 et k = 1 étaient connus), et nous travaillons l extension à certains complexes orientés en dimension 3. Enfin nous envisageons d autres pistes, globalement autour de la question fondamentale de définir des classes non triviales d objets tridimentionnels admettant des décompositions bijectives en structures de dimension inférieure. L objectif avoué, peut être utopique, est de trouver une alternative aux définitions en terme d épluchage (shellability) pour espérer définir des sous-classes de complexes intéressantes mais de croissances exponentiellement bornées.

140 140 CHAPTER IV.3. PROJET DE RECHERCHE : COMBINATOIRE

141 IV.4 Analyse AFOM : Combinatoire INTERNE POSITIF Liens avec les labos de physique th eorique du plateau, avec Geometrica Forte dynamique en r egion parisienne autour des th ematiques principales de l equipe Equipe pluridisciplinaire avec un projet coh erent et publications communes Forte reconnaissance internationale, leadership sur nos domaines de comp etence. Jeunesse et dynamisme des membres de l equipe Implication au DIX et au MPRI Atouts Opportunit es A F O M Taux d encadrement de stagiaires et de th esards trop faible. Un seul rang A dans l equipe. Implication insuffisante dans la structuration du plateau Faiblesses Menaces Marginalisation des aspects recherche fondamentales en algorithmiques et combinatoires au sein des nouvelles entit es structurantes du plateau. D epart des membres permanents juniors `a court/moyen terme NEGATIF EXTERNE Figure IV.4.1: Analyse AFOM de l équipe Combinatoire : Atouts, Faiblesses, Opportunités, Menaces 141

142 142 CHAPTER IV.4. ANALYSE AFOM : COMBINATOIRE

143 IV.5 Fiche résumé : 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 Départ de membres de l équipe conférence à Paris Diderot). F. Nielsen (Chercheur chez Sony), D. Poulalhon ( Maître de Nouveaux membres É. Fusy, D. Rossin, M. Albenque, V. Pilaud, M. Ovsjanikov. IV.5.2 Résultats scientifiques Combinatoire de la géométrie 2d L équipe a contribué largement aux riches développements qu a connu la théorie combinatoire des cartes au cours de ces dernières années: en particulier les membres de l équipe sont en grande partie à l origine de la prise de conscience de l importance des orientations minimales dans ce contexte. À côté d un gros travail d unification de la théorie, et de l obtention de nombreux résultats d énumération bijective, les membres de l équipe se sont aussi attachés à développer ses applications: en algorithmique avec de nouveaux résultats de codage, de dessin ou de génération aléatoire, ou le développement de structures de données succinctes; sur des questions d aléa discret, avec l obtention de résultats sur le comportement asymptotique de grandes cartes ou graphes planaires aléatoires. Géométrie de la combinatoire Nous abordons des questions de géométrie discrète (au sens anglophone du terme), avec l idée d utiliser la géométrie notament des polyèdres convexes pour faire apparaître des propriétés de structures combinatoires. Dans ce contexte Pilaud a obtenu avec ses collaborateurs différents types de résultats, allant de nouvelles constructions générales de réalisations d associaèdres généralisés à des résultats d indécomposabilités ou des algorithmes d énumérations de configurations géométriques. Alignement et analyse de formes tridimensionnelles Ovsjanikov développe avec ses collaborateurs un ensemble cohérent d algorithmes autour de la comparaison d objets géométriques et de l analyse de leurs symétries, avec lesquels il obtient dans plusieurs cas les meilleurs résultats actuels sur les données des benchmarks du domaine (shape matching, symmetry based matching, symmetry detection). Géométrie de l information algorithmique Les outils fondamentaux développés autour des mesures de distorsion de Bregman et des familles exponentielles par Nielsen et ses coauteurs leur ont permis d obtenir de nouveaux résultats autour de la classification et des modèles statistiques, avec des applications dans des domaines très variés allant de l analyse de données biologiques au traitement du langage. IV.5.3 Production scientifique IV Publications Nos travaux ont conduit sur la période à la publication d environ 70 articles de journaux internationaux et autant en acte de conférences internationales. Illustrons ceci de quelques résultats significatifs: 143

144 144 CHAPTER IV.5. FICHE RÉSUMÉ : COMBINATOIRE L article Boltzmann samplers, Polya theory, and cycle pointing par M. Bodirsky, E. Fusy, M. Kang, et S. Vigerske (SIAM J. Comput., 40(3): , 2011), propose un nouveau paradigme pour traiter les symétries dans la conception d algorithmes de génération alé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): , 2009) pose les bases de l explication combinatoire de la dépendance liné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 (à paraître dans les actes du prochain colloque ACM-SIAM SODA), le paradigme du codage bijectif de cartes par arbres planaires est étendu pour traiter des revêtements à l aide d arbres étiquetés non plongés, avec comme application de nouveaux algorithmes de génération alé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 différence de forme, qui permet, au lieu de se contenter d une mesure unique par un nombre comme dans les travaux antérieurs, de fournir des information détaillées sur la position et la nature de ces différences. Cet article fait partie des 6 papiers mis en avant par le comité de programme de la prestigieuse conférence ACM SIGGRAPH pour l é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) étudie les diffé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 symmétrisé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 , 2012), est développée une nouvelle application au dessin de graphes périodiques des ordres canoniques associés aux bois de Schnyder dont l étude est une spécialité de l équipe. IV Rayonnement Gilles Schaeffer a présidé le comité de programme de la principale conférence internationale annuelle en combinatoire énumérative et algébrique FPSAC 2013, qui réunit plus de 300 participants cette année et qui est co-organisée par les équipes combinatoire du LIX et du LIAFA. Il est aussi membre du comité éditorial restreint du Journal of Combinatorial Theory, Series A. Plus généralement les membres de l équipe participent régulièrement à des comités de programmes de confé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 était largement impliquée, a reçu en 2013 le grand prix ANR du numérique. IV Actions de formation Luca Castelli Aleardi, Maks Ovsjanikov, Eric Fusy et Gilles Schaeffer sont impliqué dans différents cours de niveau L3 et M1 à l École Polytechnique. Gilles Schaeffer coordonne le cours de combinatoire du MPRI au sein duquel interviennent régulièrement Dominique Poulalhon et Éric Fusy.

145 IV.5.3. PRODUCTION SCIENTIFIQUE 145 Gilles Schaeffer a donné une semaine de cours à la 41ème école d été internationale de probabilité de Saint Flour en 2011 et Éric Fusy a donné une semaine de cours à l université technique de Berlin en 2011.

146 146 CHAPTER IV.5. FICHE RÉSUMÉ : COMBINATOIRE

147 IV.6 Production scientifique : Combinatoire Les publications [257] et [201] sont des publications avec des auteurs dans des des équipes différentes. IV.6.1 Livres et chapitres de livres [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, [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 [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 Springer, [188] Olivier Schwander and Frank Nielsen. Learning mixtures by simplifying kernel density estimators. In Frank Nielsen and Rajendra Bhatia, editors, Matrix Information Geometry, pages Springer Berlin Heidelberg, January IV.6.2 Revues internationales [189] Marie Albenque. A note on the enumeration of directed animals via gas considerations. Ann. Appl. Probab., 19(5): , [190] Marie Albenque, Éric Fusy, and Dominique Poulalhon. On symmetric quadrangulations and triangulations. À paraître dans European Journal of Combinatorics, arxiv: , [191] Marie Albenque and Lucas Gerin. On the algebraic numbers computable by some generalized Ehrenfest urns. Discrete Math. Theor. Comput. Sci., 14(2): , [192] Marie Albenque and Jean-François Marckert. Some families of increasing planar maps. Electron. J. Probab., 13:no. 56, , [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, [194] Jérémy Barbay, Luca Castelli Aleardi, Meng He, and J. Ian Munro. Succinct representation of labeled graphs. Algorithmica, 62(1-2): , [195] Frédé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): , [196] Frédérique Bassino, Mathilde Bouvel, and Dominique Rossin. Enumeration of pinpermutations. Electron. J. Combin., 18(1):Paper 57, 39, [197] Olivier Bernardi and Éric Fusy. A bijection for triangulations, quadrangulations, pentagulations, etc. J. Combin. Theory Ser. A, 119(1): , [198] Olivier Bernardi and Éric Fusy. Schnyder decompositions for regular plane graphs and application to drawing. Algorithmica, 62(3-4): ,

148 148 BIBLIOGRAPHY [199] Olivier Bernardi and Éric Fusy. Unified bijections for maps with prescribed degrees and girth. J. Combin. Theory Ser. A, 119(6): , [200] Olivier Bodini, Éric Fusy, and Carine Pivoteau. Random sampling of plane partitions. Combin. Probab. Comput., 19(2): , [201] Manuel Bodirsky, Éric Fusy, Mihyun Kang, and Stefan Vigerske. Boltzmann samplers, Pólya theory, and cycle pointing. SIAM J. Comput., 40(3): , [202] Jean-Daniel Boissonnat, Frank Nielsen, and Richard Nock. Bregman Voronoi diagrams. Discrete and Computational Geometry (DCG, Springer), 44(2): , [203] Jürgen Bokowski and Vincent Pilaud. Enumerating topological (n k )-configurations. To appear in Computational Geometry: Theory and Applications., [204] Nicolas Bonichon, Mireille Bousquet-Mélou, and Éric Fusy. Baxter permutations and plane bipolar orientations. Sém. Lothar. Combin., 61A:Art. B61Ah, 29, 2009/10. [205] Mireille Bousquet-Mélou, Éric Fusy, and Louis-François Préville-Ratelle. The number of intervals in the m-tamari lattices. Electron. J. Combin., 18(2):Paper 31, 26, [206] Mathilde Bouvel, Cedric Chauve, Marni Mishna, and Dominique Rossin. Average-case analysis of perfect sorting by reversals. Discrete Math. Algorithms Appl., 3(3): , [207] Mathilde Bouvel and Dominique Rossin. A variant of the tandem duplication random loss model of genome rearrangement. Theoret. Comput. Sci., 410(8-10): , [208] Luca Castelli Aleardi, Olivier Devillers, and Abdelkrim Mebarki. Catalog-based representation of 2D triangulations. Internat. J. Comput. Geom. Appl., 21(4): , [209] Luca Castelli Aleardi, Olivier Devillers, and Gilles Schaeffer. Succinct representations of planar maps. Theoret. Comput. Sci., 408(2-3): , [210] Luca Castelli Aleardi, Éric Fusy, and Thomas Lewiner. Schnyder woods for higher genus triangulated surfaces, with applications to encoding. Discrete Comput. Geom., 42(3): , [211] Guillaume Chapuy, É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, [212] Guillaume Chapuy, Michel Marcus, and Gilles Schaeffer. A bijection for rooted maps on orientable surfaces. SIAM J. Discrete Math., 23(3): , [213] Robert Cori, Michel Marcus, and Gilles Schaeffer. Odd permutations are nicer than even ones. European J. Combin., 33(7): , [214] Chris Dowden. The evolution of uniform random planar graphs. Elect. J. Combinatorics, 17:#R7, [215] Chris Dowden. On the maximum size of minimal definitive quartet sets. Discrete Mathematics, 310(19): , [216] Chris Dowden. Random planar graphs with bounds on the maximum and minimum degrees. Graph. Comb., 27(1):87 107, [217] Chris Dowden and Louigi Addario-Berry. Subgraphs of 4-regular planar graphs. Algorithmica, 61(3): , 2011.

149 BIBLIOGRAPHY 149 [218] Michael Drmota, Éric Fusy, Mihyun Kang, Veronika Kraus, and Juanjo Rué. Asymptotic study of subcritical graph classes. SIAM J. Discrete Math., 25(4): , [219] Enrica Duchi, Simone Rinaldi, and Gilles Schaeffer. The number of Z-convex polyominoes. Adv. in Appl. Math., 40(1):54 72, [220] Enrica Duchi and Gilles Schaeffer. A combinatorial approach to jumping particles: the parallel TASEP. Random Structures Algorithms, 33(4): , [221] Murray Elder, Éric Fusy, and Andrew Rechnitzer. Counting elements and geodesics in Thompson s group F. J. Algebra, 324(1): , [222] Stefan Felsner, Éric Fusy, and Marc Noy. Asymptotic enumeration of orientations. Discrete Math. Theor. Comput. Sci., 12(2): , [223] Stefan Felsner, Éric Fusy, Marc Noy, and David Orden. Bijections for Baxter families and related objects. J. Combin. Theory Ser. A, 118(3): , [224] Valentin Féray and Ekaterina Vassilieva. Bijective enumeration of some colored permutations given by the product of two long cycles. Discrete Math., 312(2): , [225] Julien Ferté, Vincent Pilaud, and Michel Pocchiola. On the number of simple arrangements of five double pseudolines. Discrete Comput. Geom., 45(2): , [226] Éric Fusy. Transversal structures on triangulations: a combinatorial study and straightline drawings. Discrete Math., 309(7): , [227] Éric Fusy. Uniform random sampling of planar graphs in linear time. Random Structures Algorithms, 35(4): , [228] Éric Fusy. New bijective links on planar maps via orientations. European J. Combin., 31(1): , [229] Éric Fusy. Bijective counting of involutive Baxter permutations. Fund. Inform., 117(1-4): , [230] É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, [231] Éric Fusy, Dominique Poulalhon, and Gilles Schaeffer. Bijective counting of plane bipolar orientations and Schnyder woods. European J. Combin., 30(7): , [232] Vincent Garcia, Frank Nielsen, and Richard Nock. Simplification and hierarchical representations of mixtures of exponential families. Signal Processing (Elsevier), 90(12): , December [233] Nicolai Hähnle, Steve Klee, and Vincent Pilaud. Obstructions to weak decomposability for simplicial polytopes. To appear in Proceedings of the American Mathematical Society., [234] Minghui Jiang, Vincent Pilaud, and Pedro J. Tejada. On a dispersion problem in grid labeling. SIAM J. Discrete Math., 26(1):39 51, [235] Benjamin Matschke, Julian Pfeifle, and Vincent Pilaud. Prodsimplicial-neighborly polytopes. Discrete Comput. Geom., 46(1): , [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 150 BIBLIOGRAPHY [237] Frank Nielsen. Steering self-learning distance algorithms. Communications of the ACM, 52(11):Virtual Extensions, November [238] Frank Nielsen and Sylvain Boltz. The Burbea-Rao and Bhattacharyya centroids. IEEE Transactions on Information Theory, 57(8): , august [239] Frank Nielsen and Richard Nock. On the smallest enclosing information disk. Information Processing Letters, 105(3):93 97, January [240] Frank Nielsen and Richard Nock. Approximating smallest enclosing balls with applications to machine learning. International Journal on Computational Geometry and Applications, 19(5): , October [241] Frank Nielsen and Richard Nock. Sided and symmetrized Bregman centroids. IEEE Transactions on Information Theory, 55(6): , June [242] Frank Nielsen and Richard Nock. Skew Jensen-Bregman Voronoi diagrams. Transactions on Computational Science XIV, 6970: , [243] Richard Nock and Frank Nielsen. Bregman divergences and surrogates for learning. IEEE Transactions on Pattern Matching and Machine Intelligence, 31(11): , November [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 [245] Maks Ovsjanikov, Mirela Ben-Chen, Frederic Chazal, and Leonidas Guibas. Analysis and visualization of maps between shapes. To appear in Computer Graphics Forum, [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 [247] Maks Ovsjanikov, Quentin Merigot, Leonidas Guibas, and Viorica Patraucean. Shape matching via quotient spaces. To appear in Computer Graphics Forum, [248] Julian Pfeifle, Vincent Pilaud, and Francisco Santos. Polytopality and Cartesian products of graphs. Israel J. Math., 192(1): , [249] Vincent Pilaud and Michel Pocchiola. Multitriangulations, pseudotriangulations and primitive sorting networks. Discrete Comput. Geom., 48(1): , [250] Vincent Pilaud and Francisco Santos. The brick polytope of a sorting network. European J. Combin., 33(4): , [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 [252] Juanjo Rué. Enumeration and limit laws of dissections on a cylinder. Discrete Mathematics, 310(19): , [253] Juanjo Rué, Ignasi Sau, and Dimitrios M. Thilikos. Asymptotic enumeration of noncrossing partitions on surfaces. Discrete Mathematics, 313(5): , [254] Juanjo Rué, 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 Springer Berlin Heidelberg, 2010.

151 IV.6.3. CONFÉ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.., [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): , [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): , April [258] Ekaterina Vassilieva. Bijective enumeration of 3-factorizations of an N-cycle. Ann. Comb., 16(2): , [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, [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, Numéro 5, pp ), 17(4):25 52, [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): , February IV.6.3 Conférences internationales [262] Marie Albenque and Jéré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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, [263] Marie Albenque, É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 Elsevier, [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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, [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, to appear. [266] Frédé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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, [267] Olivier Bernardi and É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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2010.

152 152 BIBLIOGRAPHY [268] Sylvain Boltz. Entropy regimes for multi-scale and stable image analysis: A new definition of texture. In Computer Vision, ECCV Springer, September [269] Sylvain Boltz and Frank Nielsen. Randomized motion estimation. In IEEE ICIP 2010, September [270] Sylvain Boltz, Frank Nielsen, and Stefano Soatto. Earth mover distance on superpixels. In IEEE ICIP 2010, September [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 Springer, [272] Luca Castelli Aleardi, Olivier Devillers, and É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 Springer, [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 IEEE Computer Society, [274] Luca Castelli Aleardi, Éric Fusy, and Thomas Lewiner. Schnyder woods for higher genus triangulated surfaces. In Computational geometry (SoCG 08), pages ACM, New York, [275] Luca Castelli Aleardi, Éric Fusy, and Thomas Lewiner. Optimal encoding of triangular and quadrangular meshes with fixed topology. In 22nd Canadian Conference on Computational Geometry (CCCG 2010), 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, pages Assoc. Discrete Math. Theor. Comput. Sci., Nancy, [277] Guillaume Chapuy, Valentin Féray, and É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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, [278] Guillaume Chapuy, Éric Fusy, Omer Gimé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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, [279] Gwendal Collet and É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, pages Assoc. Discrete Math. Theor. Comput. Sci., Nancy, [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, [281] Valentin Fé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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2010.

153 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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, [283] Vincent Garcia. Levels of details for gaussian mixture models. In Ninth Asian Conference on Computer Vision (ACCV), volume 5995 (Part II), pages , Xi an, China, September 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 [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 , INRIA Rocquencourt, France, May [286] Vincent Garcia, Frank Nielsen, and Richard Nock. Hierarchical Gaussian mixture model. In International Conference on Acoustics, Speech and Signal Processing (ICASSP), LNCS, March [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 Poster [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, pages Assoc. Discrete Math. Theor. Comput. Sci., Nancy, [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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, [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 , Povoa de Varzim, Portugal, June [291] Frank Nielsen, Sylvain Boltz, and Olivier Schwander. Bhattacharyya clustering with applications to mixture simplifications. In th International Conference on Pattern Recognition (ICPR), pages , [292] Frank Nielsen, Vincent Garcia, and Richard Nock. Gaussian mixture models via entropic quantization. In 2009 European Signal Processing Conference (EUSIPCO), pages , Glasgow, United Kingdom, August [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 [294] Frank Nielsen and Richard Nock. The entropic centers of multivariate normal distributions. In European Workshop on Computational Geometry (EuroCG), pages , Nancy, France, March 2008.

154 154 BIBLIOGRAPHY [295] Frank Nielsen and Richard Nock. Quantum Voronoi diagrams. In European Workshop on Computational Geometry (EuroCG), pages , Nancy, France, March [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 , Toronto, Canada, July [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 IEEE. [298] Frank Nielsen and Richard Nock. Entropies and cross-entropies of exponential families. In IEEE ICIP 2010, pages , September [299] Frank Nielsen and Richard Nock. Hyperbolic Voronoi diagrams made easy. In International Conference on Computational Sciences and Its Applications (ICCSA), volume LNCS, March [300] Frank Nielsen and Richard Nock. Jensen-Bregman Voronoi diagrams and centroidal tessellations. In IEEE ISVD 2010, June [301] Frank Nielsen and Aurélien Serandour. Accuracy of distance metric learning algorithms. In Workshop on Data Mining using Matrices and Tensors (DMMT), Paris, France, June 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 [303] Richard Nock and Frank Nielsen. On the efficient minimization of classification calibrated surrogates. In Neural Information Processing Society (NIPS), pages , Vancouver, B.C., Canada, December [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 [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 , Paris, France, May [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, [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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, [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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, [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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2013.

155 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 [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 hal , 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 , August [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 [314] Paolo Piro, Richard Nock, Frank Nielsen, and Michel Barlaud. Multiclass leveraged k- NN for image classification. In Tenth Asian Conference on Computer Vision (ACCV), New Zealand, November [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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, [316] Olivier Schwander and Frank Nielsen. Reranking with contextual dissimilarity measures from representational bregman k-means. In Paul Richard and José Braz, editors, VISAPP (1), pages INSTICC Press, [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 , [318] Olivier Schwander and Frank Nielsen. PyMEF #x2014; A framework for exponential families in python. In 2011 IEEE Statistical Signal Processing Workshop (SSP), pages , [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 , [320] Olivier Schwander and Frank Nielsen. Fast learning of gamma mixture models with k-mle. In SIMBAD, [321] Olivier Schwander, Aurélien Schutz, Frank Nielsen, and Yannick Berthoumieu. k-mle for mixtures of generalized gaussians. In st International Conference on Pattern Recognition (ICPR), pages , [322] Hiroaki Tobita and Frank Nielsen. Image enforme: Automatic deformation of image for multi-features without information loss. In Pervasive, Nara, Japan, May 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, [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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2012.

156 156 BIBLIOGRAPHY [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 Assoc. Discrete Math. Theor. Comput. Sci., Nancy, IV.6.4 Thèses [326] Guillaume Chapuy. Combinatoire bijective des cartes de genre supérieur. PhD thesis, École Polytechnique, Prix de thèse de l École Polytechnique. IV.6.5 Autres [327] Louigi Addario-Berry and Marie Albenque. The scaling limit of simple triangulations and simple quadrangulations. Prépublication, 46pp., arxiv: , [328] Marie Albenque and Dominique Poulalhon. Generic method for bijections between blossoming trees and planar maps. Prépublication, 41 pp., arxiv: , [329] Cesar Ceballos and Vincent Pilaud. Denominator vectors and compatibility degrees in cluster algebras of finite type. Prépublication, 19 pp., arxiv: , accepté dans Transaction of the American Mathematical Society, [330] Razvan Gurau and Gilles Schaeffer. Colored regular graph of positive degree. Prépublication, 25pp., arxiv: , [331] Adeline Pierrot and Dominique Rossin. Simple permutations poset. Prépublication, 15pp., arxiv: [332] Adeline Pierrot and Dominique Rossin. 2-stack pushall sortable permutations. Prépublication, 41pp., arxiv: , [333] Adeline Pierrot and Dominique Rossin. 2-stack sorting is polynomial. Prépublication, 23pp., arxiv: , [334] Vincent Pilaud and Christian Stump. Brick polytopes of spherical subword complexes : a new approach to generalized associahedra. Prépublication, 45 pp., arxiv: , [335] Vincent Pilaud and Christian Stump. Vertex barycenter of generalized associahedra. Prépublication, 14 pp., arxiv: , accepté dans Proceedings of the American Mathematical Society, IV.6.6 Communications à des conférences nationales sans actes Uni- 8ème Conférence de Génération Aléatoire de Structures Combinatoires (GASCOM 2012) versité Bordeaux 1, Juin 2012 (Vincent Pilaud, The greedy flip tree of a subword complex) Journées ALEA 2012 CIRM, Mars 2012 (Gilles Schaeffer, Modèles de surfaces aléatoires) Gretsi 2011 Bordeaux, Septembre 2011 (Olivier Schwander and Frank Nielsen, Simplification de modèles de mélange issus d estimateur par noyau) Gretsi 2013 Brest, Septembre 2013 (Olivier Schwander and Frank Nielsen, Apprentissage rapide de modèles de mélanges avec k-mle et ses extensions)

157 IV.7 Annexes : Combinatoire IV.7.1 Participations à la communauté scientifique et responsabilités administrative Responsabilités administratives des membres de l équipe incluants responsabilité de recherche et d enseignement Luca Castelli Aleardi est membre du comité enseignement recherche du département d informatique de l École Polytechnique (période 2012-). Dominique Rossin est chargé de mission STIC auprès de la D.R.R.T. d Île de France (délégation régionale à la recherche et à la technologie) (période 2012-). est membre du conseil scientifique de l INS2I (période 2010-). est membre du comité enseignement recherche du département d informatique de l École Polytechnique (période 2010-). est co-porteur de la création de l École Doctorale STIC de l Université Paris Saclay (période 2013-). Gilles Schaeffer IV est représentant de l École Polytechnique au sein de la commission des études du Master Parisien de Recherche en Informatique (période 2009-). a été responsable du pôle Algorithmique et combinatoire du GDR IM du CNRS. (période ). est membre du conseil scientifique du LabEx CIMI de Toulouse. (période 2012-). Responsabilités de projets internationaux Projet ERC ExploreMaps ( ) (Type: Projet ERC Research Starting Grant ) 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. schaeffe/exploremaps/. Partenaires: LIX. Responsable: Gilles Schaeffer. Montant de la collaboration pour le LIX: euros. Projet FP7 CIG ( ) (Type: Projet Marie-Curie Career Integration Grant PCIG12-GA HRGP) Titre: Hardness results in Geometry Processing. Partenaires: LIX. Responsable: Maks Ovsjanikov. Montant de la collaboration pour le LIX: euros. IV IV Responsabilités de projets nationaux Participation à des projets internationaux Google Faculty Award ( ) (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: euros. 157

158 158 CHAPTER IV.7. ANNEXES : COMBINATOIRE IV Participation à des projets nationaux Projet ANR GAIA ( ) (Type: Projet ANR blanc) Titre: Géométrie Algorithmique Informationnelle et Applications. Partenaires: Université de Guyanne, INRIA Grenoble, LIX. Responsable: Richard Nock. Montant de la collaboration pour le LIX: euros. Projet ANR Cartaplus ( ) (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. Partenaires: LIAFA, LIX, IPHT (CEA). Responsable: Guillaume Chapuy. Montant de la collaboration pour le LIX: 2 participants au LIX sur 6, montant total euros. Projet ANR EGOS ( ) (Type: Projet ANR JCJC) Titre: Graphes Plongés et leurs Structures Orienté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. Partenaires: LIRMM, LIX, LABRI. Responsable: Benjamin Lévêque. Montant de la collaboration pour le LIX: 3 participants au LIX sur 7, montant total euros. Projet ANR A3 ( ) (Type: Projet ANR Blanc) Titre: Arbres Aléatoires et Applications. Partenaires: LPMA, MAPMO, LIX, LABRI. Responsable: Jean-François Delmas. Montant de la collaboration pour le LIX: 2 participants au LIX sur 30, montant total euros. Projet ANR Magnum ( ) (Type: Projet ANR Blanc) Titre: Méthodes Algorithmiques pour la Génération aléatoire Non Uniforme: Modè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. Partenaires: LIP6, LIPN, LI- AFA, LIX. Responsable: Michèle Soria. Montant de la collaboration pour le LIX: 2 participants au LIX sur 15, montant total euros. Thèses DGA ( ) (Type: Thèses DGA) Titre: Joint Analysis of Images and 3d Shapes. Partenaires: LIX, CMAP. Responsable: Maks Ovsjanikov. Montant de la collaboration pour le LIX: euros. CNRS chaire d excellence ( ) (Type: CNRS chaire d excellence) Titre: CNRS chaire d excellence. Partenaires: LIX. Responsable: Maks Ovsjanikov. Montant de la collaboration pour le LIX: euros. IV Participation à des projets locaux Qualcomm/LIX Postdoctoral Grant ( ) (Type: Postdoctoral Grant de Viorica Patraucean) Titre: Multimodal data analysis. Partenaires: LIX. Responsable: Maks Ovsjanikov. Montant de la collaboration pour le LIX: euros.

159 IV.7.2. ADMINISTRATION DE LA RECHERCHE 159 IV.7.2 IV Administration de la recherche Activités éditoriales Membres de comités éditoriaux Dominique Rossin est membre du comité éditorial de la revue TSI, Technique et Science Informatiques. Gilles Schaeffer est membre du comité éditorial restreint du Journal of Combinatorial Theory, Series A. Gilles Schaeffer est membre du comité éditorial du nouveau journal Annals of IHP: Combinatorics, Physics and Application (première parution en 2014). Gilles Schaeffer a été membre du comité éditorial du journal ESAIMPS de 2008 à 2012 (mandat de 4 ans). IV Gestion scientifique de conférences Présidence de comités de programme Gilles Schaeffer est président du comité de programme de la conférence internationnale FPSAC Cette conférence est la principale conférence annuelle pour la combinatoire énumérative et algébrique: parmi les 176 articles soumis à cette 25ème édition, le comité de programme a sélectionné 27 exposés (15% d acceptation comme exposé) et 75 posters (57% d acceptation). La conférence a réuni plus de 300 participants. Participation à des comités de programme Analco09 (6th Workshop on Analytic Algorithmics and Combinatorics) (2008). Fusy. Analco11 (8th Workshop on Analytic Algorithmics and Combinatorics) (2010). Fusy. Éric Éric 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). É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 160 CHAPTER IV.7. ANNEXES : COMBINATOIRE 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 Organisation d événements scientifiques Présidence de comités d organisation PP13 (Permutation Patterns 2013) (2013). Dominique Rossin. Trimestre thématique IHP (Physique statistique, combinatoire et probabilités : approches du continu par le discret) (2009). Gilles Schaeffer. ALÉA 2009 (Journées annuelles du GT ALÉA) (2009). Dominique Poulalhon. ALÉA 2011 (Journées annuelles du GT ALÉA) (2011). Éric Fusy, Gilles Schaeffer. Participation à des comités d organisation FPSAC13 (Formal Power Series and Algebraic Combinatorics) (2013). Marie Albenque, Vincent Pilaud. MIG (Workshop Matrix Information Geometries) (2011). Olivie Schwander. IV Participation à des comités et jurys scientifiques Au niveau international Dominique Rossin a été expert auprès de Netherlands Organisation for Scientific Research pour des demandes de financement. Gilles Schaeffer a été expert auprès du Conseil de recherches en sciences naturelles et en génie du Canada (NSERC-CRSNG) pour des demandes de financement. Au niveau national Gilles Schaeffer a été membre en 2012 du comité AERES d évaluation du Laboratoire d Informatique de l université Paris Nord (LIPN). Commission de sélection Gilles Schaeffer a été membre des commissions de recrutement pour les établissements suivants: université de Rouen (2009), de Marne-la-Vallée (2010, 2011, 2013), de Paris-Nord ( ). Dominique Poulalhon a été membre de la commission de recrutement des universités Paris Diderot (2008) et Paris-Nord (2011).

161 IV.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION 161 IV.7.3 IV Activités de formation, encadrement et évaluation Liste des thèses et HDR soutenues Habilitations à diriger les recherches Thèses de doctorat Dominique Rossin a été directeur de thèse de Mathilde Bouvel ( ). Dominique Rossin a été directeur de thèse de Adeline Pierrot ( ). Gilles Schaeffer a été directeur de thèse de Guillaume Chapuy ( ) IV Liste de rapports de thèses et HDR Rapports d habilitations à diriger des recherches Gilles Schaeffer a été rapporteur de l habilitation à diriger des recherches en informatique d Olivier Bodini à l université Pierre et Marie Curie (Paris 6), en Par ailleurs, Gilles Schaeffer a été membre des jury d habilitation suivants: Grégory Miermont, soutenue en 2008 à l université Paris-Sud. Éric Colin de Verdière, soutenue en 2012 à l École Normale Supérieure Nicolas Broutin, soutenue en 2013 à l université Paris 6. Rapports de thèse Dominique Rossin a été rapporteur des thèses de Jérémie Lumbroso soutenue en 2012 à l université Paris 6. Francesca de Carli soutenue en 2009 à l université de Sienne. Gilles Schaeffer a été rapporteur des thèses de Marie Albenque soutenue en 2008 à l université Paris 7. Valentin Feray soutenue en 2009 à l université de Marne-la-Vallée. Alexis Darasse, soutenue en 2010 à l université de Paris 6. Axel Bacher, soutenue en 2011 à l université de Bordeaux 1. Marc Sage, soutenue en 2012 à l université de Marne-la-Vallée. Par ailleurs, Gilles Schaeffer a participé au jury des thèses de Olivier Mallet, soutenue en 2008 à l université Paris 7 Matthieu Josuat-Vergès, soutenue en 2010 à l université Paris-Sud Djamal Belazzougui, soutenue en 2010 à l université Paris 7 Samuele Giraudo, soutenue en 2010 à l université de Marne-la-Vallée

162 162 CHAPTER IV.7. ANNEXES : COMBINATOIRE IV Enseignements dispensés Cours universitaires en M2 Jury MPRI Cours Aspects Algorithmiques de la combinatoire : Gilles Schaeffer, Dominique Rossin, Éric Fusy, Dominique Poulalhon Master BIBS, BioInformaique et Biostatistique, Cours de programmation Web, Dominique Rossin (2011-) Gilles Schaeffer fait partie du jury de M2 du Master Parisien de Recherche en Informatique. Ecoles thématiques et cours spécialisés Gilles Schaeffer a été invité à donner un cours de 12h à la 41ème école d été de Probabilité de Saint Flour en Éric Fusy a été invité à donner un cours de 15h sur le dessin de graphe à l université Technique de Berlin en Vincent Pilaud a été invité à donner un cours de 6h sur les polytopes de briques au Workshop Coxeter Groups meet Convex Geometry à l Université du Québec À Montréal en Vulgarisation Animation en école primaire : Dominique Rossin IV.7.4 Autres éléments de visibilité IV Exposés invités en confé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). Éric Fusy, Asymptotic enumeration in unlabelled subcritical graph families. 68ème Sé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. Société de Mathématiques Appliquées et Industrielles (Session speaker) (2013). Maks Ovsjanikov. IV Participation à des workshops sur invitations Workshop on configurations, J. Bokowski Festschrift, Darmstadt (2013). Vincent Pilaud. Journées Combinatoires de Bordeaux (2013). Vincent Pilaud. Algorithms and Permutations, Paris (2012). Vincent Pilaud.

163 IV.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ 163 Journées Viennot, Bordeaux (2012). Éric Fusy. Young Workshop in arithmetics and combinatorics, Madrid (2011). Éric Fusy. Journées Combinatoires de Bordeaux (2011). Éric Fusy. Workshop on embedded random graphs, Paris (2009). Éric Fusy. Combinatorial Potlatch, Tacoma (2008). Éric Fusy. Journées Combinatoires de Bordeaux (2012). Gilles Schaeffer. Journées Combinatoires de Bordeaux (2011). Dominique Poulalhon. Journées Combinatoires de Bordeaux (2009). Marie Albenque. Young Workshop in Arithmetics and Combinatorics (2011). Marie Albenque. Workshop SIGMA 2012 (2012). Olivier Schwander. Journée Transport Optimal et Géométrie de l information (2012). Olivier Schwander. Workshop Matrix Information Geometries (2012). Olivier Schwander. IV Invitations à l étranger Université McGill Montréal (2013). Marie Albenque a été invitée pendant deux mois par Bruce Reed. Université McGill Montréal (2012). Marie Albenque a été invitée pendant un mois par Louigi Addario-Berry. Université Technique de Berlin (2011). Marie Albenque a été invitée pendant un an par Stefan Felsner dans l équipe de Mathématiques discrètes. MIT ( ). Éric Fusy a été invité à plusieurs séjours par Olivier Bernardi. Stanford University ( ). Ekaterina Vassilieva a été invitée à plusieurs séjours par Patrick Suppes. Université d Etat de Moscou (2012). Mikhalev. Ekaterina Vassilieva a été invitée par Alexander Université de Sienne (2009, 2011). Gilles Schaeffer a été invité à plusieurs séjours par Simone Rinaldi.. Stanford University (2012). Maks Ovsjanikov a été invité pendant un mois par Leonidas Guibas. IV Exposés en séminaires Colloquium du laboratoire angevin de recherche en mathématique (2013). Gilles Schaeffer. Colloquium de l institut Camille Jordan de l université Lyon 1 (2012). Gilles Schaeffer. SIESTE de l École Normale Supérieure de Lyon (2010). Gilles Schaeffer. Séminaire du laboratoire MIA de l université de la Rochelle (2012). Olivier Schwander. Séminaire de combinatoire Philippe Flajolet (2012). Dominique Poulalhon. Séminaire de combinatoire Philippe Flajolet (2010). Gilles Schaeffer.

164 164 CHAPTER IV.7. ANNEXES : COMBINATOIRE IV Prix et distinctions G. Chapuy a obtenu le prix du meilleur article étudiant à la conférence FPSAC 2009 pour son article A new combinatorial identity for unicellular maps, via a direct bijective approach. COMBICombinatoire

165 V Équipe Concurrency, Mobility and Transactions (Comète) 165

166

167 V.1 Liste des membres : Concurrency, Mobility and Transactions V.1.1 V Liste actuelle des membres Membres permanents Nom Fonction Employeur HDR Arrivée Catuscia Palamidessi DR1 INRIA HDR equivalent 2002 Bernadette Charron-Bost DR2 CNRS HDR 1993 Frank Valencia CR1 CNRS 2004 Konstantinos Chatzikokolakis CR2 CNRS 2011 Christelle Lievin Assistant INRIA 2011 V Doctorants et postdoctorants Doctorants Nom Financement Arrivée Encadrant Henri Debrat ED de l université de Nancy 2009 Stephan Merz B. Charron-Bost Ivan Gazeau ANR(CCP) 2009 C. Palamidessi D. Miller Sophia Knight INRIA/CORDIS 2010 F. Valencia C. Palamidessi Thomas Nowak EDX 2010 B. Charron-Bost Luis Pino INRIA/DGA 2011 F. Valencia C. Palamidessi Nicolás Bordenabe INRIA/DGA 2011 K. Chatzikokolakis C. Palamidessi Lili Xu Chinese Acad. of Sc H. Lin ANR(PANDA + LOCALI) C. Palamidessi Marco Stronati EDX Monge 2012 K. Chatzikokolakis C. Palamidessi Postdoctorants Nom Financement Dates Responsable Sardaouna Hamadou ARN (PANDA + LOCALI) C. Palamidessi Yusuke Kawamoto IDEX Paris-Saclay C. Palamidessi Tobias Heindel CEA C. Palmidessi V Visiteurs et autres membres Visiteurs de longue durée Nom Financement Dates Invitant Fabio Gadducci DIGITEO/EP June C. Palamidessi Carlos Olarte DIGITEO/EP June F. Valencia Vladimiro Sassone DIGITEO/INRIA May 2013 C.Palamidessi 167

168 168CHAPTER V.1. LISTE DES MEMBRES : CONCURRENCY, MOBILITY AND TRANSACTIONS Autres Nom Fonction Financement Dates Fernán Martinelli Intern Marie Curie Action MEALS V.1.2 V Anciens membres Membres permanents Nom Fonction Employeur HDR Départ Position actuelle Lydie Fontaine Assistant INRIA 2009 DIGITEO (Assistant) Marie-Jeanne Gaffard Assistant INRIA 2011 INRIA DRI (Assistant) V Doctorants et postdoctorants Doctorants Nom Financement Départ Encadrant Position actuelle Jesus Aranda Colciencias 2009 F. Valencia Univ. Valle, Colombia C. Palamidessi (Assoc. Prof.) Romain Beauxis Ile de France 2009 C. Palamidessi Audiosocket USA Antoine Gaillard EDX Monge 2009 B. Charron-Bost Private Consultant Carlos Olarte INRIA/CORDIS 2009 F. Valencia Univ. Javeriana, Colombia C. Palamidessi (Assoc. Prof.) Sylvain Pradalier ENS Cachan 2009 C. Laneve Dassault Systèmes C. Palamidessi (R&D in Bioinformatics) Christelle Braun EDX 2010 C. Palamidessi Ministry of Defense (IT Project Officer) Miguel Andrés NWO project 2010 C. Palamidessi Google Mountain View, P. Van Rossum USA Marie-Aude Steineur ANR(PANDA) 2011 S. Abbes Private Consultant C. Palamidessi Mario Sergio Alvim CNRS/DGA 2011 C. Palamidessi UFMG, Brazil (Ass. Professor) Andrés Aristizábal CNRS/DGA 2012 F. Valencia Univ. Javeriana, Colombia C. Palamidessi (Postdoc) Postdoctorants Nom Financement Dates Responsable Position actuelle Simon Kramer INRIA C. Palamidessi IMSc, India (Researcher) Josef Widder LIX-DGA B. Charron-Bost TU Vienna, Austria (Postdoc) Martin Biely Qualcomm B. Charron-Bost EP de Lausanne, Switzerland (Postdoc) Johan Thapper LIX-DGA B. Charron-Bost Univ. Paris-Sud XI (ATER) Filippo Bonchi ERCIM C. Palamidessi CNRS ENS-Lyon, (CR) Jérémy Dubreil INRIA C. Palamidessi Facebook, UK Miguel Andrés Qualcomm C. Palamidessi Google Mountain View, USA Marco Giunti ERCIM C. Palamidessi NOVA, Portugal (Postdoc) Ehab ElSalamouny INRIA C. Palamidessi Suez Canal Univ. (Lecturer) Matteo Mio ERCIM C. Palamidessi CWI, Holland (Postdoc)

169 V.1.2. ANCIENS MEMBRES 169 V Stagiaires Master 2 Autres membres Nom Financement Dates Responsable Position actuelle Luis Pino EDX F. Valencia LIX (PhD student) Raluca Diaconu ENS Cachan F. Valencia LIP6 UPMC (PhD student) Visiteurs de longue durée Nom Financement Dates Invitant Srecko Brlek DIGITEO/EP C. Palamidessi Angelo Troina DIGITEO/EP C. Palamidessi Andrea Turrini DIGITEO/INRIA C. Palamidessi Diletta Romana Cacciagrano DIGITEO/EP F. Valencia Vladimiro Sassone DIGITEO/EP C. Palamidessi DIGITEO/INRIA C. Palamidessi DIGITEO/EP C. Palamidessi DIGITEO/EP C. Palamidessi Moreno Falaschi DIGITEO/INRIA C. Palamidessi DIGITEO/INRIA C. Palamidessi DIGITEO/INRIA C. Palamidessi DIGITEO/INRIA C. Palamidessi DIGITEO/EP C. Palamidessi Linda Brodo DIGITEO C. Palamidessi DIGITEO C. Palamidessi DIGITEO/EP C. Palamidessi Marzia Buscemi DIGITEO/INRIA C. Palamidessi Geoffrey Smith DIGITEO/EP C. Palamidessi DIGITEO/INRIA C. Palamidessi Cosimo Laneve DIGITEO/INRIA C. Palamidessi Antonio Vitale INRIA C. Palamidessi Pierpaolo Degano DIGITEO/INRIA C. Palamidessi Matthias Függer EP B. Charron-Bost Carlos Olarte DIGITEO/EP F. Valencia Elaine Pimentel DIGITEO/EP C. Palamidessi Camilo Rueda DIGITEO/EP F. Valencia Autres Nom Fonction Financement Dates Michael Martinez Intern INRIA Yamil Perchy Intern INRIA Luis Pino Intern INRIA Mario Sergio Alvim Postdoc INRIA Marco Stronati Intern ANR(PANDA) Intern ANR(PANDA) Michela Paolini Intern IMT Lucca

170 170CHAPTER V.1. LISTE DES MEMBRES : CONCURRENCY, MOBILITY AND TRANSACTIONS

171 V.2 Rapport scientifique : Concurrency, Mobility and Transactions V.2.1 Thématique générale et principaux objectifs V 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 Comè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 Comè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 Thèmes de recherche Probability and information theory. Much of the research of Comè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 Rényi min-entropy, which seems to be more appropriate for security in common scenarios like one-try attacks. 171

172 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 Exemples de résultats significatifs 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,

173 V.2.1. THÉMATIQUE GÉNÉ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 Ré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 Ré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

174 174CHAPTER V.2. RAPPORT SCIENTIFIQUE : CONCURRENCY, MOBILITY AND TRANSACTIONS 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

175 V.2.1. THÉMATIQUE GÉNÉ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 Animation scientifique, rayonnement, prix et récompenses 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 thèse Gilles Kahn in November, V Fonctionnement interne The day-to-day work at Comète is based on a constant interaction between the permanent members, postdocs, students, and interns on research themes. The Comè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.

176 176CHAPTER V.2. RAPPORT SCIENTIFIQUE : CONCURRENCY, MOBILITY AND TRANSACTIONS

177 V.3 Projet de recherche : Concurrency, Mobility and Transactions V.3.1 Objectifs scientifiques Here we describe our main goals for future work. V 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 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

178 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 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

179 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.

180 180CHAPTER V.3. PROJET DE RECHERCHE : CONCURRENCY, MOBILITY AND TRANSACTIONS

181 Bibliography [1] Miguel E. André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), 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 Springer, [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 ACM, [5] Ronald Fagin, Joseph Y. Halpern, Yoram Moses and Moshe Vardi. Reasoning About Knowledge. MIT Press,

182 182 BIBLIOGRAPHY

183 V.4 Analyse AFOM : Concurrency, Mobility and Transactions INTERNE POSITIF Work on privacy attracts the interest of the industry and other institutions. E.g. Microsoft, Thales, and Commission Nationale de l informatique et des libert es (CNIL). Strong background in Distributed Systems, Information Theory and Formal Methods. Strong International collaborations: Reflected in the participation in several international events and a significant number of foreign students, visitors and interns Atouts Opportunit es A F O M Faiblesses Need to increase the industrial transfer Menaces The administrative burdens from the security and immigration offices make it difficult to host and recruit students and visitors NEGATIF EXTERNE Figure V.4.1: Analyse AFOM de l équipe Concurrency, Mobility and Transactions : Atouts, Faiblesses, Opportunités, Menaces 183

184 184 CHAPTER V.4. ANALYSE AFOM : CONCURRENCY, MOBILITY AND TRANSACTIONS

185 V.5 Fiche résumé : Concurrency, Mobility and Transactions V.5.1 Membres 2008 : 3 chercheurs (2 CNRS, 1 INRIA), 4 postdocs, 6 doctorants 2013 : 4 chercheurs (3 CNRS, 1 INRIA), 3 postdocs, 8 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 Résultats scientifiques 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 186 CHAPTER V.5. FICHE RÉSUMÉ : 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 Production scientifique V Publications Journaux : 24 Conférences internationales : 55 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), , 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, 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 Andrés, NE Bordenabe, C Palamidessi. Privacy Enhancing Technologies, , 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: , 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: , 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 , 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.

187 V.5.3. PRODUCTION SCIENTIFIQUE 187 New Transience Bounds for Long Walks. B. Charron-Bost, Matthias Függer, Thomas Nowak. ArXiv, volume abs/ , 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 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 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 thèse Gilles Kahn for his PhD thesis. He has been invited to give two talks on the popularization of science (Debat citizen, 2012, Unithé ou Café?, 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 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 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 Actions de formation 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, Université 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 188 CHAPTER V.5. FICHE RÉSUMÉ : CONCURRENCY, MOBILITY AND TRANSACTIONS

189 V.6 Production scientifique : Concurrency, Mobility and Transactions V.6.1 Livres et chapitres de livres Édition des ouvrages [336] Marco Carbone, Pawel Sobocinski, and Frank D. Valencia. Festschrift for Mogens Nielsen s 60th Birthday. Theoretical Computer Science. Elsevier, September [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, [338] Bernadette Charron-Bost, André Schiper, and Fernando Pedone. Replication: Theory and Practice, volume 5959 of Lecture Notes in Computer Science. Springer-Verlag, [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, [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, [341] Catuscia Palamidessi and Alma Riska. Proceedings of the Eighth International Conference on Quantitative Evaluation of SysTems. IEEE, [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, Chapitres de livres [343] Mário S. Alvim, Miguel E. André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 Springer, [344] Romain Beauxis, Catuscia Palamidessi, and Frank D. Valencia. On the asynchronous nature of the asynchronous π-calculus. In Rocco De Nicola, Pierpaolo Degano, and José Meseguer, editors, Concurrency, Graphs and Models: Festschrift in honor of Prof. Ugo Montanari, Lecture Notes in Computer Science, pages Springer, [345] Bernadette Charron-Bost and André Schiper. Consensus with partial synchrony. In Ming-Yang Kao, editor, Encyclopedia of Algorithms, pages Springer-Verlag, March [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 Springer, June [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 Springer, April

190 190 BIBLIOGRAPHY [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 World Scientific, [349] Carlos Olarte, Camilo Rueda, and Frank D. Valencia. Concurrent constraint calculi: a declarative paradigm for modeling music systems. In Gérard Assayag and Andrew Gerzso, editors, New Computational Paradigms for Computer Music, pages Delatour France / Ircam-Centre Pompidou, June [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 Wiley, V.6.2 Revues internationales [351] Mário S. Alvim, Miguel E. Andrés, and Catuscia Palamidessi. Quantitative information flow in interactive systems. Journal of Computer Security, 20(1):3 50, [352] Miguel E. Andrés, Catuscia Palamidessi, Ana Sokolova, and Peter Van Rossum. Information hiding in probabilistic concurrent systems (journal version). Theoretical Computer Science, 412(28): , [353] Romain Beauxis and Catuscia Palamidessi. Probabilistic and nondeterministic aspects of anonymity. Theoretical Computer Science, 410(41): , [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, [355] Diletta Cacciagrano, Flavio Corradini, and Catuscia Palamidessi. Explicit fairness in testing semantics. Logical Methods in Computer Science, 5(2):Article 15, [356] Franck Cassez, Jérémy Dubreil, and Hervé Marchand. Synthesis of opaque systems with static and dynamic masks. Formal Methods in System Design, 40(1):88 115, [357] Bernadette Charron-Bost, Martin Hutle, and Josef Widder. In search of lost time. Information Processing Letters, 110(1): , [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): , [359] Bernadette Charron-Bost and André Schiper. The heard-of model: Computing in distributed systems with benign failures. Distributed Computing, 22(1):49 71, [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 [361] Konstantinos Chatzikokolakis and Catuscia Palamidessi. Making random choices invisible to the scheduler. Information and Computation, 208(6): , [362] Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Christelle Braun. Compositional methods for information-hiding. Mathematical Structures in Computer Science, To appear. [363] Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden. Anonymity protocols as noisy channels. Information and Computation, 206(2-4): , 2008.

191 V.6.3. CONFÉ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): , [365] Henri Debrat and Stephan Merz. Verifying fault-tolerant distributed algorithms in the heard-of model. Archive of Formal Proofs, June [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, To appear. [367] Simon Kramer and Julian C. Bradfield. A general definition of malware. Journal in Computer Virology, 6(2): , [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): , [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 [370] Matteo Mio. Probabilistic modal mu-calculus with independent product. Logical Methods in Computer Science, 8(4):Paper 18, November [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): , [372] Carlos Olarte and Camilo Rueda. A declarative language for dynamic multimedia interaction systems. Mathematics and Computation in Music, 38: , July [373] Carlos Olarte, Camilo Rueda, and Frank D. Valencia. Models and emerging trends of concurrent constraint programming. Constraints, 18(4): , [374] Ulrich Schmid and Josef Widder. The theta-model: achieving synchrony without clock. Distributed Computing, 22(1):29 47, V.6.3 Conférences internationales [375] Mário S. Alvim, Miguel E. André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 Lecture Notes in Computer Science, pages Springer, [376] Mário S. Alvim, Miguel E. Andrés, and Catuscia Palamidessi. Information flow in interactive systems. In Paul Gastin and François Laroussinie, editors, 21th International Conference on Concurrency Theory (CONCUR 2010), volume 6269 of Lecture Notes in Computer Science, pages Springer, [377] Mário S. Alvim, Miguel E. André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 Springer, 2010.

192 192 BIBLIOGRAPHY [378] Má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 IEEE, [379] Miguel E. André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 Springer, [380] Miguel E. André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 IEEE Computer Society, [381] Jesus Aranda, Gé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 Springer, July [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 Springer, December [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 (FOS- SACS), volume 5504 of Lecture Notes in Computer Science, pages Springer, March [384] Andrés Aristizá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 , July [385] Andrés Aristizá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 Springer, [386] Andrés Aristizá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 ACM, [387] Andrés Aristizá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 Electronic Proceedings in Theoretical Computer Science, [388] David Baelde, Romain Beauxis, and Samuel Mimram. Liquidsoap: a high-level programming language for multimedia streaming. In Ivana Cerná, Tibor Gyimóthy, Juraj Hromkovic, Keith Jefferey, Rastislav Královic, Marko Vukolic, and Stefan Wolf, editors,

193 BIBLIOGRAPHY 193 SOFSEM 2011: Theory and Practice of Computer Science, volume 6543 of Lecture Notes in Computer Science, pages Springer, [389] Romain Beauxis, Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden. Formal approaches to information-hiding (tutorial). In Gilles Barthe and Cédric Fournet, editors, Trustworthy Global Computing (TGC), volume 4912 of Lecture Notes in Computer Science, pages Springer, [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 Schloss Dagstuhl Leibniz-Zentrum fuer Informatik, [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 Lecture Notes in Computer Science, pages Springer, [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 Springer, July [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 Springer, [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 Elsevier, [395] Mayla Brusó, 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 Springer, [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 IEEE Computer Society, [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 Springer, [398] Bernadette Charron-Bost, Henri Debrat, and Stephan Merz. Formal verification of consensus algorithms tolerating malicious faults. In Xavier Dé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 Springer, October [399] Bernadette Charron-Bost, Matthias Fü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 Springer, 2011.

194 194 BIBLIOGRAPHY [400] Bernadette Charron-Bost, Matthias Fü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 Springer, [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 ACM, [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 Springer, July [403] Konstantinos Chatzikokolakis, Miguel E. Andrés, Nicolá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 Springer, [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 Springer, January [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 Özsoyoglu, and Armin R. Mikler, editors, First ACM International Conference on Bioinformatics and Computational Biology (BCB 10), pages ACM Digital Libraries, [406] Philippe Darondeau, Jérémy Dubreil, and Hervé 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 Elsevier, August [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 Springer Berlin Heidelberg, January [408] Moreno Falaschi, Carlos Olarte, and Catuscia Palamidessi. A framework for abstract interpretation of timed concurrent constraint programs. In António Porto and Francisco Javier López-Fraguas, editors, 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pages ACM, September [409] Matthias Függer, Alexander Kößler, Thomas Nowak, and Martin Zeiner. Brief announcement: The degrading effect of forgetting on a synchronizer. In André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 Springer, [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.

195 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 Springer, [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 Electronic Proceedings in Theoretical Computer Science (EPTCS), March [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, Open Publishing Association. [414] Marco Giunti. A type checking algorithm for qualified session types. In Laura Kovács, Rosario Pugliese, and Francesco Tiezzi, editors, 7th International Workshop on Automated Specification and Verification of Web Systems (WWV 2011), pages Electronic Proceedings in Theoretical Computer Science, August [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 Electronic Proceedings in Theoretical Computer Science, August [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 Springer, [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 IEEE Computer Society, [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 Springer, [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 (CON- CUR 2012), volume 7454 of Lecture Notes in Computer Science, pages Springer, September [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 Electronic Proceedings in Theoretical Computer Science, March 2009.

196 196 BIBLIOGRAPHY [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 Springer, March [422] Thomas Nowak, Matthias Függer, and Alexander Köß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 Springer, [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 ACM, [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 ACM, [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 Electronic Proceedings in Theoretical Computer Science, [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 Science, pages Springer, [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 Springer, V.6.4 Conférences invitées Full Papers [428] Mário S. Alvim, Miguel E. André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 Springer, [429] Mário S. Alvim, Miguel E. Andrés, and Catuscia Palamidessi. Probabilistic information flow. In 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010), pages IEEE Computer Society, Abstracts [430] Mário S. Alvim, Miguel E. André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 Springer, 2010.

197 V.6.5. THÈSES 197 [431] Catuscia Palamidessi. Compositionality of secure information flow. In Claude Bolduc, Jules Desharnais, and Bé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, [432] Catuscia Palamidessi, Mário S. Alvim, and Miguel E. André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 V.6.5 Thèses [433] Mário S. Alvim. Des approches formelles pour le cachement d information: Une analyse des systèmes interactifs, contrôle de divulgation statistique, et le raffinement des spécifications. PhD thesis, École Polytechnique de Paris, October [434] Miguel E. Andrés. Quantitative Analysis of Information Leakage in Probabilistic and Nondeterministic Systems. PhD thesis, Radboud University, Nijmegen, July [435] Jesus Aranda. On the Expressivity of Infinite and Local Behaviour in Fragments of the picalculus. PhD thesis, École Polytechnique de Paris and Universidad del Valle, Colombia, November [436] Andrés Aristizábal. Techniques de Bisimulation et Algorithmes pour la Programmation Concurrente par Contraintes. PhD thesis, École Polytechnique de Paris, October [437] Romain Beauxis. Asynchronous Process Calculi for Specification and Verification of Information Hiding Protocols. PhD thesis, École Polytechnique de Paris, May [438] Christelle Braun. Quantitative Approaches to Information Hiding. PhD thesis, École Polytechnique de Paris, May [439] Antoine Gaillard. Problèmes de communication dans les systèmes distribués: ruptures et corruptions. PhD thesis, École Polytechnique de Paris, February [440] Carlos Olarte. Programmation Concurrente par Contraintes pour Vérifier un Protocole de Sécurité. PhD thesis, École Polytechnique de Paris, September [441] Sylvain Pradalier. Formal Approach to the Modeling, Simulation and Analysis of Nano- Devices. PhD thesis, École Polytechnique de Paris, September V.6.6 Rapports techniques [442] Miguel E. Andrés, Nicolás E. Bordenabe, Konstantinos Chatzikokolakis, and Catuscia Palamidessi. Geo-indistinguishability: Differential privacy for location-based systems. Accepted at ACM CCS. Technical Report hal , INRIA, http: //hal.inria.fr/hal [443] Bernadette Charron-Bost, Matthias Függer, and Thomas Nowak. On the transience of linear max-plus dynamical systems. Technical Report abs/ , Cornell University, September [444] Bernadette Charron-Bost, Matthias Függer, and Thomas Nowak. New transience bounds for long walks. Technical Report abs/ , Cornell University, September

198 198 BIBLIOGRAPHY [445] Philippe Darondeau, Jérémy Dubreil, and Hervé Marchand. Supervisory control for modal specifications of services. Technical Report inria , INRIA, April

199 V.7 Annexes : Concurrency, Mobility and Transactions V.7.1 Participations à la communauté scientifique et responsabilités administrative Catuscia Palamidessi is a member of the Comité d Orientation Scientifique et Technique, Groupe de travail Relation Internationales de l INRIA (COST-GTRI) (période 2007-). Catuscia Palamidessi is a member of the Comité de These for Mathematics and Computer Science at the École Polytechnique (période 2007-). Catuscia Palamidessi has been a member of the Commission Scientifique Disciplinaire pour le Programme Non Thématiques de l ANR (période 2008). Catuscia Palamidessi has been a member of the Commission Scientifique Disciplinaire pour le Programme Jeunes Chercheurs de l ANR (période 2008). Catuscia Palamidessi has been a member of the Commission Scientifique du Centre de Recherche INRIA Saclay (période ). Catuscia Palamidessi is co-director of LIX (période 2010-). Catuscia Palamidessi is a member of the Comité de Centre of INRIA (période 2012-). Bernadette Charron-Bost has been a representative of LIX to the commission Bˆatiments DIGITEO (période ). Bernadette Charron-Bost is a representative of the Conseil de laboratoire (période 2011-). V Responsabilités de projets internationaux PRINTEMPS ( ) (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 Printemps. Partenaires: INRIA Saclay, McGill University. Responsable: Catuscia Palamidessi. Montant de la collaboration pour le LIX: euros (Total euros).. REACT ( ) (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: euros (Total euros).. FORCES ( ) (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 Partenaires: Universidad Javeriana, Universidad del Valle, INRIA Saclay, IRCAM. Responsable: Frank D. Valencia. Montant de la collaboration pour le LIX: euros (Total euros).. 199

200 200 CHAPTER V.7. ANNEXES : CONCURRENCY, MOBILITY AND TRANSACTIONS REACT-PLUS ( ) (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: euros (Total euros).. PRINCESS ( ) (Type: INRIA DRI Project) Titre: Protecting privacy while preserv- INg 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: euros (Total euros).. V Responsabilités de projets nationaux PANDA ( ) (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, Pôle Parisien, Pôle Méditerranéen, Airbus. Responsable: Catuscia Palamidessi. Montant de la collaboration pour le LIX: euros (Total euros).. D-SPACES ( ) (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 fvalenci/projects/d-spaces.pdf. Partenaires: LIX, ENS Cachan. Responsable: Frank Valencia. Montant de la collaboration pour le LIX: euros (Total euros).. V Participation à des projets internationaux LOCALI ( ) (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 pi2%5bcode%5d=anr-11-is Partenaires: INRIA Saclay, INRIA Rocquencourt, Paris VII, Chinese Academy of Science in Beijin. Responsable: Gilles Dowek. Montant de la collaboration pour le LIX: euros (Total euros).. PACE ( ) (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: euros (Total euros).. MEALS ( ) (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 Partenaires: Saarland University, Germany; Rheinisch-Westfälische Technische Hochschule Aachen, Germany; Technische Universitä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

201 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: euros (Total euros).. V Participation à des projets nationaux CPP ( ) (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 bouissou/cpp. Partenaires: LSV, CEA Saclay, CEA LIST, Supelec SSE, Supelec L2S, Airbus. Responsable: Catuscia Palamidessi. Montant de la collaboration pour le LIX: euros (Total euros).. CAPPRIS ( ) (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: euros (Total euros. NOTE: The budget is not precise because it is provided by INRIA on demand).. V Contrats et bourses We have several contracts and grants for financing PhD students and postdocs. Here we list some of them: LIX-Qualcomm ( ) Type de contrat: LIX-Qualcom. Titre détaillé: Algorithmes distribués probabilistes. Bernadette Charron-Bost. LIX-DGA ( ) Type de contrat: X-DGA. Titre détaillé: Algorithmes de routage dans les réseaux mobiles ad-hoc. Bernadette Charron-Bost. OISAU (2009) Type de contrat: DGA. Titre détaillé: Méthodes formelles pour les systèmes autonomes. Bernadette Charron-Bost. V.7.2 V Administration de la recherche Activités éditoriales Membres de comités éditoriaux Electronic Notes of Theoretical Computer Science (Elsevier Science) Catuscia Palamidessi (2000-). Voir Theory and Practice of Logic Programming (Cambridge University Press) Catuscia Palamidessi ( ). Voir journals.cambridge.org/tlp. Mathematical Structures in Computer Science (Cambridge University Press) Catuscia Palamidessi (2006-). Voir journals.cambridge.org/msc.

202 202 CHAPTER V.7. ANNEXES : CONCURRENCY, MOBILITY AND TRANSACTIONS Edition de numéros spéciaux Theoretical Computer Science (Elsevier) Festschrift for Mogens Nielsen s 60th birthday Marco Carbone, Pawel Sobocinski and Frank Valencia Theoretical Computer Science (Elsevier) Abstract Interpretation and Logic Programming: Festschrift in honor of professor Giorgio Levi Moreno Falaschi, Maurizio Gabbrielli and Catuscia Palamidessi Journal of Computer Security (IOS Press) Best papers presented at SECCO 07. Daniele Gorla and Catuscia Palmidessi Theoretical Computer Science (Elsevier) Selected papers of MFPS XXV. Samson Abramsky, Michael Mislove and Catuscia Palamidessi Logical Methods in Computer Science (open-access journal) Selected papers of FoSSaCS Catuscia Palamidessi and Frank Pfenning Journal of Computer Security (IOS Press) Selected papers of TOSCA 2011 and SecCo Konstantinos Chatzikokolakis, Sebastian Mö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 Gestion scientifique de conférences Participation à des comités de pilotage 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) ( ). Bernadette Charron-Bost. EXPRESS (The International Workshop in Concurrency EXPRESS) (2010-). Frank Valencia.

203 V.7.2. ADMINISTRATION DE LA RECHERCHE 203 Présidence de comités de programme 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). Catuscia Palamidessi. TGC 2012 (7th International Symposium on Trustworthy Global Computing) (2012). Catuscia Palamidessi. 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. Participation à des comités de programme Conferences: QEST 08 (Fifth International Conference on Quantitative Evaluation of SysTems) (2008). Catuscia Palamidessi. 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 204 CHAPTER V.7. ANNEXES : CONCURRENCY, MOBILITY AND TRANSACTIONS 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). Catuscia Palamidessi. 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). Catuscia Palamidessi. 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). Palamidessi. Catuscia CSF 2012 (The 25th IEEE Computer Security Foundations Symposium) (2012). Catuscia Palamidessi. QEST 2012 (International Conference on Quantitative Evaluation of SysTems) (2012). Catuscia Palamidessi. PPDP 2012 (International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming) (2012). Catuscia Palamidessi.

205 V.7.2. ADMINISTRATION DE LA RECHERCHE 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). Catuscia Palamidessi. ICALP 2013 (The 40th International Colloquium on Automata, Languages and Programming) (2013). Catuscia Palamidessi. CSF 2013 (The 26th IEEE Computer Security Foundations Symposium) (2013). Catuscia 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). Palamidessi. Catuscia FMWS 2008 (Formal Methods for Wireless Systems. CONCUR 2008 affiliated workshop) (2008). Catuscia Palamidessi. SOS 2008 (Structural operational semantics. ICALP 2008 affiliated workshop) (2008). Catuscia Palamidessi. TFIT 2008 (Fourth Taiwanese-French Conference on Information Technology) (2008). Catuscia Palamidessi. 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 206 CHAPTER V.7. ANNEXES : CONCURRENCY, MOBILITY AND TRANSACTIONS SecCo 09 (The 7th International Workshop on Security Issues in Concurrency) (2009). Catuscia Palamidessi. 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). Konstantinos Chatzikokolakis. 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. QAPL 2012 (10th Workshop on Quantitative Aspects of Programming Languages) (2012). Konstantinos Chatzikokolakis. QAPL 2013 (11th Workshop on Quantitative Aspects of Programming Languages) (2013). Konstantinos Chatzikokolakis. V Organisation d événements scientifiques Présidence de comités d organisation 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 à l École polytechnique) (2009). Bernadette Charron-Bost with Grégoire Allaire and Gilles Courtois. CINE (Colloquium pour les élèves CINE à l École polytechnique) (2011). Bernadette Charron-Bost with Olivier Bournez. Informatique et Combinatoire (Les journées Informatique et Combinatoire à l École polytechnique) (2012). Bernadette Charron-Bost with Julia Wolf. Dagstuhl Seminar (Quantitative Security Analysis) (2012). Catuscia Palamidessi with Boris Köpf and Pasquale Malacaria.

207 V.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION 207 V Participation à des comités et jurys scientifiques Au niveau international PRIN (2005-) Catuscia Palamidessi. Reviewer for the project proposals for the program PRIN, sponsored by the Italian MIUR (Ministero dell Istruzione, dell Università 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 ( ) 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-thématiques et Jeunes Chercheurs de l ANR. INRIA ( ) Catuscia Palamidessi. Member of the Commission Scientifique du Centre de Recherche INRIA Saclay. Commission de sélection 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) Member of the commission de spécialistes de l université de Nancy (Bernadette Charron- Bost) Member of Selection Committee for the Lix-Qualcomm Postdoctoral Fellowship (Frank Valencia) V.7.3 V Activités de formation, encadrement et évaluation Liste des thèses et HDR soutenues Thèses de doctorat Antoine Gaillard (Feb 2009). Problèmes de communication dans les systèmes distribué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 Vérifier un Protocole de Sécurité. 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 208 CHAPTER V.7. ANNEXES : CONCURRENCY, MOBILITY AND TRANSACTIONS Encad- Christelle Braun (May 2010). Quantitative Approaches to Information Hiding. rant: Catuscia Palamidessi. Miguel Andrés (July 2011). Quantitative Analysis of Information Leakage in Probabilistic and Nondeterministic Systems. Encadrant: Catuscia Palamidessi, Bart Jacobs and Peter van Rossum. Mário Alvim (Oct 2011). Des approches formelles pour le cachement d information: Une analyse des systèmes interactifs, contrôle de divulgation statistique, et le raffinement des spécifications. Encadrant: Catuscia Palamidessi. Andrés Aristizábal (Oct 2012). Techniques de Bisimulation et Algorithmes pour la Programmation Concurrente par Contraintes. Encadrant: Frank Valencia and Catuscia Palamidessi. V Liste de rapports de thèses et HDR Rapports d habilitations à dirigers les recherches Steve Kremer (March 2011). Modelling and analyzing security protocols in cryptographic process calculi. Rapporteur: Catuscia Palamidessi. Rapports de thèse Rémy Haemmerléu (Jan 2008). Fermetures et Modules dans les langages concurrents avec contraintes fondés sur la logique linèaire. Université 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: Catuscia Palamidessi. Augusto Parma (May 2008). Axiomatic and Logical Characterizations of Probabilistic Preorders and Trace Semantics. Università 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. Université 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.

209 V.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION 209 Mathieu Sassolas (Nov 2011). Méthodes qualitatives et quantitatives pour la détection d information caché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 performabilité des systèmes communicants mobiles. Conservatoire National des Arts et Métiers. Rapporteur: Catuscia Palamidessi. Jacopo Mauro (April 2012). Concurrent Pattern Unification. University of Bologna, Italy. Rapporteur: Catuscia Palamidessi. University of Tech- Thomas Given-Wilson (Aug 2012). Concurrent Pattern Unification. nology, 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: Catuscia Palamidessi. V Enseignements dispensés Cours universitaires en M2 Jury Catuscia Palamidessi taught a course on Concurrency at the Master MPRI, Université Paris VII, France Bernadette Charron-Bost taught at Master SAR, Université Paris VI, jusqu en 2011 Bernadette Charron-Bost teaches at Master MPRI, ENS, X et Université Paris VII Frank Valencia taught a course on Concurrency at the Master MPRI, ENS, X et Université Paris VII Konstantinos Chatzikokolakis teaches a course on Concurrency at the Master MPRI, ENS, X et Université Paris VII Catuscia Palamidessi was on the PhD Jury of Han Chen, Queen Mary, University of London, UK, Catuscia Palamidessi was on the PhD Jury of Augusto Parma, Università di Verona, Italy, Catuscia Palamidessi was on the PhD Jury of Sardaouna Hamadou, Ecole Polytechnique of Montreal, Canada, Catuscia Palamidessi was on the PhD Jury of Rémy Haemmerlé, Université Paris VII, Frank Valencia was on the PhD Jury of Gerardo Sarria, Universidad del Valle, Cali, Colombia, Bernadette Charron-Bost was on the PhD Jury of Martin Biely, Université technologique de Vienne (TUV), Catuscia Palamidessi was on the PhD Jury of Cinzia Di Giusto, University of Bologna, Italy, Catuscia Palamidessi was on the PhD Jury of Magnus Johansson, Uppsala University), 2010.

210 210 CHAPTER V.7. ANNEXES : CONCURRENCY, MOBILITY AND TRANSACTIONS Bernadette Charron-Bost was on the PhD Jury of Pierre Sutra, Université Paris VI, Catuscia Palamidessi was on the PhD Jury of Robert Abo, Conservatoire National des Arts et Métiers, France, Catuscia Palamidessi was on the PhD Jury of Mathieu Sassolas, University of Paris VI, France, Catuscia Palamidessi was on the PhD Jury of Sonja Georgievska, Eindhoven University of Technology, The Netherlands, Catuscia Palamidessi was on the PhD Jury of Jerson Ortiz Vega, Universidad del Valle, Cali, Colombia, Catuscia Palamidessi was on the PhD Jury of Morgan Barbier, Ecole Polytechnique, Ecoles thématiques et cours spécialisés Frank Valencia teaches a summer course on Models of Concurrency Theory at the Universidad Javeriana. Cali, Colombia, 2008 Bernadette Charron-Bost taught at à l École RESCOM. La Palmyre, France, Catuscia Palamidessi taught a course on Quantitative Information Flow at the 11th International School on Foundations of Security Analysis and Design. Bertinoro, Italy, September 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 V.7.4 Autres éléments de visibilité V 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 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, Québec, Canada (2010). Catuscia Palamidessi. Invited Speaker at ICALP 2011, the 38th International Colloquium on Automata, Languages and Programming (2011). Catuscia Palamidessi. Invited Speaker at CBSoft Brazilian Conference on Software: Theory and Practice. São Paulo, Brazil (2011). Catuscia Palamidessi.

211 V.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ 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). Catuscia Palamidessi. Invited Speaker at workshop on Logic And Information Security. Leiden, NL (2008). Catuscia Palamidessi. Invited Speaker at SecCo 2008, the international Workshop on Security Issues in Concurrency,Toronto, Canada, August (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 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). Catuscia Palamidessi. Invited Speaker at SOS 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). Catuscia Palamidessi. Invited Speaker at Grande Region Security and Reliability Day. Nancy, France (2012). Catuscia Palamidessi. Invited Speaker at COW The 19th CREST Open Workshop on Interference and Dependence, UK (2012). Catuscia Palamidessi. V Participations sur invitation à 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). Pa-lamidessi) Shanghai, China, 2009 (Catuscia Aarhus, Den- Symposium for Prof. Mogens Nielsen s 60th birthday: an Aarhus celebration. mark, 2009 (Frank Valencia)

212 212 CHAPTER V.7. ANNEXES : CONCURRENCY, MOBILITY AND TRANSACTIONS 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 Andrés, Konstantinos Chatzikokolakis, Sophia Knight and Catuscia Palamidessi) Schloss Dag- Dagstuhl seminar on Information Flow and Its Applications (invited speaker). stuhl, Germany, 2012 (Catuscia Palamidessi) Dagstuhl seminar on Quantitative Security Analysis. Schloss Dagstuhl, Germany, 2012 (Konstantinos Chatzikokolakis, Ehab ElSalamouny, Sardaouna Hamadou, Catuscia Palamidessi and Marco Stronatti) Sho- Shonan seminar on Quantitative Methods in Security and Safety Critical Applications. nan Village, Japan, 2012 (Konstantinos Chatzikokolakis) Rutgers University, US, 2013 (Konstanti- DIMACS Working Group on Measuring Anonymity. nos Chatzikokolakis) V Prix et distinctions Prix de thèse Gilles Kahn (second place), Konstantinos Chatzikokolakis, ComèteConcurrency, Mobility and Transactions

213 VI Équipe Cryptographie (CRYPTO) 213

214

215 VI.1 Liste des membres : Cryptographie VI.1.1 VI Liste actuelle des membres Membres permanents Nom Fonction Employeur HDR Arrivée Daniel Augot DR INRIA HDR 2008 Alain Couvreur CR INRIA 2011 Françoise Levy-dit-Vehel Associate Professor ENSTA HDR 2012 François Morain Professor École polytechnique HDR 1991 Benjamin Smith CR, CHE INRIA, École polytechnique 2007 Valérie Lecomte Assistant INRIA 2012 VI Doctorants et postdoctorants Doctorants Nom Financement Arrivée Encadrant Cécile Gonçalves Monge 2011 F. Morain Gwezheneg Robert MESR-Rennes 2012 P. Loidreau (IRMAR, Rennes) Alexander Zeh Ulm Universität (Germany) 2010 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 Financement Dates Responsable Nicolas Delfosse Qualcomm A. Couvreur Julia Pieltant INRIA D. Augot Guillaume Quintin X/DGA D. Augot VI Visiteurs et autres membres Visiteurs de longue durée 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 VI.1.2 VI Anciens membres Membres permanents Nom Fonction Employeur HDR Départ Position actuelle Andreas Enge CR INRIA Saclay Île-de-France HDR 2010 INRIA Bordeaux Sud-Ouest 215

216 216 CHAPTER VI.1. LISTE DES MEMBRES : CRYPTOGRAPHIE VI Doctorants Doctorants et postdoctorants Nom Financement Départ Encadrant Position actuelle Morgan Barbier École polytechnique 2011 D. Augot ATER Caen, MC on October 1st, 2013 Jean-François Biasse DGA 2010 A. Enge PostDoc, University of Calgary Luca De Feo X/Monge 2010 F. Morain MC, Versailles Saint-Quentin University Thomas Houtmann DGA 2008 F. Morain Professor, Classes préparatoires Guillaume Quintin INRIA/DGA 2012 D. Augot PostDoc École polytechnique Postdoctorants Nom Financement Dates Responsable Position actuelle Alain Couvreur INRIA D. Augot CR, INRIA Sorina Ionica DGA B. Smith ATER, ENS Ulm VI Stagiaires Master 2 Autres membres Nom Financement Dates Responsable Position actuelle Guillaume Quintin CNRS 2009 D. Augot LIX postdoctorant Autres Nom Fonction Financement Dates Jérôme Milan Software Engineer Digiteo Jérôme Milan Software Engineer CNRS Tania Richmond Stagiaire M1 CNRS 2011

217 VI.2 Rapport scientifique : Cryptographie VI.2.1 Thématique générale et principaux objectifs VI 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 Thèmes de recherche 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 2 p 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 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 : F X (x,y) = 0 where F X 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 g X of X is a non-negative integer classifying the essential geometric complexity of X ; it depends on the degree of F X 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) = {(α,β) L 2 : F X (α,β) = 0} (we may also include some additional points at infinity ). In a functorial way, there exists an algebraic group J X, called the Jacobian of X ; Jacobians are fundamental in curve-based cryptography. The group J X has a geometric structure: its elements correspond, to points on a g X -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 degh g and degf = 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

219 VI.2.1. THÉMATIQUE GÉNÉ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 F q. 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 F q, 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 220 CHAPTER VI.2. RAPPORT SCIENTIFIQUE : CRYPTOGRAPHIE VI Exemples de résultats significatifs 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 F 2, 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 Animation scientifique, rayonnement, prix et récompenses 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 A. Enge won the Selfridge Prize of the Number Theory Foundation for the best paper presented at ANTS-VIII, L. De Feo received the SIGSAM Distinguished Student Paper Award at ISSAC B. Smith won the Best Paper award at Asiacrypt 2011 for his work on counting points on genus 2 curves with real multiplication. VI 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 Confé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,

221 VI.2.1. THÉMATIQUE GÉNÉ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 (École polytechnique), and has contributed by giving a talk in January D. Augot sometimes attends Comèteseminar. We are regular participants of a monthly Butte aux Cailles open seminar, located in Paris at Télécom ParisTech, where the focus is on topics in curves, cryptography and coding. VI Fonctionnement interne 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: Thé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 École Polytechnique: François Morain, who is a full professor, and Ben Smith, who is Chargé d Enseignement. Except for the years , 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 Topic Funding Agency Amount Start End CADO Factorization ANR 96, PACE Pairings in crypto ANR (industrial) 180, DIFMAT Optimal codes X/DGA 86, CATREL Discrete Logarithm ANR 149, , 000 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 Î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 Formation par la recherche The Plateau de Saclay environment provides many opportunities to get PhD funding (É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 École Polytechnique.

222 222 CHAPTER VI.2. RAPPORT SCIENTIFIQUE : CRYPTOGRAPHIE

223 VI.3 Projet de recherche : Cryptographie VI.3.1 VI Objectifs scientifiques Basic Number Theory This is a strong historical thread from Franç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 X 0 (l) for prime l with Atkin s functions. A more general study of quotients of modular curves X 0 (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 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 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 of the same type over the same finite field, we can define a number of families including both X and X. The question is: which of these families yields the most efficient point counting algorithm? VI 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 F q 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 F 64 ). 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 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,

225 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 à 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 The aim is to recover a bit of the message by looking only at a small number l 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 226 CHAPTER VI.3. PROJET DE RECHERCHE : CRYPTOGRAPHIE

227 VI.4 Analyse AFOM : Cryptographie INTERNE POSITIF Strong French communauty in Cryptography, Algorithmic Number Theory. Cryptography is a key ingredient of security, and security is promoted both by INRIA ˆIle-de- France and Digicosme. Neighboring CMLS (Centre de math ematiques Laurent Schwartz), LMO (Laboratoire de math ematiques d Orsay), and Fondation Jacques Hadamard. Out of the box thinking about coding and cryptography (geometry). Best algebraic knowledge on error correcting codes. Software mastery, our local cluster, ties with Caramel. World record breaking computations. Atouts Opportunit es A F O M Different communities and cultures in Crypto and Coding. Lack of local critical mass in LIX and outside LIX to fully benefit from Plateau de Saclay. Few Phd students. Faiblesses Menaces No more PhD students. Departure of our junior permanent members. NEGATIF EXTERNE Figure VI.4.1: Analyse AFOM de l équipe Cryptographie : Atouts, Faiblesses, Opportunités, Menaces 227

228 228 CHAPTER VI.4. ANALYSE AFOM : CRYPTOGRAPHIE

229 VI.5 Fiche résumé : 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 TANC : 3 INRIA chercheurs, 1 enseignant-chercheurs (X), 1 engineer, 4 doctorants GRACE : 3 chercheurs (3 INRIA), 2 enseignants-chercheurs (X, ENSTA), 3 postdocs, 3 doctorants. Départ de membres de l é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 Françoise Levy-dit-Vehel (Associate professor, ENSTA) joining the team, with themes like applied cryptography and multivariate cryptography. VI.5.2 Résultats scientifiques 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

230 230 CHAPTER VI.5. FICHE RÉSUMÉ : CRYPTOGRAPHIE VI.5.3 Production scientifique VI Publications Journaux : 18 Conférences internationales : 22 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, Ré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. Thomé 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 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 Poincaré, or Télé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 Actions de formation 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 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).

231 VI.6 Production scientifique : Cryptographie Les publications [504] et [499] sont des publications avec des auteurs dans des des équipes différentes. VI.6.1 Livres et chapitres de livres [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 Full journal versions of selected papers of WCC [447] G. Hanrot, F. Morain, and E. Thomé, editors. Algorithmic Number Theory, volume 6197 of Lecture Notes in Comput. Sci. Springer-Verlag, th International Symposium, ANTS- IX, Nancy, France, July 2010, Proceedings. VI.6.2 Documents pédagogiques [448] F. Morain. Cours de Cryptologie. Ecole Polytechnique, pages. [449] F. Morain. Introduction à la programmation et à l algorithmique. Ecole Polytechnique, pages. VI.6.3 Revues internationales [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): , September [451] Alain Couvreur. Construction of rational surfaces yielding good codes. Finite Fields and Their Applications, 17(5): , September [452] Alain Couvreur. Differential Approach for the Study of Duals of Algebraic-Geometric Codes on Surfaces. Journal de Théorie des Nombres de Bordeaux, 23(1):95 120, January [453] Alain Couvreur. The dual minimum distance of arbitrary-dimensional algebraicgeometric codes. Journal of Algebra, 350(1):84 107, January [454] Luca De Feo. Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic. Journal of Number Theory, 131(5): , May [455] Luca De Feo and Éric Schost. transalpyne: a language for automatic transposition. ACM SIGSAM Bulletin, 44(1/2):59 71, July [456] Luca De Feo and Éric Schost. Fast Arithmetics in Artin-Schreier Towers over Finite Fields. Journal of Symbolic Computation, 47(7): , July [457] Régis Dupont. Fast evaluation of modular functions using Newton iterations and the AGM. Mathematics of Computation, 80(275): , [458] Andreas Enge. Computing modular polynomials in quasi-linear time. Mathematics of Computation, 78(267): ,

232 232 BIBLIOGRAPHY [459] Andreas Enge. The complexity of class polynomial computation via floating point approximations. Mathematics of Computation, 78(266): , [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, [461] Carlos Munuera and Morgan Barbier. Wet paper codes and the dual distance in steganography. Advances in mathematics of communications, 6(3): , November [462] Benjamin Smith. Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves. Journal of Cryptology, 22(4): , [463] Benjamin Smith. Families of explicitly isogenous Jacobians of variable-separated curves. LMS Journal of Computation and Mathematics, 14: , August [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 [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: , September [466] Alexander Zeh and Antonia Wachter. Fast Multi-Sequence Shift-Register Synthesis with the Euclidean Algorithm. Advances in mathematics of communications, 5(4): , posted at = :39:25, [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 VI.6.4 Conférences internationales [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 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 , Paraty, Brésil, October 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 , Oxford, Royaume-Uni, November Springer. [471] Daniel Augot and Michael Stepanov. A note on the generalisation of the Guruswami- Sudan list decoding algorithm to Reed-Muller codes. In Massimiliano Sala, Teo Mora, Ludovic Perret, Shojiro Sakata, and Carlo Traverso, editors, Gröbner Bases, Coding, and Cryptography, volume 2, pages Springer, 2009.

233 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, ISIT IEEE International Symposium on, pages , Toronto, Canada, August 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 , Saint-Peterburg, Russie, Fédération De, August IEEE. [474] Juliana Belding, Reinier Brö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 , Banff, Canada, Springer-Verlag. [475] Luca De Feo and Éric Schost. Fast Arithmetics in Artin-Schreier Towers over Finite Fields. In International Conference on Symbolic and Algebraic Computation, pages , Corée, République De, July [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 , Melbourne, Australie, 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 , Seoul, Corée, République De, November 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 , Cambridge, États-Unis, IEEE. [479] Guillaume Quintin. The decoding Library for List Decoding. In François Boulier, editor, International Symposium on Symbolic and Algebraic Computation, volume 46, pages , Grenoble, France, 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 , Doha, Qatar, [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 , Istanbul, Turquie, 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 , Luminy, France, 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 Internation Symposium on Information Theory, pages , Boston, États- Unis, April IEEE.

234 234 BIBLIOGRAPHY [484] Alexander Zeh, Christian Gentner, and Martin Bossert. Efficient List-Decoding of Reed- Solomon Codes with the Fundamental Iterative Algorithm. In Daniel Costello and Alex Grant, editors, Information Theory Workshop, ITW IEEE, Taorminia, Italie, [485] Alexander Zeh, Sabine Kampf, and Martin Bossert. On the Equivalence of Sudan- Decoding 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, [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 , Taichung, Taïwan, Province De Chine, [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 , Austin, États-Unis, 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 , St. Petersburg, Russie, Fédération De, [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 IEEE. 5 pages, no figure, submitted to ISIT2013. VI.6.5 Conférences nationales [490] Daniel Augot. Les codes algébriques principaux et leur décodage. In Jean-Guillaume Dumas, Grégoire Lecerf, Delphine Boucher, and Thomas Cluzeau, editors, Journées Nationales de Calcul Formel, volume 1 of Les cours du CIRM, pages 31 74, Luminy, France, May CIRM. [491] Daniel Augot. Problématique des bons codes sur le corps à deux éléments. In Journées de la Société Mathémarique de France, Fascicules Journées annuelles de la SMF, Paris, France, June VI.6.6 Vulgarisation [492] F. Morain. Factorisation d entiers : la voie royale du cassage de RSA. MISC Hors-Série 5 Cryptographie : vos secrets sont-ils bien gardés?, April [493] F. Morain. Le logarithme discret contre les tunnels sécurisés. MISC Hors-Série 6 Les mains dans la cryptographie, November 2012.

235 VI.6.7. LOGICIEL 235 VI.6.7 VI Logiciel Multiprecision MPC The mpc library, developed in C by A. Enge in collaboration with Ph. Thé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 The library currently benefits from an INRIA Opération de développement logiciel. The latest version (0.8) was released in November A Debian package has been available (in the testing distribution) since October The perl wrapper Math::MPC ( sisyphus/math-mpc/) has been available on CPAN since version 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 ( and by Trip ( a symbolic-numeric system for celestial mechanics developed at Institut de Mécanique Céleste et de Calcul des Éphémé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 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 Integer Factorization ECPP F. Morain has been continuously improving his primality proving algorithm called ECPP, originally developed in the early 1990s. Binaries for version 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 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 tifa.xhtml and distributed under the Lesser General Public License, version 2.1 or later.

236 236 BIBLIOGRAPHY CADO-NFS One of the achievements of the ANR CADO is the program cado-nfs available on 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 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 Coding theory Quintix The Quintix library is a Mathemagix package available at 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 Guruswami- Sudan 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 Thèses [494] Morgan Barbier. Décodage en liste et application à la sécurité de l information. These, Ecole Polytechnique X, December [495] Jean-François Biasse. Subexponential algorithms for number fields. PhD thesis, Ecole Polytechnique X, [496] Luca De Feo. Algorithmes Rapides pour les Tours de Corps Finis et les Isogénies. These, Ecole Polytechnique X, December [497] Guillaume Quintin. Sur l algorithme de décodage en liste de Guruswami-Sudan sur les anneaux finis. PhD thesis, Ecole Polytechnique X, November 2012.

237 VI.6.9. BREVETS 237 VI.6.9 VI.6.10 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 [499] Thomas Heide Clausen, Ulrich Herberg, and Jérôme Milan. Digital Signatures for Admittance Control in the Optimized Link State Routing Protocol version 2. Rapport de recherche RR-7216, INRIA, February 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, [501] Daniel Augot and François Morain. Discrete logarithm computations over finite fields using Reed-Solomon codes. Preprint, 2012, [502] Stéphane Ballet, Jean Chaumine, and Julia Pieltant. Shimura modular curves and asymptotic symmetric tensor rank of multiplication in any finite field. Preprint, 2013, [503] Morgan Barbier. New Set of Codes for the Maximum-Likelihood Decoding Problem. In Yet Another Conference on Cryptography, Porquerolle, France, October [504] Jérémy Berthomieu, Grégoire Lecerf, and Guillaume Quintin. Polynomial root finding over local rings and application to error correcting codes. Preprint, fr/hal [505] Alain Couvreur, Philippe Gaborit, Valé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, Norvège, April [506] Nicolas Delfosse. Tradeoffs for reliable quantum information storage in surface codes and color codes. Preprint, 2013, [507] Andreas Enge and François Morain. Generalised Weber Functions. I. Preprint, 2009, [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, Norvège, April [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: //hal.inria.fr/hal [510] Guillaume Quintin, Morgan Barbier, and Christophe Chabot. On Generalized Reed- Solomon Codes Over Commutative and Noncommutative Rings. Preprint, 2012, http: //hal.inria.fr/hal

238 238 BIBLIOGRAPHY

239 VI.7 Annexes : Cryptographie VI.7.1 Participations à la communauté scientifique et responsabilités administrative Responsabilités administratives des membres de l équipe incluant responsabilité de recherche et d enseignement F. Morain represents INRIA at Conseil d UFR 929 Maths of Paris 6 (période ). is vice-head of the Département d informatique of Ecole Polytechnique (période ). represents École polytechnique in the Commission des Études du Master MPRI (période ). is vice-head of the Département d informatique of Ecole Polytechnique (période ). is a member of the commission de recrutement en informatique of Ecole Polytechnique (période 2011-). is an elected member to the conseil de laboratoire du LIX (période 2011-). Andreas Enge was in charge of European affairs at INRIA Saclay Île-de-France (période -2010). D. Augot is charge of the followup of PhD students of INRIA Saclay Île-de-France (période 2010-). is member of INRIA Saclay Île-de-France s commission scientifique, in charge of allocating a few PhD and postdoctoral grants (période 2010-). is member of INRIA Saclay Île-de-France s bureau du comité des projets, in charge of discussing the creation and ending of INRIA project-teams (période 2010-). is part of Digiteo comité de programme in charge of evaluating Digiteo Ph.D. and Post- Doctoral grant applications (période 2011-). represents INRIA in the commission formation of Digicosme (période 2012-). F. Levy-dit-Vehel is in charge of the teaching module Sécurité des systèmes d information for third year students. (période 2000-). is the correspondent of Master MPRI at ENSTA ParisTech. (période 2007-). B. Smith is an elected member of the Comité de Centre of INRIA Saclay Île-de-France (période 2012-). is an elected member of the Conseil du Laboratoire of LIX. (période 2012-). is the coordinator for the LIX-Qualcomm postdoctoral fellowship. (période 2011-). is the responsable de bureaux at LIX. (période 2013-). 239

240 240 CHAPTER VI.7. ANNEXES : CRYPTOGRAPHIE VI Participation à des projets nationaux Project PACE ( ) (Type: Industrial ANR project) Titre: Pairings and advances in cryptology for e-cash pace.rd.francetelecom.com/. Partenaires: France Télécom R&D, Gemalto, NXP Semiconductors, Cryptolog International, École normale supérieure Paris and Université Caen. Responsable: Andreas Enge. Montant de la collaboration pour le LIX: euros (sur un total de 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 Télécom in Caen. Project CADO ( ) (Type: Projet ANR) Titre: Crible Algébrique : Distribution, Optimisationcado.gforge.inria.fr. Partenaires: LORIA. Responsable: F. Morain. Montant de la collaboration pour le LIX: euros (sur un total de 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 ( ) (Type: X/DGA) Titre: Diffusion matrices. Partenaires: None. Responsable: D. Augot. Montant de la collaboration pour le LIX: 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 ( ) (Type: ANR project) Titre: Cribles: Améliorations Théoriques et Ré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: received by LIX, 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 ( ) (Type: CNRS PEPS, projet exploratoire premier soutien) Titre: Topolgie algébrique et Codes Quantiques Algebraic topology and Quantum Codes. Partenaires: INRIA Rocquencourt, IMB (Bordeaux), LATP (Marseille). Responsable: G. Zémor. Montant de la collaboration pour le LIX: no funding for the LIX, the total amount is 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 Participation à des projets locaux CryptoNet ( ) (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: 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.

241 VI.7.2. ADMINISTRATION DE LA RECHERCHE 241 Amiga ( ) (Type: Digiteo/DGA Postdoc) Titre: Advanced Methods for Isogeny Graph Analysis. Postdoc, Sorina Ionica. Partenaires: None. Responsable: B. Smith. Montant de la collaboration pour le LIX: euros. Isogenies are essentially morphisms between elliptic curves, occuring in many contexts in computational number theory and cryptography. VI Contrats bilaté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: 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 Administration de la recherche Activités éditoriales Membres de comités éditoriaux Designs, Codes and Cryptography (Springer) A. Enge (2004-). Voir com/journal/ RAIRO - Theoretical Informatics and Applications (Cambrige University Press) D. Augot (2012-). Voir Edition de numéros spéciaux Journal of Symbolic Computation (Springer) Special issue: Gröbner Bases in Cryptography, Coding Theory, and Algebraic Combinatorics D. Augot, with J.C. Faugère and L. Perret 2009http:// 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/ /s VI Gestion scientifique de conférences Présidence de comités de programme 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. Participation à des comités de programme Pairing (Conference on Pairing-Based Cryptography) (2008). A. Enge. JNCF (Journées Nationales de Calcul Formel, advisory board) (2008). A. Enge.

242 242 CHAPTER VI.7. ANNEXES : CRYPTOGRAPHIE 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 Organisation d événements scientifiques Présidence de comités d organisation The team organized the C4 (Computations on Curves for Crypto and Coding) workshop, held on the 9th and 10th of June 2008 at the École polytechnique, bringing together leading researchers from France, the United States, Canada, Denmark, and the Netherlands. Participation à des comités d organisation 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.. B. Smith organised the rump VI Participation à des comités et jurys scientifiques Au niveau international Swiss National Science Foundation (2011) D. Augot. Grant evaluation. Au niveau national CNRS PEPS Projets Exploratoires PluridisciplinaireS (2011) D. Augot. Grant evaluation. Commission de sélection Université Pierre et Marie Curie (D. Augot) 2010 Université du Sud Toulon-Var (D. Augot) 2011, 2012 Université Paris 8, Vincennes Saint-Denis (D. Augot) 2011 Université de Versailles Saint-Quentin (D. Augot) 2013

243 VI.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION 243 VI.7.3 VI Activités de formation, encadrement et évaluation Liste des thèses et HDR soutenues Thèses de doctorat Jean-Franç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 Isogénies. Encadrant: Franç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 Grégoire Lecerf). VI Liste de rapports de thèses et HDR Rapports d habilitations à dirigers les recherches Ayoub Otmani (December 6, 2011). Contribution à la cryptanalyse de primitives cryptographiques fondées sur la théorie des codes. Rapporteur: D. Augot. Rapports de thèse Eleonara Guerini (April 27, 2009). Systematic codes and polynomial ideals. Université of Trento, Italy. Rapporteur: D. Augot. Thomas Roche (January 29, 2010). Dimensionnement et intégration d un chiffre symétrique dans le contexte d un système d information distribué de grande taille. Grenoble. Rapporteur: D. Augot. Cyril Bazin (January 19th, 2010). Tatouage de données géographiques et généralisation aux données devant préserver des contraintes. Caen. Rapporteur: D. Augot, supervising Caroline Fontaine s review. Alexander Soro (December 3rd, 2010). Mécanismes de fiabilisation pro-actifs. Rapporteur: D. Augot. Toulouse. Amine Bouabdallah (December 3rd, 2010). Contributions à 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. Université de Limoges. Rapporteur: D. Augot. Romain Cosset (November 7, 2011). Applications des fonctions thêta à la cryptographie sur courbes hyperelliptiques. Université H. Poincaré. Rapporteur: F. Morain. Shi Bai (November 2011). Polynomial selection for the number field sieve. National University. Rapporteur: F. Morain. Australian Rafaël Fourquet (December 9th, 2011). Décodage par liste des codes de Reed et Muller et applications à la cryptanalyse. Université Paris 8. Rapporteur: F. Levy-dit-Vehel.

244 244 CHAPTER VI.7. ANNEXES : CRYPTOGRAPHIE Vincent Herbert (December 5th, 2011). Des codes correcteurs pour sécuriser l information numérique. Université 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 thèse Damien Robert (July 21st, 2010). Fonctions thêta et applications à la cryptographie. Président: F. Morain. Stéphane Jacob (March 8th, 2012). Protection cryptographique des bases de données : conception et cryptanalyse. Pré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 évaluation numérique des fonctions D-finies. Membre: F. Morain. Romain Cosset (November 7th, 2011). Applications des fonctions thêta à 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 booléennes, courbes algébriques, et multiplication complexe. Membre: B. Smith. VI Enseignements dispensés École Polytechnique Licence : F. Morain, 10 lectures of 1.5h, 1st year course Introduction à l informatique (INF311) at École polytechnique (L2). Responsability of this module (350 students). License (L2) : B. Smith, tutorials for Introduction à l informatique (INF311) at École polytechnique. 36h in 2012, 36h in License (L2) : B. Smith, tutorials for Les principes des langages de programmation (INF321). 36h in License (L3) : B. Smith, tutorials for Les bases de la programmation et de l algorithmique (INF421a). 36h in Master (M1) : F. Morain, 9 lectures of 1.5h, 3rd year course cryptology at École polytechnique. Master (M1) : B. Smith, tutorials for Cryptology (INF568). 18h in 2012, 18h in ENSTA ENSTA ParisTech: Mathématiques discrètes pour la protection de l information, course for 2nd year students. F Levy-dit-Vehel, 21 hours, ENSTA ParisTech: Cryptographie, course for 3rd year students. F Levy-dit-Vehel, 21 hours, ENSTA ParisTech: Introduction à la cryptographie, course in specialized master architecture des systèmes d information. F Levy-dit-Vehel, 7 hours,

245 VI.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION 245 Cours universitaires en M2 Jury MPRI (Master Parisien de recherche en informatique),u. Paris Diderot, ENS Ulm, ENS Cachan, É. Polytechnique, U. Paris Sud, U. P. et M. Curie, France Codes correcteurs d erreurs et applications à la cryptographie. D. Augot, 24 hours, M2, Arithmetic algorithms for cryptology. F. Morain, 9 hours, M2. Arithmetic algorithms for cryptology. B. Smith, 9 hours, M2. Agrégation de Mathématiques option D (informatique). A. Couvreur, Ecoles thématiques et cours spécialisés 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 Réfé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 mathé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 Journé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 Vulgarisation 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. 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 246 CHAPTER VI.7. ANNEXES : CRYPTOGRAPHIE D. Augot was interviewed for a video about Évariste Galois. D. Augot, M. Barbier, C. Gonçalves, S. Ionica, and B. Smith took part in the Nuit des chercheurs at the École polytechnique. D. Augot made a presentation in high school at Courcouronnes Quand = 0. D. Augot was interviewed by French novelist Franç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 écoles, pourquoi pas moi?. D. Augot made a presentation in high school at Courcouronnes Quand = 0. A. Couvreur made a presentation at UniThé ou Café (INRIA Saclay) Décryptage du codage. VI.7.4 Autres éléments de visibilité VI 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, Montréal (2010). B. Smith. Elliptic Curve Discrete Logarithm workshop, Laboratory for Cryptologic Algorithms (LACAL), EPFL, Lausanne (2011). B. Smith. National workshops Rencontres Arithmétiques de l Informatique Mathématique, Lyon. (2008). L. De Feo. 25 ans du DEA Limoges (2011). F. Morain. Journées C2, Codage et Cryptographie, Oléron (2011). F. Morain. Journées C2, Codage et Cryptographie, Dinard (2012). D. Augot.

247 VI.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ 247 Participation à 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). G. Quintin. D. Augot, B. Smith, A. Couvreur, C. Goncalves, J. Pieltant, Séjours invités Combinatorial, Algebraic and Algorithmic Aspects of Coding Theory Semester, EPFL (2011). D. Augot, two weeks. VI Prix et distinctions 1. B. Smith won the Best Paper award at EUROCRYPT 2008 for his work on discrete logarithms in genus A. Enge won the Selfridge Prize of the Number Theory Foundation for the best paper presented at ANTS-VIII, L. De Feo received the SIGSAM Distinguished Student Paper Award at ISSAC 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 248 CHAPTER VI.7. ANNEXES : CRYPTOGRAPHIE

249 VII Équipe High-Performance Communications (Hipercom) 249

250

251 VII.1 Liste des membres : High-Performance Communications VII.1.1 VII Liste actuelle des membres Membres permanents Nom Fonction Employeur HDR Arrivée Thomas Heide Clausen Maitre de conference École Polytechnique 2004 Sylvie Tonda-Goldstein Chargée d Affaire à la DRIP DRIP, École Polytechnique 2004 Valerie Lecomte Administrative assistant INRIA 2008 Note: La DRIP est la Direction des Relations Industrielles et Partenariales de l École polytechnique. VII Doctorants et postdoctorants Postdoctorants Nom Financement Dates Responsable Jiazi Yi Carnot T. Clausen VII.1.2 VII Anciens membres Membres permanents Nom Fonction Employeur HDR Départ Position actuelle Aline Carneiro Viana CR INRIA HDR March 2012 INRIA Emmanuel Baccelli CR INRIA March 2012 INRIA, mission longue duree a Berlin FU Philippe Jacquet DR INRIA HDR 2011 Alcatel-Lucent Bell Labs VII Doctorants et postdoctorants Doctorants Nom Financement Départ Encadrant Position actuelle Ulrich Herberg EDx 2011 T. Clausen & Fujitsu Laboratories of P. Jacquet America Juan Antonio Cordero Fuertes EDx 2011 E. Baccelli & P. Jacquet Université catholique de Louvain, ICTEAM, Brussels Marie Nestor Mariyasagayam CIFRE 2011 T. Clausen & Hitachi France P. Jacquet Song-Yean Cho INRIA 2008 P. Jacquet Samsung, Korea Postdoctorants Nom Financement Dates Responsable Position actuelle Jiazi Yi ERDF T. Clausen Still at LIX, different financing Jiazi Yi Qualcomm T. Clausen Still at LIX, different financing Georg Wittenberg INRIA E. Baccelli The Boston Consulting Group, Germany 251

252 252 CHAPTER VII.1. LISTE DES MEMBRES : HIGH-PERFORMANCE COMMUNICATIONS VII Stagiaires Master 2 Autres membres Nom Financement Dates Responsable Position actuelle Ulrich Herberg Bourse TUM T. Clausen Fujitsu Laboratories of America Juan Antonio Cordero Fuertes Bourse X T. Clausen Université catholique de Louvain, ICTEAM, Brussels Veronika Maria Bauer Bourse TUM 2010 T. Clausen & PhD student, TUM E. Baccelli Alberto Camacho Martinez Erasmus T. Clausen Universitat Pompeu Fabra Visiteurs de longue durée Nom Financement Dates Invitant Rodney Van Meter Ecole Polytechnique March 2011-April 2011 T. Clausen

253 VII.2 Rapport scientifique : High- Performance Communications VII.2.1 Thématique générale et principaux objectifs VII 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 Thème 1 Thèmes de recherche : Wireless MESH Networks, convergence of wireless, mobile and wired networks Thème 2 Thème 3 : Sensor Networking, Smart Objects and the Internet of Things : Service-Driven Networks VII Exemples de résultats significatifs 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 ( 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

254 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 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.

255 VII.2.1. THÉMATIQUE GÉNÉ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 ê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 IETF 2, a set of algorithms and a resulting protocol, named RPL 3 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 IETF 4 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 manufacturers 5 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 Responsabilité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 theoret- 2 Internet Engineering Task Force 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 RFC Reactive Discovery of Point-to-Point Routes in Low-Power and Lossy Networks, M. Goyal, E. Baccelli, M. Philipp, A. Brandt, J. Martoccini, August

256 256CHAPTER VII.2. RAPPORT SCIENTIFIQUE : HIGH-PERFORMANCE COMMUNICATIONS 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 Animation scientifique, rayonnement, prix et récompenses 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 ( - 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 ( and in 2010 as part of the Mission d information sur les droits de l individu dans la révolution numérique ( 2010)

257 VII.2.1. THÉMATIQUE GÉNÉ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 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 à la science informatique ( VII Fonctionnement interne 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 INRIA- Rocquencourt. 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 Formation par la recherche Toutes les thèses sont financées : EDx (1), CIFRE (1), INRIA (2).

258 258CHAPTER VII.2. RAPPORT SCIENTIFIQUE : HIGH-PERFORMANCE COMMUNICATIONS INTERNE Departure of single team member puts all activities at risk. Basic research / theory has taken a back-seat to industrially applicable research. The only permanent team member is also spending a significant fraction of his time teaching and coordinating teaching programs at Ecole Polytechnique. Faiblesses POSITIF High-profile research topic. Significant industry interest, partnerships. Team competencies. International visibility. Strong implication in international standardisation. Ability to attract large research projects (industrial and otherwise). Atouts Extremely competent support from the Direction des Relations Industrielles et Partenariats (DRIP) at Ecole Polytechnique on legal/contractual matters. National industrual environment increasingly interested in application of results. Opportunit es A F O M Menaces Members of Direction of Ecole Polytechnique have already - explicitly - stated that the research topic is not a strategic priority for the institution. Competitive research topic. Severe lack of personnel - inability to hire permanent staff. Administrative overhead. Lack of basic funding for nonapplied research. Increasing time spent on chasing funding, constructing and submitting proposals. NEGATIF EXTERNE Figure VII.2.2: Analyse AFOM de l équipe High-Performance Communications : Atouts, Faiblesses, Opportunités, Menaces

259 VII.3 Fiche résumé : High-Performance Communications VII.3.1 Membres 2008 : 2 chercheurs (2 INRIA), 1 enseignants-chercheurs, 3 doctorants 2013 : 1 enseignants-chercheurs, 1 postdoc Départ de membres de l équipe Philippe Jacquet (Alcatel-Lucent), Emmanuel Baccelli (INRIA, on long-term mission at FU Berlin), Aline Carneiro Viana(INRIA). Sadly, none, despite intense lobbying with X and LIX for recruiting rein- Nouveaux membres forcements. VII.3.2 Résultats scientifiques 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 publication 1. 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 259

260 260 CHAPTER VII.3. FICHE RÉSUMÉ : 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 Production scientifique Publications Journaux : 10 Conférences internationales : 38 International Standards: 9 5 productions scientifiques marquantes: N. Karowski, A. Carneiro Viana, and A. Wolisz, Optimized Asynchronous Multi-channel Discovery of IEEE based Wireless Personal Area Networks. Accepted in 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 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 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 VII 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.

261 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 ( - 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 ( and in 2010 as part of the Mission d information sur les droits de l individu dans la révolution numérique ( 2010) VII Actions de formation 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 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 à la science informatique (

262 262 CHAPTER VII.3. FICHE RÉSUMÉ : HIGH-PERFORMANCE COMMUNICATIONS

263 VII.4 Production scientifique : High- Performance Communications VII.4.1 Livres et chapitres de livres [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 River Publishers, Denmark, [512] T. Clausen and E. Baccelli. Introduction à la science informatique. In chapter 7. CRDP de l Académie de Paris, July [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: , chapter 16. InTech, January VII.4.2 Revues internationales [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 [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 [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 [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 , November [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 [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 , Volume 2, Number 4, October [520] N. Karowski, A. Carneiro Viana, and A. Wolisz. Optimized asynchronous multi- channel discovery of IEEE based wireless personal area networks. IEEE Transaction on Mobile Computing, 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 [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

264 264 BIBLIOGRAPHY VII.4.3 Conférences internationales [523] E. Baccelli, T. Clausen, U. Herberg, and C. Perkins. IP links in multihop ad hoc wireless networks? In Proceedings of SoftCom, September [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 [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 [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 [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 [528] E. Baccelli, P. Jacquet, Bernard Mans, and Georgios Rodolakis. Information propagation speed in bidirectional vehicular delay tolerant networks. In IEEE Infocom, April [529] E. Baccelli, M. Philipp, and M. Goyal. The p2p-rpl routing protocol for IPv6 sensor networks: Testbed experiments. In Softcom, September [530] E. Baccelli and J. Schiller. Towards scalable MANETs. In Proceedings of the IEEE International Conference on ITS Telecommunications (ITST), Phuket, Thailand, October [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 [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 [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 [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 [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 [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 [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.

265 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 [539] T. Clausen, J. Yi, and A. Colin de Verdiere. LOADng: Towards AODV version 2. In 2012 IEEE 76th Vehicular Technology Conference, September [540] J. A. Cordero Fuertes. Adjacency persistency in OSPF MANETs. In 4th IET China-Ireland International Conference on Information and Communications Technologies (CIICT), October [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 [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 [543] U. Herberg. JOLSRv2 an OLSRv2 implementation in Java. In Proceedings of the 4th OLSR Interop Workshop, October [544] U. Herberg. Performance evaluation of using a dynamic shortest path algorithm in OL- SRv2. In Proceedings of the 8th Annual Conference on Communication Networks and Services Research (CNSR), May [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 [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 [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 [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 [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 [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 [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 [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.

266 266 BIBLIOGRAPHY [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 [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 [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 [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 [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 [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 [559] J. Yi, T. Clausen, and U. Herberg. Vulnerability analysis of the SMF protocol for mobile ad hoc networks. In IEEE CPSCom 2011, October [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 VII.4.4 Thèses [561] Song-Yean Cho. Efficient Information Dissemination in Wireless Multi-Hop Networks. Phd thesis, Ecole Polytechnique, September [562] J. A. Cordero Fuertes. Link-State Routing Optimization for Compound Autonomous Systems in the Internet. Phd thesis, Ecole Polytechnique, September [563] U. Herberg. Performance, Scalability, Automatic Management and Internet Integration of Ad Hoc Networks. Phd thesis, Ecole Polytechnique, May [564] Marie Nestor Mariyasagayam. Communication Véhiculaires par géolocalisation pour Systèmes de Transports Intelligents. Phd thesis, Ecole Polytechnique, June 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 [566] E. Baccelli and M. Townsley. RFC5889: Ip addressing model in ad hoc networks. The Internet Engineering Task Force, September rfc5889.

267 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 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 http: // [569] T. Clausen, C. Dearlove, and J. Dean. RFC6130: Mobile ad hoc network (MANET) neighborhood discovery protocol (nhdp). The Internet Engineering Task Force, March [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 [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 [572] ITU. ITU-T g.9903: Narrow-band orthogonal frequency division multiplexing power line communication transceivers for g3-plc networks: Amendment 1, May 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 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 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 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 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 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 internet-draft (work in progress). The Internet Engineering Task Force, April ietf.org/html/draft-clausen-lln-rpl-experiences.

268 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 [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 [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 internet-draft (work in progress). The Internet Engineering Task Force, March draft-clausen-lln-loadng. [582] 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 internet-draft (work in progress). The Internet Engineering Task Force, March draft-clausen-lln-loadng. [583] 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 internet-draft (work in progress). The Internet Engineering Task Force, April draft-clausen-lln-loadng. [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 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 [586] T. Clausen, C. Dearlove, and J. Dean. MANET neighborhood discovery protocol (NHDP) draft-07 - internet-draft (work in progress). The Internet Engineering Task Force, July [587] T. Clausen, C. Dearlove, and J. Dean. MANET neighborhood discovery protocol (NHDP) draft-08 - internet-draft (work in progress). The Internet Engineering Task Force, March [588] T. Clausen, C. Dearlove, and J. Dean. MANET neighborhood discovery protocol (NHDP) draft-09 - internet-draft (work in progress). The Internet Engineering Task Force, March [589] T. Clausen, C. Dearlove, and J. Dean. MANET neighborhood discovery protocol (NHDP) draft-10 - internet-draft (work in progress). The Internet Engineering Task Force, July [590] T. Clausen, C. Dearlove, and J. Dean. MANET neighborhood discovery protocol (NHDP) draft-11 - internet-draft (work in progress). The Internet Engineering Task Force, October

269 BIBLIOGRAPHY 269 [591] T. Clausen, C. Dearlove, and J. Dean. MANET neighborhood discovery protocol (NHDP) draft-12 - internet-draft (work in progress). The Internet Engineering Task Force, March [592] T. Clausen, C. Dearlove, and J. Dean. MANET neighborhood discovery protocol (NHDP) draft-13 - internet-draft (work in progress). The Internet Engineering Task Force, July [593] T. Clausen, C. Dearlove, and P. Jacquet. Link metrics for OLSRv2 draft-01 - internetdraft (work in progress). The Internet Engineering Task Force, July datatracker.ietf.org/doc/draft-dearlove-olsrv2-metrics/. [594] T. Clausen, C. Dearlove, and P. Jacquet. Link metrics for OLSRv2 draft-02 - internetdraft (work in progress). The Internet Engineering Task Force, July 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 https: //datatracker.ietf.org/doc/draft-dearlove-olsrv2-metrics/. [596] T. Clausen, C. Dearlove, and P. Jacquet. The optimized link state protocol version 2 (OL- SRv2) draft-05 - internet-draft (work in progress). The Internet Engineering Task Force, February [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 [598] T. Clausen, C. Dearlove, and P. Jacquet. The optimized link state protocol version 2 (OLSRv2) draft-07 - internet-draft (work in progress). The Internet Engineering Task Force, July [599] T. Clausen, C. Dearlove, and P. Jacquet. Link metrics for OLSRv2 draft-04 - internetdraft (work in progress). The Internet Engineering Task Force, July datatracker.ietf.org/doc/draft-dearlove-olsrv2-metrics-04. [600] T. Clausen, C. Dearlove, and P. Jacquet. The optimized link state protocol version 2 (OL- SRv2) draft-08 - internet-draft (work in progress). The Internet Engineering Task Force, March [601] T. Clausen, C. Dearlove, and P. Jacquet. The optimized link state protocol version 2 (OLSRv2) draft-09 - internet-draft (work in progress). The Internet Engineering Task Force, July [602] T. Clausen, C. Dearlove, and P. Jacquet. The optimized link state protocol version 2 (OL- SRv2) draft-10 - internet-draft (work in progress). The Internet Engineering Task Force, September [603] T. Clausen, C. Dearlove, and P. Jacquet. Link metrics for OLSRv2 draft-05 - internetdraft (work in progress). The Internet Engineering Task Force, June datatracker.ietf.org/doc/draft-dearlove-olsrv2-metrics/. [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 [605] T. Clausen, C. Dearlove, and P. Jacquet. The optimized link state protocol version 2 (OL- SRv2) draft-13 - internet-draft (work in progress). The Internet Engineering Task Force, October

270 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 Force, July [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 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 Approved for publication as RFC, 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 [610] U. Herberg and T. Clausen. Cryptographical signatures in NHDP draft-00 - internetdraft (work in progress). The Internet Engineering Task Force, November http: //tools.ietf.org/html/draft-herberg-manet-nhdp-sec. [611] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft internet-draft (work in progress). The Internet Engineering Task Force, July [612] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft internet-draft (work in progress). The Internet Engineering Task Force, July [613] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft internet-draft (work in progress). The Internet Engineering Task Force, July [614] U. Herberg and T. Clausen. Security threats for NHDP draft-00 - internet-draft (work in progress). The Internet Engineering Task Force, November org/html/draft-herberg-manet-nhdp-sec-threats. [615] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft internet-draft (work in progress). The Internet Engineering Task Force, June [616] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft internet-draft (work in progress). The Internet Engineering Task Force, July [617] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft-02 - internet-draft (work in progress). The Internet Engineering Task Force, November [618] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft-03 - internet-draft (work in progress). The Internet Engineering Task Force, March [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

271 BIBLIOGRAPHY 271 [620] U. Herberg and T. Clausen. Cryptographical signatures in NHDP draft-00 - internetdraft (work in progress). The Internet Engineering Task Force, July 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 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 ietf.org/html/draft-herberg-manet-nhdp-sec. [623] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft-03 - internet-draft (work in progress). The Internet Engineering Task Force, March [624] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft internet-draft (work in progress). The Internet Engineering Task Force, July [625] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft internet-draft (work in progress). The Internet Engineering Task Force, July [626] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft-06 - internet-draft (work in progress). The Internet Engineering Task Force, September [627] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft-07 - internet-draft (work in progress). The Internet Engineering Task Force, November [628] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft-08 - internet-draft (work in progress). The Internet Engineering Task Force, January [629] U. Herberg and T. Clausen. MANET cryptographical signature TLV definition draft-09 - internet-draft (work in progress). The Internet Engineering Task Force, March [630] U. Herberg and T. Clausen. Using integrity check values in NHDP draft-01 - internetdraft (work in progress). The Internet Engineering Task Force, March 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 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 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 draft-ietf-manet-nhdp-mib-01.

272 272 BIBLIOGRAPHY [634] U. Herberg, R. Cole, and I. Chakeres. Definition of managed objects for the neighborhood discovery protocol draft-02 - internet-draft (work in progress). The Internet Engineering Task Force, November draft-ietf-manet-nhdp-mib. [635] U. Herberg, R. Cole, and I. Chakeres. Definition of managed objects for the neighborhood discovery protocol draft-03 - internet-draft (work in progress). The Internet Engineering Task Force, March draft-ietf-manet-nhdp-mib-03. [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 [637] U. Herberg, R. Cole, and I. Chakeres. Definition of managed objects for the neighborhood discovery protocol draft-05 - internet-draft (work in progress). The Internet Engineering Task Force, November draft-ietf-manet-nhdp-mib-05. [638] U. Herberg, R. Cole, and I. Chakeres. Definition of managed objects for the neighborhood discovery protocol draft-06 - internet-draft (work in progress). The Internet Engineering Task Force, November draft-ietf-manet-nhdp-mib-06. [639] U. Herberg, R. Cole, and I. Chakeres. Definition of managed objects for the neighborhood discovery protocol - internet-draft (work in progress). The Internet Engineering Task Force, January [640] U. Herberg, R. Cole, and I. Chakeres. Definition of managed objects for the neighborhood discovery protocol draft-08 - internet-draft (work in progress). The Internet Engineering Task Force, July [641] U. Herberg, R. Cole, and I. Chakeres. Definition of managed objects for the neighborhood discovery protocol draft-09 - internet-draft (work in progress). The Internet Engineering Task Force, July [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 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 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 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 draft-ietf-manet-olsrv2-mib.

273 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 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 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 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 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 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 internetdraft (work in progress). The Internet Engineering Task Force, October 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 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 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 [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 [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 [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 [658] T. Clausen. MANET router configuration recommendations. Technical Report RR-6852, INRIA, February [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 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 [661] T. Clausen and U. Herberg. Comparative study of RPL-enabled optimized broadcast in wireless sensor networks. Technical Report RR-7296, INRIA, May [662] T. Clausen and U. Herberg. MANET network management and performance monitoring for NHDP and OLSRv2. Technical Report RR-7311, INRIA, June [663] T. Clausen and U. Herberg. Multipoint-to-point and broadcast in RPL. Technical Report RR-7244, INRIA, April [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 [665] T. Clausen and U. Herberg. Security issues in the optimized link state routing protocol version 2 (OLSRv2)). Technical Report RR-7218, INRIA, February [666] T. Clausen and U. Herberg. Study of multipoint-to-point and broadcast traffic performance in RPL. Technical Report RR-7384, INRIA, September [667] T. Clausen and U. Herberg. Vulnerability analysis of the optimized link state routing protocol version 2 (OLSRv2). Technical Report RR-7203, INRIA, February [668] T. Clausen and U. Herberg. Yet another autoconf proposal (YAAP) for mobile ad hoc NETworks. Technical Report RR-7341, INRIA, July [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 [670] T. Clausen and U. Herberg. Some considerations on routing in particular and lossy environments. Technical Report RR-7540, INRIA, February [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 [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 [673] J. A. Cordero Fuertes. On MPR-OSPF specification and implementation in quagga/gtnets. Technical Report RR-6827, INRIA, February [674] J. A. Cordero Fuertes. MPR-based pruning techniques for shortest path tree computation. Technical Report RR-7329, INRIA, June [675] J. A. Cordero Fuertes, E. Baccelli, and P. Jacquet. OSPF over multi-hop ad hoc wireless communications. Technical Report RR-7268, INRIA, April [676] U. Herberg. Integrating java support for routing protocols in NS2. Technical Report RR-7075, INRIA, October [677] U. Herberg. Performance analysis of SNMP in OLSRv2-routed MANETs. Technical Report RR-7407, INRIA, October [678] U. Herberg. Performance evaluation of using a dynamic shortest path algorithm in OL- SRv2. Technical Report RR-7174, INRIA, January 2010.

275 VII.4.8. AUTRES 275 [679] U. Herberg and T. Clausen. Delay tolerant routing with OLSRv2. Technical Report RR- 7662, INRIA, June [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 [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 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 [683] G. Dowek, T. Viéville, J.P. Archambault, E. Baccelli, and B. Wack. Les ingrédients des algorithmes. Interstices )i( (Online), April [684] G. Dowek, T. Viéville, J.P. Archambault, E. Baccelli, and B. Wack. Tout a un reflet numérique. Interstices )i( (Online), January 2010.

276 276 BIBLIOGRAPHY

277 VII.5 Annexes : High-Performance Communications VII.5.1 Participations à la communauté scientifique et responsabilités administrative Responsabilités administratives des membres de l équipe incluants responsabilité de recherche et d enseignement Thomas Heide Clausen VII co-chaired the AUTOCONF Working Group of the IETF (période ). presided the selection committee of the LIX-Qualcomm Fellowship Program 1 (période ). was member of the Commite Enseignement-Recherche du DIX, nominated by the Director of LIX (période ). is coordinator of the Computer Networking curriculum at Ecole Polytechnique (période 2010-). is member of the Routing Area Directorate of the IETF 2 (période 2011-). Responsabilités de projets internationaux Hitachi ( ) (Type: Direct Industrial Sponsorship) Titre: Development of Scalable Ad- Hoc Network System. Partenaires: LIX and Hitachi Yokohama Research Lab. Responsable: Thomas Heide Clausen. Montant de la collaboration pour le LIX: euros. Toyota ( ) (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: euros. Hitachi ( ) (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: euros. Hitachi ( ) (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: euros. Qualcomm ( ) (Type: Direct Industrial Sponsorship) Titre: Réseaux sans-fils. Partenaires: LIX and Qualcomm. Responsable: Thomas Heide Clausen. Montant de la collaboration pour le LIX: euros. Hitachi ( ) (Type: Direct Industrial Sponsorship) Titre: Routing Protocols for Large- Scale Networks for AMI. Partenaires: LIX and Hitachi Yokohama Research Lab. Responsable: Thomas Heide Clausen. Montant de la collaboration pour le LIX: euros. Hitachi ( ) (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: euros

278 278 CHAPTER VII.5. ANNEXES : HIGH-PERFORMANCE COMMUNICATIONS Fujitsu ( ) (Type: Direct Industrial Sponsorship) Titre: Réseaux sans-fils. Partenaires: LIX and Fujitsu Laboratories of America. Responsable: Thomas Heide Clausen. Montant de la collaboration pour le LIX: euros. VII Responsabilités de projets nationaux ERDF ( ) (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 réseau de smart metering. Partenaires: LIX and ERDF. Responsable: Thomas Heide Clausen. Montant de la collaboration pour le LIX: euros. VII.5.2 VII Administration de la recherche Activités éditoriales Membres de comités éditoriaux Philippe Jacquet belongs to the editorial board of the DMTCS journal. Participation à des comités de programme 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.

279 VII.5.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION 279 VII Organisation d événements scientifiques Organization of the 4th OLSR Interop/Workshop, Ottawa, Canada, October 14-16, 2008, Thomas Heide Clausen Organization of the 5th OLSR Interop/Workshop, Vienna, Austria, October 2-4, 2009, Thomas Heide Clausen Présidence de comités d organisation MobiHoc (Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing) (2011). Philippe Jacquet, General Chair. Participation à des comités d organisation MobiHoc (Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing) (2011). Thomas Heide Clausen, Finance Chair. MobiHoc (Twelfth ACM International Symposium on Mobile Ad Hoc Networking and 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 Co- Chair. 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 Activités de formation, encadrement et évaluation Thèses de doctorat 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 Systèmes de Transport Intelligents. Encadrant: P.Jacquet & T.Clausen. Ulrich Herberg (May, 2011). Réseaux Ad Hoc: performance, dimensionnement, gestion automatisée et inté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 280 CHAPTER VII.5. ANNEXES : HIGH-PERFORMANCE COMMUNICATIONS VII Enseignements dispensés At Ecole Polytechnique MODAL-NET - Hands-on Computer (T.Clausen), INF557 - Introduction to Networking, (T. Clausen) INF566 - Networks and Protocols (T. Clausen, with Mark Townsley, Cisco), INF567 - Mobile and Wireless Networks (P.Jacquet, with E.Baccelli), Cours 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, Vulgarisation Emmanuel Baccelli has co-authored Les ingrédients des algorithmes /les-ingredients-des-algorithmes Emmanuel Baccelli has co-authored Tout a un reflet numérique /tout-a-un-reflet-numerique VII.5.4 Autres éléments de visibilité 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 Thomas Clausen has been advising the French legislature within the context of the Mission d information sur les droits de l individu dans la révolution numérique 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 FET- Open program of the European Commission since January 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 FET- Open), in Brussels, January 2011 Thomas Clausen has been performing reviews of proposals for the EU FP7 CONFINE project, in 2012 VII Invitations Flajolet 60th Birthday Workshop, Paris (December 2008). Philippe Jacquet, Invited Speaker. Journée commune SEE Àcadé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.

281 VII.5.4. AUTRES ÉLÉMENTS DE VISIBILITÉ 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). Speaker. Thomas Clausen, Keynote WiOpt workshop, Avignon (2010). Philippe Jacquet, Invited Speaker. HIPERCOMHigh-Performance Communications

282 282 CHAPTER VII.5. ANNEXES : HIGH-PERFORMANCE COMMUNICATIONS

283 VIII Équipe Modélisation Algébrique et Calcul Symbolique (MAX) 283

284

285 VIII.1 Liste des membres : Modélisation Algébrique et Calcul Symbolique VIII.1.1 VIII Liste actuelle des membres Membres permanents Nom Fonction Employeur HDR Arrivée Michel Fliess Directeur de recherche émérite CNRS Thèse d État Marc Giusti Directeur de recherche CNRS Thèse d État Joris van der Hoeven Directeur de recherche CNRS HDR Grégoire Lecerf Chargé de recherche CNRS Jean Moulin Ollagnier Professeur Univ. Paris- Thèse d État Est Créteil François Ollivier Chargé de recherche CNRS Denis Raux Ingénieur de recherche CNRS Sylvie Jabinet Assistante CNRS Sylvie Tonda-Goldstein Chargée d Affaire Ecole Polytechnique, 2004 DRIP Notes: Michel Fliess est Directeur de recherche émérite depuis octobre La DRIP est la Direction des Relations Industrielles et Partenariales de l École polytechnique. VIII Autres membres Nom Fonction Financement Dates François Poulain Ingénieur ANR & Digiteo Janvier 2012 VIII.1.2 VIII Anciens membres Doctorants et postdoctorants Doctorants Nom Financement Départ Encadrant Position actuelle Jérémy Berthomieu Gaspard Monge M. Giusti et G. Lecerf MCF LIP6, Univ. Paris 6 Romain Lebreton Gaspard Monge M. Giusti et É. Schost Postdoctorant au LIRMM VIII Autres membres Stagiaires Master 2 Nom Financement Dates Responsable Position actuelle Renan Calmet ANR MaGiX 2010 J. van der Hoeven Professeur Pierre Lairez ENS 2010 V. Cossart et J. van der Hoeven En thèse 285

286 286CHAPTER VIII.1. LISTE DES MEMBRES : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE Visiteurs de longue durée De nombreux visiteurs sont restés dans l équipe pour des séjours de longue duré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 Solernó, etc... Nom Financement Dates Invitant Brahim Sadik DIGITEO F. Ollivier Miguel De Benito Delgado ANR MaGiX 8/2012 J. van der Hoeven Brahim Sadik ANR LEDA 6/2013 F. Ollivier Autres Nom Fonction Financement Dates David Michel Ingénieur ANR MaGiX Novembre 2009 Septembre 2010 Douda Niang Diatta Ingénieur Digiteo MaGiX Septembre 2010 Décembre 2011 Marc Mezzarobba Ingénieur ANR MaGiX Septembre Octobre 2011 Francis Jamet Stagiaire 2009 Juin 2011

287 VIII.2 Rapport scientifique : Modélisation Algébrique et Calcul Symbolique VIII.2.1 Introduction Le développement scientifico-technologique de la société pose des problèmes qui, moyennant simplifications et modélisations, se traduisent fréquemment par des systèmes d équations et d inéquations algébriques ou différentielles, et nécessitent des solutions, c est-à-dire des processus capables de les résoudre. L équipe MAX s attache à concevoir de tels processus robustes et à étudier leurs performances. L originalité de plusieurs travaux de l équipe MAX réside dans une approche géométrique visant à exploiter les spécificités d instances de problèmes au sein de leur classe. Sont visées principalement quatre classes d objets : (i) les polynômes en une ou plusieurs variables (processus de Newton, factorisation, élimination) ; (ii) les opérateurs différentiels linéaires (élimination noncommutative, intégration) ; (iii) les polynômes différentiels (résolution d équations différentielles non linéaires, automatique) ; (iv) le calcul analytique efficace et robuste. Nos algorithmes sont pour la plupart validés par des logiciels portables et distribués librement, développés avec en ligne de mire l efficacité sur des problèmes de grandes tailles. Durant ces cinq dernières années les réussites de l équipe MAX ont d une part classiquement été de nombreux résultats scientifiques publiés dans des revues et actes de conférences de premier plan, et d autre part le dépôt de deux brevets et la création d une entreprise exploitant de nouvelles techniques pour les commandes sans modèles. L équipe a aussi reçu plusieurs financements pour soutenir ses travaux. En particulier les compétences et l expertise du centre de calcul Medicis de l équipe MAX ont contribué à la réussite du projet européen SCIENCE chargé de concevoir et d implanter un système de communication entre de nombreux logiciels de calcul ( Par ailleurs suite l arrivée de van der Hoeven, Lecerf, et Raux dans l équipe MAX, de nouveaux thèmes de recheche sont venus s ajouter : (i) le développement du logiciel GNU TEXmacs, largement distribué et utilisé à travers le monde, pour l édition de documents scientifiques et comme interface à de nombreux logiciels de calcul ou graphisme ; (ii) le développement d une plateforme collaborative pour l édition partagée de documents scientifiques pouvant contenir des calculs scientifiques reproductibles de façon pérenne. VIII.2.2 Thèmes de recherche Résolution exacte et numérique des systèmes polynomiaux Berthomieu, Hivert et Mourtada ont proposé un algorithme pour calculer le nombre minimal de variables d un système polynomial défini sur un corps parfait de caractéristique quelconque [699], avec la cryptanalyse à plusieurs variables comme champ d application. Berthomieu et Pardo ont montré que le calcul d une solution approchée par déformation homotopique d un système polynomial réel pouvait se faire en temps polynomial en la borne de Bézout, à l instar du cas complexe [703]. Bank, Giusti, Heintz et Pardo ont achevé la résolution réelle des systèmes polynomiaux en présence de singularités réelles (trouver un point par composante connexe). La spécificité de l algorithme réside en sa complexité polynomiale en des quantités intrinsèques et linéaire en la longueur d évaluation des équations du système. Colin et Giusti ont donné un algorithme quasi-polynomial pour le calcul de résolvantes de Lagrange. Giusti et Yakoubsohn ont publié une suite à des travaux antérieurs avec Lecerf et Salvy sur l approximation de solutions isolées multiples. 287

288 288CHAPTER VIII.2. RAPPORT SCIENTIFIQUE : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE Lebreton et Schost ont conçu les premiers algorithmes quasi-optimaux pour le calcul de représentations efficaces de l algèbre de décomposition universelle [765]. Une implantation de la résolution numérique certifiée par déformation homotopique est en cours dans Mathemagix [806, 803]. Algorithmes élémentaires pour le calcul formel et numérique Berthomieu, van der Hoeven et Lecerf ont conçu une arithmétique paresseuse rapide, appelée aussi détendue, pour les entiers p-adiques [700]. Berthomieu et Lebreton utilisent cette arithmétique pour calculer efficacement une solution d un système algébrique dans les p-adiques [736]. D autres avancées sur le calcul détenu ont été réalisées dans [802, 804, 808, 809]. van der Hoeven a accéléré la méthode de Newton intervenant dans des opérations élémentaires sur les polynômes et les séries à une variable [716]. van der Hoeven et Lecerf ont conçu plusieurs nouveaux algorithmes pour le produit des polynômes et séries à plusieurs variables pour plusieurs types d anneaux de coefficients usuels [719, 721, 762]. van der Hoeven, Lebreton et Schost ont accéléré l algorithme de transformée de Fourier rapide de polynômes à plusieurs variables dans le cas particulier des polynômes symétriques ou à support réseau [761]. Bostan, Chowdhury, Lebreton, Salvy et Schost ont développé deux approches pour le calcul de solutions séries d équations différentielles linéaires singulières, par adaptation de la méthode de Newton et à base d arithmétique détendue [737]. Berthomieu, Lecerf et Quintin ont étudié la complexité du calcul des racines de polynômes à une variable pour des problèmes de théorie des codes correcteurs d erreur [702]. Berthomieu et Lecerf ont conçu un algorithme pour réduire la factorisation des polynômes à deux variables au cas de la représentation dense, en fonction du volume du polygone de Newton des supports [701]. van der Hoeven a proposé plusieurs méthodes pour trouver des dépendances linéaires à coefficients analytiques entre un nombre fini de fonctions analytiques [715]. Algèbre différentielle L étude et la traduction d œuvres posthumes de Jacobi en latin, entreprise à partir de 2003 par Ollivier a été poursuivie et a donné lieu à deux publications en anglais, incluant des fragments inédits retrouvés dans les archives de l académie des sciences de Berlin [722, 723]. Ces documents fournissent des pistes intéressantes pour améliorer la complexité de la résolution de systèmes différentiels. Un article ancien, demeuré inédit et à la base du package Diffalg de Maple a été publié dans le même volume [704]. Une présentation des résultats de Jacobi et de leur postérité a été faite au congrès DART II en La publication du texte initialement rédigé en 2008 et longtemps différée, doit avoir lieu en juin Ceci a permis de nombreuses mises à jour, en particulier sur l état de l art [770]. En collaboration avec D Alfonso, Jeronimo et Solernó de l Université de Buenos Aires, ainsi que Sedoglavic du Laboratoire d Informatique Fondamentale de Lille, un premier algorithme inspiré de la méthode Kronecker a été mis au point pour les systèmes différentiels ordinaires [705].

289 VIII.2.2. THÈMES DE RECHERCHE 289 Par ailleurs, van der Hoeven a montré que le produit de deux opérateurs différentiels linéaires dans [x, ] coûte asymptotiquement aussi cher que le produit matriciel à des facteurs logarithmiques près [735] (collaboration avec Benoit et Bostan). Les coûts des autres opérations élémentaires sur ces opérateurs ont aussi été améliorés dans [805]. Intégrales premières à la Liouville, dérivations des algèbres de polynômes Nowicki et Moulin Ollagnier ont présenté [726] de nouveaux exemples de dérivations homogènes de l anneau de polynômes k[x] = k[x 1,,x n ] sur un corps k de caractéristique 0 sans polynôme de Darboux. Toujours en collaboration avec Nowicki, Moulin Ollagnier a caractérisé [727] une classe importante de dérivations monomiales sans aucun polynôme de Darboux ; ils donnent en particulier une classification complète de toutes les dérivations monomiales de k[x, y, z] sans polynôme de Darboux. Nowicki et Moulin Ollagnier ont rédigé [728] un premier article dans lequel ils étudient la dérivation de Jouanolou J n,1 sur K[x 0,,x n 1 ] (c.à.d. la dérivation d telle que d(x i ) = x i+1 pour i = 0,...,n 2, et d(x n 1 ) = x 0 ) et la dérivation factorisée associée FJ n,1 qui ont de nombreuses constantes. Automatique et traitement du signal Les méthodes algébriques en automatique et signal ont continué à se développer. Il convient de souligner avant tout les succès impressionnants de la commande sans modèle, développée par Fliess et Cédric Join (MdC à l université de Lorraine) [711, 710], succès dus aux méthodes d estimation rapide découvertes au début des années Cette commande sans modèle permet, comme son nom l indique, de réguler un dispositif sans nécessité d en écrire une modélisation mathématique, à la fois précise et maniable, ce qui, dans la plupart des situations industrielles réelles est une gageure impossible. Le système inconnu est approché pendant un cours laps de temps, par un modèle ultra-local, très simple à un seul paramètre inconnu, estimé en temps réel. Lancée en 2006, cette approche a connu non seulement une progression théorique notable (amélioration et simplification des techniques d estimation, explication du choix quasi-universel d un modèle ultra-local d ordre 1, explication conceptuelle du rôle prédominant aujourd hui dans l industrie des régulateurs dits proportionnels-intégraux-différentielles, ou PID, en dépit de réglages fort complexes et de performances trop souvent médiocres). Les applications nombreuses, facilités, par des correcteurs PID, dits intelligents, dont le réglage est immédiat ont touché les domaines les plus divers, des installations hydro-électriques, au trafic autoroutier, en passant diverses questions concernant les automobiles, la robotique et les paliers magnétiques [729, 724, 730, 794, 793]. Pour des raisons expérimentales évidentes, elles ont toujours été effectuées en collaboration avec des industriels, des universitaires, ou des administrations. Plusieurs ont été réalisées à l étranger. En résumé, la commande sans modèle représente, tant par la vision théorique renouvelée qu elle porte, que par sa puissance applicative, une révolution épistémologique. Quant au signal, on insistera ici sur la détection de ruptures, c est-à-dire de changements brusques et violents, développée par Fliess, Cédric Join et Mamadou Mboup (professeur à l université de Reims) [712, 725]. C est un sujet qui a suscité une littérature abondante, où méthodes statistiques et autres, comme les ondelettes, ont été utilisées. Nos techniques algébriques d estimation ont donné, dans les nombreuses simulations numériques déjà faites, des résultats bien supérieurs. Ingénierie Financière Dans la thé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 séries temporelles, ou chroniques, qu on a orientée vers l ingénierie financière. Fliess et ses collaborateurs ont pu ainsi montrer rigoureusement, pour la première fois, l existence de tendances (on emploie souvent la traduction anglaise trend), utilisées par bien des praticiens, alors que la quasi-totalité des théoriciens de la finance rejettent ladite existence. La fin de

290 290CHAPTER VIII.2. RAPPORT SCIENTIFIQUE : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE cette querelle qui a duré plusieurs dizaines d années s accompagne d algorithmes efficaces non seulement pour déterminer les tendances, mais aussi les volatilités, qui reçoivent une dé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 développent le logiciel GNU TEXmacs (http: // qui est un éditeur de texte scientifique libre et portable avec de multiples interfaces pour des logiciels scientifiques existants. Il fournit un éditeur de texte mathématique tel-écran-tel-écrit (wysiwyg) d une qualité typographique professionelle. D autres fonctionnalités (images, mode de présentations, tableur, convertisseurs LaTeX, Html, édition sémantique, etc) sont aussi présentes [807, 718, 819]. Mathemagix van der Hoeven et Lecerf développent le logiciel libre Mathemagix ( mathemagix.org) permettant à la fois la manipulation exacte d objets de nature algébrique et analytique. Au cours des projets ANR et Digiteo MaGiX, un nouveau langage de programmation mathématique haut niveau a été développé pour ce système, avec un compilateur, un interpréteur et des librairies de calcul [791, 720, 760]. Nous avons également mis en place une infrastructure informatique organisée autour de plusieurs machines essentiellement virtuelles pour faciliter la portabilité de nos logiciels. VIII.2.4 Exemples de résultats significatifs GNU TEXmacs Une nouvelle version multi-plateformes du logiciel GNU TEXmacs, entièrement remodelée sur la librairie graphique Qt a été produite grâce, en particulier, aux financements de l ANR et Digiteo. TEXmacs est distribué depuis longtemps via de nombreuses distributions Linux. Les versions pour Mac OS X et Windows sont téléchargeables depuis le site org hébergé dans notre unité, via les infrastructures de l INRIA Saclay. Factorisation de polynômes Nous avons montré comment réduire efficacement les problèmes de factorisation des polynômes creux à deux variables au cas dense, en fonction du volume du polygone de Newton du support. Opérateurs différentiels Nous avons conçu un algorithme quasi-optimal pour le produit des opérateurs différentiels linéaires. Géométrie algébrique réelle Nous avons conçu un algorithme intrinsèque pour trouver un point par composante connexe réelle d un fermé algébrique. Commande sans modèle Notre nouvelle théorie de la commande sans modèle a connu des succès théoriques et pratiques et a conduit à de nombreuses applications dont deux brevets (aménagement hydroélectrique et trafic autoroutier). Michel Fliess a reçu le prix de l innovation (catégorie brevet) de l École polytechnique pour son brevet sur les aménagements hydroélectriques. VIII.2.5 Animation scientifique, rayonnement, prix et récompenses Les membres de l équipes MAX sont impliqués réguliè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 (Journées Nationales

291 VIII.2.6. FONCTIONNEMENT INTERNE 291 de Calcul Formel, école thématique CNRS). Les divers financements reçus ont aussi permis l organisation de quatre Workshops. Concernant les activités éditoriales, soulignons que Marc Giusti est éditeur en chef exécutif du journal Applicable Algebra in Engineering, Communication and Computing publié par Springer Verlag. Michel Fliess est membre des comités éditoriaux de Forum mathematicum publié par De Gruyter, et de Journal of Applied Mathematics publié par Hindawi Publishing Corporation. L équipe est par ailleurs très fière des récompenses obtenues par ses membres : Michel Fliess a reçu le prix de l innovation (catégorie brevet) de l École polytechnique pour un brevet sur les aménagements hydroélectriques. Romain Lebreton a reçu le prix du meilleur article étudiant à la conférence internationale ISSAC 12. Romain Lebreton a reçu le prix du meilleur poster de la part du Fachgruppe Computer Algebra lors de la conférence internationale ISSAC 12. VIII.2.6 Fonctionnement interne Le total des financements externes obtenus aux travers des projets dans lesquels se sont impliqués les membres de l équipe MAX s élève à environ euros, ayant permis de financer plusieurs workshops, environ 4 années de postes d ingénieur recherche en CDD, ainsi que de nombreuses invitations et missions et les infrastructures informatiques propres à l équipe (plus d une demiebaie de serveurs). Ces sources de financements sont variées puisque venant principalement d un projet européen, d un projet ANR et d un projet Digiteo. Nous animons par ailleurs un séminaire en commun avec l équipe Specfun de l INRIA Saclay. VIII.2.7 Formation par la recherche 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 donné des mini-cours lors de Journées Nationales de Calcul Formel (école thématiques CNRS). Lecerf est aussi intervenu dans une école d été organisée par le CIMPA. Les deux thèses soutenues dans l équipe ont été financées en totalité par des bourses Gaspard Monge de l École polytechnique. VIII.2.8 Création d entreprise La société AL.I.E.N. (acronyme de ALgèbre pour Identification et Estimation Numériques) a été fondée à la toute fin de l année 2011 par Cédric Join et Michel Fliess, après avoir obtenu, en 2011, le prix OSEO dans la catégorie émergence. C est une spin-off de l École polytechnique et de l université de Lorraine. À Polytechnique, l aide de la DRIP a été particulièrement précieuse. À Nancy, l incubateur lorrain s est beaucoup dépensé pour assurer son démarrage. Elle a pour but de commercialiser les techniques d automatique et de signal, dont il est question ici. La commande sans modèle est, aujourd hui, son produit phare.

292 292CHAPTER VIII.2. RAPPORT SCIENTIFIQUE : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE

293 VIII.3 Projet de recherche : Modélisation Algébrique et Calcul Symbolique VIII.3.1 Objectifs scientifiques Traditionnellement, l équipe MAX couvre un grand nombre de sous domaines du calcul formel, comme la résolution des systèmes polynomiaux, la complexité algébrique, l algèbre différentielle, la théorie de Galois, les applications à l automatique, etc. En outre, l équipe a toujours été présente dans l organisation de la communauté 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 thèmes de recherche ont évolué, mais l esprit de transversalité et de centre de services demeure. Les évolutions les plus notables concernent l apparition du nouveau thème de calcul analytique, et un investissement plus lourd dans le développement d une arithmétique de base efficace pour le calcul formel. Par ailleurs, les services de calcul s appuient davantage sur les logiciels GNU TEXmacs et Mathemagix, développés principalement au sein de notre équipe. Depuis septembre 2013, Bruno Grenet est postdoctorant au sein de l équipe MAX, financé par une bourse LIX/Qualcomm. Son travail de recherche concerne des questions d informatique théorique liées aux classes de complexité et aux bornes inférieures d algorithmes sur les matrices et polynômes à plusieurs variables. VIII Algorithmes fondamentaux pour le calcul formel Lecerf compte travailler sur les questions de complexité liées aux calculs usuels dans les anneaux locaux (principalement l élimination, normalisation et factorisation), ainsi que sur de nouveaux algorithmes pour la décomposition primaire des idéaux dans les anneaux de polynômes par des méthodes en évaluation. La résolution des systèmes algébriques complexes et réels restera néanmoins une préoccupation de tout premier plan pour Lecerf et Giusti, tant sur les aspects liés à la complexité asymptotique que sur les performances pratiques de leurs logiciels. Van der Hoeven et Lecerf espèrent aussi pouvoir mettre en place davantage d interactions entre les méthodes symboliques et celles numériques, propres au calcul analytique effectif. La conception d algorithmes efficaces pour le calcul formel s appuie en grande partie sur le développement d une arithmétique rapide sur des objets mathématiques de base, comme les grands entiers, les polynômes, les matrices, les séries formelles, les opérateurs différentiels, etc. Van der Hoeven et Lecerf continueront leurs travaux sur ces sujets. VIII Algorithmes fondamentaux pour le calcul analytique De la même manière que le calcul formel vise la manipulation exacte d objets mathématiques de nature algébrique, le calcul analytique vise la conception d algorithmes fiables pour calculer avec des objets plus analytiques, comme l intégration de systèmes dynamiques ou la résolution d un système d équations analytiques. Ici, la fiabilité est une contrainte essentielle, ce qui distingue le calcul analytique du calcul numérique plus classique. D une part, cela nécessite de repenser des algorithmes numériques classiques afin de rester efficace en précision multiple. D autre part, cela nécessite l utilisation des méthodes de certification venant de l arithmétique d intervalles. Enfin, une réflexion de nature plus logique sur ce qui est calculable est parfois nécessaire. Nous comptons poursuivre nos travaux sur ce sujet, qui faisaient également l objet des projets ANR et Digiteo MaGiX. VIII Résolution de systèmes polynomiaux invariants sous un groupe Les travaux actuels de Colin et Giusti concernent l algèbre des invariants polynomiaux sous un sous-groupe fini, avec pour but ultime la résolution de systèmes invariants sous un groupe fini. 293

294 294CHAPTER VIII.3. PROJET DE RECHERCHE : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE VIII Résolution réelle des systèmes polynomiaux Un très grand projet consiste à déterminer la topologie des variétés algébriques réelles, au delà de simples éléments de réponse tel le premier nombre de Betti. Bien évidemment, comme dans les travaux de Bank, Giusti, Heintz et Pardo, nous demandons une algorithmique efficace, ne dépendant que de quantités intrinsèques. VIII Résolution des systèmes différentiels Les travaux entrepris dans le cadre du projet LEDA ouvrent la voie à d autres problématiques : après avoir cherché à borner la complexité de la mise en forme normale, en particulier grâce à la borne de Jacobi, on peut tenter de chercher un changement de variable permettant d abaisser l ordre du système ou la complexité d évaluation des expressions. La première problématique inclut la question de la platitude différentielle, dont l intérêt en automatique est important. Ces questions sont abordées dans le cadre du projet SIMCA, à travers le problème de Lüroth et ses avatars différentiels, comme endogène = exogène dont une version effective dans les coordonnées d origine du système fournirait une borne sur les sorties linéarisantes, montrant la décidabilité de la platitude. VIII Développement de méthodes diverses en automatique et traitement du signal La commande sans modèle et les correcteurs intelligents associés doivent pour confirmer qu ils constituent une révolution conceptuelle, aux conséquences pratiques considérables, encore relever quelques défis, dont le plus important est, pour Fliess, la présence de retards. Plus qu à une solution mathématique générale, difficile à imaginer sans modèle mathématique précis, Fliess pense que l é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 démontrent la robustesse de ses techniques pour des bruits forts. D autre part F. Ollivier envisage le développement d une librairie Mathemagix dédiée à l automatique algébrique et fournissant une boîte à outils pour tester les propriétés structurelles des systèmes (observabilité, commandabilité, etc.) ainsi que des tests de platitude et des outils pour construire les sorties linéarisantes dans les cas couverts par la littérature. VIII Refondation de la théorie des séries temporelles Les séries temporelles ont été précédemment évoquées dans la partie pour l ingénierie financière. Fliess prévoit de fournir un effort considérable pour aborder de façon plus générale les bases de données, très souvent représentées par de telles séries. Des résultats préliminaires prometteurs, non encore publiés, devraient faire avancer ce domaine de l informatique, en extension rapide. VIII Logiciels de calcul formel et analytique van der Hoeven et Lecerf continueront de développer le logiciel Mathemagix pour le calcul numérique et formel. D une part en consolidant les librairies actuelles écrites en C++, et d autre part en améliorant le compilateur et l interprète pour le language de programmation Mathemagix. Il devrait être ensuite possible de porter les librairies C++ en Mathemagix, de sorte à gagner en clarté de programmation, généralité, et efficacité. Un soin particulier sera aussi porté à la conception d un environnement de calcul symbolique rigoureux (le logiciel Caas actuellement dans la distribution de Mathemagix) destiné à des besoins en enseignement couvrant essentiellement le programme de CAPES de mathématiques.

295 VIII.3.2. MISE EN ŒUVRE 295 VIII Plateforme d édition et de calcul scientifiques Dans les années 1990, plusieurs membres de l équipe MAX actuelle ont contribué à la création d un centre de ressources matérielles et humaines pour le calcul formel hébergé à l École polytechnique, et appelé Medicis ( Ce centre était ouvert librement au monde académique, c est-à-dire aux scientifiques ayant besoin d effectuer des calculs intensifs, principalement formels. D une façon plus large, ce centre a aussi joué un rôle très important dans l animation scientifique pour la communauté française puis européenne de calcul formel, notamment durant ces dernières années, au travers du projet europé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 thématique de recherche et de développement de logiciels pour l édition et le calcul scientifique s est développée avec les aides conjointes de l ANR et Digiteo (DIM), via un projet appelé MaGiX (Mathématiques, Analyse, Géométrie, Interface, exactes). Dans les années avenir nous prévoyons d orienter le dé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 façon pérenne. Une partie de ces développements se feront par l intégration de nouvelles fonctionnalités dans le logiciel d édition scientifique libre GNU TeXmacs, afin de faire évoluer ce logiciel vers une suite bureautique scientifique complet. Ceci inclut une approche plus centrée sur le web, avec des possibilités d édition collaboratives interactives. D autre part, nous visons à mettre en place un cluster de machines virtuelles pour faire des calculs scientifiques à distance, et pour rédiger des articles et des livres, avec des contenus interactifs pérennes. Le logiciel TeXmacs contient de nombreuses interfaces pour d autres logiciels, ce qui conduit à de nombreux défis et opportunités de collaborations. Un exemple récent est le projet DoCoq qui vise à créer un nouveau type d interface graphique pour le logiciel Coq. Ce projet vient de recevoir un financement de EUROS pour une durée d un an via le contrat Digiteo D, commençé en septembre 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 François Poulain. VIII.3.2 Mise en œuvre Traditionnellement, l équipe MAX est très impliquée dans l animation de la communauté du calcul formel en France et au delà, via le centre de calcul Medicis, l organisation de conférences (comme ICMS 2010, ISSAC 2012, et MEGA 2013) et de workshops, des responsabilités éditoriales, ainsi que divers collaborations nationales et internationales (comme les collaborations récentes au sein des projets ANR Gecko, MaGiX et LEDA, et le projet européen Science). Dans les années à venir nous comptons maintenir ces activités. Plusieurs nouvelles demandes ANR sont notamment en cours, qui nous permettront d organiser de nouveaux événements scientifiques. Concernant le centre de calcul Medicis, plusieurs concepts seront à la base de sa réorganisation : utilisation de logiciels libres, interface simple et conviviale pour l utilisateur non informaticien, rapidité d affichage des résultats, reproductibilité des calculs dans le temps, configuration à la demande. Le cluster Medicis, déjà en cours de renouvellement, sera constitué de machines tournant sous Scientific Linux et proposant exclusivement des logiciels de calcul libres. Notre logiciel GNU TEXmacs permettra, à distance, et de façon ergonomique, de lancer différentes sortes de calculs et d incorporer les résultats de façon transparente dans un document. L utilisateur se verra proposer l utilisation de différents types de machines virtuelles, selon ses besoins. Il est aussi prévu que l utilisateur puisse ajouter des logiciels à une machine donnée et même récupérer ces machines, après passage dans une chaîne de configuration sortante, pour les exécuter sur son propre matériel. Le fonctionnement sera assuré par deux machines frontales (une principale et une de secours), et d un ensemble de nœuds de calculs.

296 296CHAPTER VIII.3. PROJET DE RECHERCHE : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE

297 VIII.4 Analyse AFOM : Modélisation Algébrique et Calcul Symbolique INTERNE POSITIF Renomm ee internationale de l equipe en calcul formel Renomm ee internationale des techniques en automatique et signal Visibilit e internationale du logiciel GNU TEXmacs Compl ementarit e des th`emes de recherche en calcul formel Pr esence d un ing enieur de recherche permanent Atouts Attractivit e de l equipe (d etachements, postdocs, etc) Possibilit e de s appuyer sur un logiciel grand public comme TEXmacs pour valoriser nos travaux Proximit e d autres equipes de haut niveau Collaborations scientifiques avec diverses universit es sur des points techniques pratiques pr ecis (trafic autoroutier, palier magn etique, serre). Opportunit es A F O M R`egles de s ecurit e informatique de l Ecole polytechnique bloquantes pour la mise œuvres de nos services en ligne (site Internet, calculs, etc) Pas d enseignant `a l Ecole polytechnique malgr e plusieurs candidatures de tr`es bon niveau Faiblesses Menaces Financements r ecurrents trop faibles pour maintenir une activit e scientifique r eguli`ere La diversit e et la quantit e de tˆaches administratives augmentent Flux d etudiants incertain NEGATIF EXTERNE Figure VIII.4.1: Analyse AFOM de l équipe Modélisation Algébrique et Calcul Symbolique : Atouts, Faiblesses, Opportunités, Menaces 297

298 298CHAPTER VIII.4. ANALYSE AFOM : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE

299 VIII.5 Fiche résumé : Modélisation Algébrique et Calcul Symbolique VIII.5.1 Membres Composition actuelle de l équipe 5 chercheurs CNRS, 1 enseignant-chercheur, 1 ingénieur de recherche CNRS, 1 ingénieur de recherche en CDD. Départ de membres de l équipe Jérémy Berthomieu (ATER à l université de Versailles, puis MCF à Paris 6), Romain Lebreton (Postdoctorant au LIRMM à Montpelier). Nouveaux membres (IR CNRS). Joris van der Hoeven (DR CNRS), Grégoire Lecerf (CR CNRS), Denis Raux VIII.5.2 Résultats scientifiques Résultat 1 Nouvelle version multi-plateformes du logiciel GNU TEXmacs, entièrement remodelée sur la librairie graphique Qt. Résultat 2 Réduction des problèmes de factorisation des polynômes à deux variables au cas dense, en fonction du volume du polygone de Newton du support. Résultat 3 Algorithme quasi-optimal pour le produit des opérateurs différentiels linéaires. Résultat 4 Algorithme intrinsèque pour trouver un point par composante connexe réelle d un fermé algébrique. Résultat 5 Succès théoriques et pratiques de la commande sans modèle, et nombreuses applications dont deux brevets (aménagement hydroélectrique et trafic autoroutier) VIII.5.3 Production scientifique VIII Publications Journaux : 40 Conférences internationales : 48 Conférences invitées : 10 Brevets : 2 Créations d entreprises : 1 Logiciels : 2 5 productions scientifiques marquantes : J. van der Hoeven et al., logiciel GNU TEXmacs, J. Berthomieu et G. Lecerf. Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations. Math. Comp., 81(279), A. Benoit, A. Bostan et J. van der Hoeven. Quasi-optimal multiplication of linear differential operators. In Proc. FOCS 12, pages , New Brunswick, October IEEE. Bernd Bank, Marc Giusti, et Joos Heintz. Point searching in real singular complete intersection varieties-algorithms of intrinsic complexity. Accepté pour publication dans Math. Comp. 299

300 300CHAPTER VIII.5. FICHE RÉSUMÉ : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE M. Fliess, H. Abouaissa et C. Join. Procédé de régulation d un trafic sur un axe principal de circulation, système et produit programme d ordinateur correspondants. Brevet PCT/EP2012/053354,2012. École polytechnique, Université de Lorraine, Université d Artois, Centre National de la Recherche Scientifique. VIII Rayonnement Durant ces cinq dernières années, l équipe MAX s est illustrée par l obtention de plusieurs financements de projets, dont un européen, ayant permis l organisation de diverses rencontres et workshops. Plusieurs membres de l équipe sont aussi intervenus dans l organisation des principales conférences internationales dans leurs domaines (DART, ISSAC, ICMS, MEGA, Calculemus). Le rayonnement de l équipe MAX sur le plan international a aussi été marqué par 33 invitations à donner des exposés dans des conférences de premier plan, et aussi par les deux prix attribués à Lebreton lors de la conférence ISSAC Les logiciels GNU TEXmacs et Mathemagix ont leurs sites Internet et listes de discussions hébergés dans notre unité. Soulignons que TEXmacs est présent par défaut dans la grande majorité des distributions Linux. Des paquets binaires pour Windows et Mac OS X sont disponibles depuis nos sites Internet, ainsi que des vidéos pour prendre en main rapidement le logiciel. VIII Actions de formation Lecerf a participé à l organisation des Journées Nationales de Calcul Formel en 2010 et 2011, qui réunissent tous les 18 mois une très grande majorité des chercheurs et doctorants en calcul formel en France ( Ces journées sont une école thématique CNRS, qui comporte des mini-cours et des exposés donnés essentiellement par des jeunes chercheurs. Van der Hoeven y a donné un cours en 2011 et Lecerf en Par ailleurs, Lecerf a donné un cours de 12h à une école d été organisée par le CIMPA en Indonésie en L é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).

301 VIII.6 Production scientifique : Modélisation Algébrique et Calcul Symbolique VIII.6.1 Livres et chapitres de livres [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, Held in Barcelona, June 15 19, [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 Springer, [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, Proceedings, volume 6327 of Lecture Notes in Computer Science. Springer, [688] Marc Giusti and Pierre Rouchon, editors. Special issue dedicated to Professor Michel Fliess, volume 81 of Internat. J. Control, Taylor & Francis, [689] J. van der Hoeven and M. van Hoeij, editors. International Symposium on Symbolic and Algebraic Computation 2012 (ISSAC 2012), Grenoble, France, ACM Press. [690] E. Kaltofen and G. Lecerf. Handbook of Finite Fields, chapter Factorization of multivariate polynomials. CRC Press, VIII.6.2 Documents pédagogiques [691] A. Bostan, F. Chyzak, M. Giusti, R. Lebreton, G. Lecerf, B. Salvy, and É. Schost. Algorithmes efficaces en calcul formel, notes du cours 2-22 du MPRI, version de VIII.6.3 Revues internationales [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): , [693] Bernd Bank, Marc Giusti, and Joos Heintz. Point searching in real singular complete intersection varieties-algorithms of intrinsic complexity. Math. Comp. (à paraître), [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, [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): , [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, [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,

302 302 BIBLIOGRAPHY [698] Lotfi Belkoura, Jean-Pierre Richard, and Michel Fliess. Parameters estimation of systems with delayed and structured entries. Automatica, 45(5): , [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 Amer. Math. Soc., Providence, RI, [700] J. Berthomieu, J. van der Hoeven, and G. Lecerf. Relaxed algorithms for p-adic numbers. Journal de Théorie des Nombres de Bordeaux, 23(3): , [701] J. Berthomieu and G. Lecerf. Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations. Math. Comp., 81(279), [702] J. Berthomieu, G. Lecerf, and G. Quintin. Polynomial root finding over local rings and application to error correcting codes. À paraître dans Applicable Algebra in Engineering, Communication and Computing, [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): , [704] François Boulier, Daniel Lazard, Franç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, [705] Lisi D Alfonso, Gabriela Jeronimo, François Ollivier, Alexandre Sedoglavic, and Pablo Solernó. A geometric index reduction method for implicit systems of differential algebraic equations. J. Symb. Comput., 46(10): , [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): , Held in Barcelona, June 15 19, [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, [708] Michel Fliess. Critique du rapport signal à bruit en communications numériques Questioning the signal to noise ratio in digital communications. ARIMA (Revue africaine d informatique et de Mathématiques appliquées), 9: , [709] Michel Fliess, Stefan Fuchshumer, Markus Schöberl, Kurt Schlacher, and Hebertt Sira- Ramirez. An introduction to algebraic discrete-time linear parametric identification with a concrete application. Journal Européen des Systèmes Automatisés, 42(2-3): , [710] Michel Fliess and Cédric Join. Commande sans modèle et commande à modèle restreint. Revue électronique Sciences et Technologies de l Automatique (e-sta), 5(4):1 23, [711] Michel Fliess and Cédric Join. Model-free control. International Journal of Control, page to appear, [712] Michel Fliess, Cédric Join, and Mamadou Mboup. Algebraic change-point detection. Applicable Algebra in Engineering, Communication and Computing, 21(2): , [713] Michel Fliess, Cédric Join, and Hebertt Sira-Ramirez. Non-linear estimation is easy. Int. J. Modelling Identification and Control, 4(1):12 27, [714] Marc Giusti and Pierre Rouchon. Foreword [Special issue dedicated to Professor Michel Fliess]. Internat. J. Control, 81(3):333, 2008.

303 BIBLIOGRAPHY 303 [715] J. van der Hoeven. Guessing singular dependencies. Technical Report , Université Paris-Sud, Orsay, France, Version améliorée à paraître dans J. Symbolic Comput. [716] J. van der Hoeven. Newton s method and FFT trading. J. Symbolic Comput., 45(8): , [717] J. van der Hoeven. Meta-expansion of transseries. J. Symbolic Comput., 46(4): , [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, [719] J. van der Hoeven and G. Lecerf. On the bit-complexity of sparse polynomial multiplication. J. Symbolic Comput., 50: , [720] J. van der Hoeven, G. Lecerf, B. Mourrain, Ph. Tré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): , [721] J. van der Hoeven and É. Schost. Multi-point evaluation in higher dimensions. Appl. Algebra Engrg. Comm. Comput., 24(1):37 52, [722] Carl Gustav Jacob Jacobi and Franç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, [723] Carl Gustav Jacob Jacobi and Franç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, [724] Cédric Join, John Masse, and Michel Fliess. Etude préliminaire d une commande sans modèle pour papillon de moteur A model-free control for an engine throttle: a preliminary study. Journal Européen des Systèmes Automatisés, 42(2-3): , [725] Mamadou Mboup, Cédric Join, and Michel Fliess. Numerical differentiation with annihilators in noisy environment. Numerical Algorithms, 50(4): , [726] J. Moulin Ollagnier and A. Nowicki. Derivations of polynomial algebras without Darboux polynomials. Journal of Pure and Applied Algebra, 212: , [727] J. Moulin Ollagnier and A. Nowicki. Monomial derivations. Communications in Algebra, 39: , [728] J. Moulin Ollagnier and A. Nowicki. Constants of cyclotomic derivations. Journal of Algebra, 394:92 119, [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): , [730] Jorge Villagra, Brigitte D Andréa-Novel, Michel Fliess, and Hugues Mounier. Synthèse algébrique d estimateurs de vitesses longitudinale et latérale d une automobile. Revue électronique Sciences et Technologies de l Automatique (e-sta), 5(3):12 27, [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): , 2011.

304 304 BIBLIOGRAPHY VIII.6.4 Conférences internationales [732] Hassane Abouaissa, Michel Fliess, Violina Iordanova, and Cédric Join. First steps towards a model-free control of a freeway traffic flow Prolégomènes à une régulation sans modèle du trafic autoroutier. In Conférence Méditerranéenne sur l Ingénierie Sûre des Systèmes Complexes, MISC 2011, Agadir, Maroc, May CDROM. [733] Hassane Abouaissa, Michel Fliess, and Cédric Join. Fast parametric estimation for macroscopic traffic flow model. In Myung Jin Chung and Pradeep Misra, editors, 17th IFAC World Congress, Seoul, République De Corée, 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, Séoul, République De Corée, 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 , New Brunswick, October 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, ACM. [737] A. Bostan, M. Chowdhurry, R. Lebreton, B. Salvy, and É Schost. Power series solutions of singular (q)-differential equations. In J. van der Hoeven and van Hoeij M., editors, Proceedings of ISSAC 12, pages ACM Press, [738] Sungwoo Choi, Brigitte D André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, European Union Control Association. [739] Brigitte D Andrea Novel, Clément Boussard, Michel Fliess, Oussama El Hamzaoui, Hugues Mounier, and Bruno Steux. Commande sans modèle de la vitesse longitudinale d un véhicule électrique. In Sixième Conférence Internationale Francophone d Automatique (CIFA 2010), Nancy, France, [740] Brigitte D Andrea Novel, Michel Fliess, Cé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 [741] Jérôme De Miras, Samer Riachy, Michel Fliess, Cédric Join, and Stéphane Bonnet. Vers une commande sans modèle d un palier magnétique First steps towards a modelfree control of a magnetic bearing. In Septième Conférence Internationale Francophone d Automatique, Grenoble, France, CDROM, SURFDIAG, CID. [742] Michel Fliess and Cédric Join. Intelligent PID controllers. In 16th Mediterrean Conference on Control and Automation, Ajaccio, France, [743] Michel Fliess and Cé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, [744] Michel Fliess and Cédric Join. Systematic risk analysis: first steps towards a new definition of beta. In Cognitive Systems with Interactive Sensors (COGIS 09), PARIS, France, 2009.

305 BIBLIOGRAPHY 305 [745] Michel Fliess and Cédric Join. Towards New Technical Indicators for Trading Systems and Risk Management. In 15th IFAC Symposium on System Identification (SYSID 2009), Saint-Malo, France, [746] Michel Fliess and Cédric Join. Delta Hedging in Financial Engineering: Towards a Model- Free Approach. In 18th Mediterranean Conference on Control and Automation, MED 10, Marrakech, Maroc, June IEEE. [747] Michel Fliess and Cédric Join. Preliminary remarks on option pricing and dynamic hedging. In 1st International Conference on Systems and Computer Science, Villeneuve d Ascq, France, August CDROM, SURFDIAG, CID. [748] Michel Fliess, Cédric Join, and Frédéric Hatt. Volatility made observable at last. In 3èmes Journées Identification et Modélisation Expérimentale, JIME 2011, Douai, France, April CDROM. [749] Michel Fliess, Cédric Join, and Wilfrid Perruquetti. Real-time estimation for switched linear systems. In 47th IEEE Conference on Decision and Control, Cancun, Mexique, [750] Michel Fliess, Cé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 [751] Michel Fliess, Cé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 CDROM. [752] Francisco De Asís García Collado, Brigitte D Andréa-Novel, Michel Fliess, and Hugues Mounier. Analyse fréquentielle des dérivateurs algébriques. In XXIIe Colloque GRETSI, Dijon, France, [753] M. Giusti. Efficient computation of square-free Lagrange resolvants. In DART 2008, in memory of Giuseppa Carrà-Ferro, Mars [754] M. Giusti. Efficient computation of square-free Lagrange resolvants. In AAECC in honour of Jacques Calmet, Février [755] M. Giusti. Variedades polares y bipolares. In EACA 2008 (XI Encuentro de Algebra Computacional y Aplicaciones), Granada, Espagne, Septiembre [756] M. Giusti. Efficient computation of square-free Lagrange resolvents. In Joint Conference of ASCM2009 and MACIS2009, December 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 org/. [758] M. Giusti. Geometry associated to a finite subgroup and evaluation techniques. In MEGA 2013, Frankfurt am Main, Germany, May 3-7, de/mega2013/. [759] J. van der Hoeven. Relaxed resolution of implicit equations. Conférence MEGA 2011, Stockholm, Sweden, juin [760] J. van der Hoeven. Overview of the Mathemagix type system. In Electronic proc. ASCM 12, Beijing, China, October Available from hal

306 306 BIBLIOGRAPHY [761] J. van der Hoeven, R. Lebreton, and É. Schost. Structured FFT and TFT: symmetric and lattice polynomials. In M. Monagan, G. Cooperman, and M. Giesbrecht, editors, Proc. ISSAC 13, pages ACM Press, [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 , Grenoble, France, July [763] Cédric Join, Gé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, [764] Cédric Join, Gérard Robert, and Michel Fliess. Vers une commande sans modèle pour aménagements hydroélectriques en cascade. In Sixième Conférence Internationale Francophone d Automatique, CIFA 2010, Nancy, France, [765] R. Lebreton and É. Schost. Algorithms for the universal decomposition algebra. In J. van der Hoeven and van Hoeij M., editors, Proceedings of ISSAC 12, pages ACM Press, [766] Lghani Menhour, Brigitte D Andréa-Novel, Clément Boussard, Michel Fliess, and Hugues Mounier. Algebraic nonlinear estimation and flatness-based lateral/longitudinal control for automotive vehicles. In ITSC-2011, Washington, États-Unis, October CDROM, 6 pages. [767] Lghani Menhour, Brigitte D Andréa-Novel, Michel Fliess, and Hugues Mounier. Commande couplée longitudinale/latérale de véhicules par platitude et estimation algébrique. In Septième Conférence Internationale Francophone d Automatique, Grenoble, France, CDROM. [768] Loïc Michel, Cédric Join, Michel Fliess, Pierre Sicard, and Ahmed Chériti. Model-free control of dc/dc converters. In 12th IEEE Workshop on Control and Modeling for Power Electronics (COMPEL), Boulder, Colorado, États-Unis, June 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. Conférence MEGA 2009, Barcelone, Catalogne, Mai [770] Franç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 World Scientific. ISBN: [771] Samer Riachy, Michel Fliess, and Cé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 CDROM. [772] Samer Riachy, Michel Fliess, Cédric Join, and Jean-Pierre Barbot. Vers une simplification de la commande non linéaire : l exemple d un avion à décollage vertical. In Sixième Conférence Internationale Francophone d Automatique, CIFA 2010, Nancy, France, June 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 [774] Rosane Ushirobira, Wilfrid Perruquetti, Mamadou Mboup, and Michel Fliess. Estimation algébrique des paramètres intrinsèques d un signal sinusoïdal biaisé en environnement bruité. In Gretsi, Bordeaux, France, September 2011.

307 VIII.6.5. CONFÉ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, [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 ACM, [777] Jorge Villagra, Brigitte D Andréa-Novel, Michel Fliess, and Hugues Mounier. Estimation of longitudinal and lateral vehicle velocities: an algebraic approach. In 2008 American Control Conference, Seattle, États-Unis, [778] Jorge Villagra, Brigitte D André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, [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, VIII.6.5 Conférences nationales [780] Hassane Abouaissa, Michel Fliess, Violina Iordanova, and Cédric Join. Towards a Nonlinear Characterization of a Freeway Network Vers une caractérisation non linéaire d un réseau autoroutier. In 3èmes Journées Identification et Modélisation Expérimentale, JIME 2011, Douai, France, April CDROM. [781] J. van der Hoeven. Calcul analytique. In G. Chèze, T. Cluzeau, G. Lecerf, and C. Pernet, editors, Journées Nationales de Calcul Formel 2011, volume 2 of Les cours du CIRM. Cedram, [782] G. Lecerf. Factorization des polynômes à plusieurs variables (Cours no. II). In G. Chèze, P. Boito, C. Pernet, and M. Safey el Din, editors, Journées nationales de calcul formel, volume 3 of Les cours du CIRM, pages Cedram, VIII.6.6 Conférences invitées [783] Hassane Abouaissa, Michel Fliess, Violina Iordanova, and Cédric Join. Freeway ramp metering control made easy and efficient. In 13th IFAC Symposium on Control in Transportation Systems (CTS 2012), Sofia, Bulgarie, SURFDIAG, CID. [784] Bernd Bank, Marc Giusti, and Joos Heintz. Polar, bipolar and copolar varieties: Real solving of algebraic varieties with intrinsic complexity. In José Luis Monta na and Luis M. Pardo, editors, Recent Advances in Real Complexity and Computation, volume 604 of Contemp. Math., Issu du cours donné par M. Giusti à l Escuela Santaló, Universidad de Cantabria, Universidad Internacional Menéndez Pelayo, Real Sociedad Matemática Espa nola; Recent Advances in Real Complexity and Computation Juillet 2012, Palacio de la Magdalena, UIMP, Santander, Cantabria, Espagne, unican.es. [785] Michel Fliess and Cé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, Presses Universitaires de Perpignan.

308 308 BIBLIOGRAPHY [786] Michel Fliess and Cé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, This communication is a slightly modified and updated version of a paper by the same authors (Commande sans modèle et commande à modèle restreint, e-sta, vol. 5 (4), pp. 1-23, Available at which is written in French. [787] Michel Fliess, Cédric Join, and Frédéric Hatt. Is a probabilistic modeling really useful in financial engineering? A-t-on vraiment besoin d un modèle probabiliste en ingénierie financière? In Conférence Méditerranéenne sur l Ingénierie Sûre des Systèmes Complexes, MISC 2011, Agadir, Maroc, May [788] Michel Fliess, Cédric Join, and Samer Riachy. Nothing is as Practical as a Good Theory: Model-Free Control Rien de plus utile qu une bonne théorie : la commande sans modèle. In 4èmes Journées Doctorales / Journées Nationales MACS, JD-JN-MACS, Marseille, France, June [789] M. Giusti. Plenary invited talk: A Grö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, Corée, pages 1 2. ACM, [790] Marc Giusti and Jean-Claude Yakoubsohn. Tracking multiplicities. In José Luis Monta na and Luis M. Pardo, editors, Recent Advances in Real Complexity and Computation, volume 604 of Contemp. Math., Issu du cours donné par J. C. Yakoubsohn à l Escuela Santaló, Universidad de Cantabria, Universidad Internacional Menéndez Pelayo, Real Sociedad Matemática Espa nola; Recent Advances in Real Complexity and Computation Juillet 2012, Palacio de la Magdalena, UIMP, Santander, Cantabria, Espagne, [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 Science, pages Springer, [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, VIII.6.7 Brevets [793] M. Fliess, H. Abouaissa, and C. Join. Procédé de régulation d un trafic sur un axe principal de circulation, système et produit programme d ordinateur correspondants. Brevet PCT/EP2012/053354, École polytechnique, Université de Lorraine, Université d Artois, Centre National de la Recheche Scientifique. [794] M. Fliess, C. Join, A. Libaux, and G. Robert. Procédé de régulation d un niveau dans un aménagement hydraulique, système et produit programme d ordinateur correspondants. Brevet EP , EP B1, École polytechnique, Électricité de France. VIII.6.8 Thèses [795] J. Berthomieu. Contributions à la résolution des systèmes algébriques : réduction, localisation, traitement des singularités ; implantations. PhD thesis, École polytechnique, 2011.

309 BIBLIOGRAPHY 309 [796] R. Lebreton. Contributions à l algorithmique détendue et à la résolution de systèmes polynomiaux. PhD thesis, École polytechnique, VIII.6.9 Logiciels [797] J. van der Hoeven et al. Logiciel GNU TEXmacs Licence GNU GPLv3. [798] J. van der Hoeven, G. Lecerf, B. Mourrain, et al. Logiciel Mathemagix. mathemagix.org, Principalement licence GNU GPLv2. VIII.6.10 Rapports techniques [799] Bernd Bank, Marc Giusti, Joos Heintz, Grégoire Lecerf, Guillermo Matera, and Pablo Solernó. Degeneracy loci and polynomial equation solving. Technical report, Humboldt Universität zu Berlin, Prépublication Humboldt Universität zu Berlin, [800] Bernd Bank, Marc Giusti, Joos Heintz, and Mohab Safey El Din. Intrinsic complexity estimates in polynomial optimization. Technical report, Humboldt Universität zu Berlin, Prépublication Humboldt Universität zu Berlin, and arxiv: v1. [801] Michel Fliess and Cédric Join. A model-free approach to delta hedging. Technical report, Laboratoire d informatique de l école polytechnique - LIX, ALIEN - INRIA Saclay - Ile de France/Inria Lille - Nord Europe, Centre de recherche en automatique de Nancy - CRAN, February [802] J. van der Hoeven. Relaxed resolution of implicit equations. Technical report, HAL, [803] J. van der Hoeven. Efficient root counting for analytic functions on a disk. Technical report, HAL, [804] J. van der Hoeven. From implicit to recursive equations. Technical report, HAL, [805] J. van der Hoeven. On the complexity of skew arithmetic. Technical report, HAL, [806] J. van der Hoeven. Reliable homotopy continuation. Technical report, HAL, http: //hal.archives-ouvertes.fr/hal [807] J. van der Hoeven. Towards semantic mathematical editing. Technical report, HAL, [808] J. van der Hoeven. Faster relaxed multiplication. Technical report, HAL, http: //hal.archives-ouvertes.fr/hal [809] J. van der Hoeven. On the complexity of polynomial reduction. Technical report, HAL, [810] J. van der Hoeven and G. Lecerf. Mathemagix User Guide. HAL, archives-ouvertes.fr/hal

310 310 BIBLIOGRAPHY VIII.6.11 Autres [811] Antoine Colin and Marc Giusti. Efficient computation of square-free Lagrange resolvants. CoGi pdf. [812] Michel Fliess, Hassane Abouaissa, Violina Iordanova, and Cédric Join. La commande sans modèle du trafic autoroutier. FLASH X La revue scientifique de l Ecole polytechnique, 14:25 28, Le texte en anglais, présenté en conférence plénière (librement accessible sur fournit des explications plus complètes et une bibliographie indispensable. SURFDIAG, CID. [813] J. van der Hoeven and G. Lecerf. MaGiX. Poster présenté au Forum Digiteo 2011, Octobre [814] J. van der Hoeven and F. Poulain. Vidéos de présentation de GNU TEXmacs, Ces vidéos ont été produites à l issue d exposés donnés au Workshop TEXmacs à Albufeira au Portugal. Elles sont disponibles depuis [815] F. Ollivier. A non-algebraic Galois theory and flat systems. Poster présenté au Congrès AMDS, Mai [816] F. Ollivier. An overview of the SCIEnce Project. Poster présenté au Congrès DART IV, Octobre [817] F. Ollivier. Simultaneous proof of the dimensional conjecture and of Jacobi s bound. Poster présenté au Congrès DART IV, Octobre [818] F. Ollivier. Flat difference systems. A definition, some properties and open problems. Poster présenté au Congrès MEGA 2011, Mai [819] F. Poulain, J. van der Hoeven, and G. Lecerf. GNU TEXmacs, une plate-forme scientifique libre. Poster présenté au Forum Digiteo 2012, Novembre 2012.

311 VIII.7 Annexes : Modélisation Algébrique et Calcul Symbolique VIII.7.1 Participations à la communauté scientifique et responsabilités administratives Michel Fliess a été responsable du projet INRIA Alien (période ). Marc Giusti VIII est responsable de l équipe MAX (Modélisation Algébrique et Calcul Symbolique) (période ). est membre du Conseil de Laboratoire (période ). Responsabilités de projets internationaux SCIEnce ( ) (Type: Projet européen) Titre: Symbolic computation infrastructure. Partenaires: St Andrew, LIX, etc. Responsable: Marc Giusti. Montant de la collaboration pour le LIX: euros. Le projet européen SCIEnce (Symbolic Computation Infrastructure for Europe), FP6, Research Infrastructure action, I3 (Integrated Infrastructure Initiative), qui avait débuté en avril 2006, s est achevé fin Ont participé à ce projet : the University of St Andrews, Écosse ; le laboratoire LIX, CNRS, France ; the Computational Mathematics Group, Universitä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, Écosse ; the KANT group, Technische Universität Berlin, Allemagne. Marc Giusti a été responsable de la tâche Communication et Organisation Interne de ce projet, avec un budget de euros sur 5 ans. La coordination a été assuré par Steve Linton (GAP, St Andrews). Les journées de clôture ont été organisées à Polytechnique en décembre medicis.polytechnique.fr/science/ SIMCA (2013-) (Type: Projet Math AmSud) Titre: Coopération avec l Argentine et le Brésil. Partenaires: LIX, Universidad de Buenos Aires, Escola Politécnica São Paulo. Responsable: François Ollivier. Montant de la collaboration pour le LIX: 3000 euros en 2013 (sur un total de 9000 euros en 2013). Nous étudions les systèmes différentiels apparaissant dans la modélisation de phénomènes physiques en recherchant des changements de variables permettant de les simplifier. Dans le cas de systèmes sous-déterminés, nous cherchons à faire chuter la borne de Jacobi, en nous attachant plus particulièrement au cas des systèmes plats. Afin de rechercher les sorties linéarisantes les plus simples, nous étudions le théorème de Lüroth et ses généralisations. polytechnique.fr/ ollivier/simca/ VIII Responsabilités de projets nationaux LEDA ( ) (Type: Projet ANR) Titre: Logistique des Equations différentielles algébriques. Partenaires: IMT, LGC, LIFL et LIX. Responsable: François Ollivier. Montant de la collaboration pour le LIX: euros (sur un total de euros). La détermination de l index et la mise au point de méthodes d intégration adaptées aux systèmes à index positif est un problème récurrent dans de nombreux domaines de la science et de l industrie. Nous avons déposé en janvier 2010 un projet ANR auquel participent l équipe MIP de l Institut de Mathématique de Toulouse, le département Procédés et Systèmes Industriels 311

312 312CHAPTER VIII.7. ANNEXES : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE du Laboratoire de Génie Chimique de Toulouse et le Laboratoire d Informatique Fondamentale de Lille. Ce projet LÉDA (Logistique des Équations Différentielles Algébriques) a été accepté et a démarré en septembre Marc Giusti et Joris Van Der Hoeven ont participé à ce projet dont François Ollivier était le responsable local. Les journées de clôture ont eu lieu à Lille en juin 2013, couplées avec le congrès international DART V (Differential algebra and Related Topics). polytechnique.fr/ ollivier/leda/ MaGiX, ANR-09-JCJC ( ) (Type: ANR Jeunes Chercheuses Jeunes Chercheurs) Titre: Mathématiques, Analyse, Géometrie, Interfaces, exactes. Partenaires: LIX. Responsable: Joris van der Hoeven. Montant de la collaboration pour le LIX: EUROS. Url : Autres participants : Massimiliano Gubinelli (professeur à l université Paris IX), Grégoire Lecerf. Ce financement a permis l emploi en CDD de David Michel puis François Poulain, l achat de matériel informatique, et l organisation de la conférence MaGiX@LIX en septembre 2011 à l École polytechnique, puis d un workshop TEXmacs à Faro au Portugal en février 2012, et enfin un workshop MaGiX satellite d ISSAC 2012 en juillet à Grenoble. MaGiX, DIM/Digiteo HD ( ) (Type: DIM/Digiteo) Titre: Mathématiques, Analyse, Géometrie, Interfaces, exactes. Partenaires: LIX. Responsable: Marc Giusti. Montant de la collaboration pour le LIX: EUROS. Url : Autres participants : Joris van der Hoeven, Grégoire Lecerf. Ce financement a permis l emploi en CDD de Daouda Niang Diatta et François Poulain, ainsi que l achat de matériel informatique. VIII VIII Participation à des projets internationaux Participation à des projets nationaux Projet ANR-05-BLAN ( ) (Type: Projet ANR) Titre: GECKO. Partenaires: INRIA Rocquencourt, LIX, Université de Nice, Université de Toulouse. Responsable: Bruno Salvy. Montant de la collaboration pour le LIX: ,50 euros sur un montant total de euros. Cette dernière année a culminé avec l organisation de la conférence finale du projet (jointe à TERA) sur une semaine en Novembre 2008 : VIII.7.2 VIII Administration de la recherche Activités éditoriales Depuis Février 2006, Marc Giusti est Éditeur en Chef exécutif ( Managing Editor-in-Chief ) du journal AAECC (Applicable Algebra in Engineering, Communication and Computing), Springer Verlag. Membres de comités éditoriaux Forum mathematicum (De Gruyter) Michel Fliess ( ). com/view/j/form. Voir Journal of Applied Mathematics (Hindawi Publishing Corporation) Michel Fliess (2010 ). Voir

313 VIII.7.2. ADMINISTRATION DE LA RECHERCHE 313 Edition de numéros spéciaux Journal of Symbolic Computation, Volume 45, Number 12, December 2010, ISSN (Numéro spécial rassemblant des contributions sélectionnées présentées à 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 (Special Issue dedicated to Professor Michel Fliess) Marc Giusti avec Pierre Rouchon VIII Gestion scientifique de conférences Présidence de comités de programme ICMS 2010 (International Congress on Mathematical Software) (2010). Joris van der Hoeven. Participation à des comités de programme 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). François Ollivier. DART V (Differential Algebra and Related Topics) (2013). François Ollivier. ISSAC 11 (International Symposium on Symbolic and Algebraic Computation) (2011). Grégoire Lecerf. MEGA (Méthodes Effectives en Géométrie Algébrique, comité exécutif en charge de l organisation scientifique) (2009). Marc Giusti. MEGA (Méthodes Effectives en Géométrie Algébrique, advisory board) (2011). Marc Giusti. MEGA (Méthodes Effectives en Géométrie Algébrique, advisory board) (2013). Marc Giusti, Grégoire Lecerf. VIII Organisation d événements scientifiques Présidence de comités d organisation TERA 2008 (Congrès TERA 2008) (2008). François Ollivier. ICMS 2010 (International Congress on Mathematical Software) (2010). Joris van der Hoeven. MaGiX@LIX (Confé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). Grégoire Lecerf.

314 314CHAPTER VIII.7. ANNEXES : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE Participation à des comités d organisation SCIEnce 2011 (Atelier externe final du projet) (2011). Marc Giusti. SCIEnce 2010 (Troisiè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 François Ollivier. JNCF 2010 (Journées nationales de calcul formel) (2010). Grégoire Lecerf. JNCF 2011 (Journées nationales de calcul formel) (2011). Grégoire Lecerf. MaGiX@Lix (Conférence internationale du projet ANR MaGiX) (2011). Grégoire Lecerf. SCIEnce 2009 (Deuxième atelier externe du projet) (2009). Marc Giusti. VIII Participation à des comités et jurys scientifiques Commission de sélection Université de Versailles (Joris van der Hoeven) 2010 Université de Limoges, Poste MC /25 (Marc Giusti) 2010 première réunion VIII.7.3 VIII Activités de formation, encadrement et évaluation Liste des thèses et HDR soutenues Thèses de doctorat Jérémy Berthomieu (6 Décembre 2011). Contributions à la résolution des systèmes algébriques : réduction, localisation, traitement des singularités, implantations. Encadrant: Marc Giusti et Grégoire Lecerf. Romain Lebreton (11 Décembre 2012). Contributions à l algorithmique détendue et à la résolution de systèmes polynomiaux. Encadrant: Marc Giusti. VIII Liste de rapports de thèses et HDR Rapports d habilitations à diriger les recherches Laurent Busé (2011). Représentations matricielles en théorie de l élimination et applications à la géométrie. Rapporteur: Marc Giusti. Rapports de thè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ı Ürgüplü (2010). Contributions to Symbolic Effective Qualitative Analysis of Dynamical Systems; Application to Biochemical Reaction Networks. Université de Lille. Rapporteur: Marc Giusti.

315 VIII.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION 315 VIII Cours universitaires en M2 Enseignements dispensés M. Giusti est intervenu à hauteur de 12h dans le cours Algorithmes efficaces en calcul formel du master parisien de recherche en informatique (MPRI) durant les années G. Lecerf est intervenu à hauteur de 12h dans le cours Algorithmes efficaces en calcul formel du master parisien de recherche en informatique (MPRI) durant l année J. Berthomieu est intervenu à hauteur de 12h dans les TD de Algèbre commutative et effectivité du master d algèbre appliquée à la cryptographie et au calcul formel (M2A2C2) durant l année Autres cours universitaires Lebreton est intervenu à hauteur de 186h dans les TDs des cours d Informatique de l École Polytechnique (INF ) durant la période Jury de thèse de doctorat Cristina Bertone (2010). Polynomial factorization and curve decomposition algorithms. Membre: Dipartimento di Matematica, Torino, Italie. Grégoire Lecerf Louis Leroux (2011). Algorithmes pour les polynômes lacunaires. Membre: Laboratoire de mathématiques Nicolas Oresme, université de Caen. Grégoire Lecerf Vanessa Viste (2011). Attaques algébriques du problème du logarithme discret sur courbes elliptiques. Membre: Laboratoire d informatique de l université de Versailles Saint-Quentinen-Yvelines. Grégoire Lecerf Jérémy Berthomieu (2011). Contributions à la résolution des systèmes algébriques : réduction, localisation, traitement des singularités, implantations. Membre: LIX, École polytechnique. Marc Giusti Jérémy Berthomieu (2011). Contributions à la résolution des systèmes algébriques : réduction, localisation, traitement des singularités, implantations. Membre: LIX, École polytechnique. Grégoire Lecerf Marc Mezzarobba (2011). Autour de l évaluation numérique des fonctions D-finies. Membre: École polytechnique. Joris van der Hoeven Shaoshi Chen (2011). Some Applications of Differential-Difference Algebra to Creative Telescoping. Membre: École polytechnique. Joris van der Hoeven Guillaume Quintin (2012). On the Algorithms of Guruswami-Sudan List Decoding over Finite Rings. Membre: LIX, École polytechnique. Grégoire Lecerf Alexandre Benoit (2011). Algorithmique semi-numérique rapide des séries de Tchebychev. Membre: École polytechnique. Joris van der Hoeven Aslı Ürgüplü (2010). Contributions to Symbolic Effective Qualitative Analysis of Dynamical Systems; Application to Biochemical Reaction Networks. Membre: Université de Lille. Marc Giusti Lionel Alberti (2008). Propriétés des Singularités des Variétés Algébriques Réelles. Membre: Université de Nice. Marc Giusti, président du jury Marc Dohm (2008). Implicitization of rational algebraic surfaces with syzygy-based methods. Membre: Université de Nice. Marc Giusti, président du jury

316 316CHAPTER VIII.7. ANNEXES : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE Clémence Durvye (2008). Algorithmes pour la décomposition primaire d idéaux de dimension nulle donnés en évaluation. Membre: Université de Versailles-Saint-Quentin. Marc Giusti Jury d habilitations à diriger des recherches Mohab Safey el Din (2010). Résolution de systèmes polynomiaux sur les réels : algorithmes, complexité, implantations et applications. Membre: Marc Giusti, président du jury. Laurent Busé (2011). Représentations matricielles en théorie de l élimination et applications à la géométrie. Membre: Université de Nice. Marc Giusti Joris van der Hoeven (2008). Habilitation : Transséries et Analyse Complexe Effective. Membre: Université d Orsay. Marc Giusti Écoles thématiques et cours spécialisés Calcul analytique (3h de cours), Joris van der Hoeven, Journées Nationales de Calcul Formel, école thématique CNRS, CIRM, Luminy, Les notes de cours sont publiées dans [781]. Fast algorithms for polynomials and matrices (12h de cours), Grégoire Lecerf, Non-linear Computational Geometry CIMPA-UNESCO-MICINN-INDONESIA Research School, Department Mathematics, Universitas Gadjah Mada, Yogyakarta, Indonésie, juillet, Factorisation des polynômes à plusieurs variables (3h de cours), Grégoire Lecerf, Journées Nationales de Calcul Formel, école thématique CNRS, CIRM, Luminy, mai, Les notes de cours sont publiées dans [782]. Vulgarisation Exposé intitulé Présentation de GNU TEXmacs, par F. Poulain aux rencontres mondiales du logiciel libre, Genêve, Suisse, Exposé intitulé GNU TEXmacs, une plate-forme scientifique libre, par F. Poulain aux rencontres mondiales du logiciel libre, Bruxelles, Belgique, Article La commande sans modèle du trafic autoroutier par Fliess, Abouaissa, Iordanovaet et Join, dans FLASH X La revue scientifique de l École polytechnique, VIII.7.4 Autres éléments de visibilité VIII Invitations Exposés invités dans des conférences Deuxième colloque franco-maghrébin de Calcul formel, Kerkennah (Sfax, Tunisie) (2009). Marc Giusti, La géométrie associée à 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 Universitä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.

317 VIII.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ 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 Mathématiques, organisé conjointement par la SMT et la SMF, Djerba, Tunisie (2009). Marc Giusti, Variété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-maghrébin de Calcul Formel, Îles de Kerkennah, Tunisie (2008). Marc Giusti, Variétés bipolaires et résolution d une équation polynomiale ré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). François Ollivier, A proof of the dimensional conjecture and of Jacobi s bound. Applications of Computer Algebra, Vlora, Albania (2010). Franç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). Grégoire Lecerf, Fast arithmetic for polynomials and matrices in Mathemagix. XXI rencontres Arithmétiques de Caen, factorisation des nombres entiers et des polynômes, Caen, France (2010). Gré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. Exposés invités dans des Workshops Journées nationales de calcul formel 2008, CIRM (2008). Marc Giusti, Variétés polaires et bipolaires. Worshop Universidad de Cantabria, España (2009). Marc Giusti, Variedades polares, bipolares y resolución de una ecuación real. Workshop de Informatica Aplicable y Matematica (Semi)numerica, Buenos-Aires, Argentine (2008). Marc Giusti, Variedades polares y bipolares. Colloquium du département de mathématiques de l Université de Rennes (2008). Marc Giusti, Variétés polaires et bipolaires.

318 318CHAPTER VIII.7. ANNEXES : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE Journées nationales de calcul formel 2010, CIRM (2010). Joris van der Hoeven, Mathemagix : langage, fonctionnalités et performances. Rencontres MaGiX@LiX 2011, École polytechnique, Palaiseau, France (2011). Grégoire Lecerf, Mathemagix libraries. Rencontres MaGiX@LiX 2011, École polytechnique, Palaiseau, France (2011). Joris van der Hoeven, Mathemagix compiler. Rencontres MaGiX@LiX 2011, École polytechnique, Palaiseau, France (2011). Joris van der Hoeven, Semantic editing with GNU TEXmacs. Journées nationales de calcul formel 2013, Marseille, France (2013). François Poulain, GNU TEXmacs, une plate-forme libre pour l édition scientifique. Workshop TEXmacs, Albufeira, Portugal (2012). Joris van der Hoeven, plusieurs exposés sur GNU TEXmacs. Workshop TEXmacs, Albufeira, Portugal (2012). Grégoire Lecerf, Presentation of Mathemagix. Workshop TEXmacs, Albufeira, Portugal (2012). François Poulain, Presentation of other work on converters within TEXmacs. Workshop MaGiX@ISSAC 2012, Grenoble, France (2012). Franç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). Mathemagix language. Joris van der Hoeven, The Journées nationales de calcul formel 2010, CIRM (2010). François Ollivier, Borne de Jacobi et calcul de l index de forme normale pour toutes les composantes quasi-régulières d un système d EDO. Séjours invités Marc Giusti a été invité plusieurs se- Université de Cantabria, Espagne ( ). maines par Joos Heintz et Luis Miguel Pardo. Université de Buenos Aires ( ). Marc Giusti a été invité plusieurs semaines par Joos Heintz. Université de Humboldt, Allemagne (2011). Marc Giusti a été invité pour le 70ème anniversaire de Bernd Bank. Université de Toruǹ, Pologne (2008). Jean Moulin Ollagnier a été invité 15 jours par l université Nicolas Copernic de Toruǹ en septembre Université de Toruǹ, Pologne (2010). Jean Moulin Ollagnier a été invité 15 jours par l université Nicolas Copernic de Toruǹ en juillet Université de Toruǹ, Pologne (2012). Jean Moulin Ollagnier a été invité 15 jours par l université Nicolas Copernic de Toruǹ en juillet Faculté des Sciences Semlalia, Marrakech, Maroc (2009). François Ollivier a été invité une semaine par Brahim Sadik en mars 2009.

319 VIII.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ 319 Faculté des Sciences Semlalia, Marrakech, Maroc (2011). François Ollivier a été invité une semaine par Brahim Sadik en novembre Faculté des Sciences Semlalia, Marrakech, Maroc (2012). François Ollivier a été invité une semaine par Brahim Sadik en juin VIII Prix et distinctions Prix de l innovation de l École polytechnique 2010, catégorie brevet, Michel Fliess, Prix du meilleur article étudiant à la conférence internationale ISSAC 12, Romain Lebreton, Prix du meilleur poster de la part du Fachgruppe Computer Algebra lors de la conférence internationale ISSAC 12, Romain Lebreton, MAXModélisation Algébrique et Calcul Symbolique

320 320CHAPTER VIII.7. ANNEXES : MODÉLISATION ALGÉBRIQUE ET CALCUL SYMBOLIQUE

321 IX Équipe Parsifal (PARSIFAL) 321

322

323 IX.1 Liste des membres : Parsifal IX.1.1 IX Liste actuelle des membres Membres permanents Nom Fonction Employeur HDR Arrivée Dale Miller DR INRIA HDR equivalent 2003 Lutz Straßburger CR INRIA HDR 2005 Stéphane Graham-Lengrand CR, CHE CNRS, École Polytechnique 2008 Kaustuv Chaudhuri CR INRIA 2009 François Lamarche DR INRIA 2012 Christelle Lievin Assistant INRIA 2011 IX Doctorants et postdoctorants Doctorants Nom Financement Arrivée Encadrant Mahfuza Farooque ANR Jeunes Chercheurs PSI 2010 S. Graham-Lengrand Ivan Gazeau ANR Blanc CPP 2009 D. Miller Hernán Vanzetto INRIA-MSR 2011 K. Chaudhuri Zakaria Chihani ERC ProofCert 2012 D. Miller Postdoctorants Nom Financement Dates Responsable Matteo Cimini INRIA D. Miller Fabien Renaud ERC ProofCert D. Miller Novak Novakovic ANR Structural L. Straßburger Mikheil Rukhaia ANR Structural 2013 L. Straßburger Ryuta Arisaka ANR Structural L. Straßburger IX Visiteurs et autres membres Autres Nom Fonction Financement Dates Quentin Heath ingénieur INRIA, ADT BATT 2011 Anastasia Gkolfi stagiaire M2 ANR Structural 2013 Sonia Marin stagiaire M2 ANR Structural 2013 Jean Pichon stagiaire M2 ERC ProofCert 2013 Damien Rouhling stagiaire L3 ENS Lyon - ANR PSI 2013 Olivier Savary-Bélanger stagiaire M2 EA RAPT; McGill 2013 IX.1.2 IX Anciens membres Membres permanents Nom Fonction Employeur HDR Départ Position actuelle Joëlle Despeyroux CR INRIA 2011 CR, INRIA Sophia Antipolis 323

324 324 CHAPTER IX.1. LISTE DES MEMBRES : PARSIFAL IX Doctorants Doctorants et postdoctorants Nom Financement Départ Encadrant Position actuelle Nicolas Guenot EDX 2012 L. Straßburger Postdoc, ITU Copenhagen Olivier Delande Monge 2009 D. Miller Thales Research Center Vivek Nigam Alloc Mobius 2009 D. Miller Junior Prof, Univ Paraíba, Brazil David Baelde Alloc ENS Lyon 2008 D. Miller MdC, ENS Cachan Alexis Saurin Alloc ENS Paris 2008 D. Miller CR, CNRS PPS Postdoctorants Nom Financement Dates Responsable Position actuelle Stefan Hetzl ANR Structural L. Straßburger Researcher, TU Vienna Beniamino Accattoli INRIA D. Miller Postdoc, CMU Willem Heijltjes ANR Structural L. Straßburger Postdoc, Univ. of Bath Revantha Ramanayake ANR PSI S. Graham-Lengrand Postdoc, TU Vienna Clément Houtmann INRIA D. Miller Ingénieur, Systerel Andrew Gacek INRIA D. Miller Ingénieur, Rockwell Collins Tom Gundersen INRIA L. Straßburger Postdoc, Univ. Paris 7 Stefan Hetzl INRIA L. Straßburger Researcher, TU Vienna Laurent Méhats ANR Blanc Infer L. Straßburger unknown Matteo Capelletti INRIA L. Straßburger unknown IX Stagiaires Master 2 Autres membres Nom Financement Dates Responsable Position actuelle Ivan Gazeau ENS 2009 D. Miller Ph.D. student Edlira Nano 2008 L. Straßburger unknown Anne-Laure Schneider 2009 D. Miller unknown Alexandre Viel ENS 2008 D. Miller unknown Autres Stagiaires Nom Financement Dates Responsable Position actuelle Andrew Cave EA RAPT 2011 K. Chaudhuri Ph.D. McGill Chris Martens EA RAPT 2011 K. Chaudhuri Ph.D. Carnegie Mellon Salil Joshi EA RAPT 2011 K. Chaudhuri Ph.D. Carnegie Mellon Yuting Wang EA RAPT 2012 K. Chaudhuri Ph.D. Univ. Minnesota Matthieu Vegreville École polytechnique 2012 S. Graham-Lengrand Student

325 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 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.

327 IX.2.3. SOFTWARE 327 IX.2.3 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. 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 by members of Parsifal in collaboration with the Microsoft Research- INRIA Joint Centre in Saclay. It has been used in a number of large formalization efforts of distributed systems and distributed algorithms. 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. lengrand/psyche/ IX.2.4 Exemples de résultats significatifs 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 328 CHAPTER IX.2. RAPPORT SCIENTIFIQUE : PARSIFAL 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 p- simulate 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].

329 IX.2.5. ANIMATION SCIENTIFIQUE, RAYONNEMENT, PRIX ET RÉCOMPENSES 329 IX.2.5 Animation scientifique, rayonnement, prix et récompenses 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 ( ). 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 thèse de l Ecole Polytechnique and the Prix de thèse ASTI 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 Miller has also been awarded the ERC Advanced Grant ProofCert for the period IX.2.6 Fonctionnement interne 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 Comè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 330 CHAPTER IX.2. RAPPORT SCIENTIFIQUE : PARSIFAL

331 IX.3 Projet de recherche : Parsifal IX.3.1 Objectifs scientifiques 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 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 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

332 332 CHAPTER IX.3. PROJET DE RECHERCHE : PARSIFAL 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 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 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 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

333 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 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 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 334 CHAPTER IX.3. PROJET DE RECHERCHE : PARSIFAL

335 IX.4 Analyse AFOM : Parsifal INTERNE POSITIF Strong theoretical background in the nature of proof. Extensive background with the implementation of computational logic systems. Long history of designing and applying logic-based tools. The ERC grant provides a basis for promoting our work and attracting doctorants and postdocs. We routinely attract very strong candidates for CR positions. Atouts Opportunit es A F O M Faiblesses Integration with other teams in the Paris area. Menaces Missing an engineer for software development. NEGATIF EXTERNE Figure IX.4.1: Analyse AFOM de l équipe Parsifal : Atouts, Faiblesses, Opportunités, Menaces 335

336 336 CHAPTER IX.4. ANALYSE AFOM : PARSIFAL

337 IX.5 Fiche résumé : Parsifal IX.5.1 Membres 2008 : 4 chercheurs (1 CNRS, 3 INRIA), 3 postdocs, 7 doctorants 2013 : 5 chercheurs (1 CNRS, 4 INRIA), 5 postdocs, 3 doctorants, 1 engineer Départ de membres de l équipe Joë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 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, Franç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 Résultats scientifiques 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

338 338 CHAPTER IX.5. FICHE RÉSUMÉ : PARSIFAL IX.5.3 Production scientifique IX Publications Journaux : 20 Conférences internationales : 53 During the year (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 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 ) 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 Rayonnement Dale Miller was awarded an ERC Advanced Grant in 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 Unithé ou café -series of popular talks at the INRIA Saclay research center, March 11, IX Actions de formation Team members are routinely involved with teaching along various lines. 1. Stephane Graham-Lengrand is a Chargé d Enseignement at École Polytechnique where he teaches various undergraduate and M1 courses. In addition, he also taught at the École d ingénieur ESIEA in 2008, 2009 and 2010.

339 IX.5.3. PRODUCTION SCIENTIFIQUE 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 Universitá 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 340 CHAPTER IX.5. FICHE RÉSUMÉ : PARSIFAL

341 IX.6 Production scientifique : Parsifal Les publications [877], [878], [872], [923] et [922] sont des publications avec des auteurs dans des des équipes différentes. IX.6.1 Livres et chapitres de livres [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, [821] Chris Hawblitzel and Dale Miller, editors. CPP: Second International Conference on Certified Programs and Proofs, volume 7679 of LNCS. Springer, [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 College Publications, [823] Dale Miller and Gopalan Nadathur. Programming with Higher-Order Logic. Cambridge University Press, June IX.6.2 Revues internationales [824] Beniamino Accattoli and Delia Kesner. Preservation of strong normalisation modulo permutations for the structural lambda-calculus. Logical Methods in Computer Science, 8(1), [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(2-3): , March [826] Olivier Delande, Dale Miller, and Alexis Saurin. Proof and refutation in MALL as a game. Annals of Pure and Applied Logic, 161(5): , February [827] Murdoch Gabbay and Stéphane Lengrand. The lambda-context calculus. Information and Computation, 207(12): , [828] Andrew Gacek, Dale Miller, and Gopalan Nadathur. Nominal abstraction. Information and Computation, 209(1):48 73, [829] Andrew Gacek, Dale Miller, and Gopalan Nadathur. A two-level logic approach to reasoning about computations. J. of Automated Reasoning, 49(2): , [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): , [831] François Lamarche. Modelling Martin Löf Type Theory in Categories. In Ch. Retoré and J. Gilibert, editors, Logic, Categories, Semantics, special issue of J. of Applied Logic, Bordeaux, France, June Ch. Retoré and J. Gilibert, Elsevier North-Holland. Scheduled to appear in June [832] Sté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),

342 342 BIBLIOGRAPHY [833] Stéphane Lengrand and Alexandre Miquel. Classical F ω, orthogonality and symmetric candidates. Annals of Pure and Applied Logic, 153(1 3):3 20, March [834] Chuck Liang and Dale Miller. Focusing and polarization in linear, intuitionistic, and classical logics. Theoretical Computer Science, 410(46): , [835] Chuck Liang and Dale Miller. A focused approach to combining logics. Annals of Pure and Applied Logic, 162(9): , [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 [837] Dale Miller. Formalizing operational semantic specifications in logic. Concurrency Column of the Bulletin of the EATCS, October [838] Dale Miller and Elaine Pimentel. A formal framework for specifying sequent calculus proof systems. Theoretical Computer Science, 474:98 116, [839] Vivek Nigam and Dale Miller. A framework for proof systems. J. of Automated Reasoning, 45(2): , [840] Alexis Saurin. Typing streams in Λµ-calculus. ACM Transactions on Computational Logic, 11(4), [841] Lutz Straßburger. From deep inference to proof nets via cut elimination. J. of Logic and Computation, 21(4): , August [842] Lutz Straßburger. Extension without cut. Annals of Pure and Applied Logic, 163(12): , [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, [844] Alwen Tiu and Dale Miller. Proof search specifications of bisimulation and modal logics for the π-calculus. ACM Trans. on Computational Logic, 11(2), IX.6.3 Conférences internationales [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 Schloss Dagstuhl Leibniz-Zentrum für Informatik, [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 Springer, [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 Springer, [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 Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2012.

343 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 Springer, [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, [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 , [852] David Baelde, Dale Miller, and Zachary Snow. Focused inductive theorem proving. In J. Giesl and R. Hähnle, editors, Fifth International Joint Conference on Automated Reasoning, number 6173 in LNCS, pages , [853] David Baelde and Samuel Mimram. De la webradio lambda à la λ-webradio. In Ensiie Cedric, editor, Journées Francophones des Langages Applicatifs, pages INRIA, [854] Alexis Bernadet and Sté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 [855] Alexis Bernadet and Sté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 für Informatik, September [856] Kai Brü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 Springer, [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 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 , Brno, Czech Republic, August Springer. [859] Kaustuv Chaudhuri. Magically constraining the inverse method using dynamic polarity assignment. In Christian Fermüller and Andrei Voronkov, editors, Proc. 17th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), volume 6397 of LNCS, pages , Yogyakarta, Indonesia, October 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 , Kyoto, Japan, December 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 Springer, July 2013.

344 344 BIBLIOGRAPHY [862] Kaustuv Chaudhuri and Joëlle Despeyroux. A hybrid linear logic for constrained transition systems. Collected Abstracts of the 19th Conference on Types for Proofs and Programs (TYPES), April [863] Kaustuv Chaudhuri, Damien Doligez, Leslie Lamport, and Stephan Merz. Verifying safety properties with the TLA + proof system. In Jürgen Giesl and Reiner Hähnle, editors, Fifth International Joint Conference on Automated Reasoning, volume 6173 of LNAI, pages , Edinburgh, UK, July Springer. [864] Kaustuv Chaudhuri, Damien Doligez, Stephan Merz, and Leslie Lamport. The TLA+ proof system: Building a heterogeneous verification platform. In Ana Cavalcanti, David Dé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 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 Schloss Dagstuhl Leibniz- Zentrum für Informatik, September [866] Kaustuv Chaudhuri, Stefan Hetzl, and Dale Miller. A systematic approach to canonicity in the classical sequent calculus. In Patrick Cégielski and Arnaud Durand, editors, CSL 2012: Computer Science Logic, volume 16 of Leibniz International Proceedings in Informatics (LIPIcs), pages Schloss Dagstuhl Leibniz-Zentrum für Informatik, September [867] Kaustuv Chaudhuri, Dale Miller, and Alexis Saurin. Canonical sequent proofs via multi-focusing. In G. Ausiello, J. Karhumäki, G. Mauri, and L. Ong, editors, Fifth International Conference on Theoretical Computer Science, volume 273 of IFIP, pages Springer, September [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 EasyChair, [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 , [870] Agata Ciabattoni, Lutz Straßburger, and Kazushige Terui. Expanding the realm of systematic proof theory. In Erich Grädel and Reinhard Kahle, editors, Computer Science Logic, CSL 09, volume 5771 of Lecture Notes in Computer Science, pages Springer, [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 IEEE Computer Society Press, [872] Mahfuza Farooque, Sté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 ACM, September [873] Murdoch Gabbay and Stéphane Lengrand. The lambda-context calculus. In Brigitte Pientka and Carsten Schü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.

345 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 ACM, July [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 IEEE Computer Society Press, [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 , [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, [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, [879] Sté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 [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 Schloss Dagstuhl Leibniz-Zentrum fü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 , [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 , Edinburgh, United Kingdom, July Schloss Dagstuhl Leibniz-Zentrum fü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 , Edinburgh, United Kingdom, July [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 Springer, [885] Stefan Hetzl and Lutz Straßburger. Herbrand-Confluence for Cut-Elimination in Classical First-Order Logic. In Patrick Cégielski and Arnaud Durand, editors, Computer Science Logic (CSL) 2012, volume 16 of Leibniz International Proceedings in Informatics (LIPIcs), pages Schloss Dagstuhl Leibniz-Zentrum fuer Informatik, 2012.

346 346 BIBLIOGRAPHY [886] Kentaro Kikuchi and Sté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 , Budapest, Hungary, March Springer. [887] Chuck Liang and Dale Miller. A unified sequent calculus for focused proofs. In 24th Symp. on Logic in Computer Science, pages , [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 , [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 [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, [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 [892] Dale Miller and Zoltán Ésik, editors. Proceedings 8th Workshop on Fixed Points in Computer Science, volume 77 of Electronic Proceedings in Theoretical Computer Science, [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 Springer. To appear. [894] Vivek Nigam. Using tables to construct non-redundant proofs. In CiE 2008: Abstracts and extended abstracts of unpublished papers, [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 Springer, [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 , [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 To appear. [898] Alexis Saurin. Towards ludics programming: Interactive proof search. In Logic Programming, 24th International Conference, volume 5366 of LNCS, pages , December [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 Springer, [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 Springer, 2009.

347 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 Springer, [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 , Madrid, Spain, September IX.6.4 Conférences invitées [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 , August [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, [905] Lutz Straßburger. What is the problem with proof nets for classical logic? In Fernando Ferreira, Benedikt Lö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 , Ponta Delgada, Azores, Portugal, June Springer. IX.6.5 Logiciel [906] The Abella prover, Available at [907] The Bedwyr model checker, Available at bedwyr/. [908] Kaustuv Chaudhuri. Profound: a linking-based interactive prover, Available at: [909] Kaustuv Chaudhuri, Denis Cousineau, Damien Doligez, Markus Kuppe, Leslie Lamport, Tomer Libal, Stephan Merz, and Hernán Vanzetto. TLAPS: the TLA + proof system, Available from [910] Psyche: the Proof-Search factory for Collaborative HEuristics, Available at http: // IX.6.6 Thèses [911] David Baelde. A linear approach to the proof-theory of least and greatest fixed points. PhD thesis, Ecole Polytechnique, December [912] Olivier Delande. Symmetric Dialogue Games in the Proof Theory of Linear Logic. PhD thesis, Ecole Polytechnique, October [913] Nicolas Guenot. Nested Deduction in Logical Foundations for Computation. Ph.d. thesis, Ecole Polytechnique, [914] Vivek Nigam. Exploiting non-canonicity in the sequent calculus. PhD thesis, Ecole Polytechnique, September 2009.

348 348 BIBLIOGRAPHY [915] Alexis Saurin. Une étude logique du contrôle (appliquée à la programmation fonctionnelle et logique). PhD thesis, Ecole Polytechnique, September IX.6.7 Habilitation à diriger des recherches [916] Lutz Straßburger. Towards a Theory of Proofs of Classical Logic. Habiliatation à diriger des recherches, Université Paris VII, IX.6.8 Rapports techniques [917] David Baelde. On the expressivity of minimal generic quantification: Extended version. Technical Report inria , INRIA/HAL, inria [918] Alexis Bernadet and Stéphane Lengrand. Filter models: non-idempotent intersection types, orthogonality and polymorphism - long version. Technical Report hal , Laboratoire d informatique de l école polytechnique - LIX, CNRS-Ecole Polytechnique- INRIA, June [919] Kaustuv Chaudhuri and Joëlle Despeyroux. A hybrid linear logic for constrained transition systems with applications to molecular biology. Research Report inria , INRIA-HAL, [920] Mahfuza Farooque and Stéphane Graham-Lengrand. Sequent calculi with procedure calls. Technical report, Laboratoire d informatique de l école polytechnique - LIX, CNRS-Ecole Polytechnique-INRIA, January hal [921] Mahfuza Farooque and Stéphane Lengrand. A sequent calculus with procedure calls. Technical report, Laboratoire d informatique de l école polytechnique - LIX, CNRS- Ecole Polytechnique-INRIA, December hal [922] Mahfuza Farooque, Stéphane Lengrand, and Assia Mahboubi. Simulating the DPLL(T) procedure in a sequent calculus with focusing. Technical report, Laboratoire d informatique de l école polytechnique - LIX, CNRS-Ecole Polytechnique-INRIA, March [923] Mahfuza Farooque, Stéphane Lengrand, and Assia Mahboubi. Two simulations about DPLL(T). Technical report, Laboratoire d informatique de l école polytechnique - LIX, CNRS-Ecole Polytechnique-INRIA, March hal [924] François Lamarche. Path Functors in Cat. Technical Report hal , INRIA, Submitted, [925] Laurent Méhats and Lutz Straßburger. Non-crossing tree realizations of ordered degree sequences. Research Report hal , INRIA, December fr/hal [926] Michele Pagani and Alexis Saurin. Stream associative nets and lambda-mu-calculus. Technical Report 6431, INRIA, January en.

349 IX.6.9. AUTRES 349 IX.6.9 Autres [927] Alexis Bernadet and Stéphane Graham-Lengrand. A big-step operational semantics via non-idempotent intersection types. Submitted, April [928] Alexis Bernadet and Stéphane Lengrand. Non-idempotent intersection types and strong normalisation. Submitted, February [929] Stefan Hetzl. On the form of witness terms. Draft manuscript, 2009.

350 350 BIBLIOGRAPHY

351 IX.7 Annexes : Parsifal IX.7.1 Participations à la communauté scientifique et responsabilités administrative Responsabilités administratives des membres de l équipe incluants responsabilité de recherche et d enseignement Stéphane Graham-Lengrand IX est membre élu du Comité Enseignement-Recherche du département d informatique de l Ecole Polytechnique (période 2010-). est responsable des programmes de Master 1 Informatique de l Ecole Polytechnique (période 2011-). est représentant de l Informatique au Comité des thèses de l Ecole Doctorale de l Ecole Polytechnique (période 2008-). est responsable du GT Logique, Algèbre, Calcul du GDR Informatique-Mathématique du CNRS (période 2011-). Responsabilités de projets internationaux ProofCert ( ) (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: 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). RAPT ( ) (Type: Équipe Associée INRIA) Titre: Applying Recent Advances in Proof Theory for Specification and Reasoning. Partenaires: LIX, McGill Univ. (Canada), Carnegie Mellon Univ. (États-Unis), et Univ. Minnesota (États-Unis). Responsable: Kaustuv Chaudhuri. Montant de la collaboration pour le LIX: 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. Redo ( ) (Type: INRIA ARC) Titre: Redesigning logical syntax. Partenaires: INRIA Nancy Grand Est, University of Bath, INRIA Saclay Île-de-France. Responsable: Lutz Straßburger. Montant de la collaboration pour le LIX: euros. This grant supported one postdoc at LIX and travel expenses for visits between the three sites and to conferences. lutz/orgs/redo.html Slimmer ( ) (Type: INRIA Equipe Associée) Titre: Sophisticated Logic Implementations for Modeling and Mechanical Reasoning slimmer.gforge.inria.fr/. Partenaires: University of Minnesota and LIX. Responsable: Dale Miller. Montant de la collaboration pour le LIX: 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 352 CHAPTER IX.7. ANNEXES : PARSIFAL From Proofs to Counterexamples for Programming ( ) (Type: PHC PROCOPE) Titre: From Proofs to Counterexamples for Programming. Partenaires: INRIA Saclay Île-de-France, Universität Bonn. Responsable: Lutz Straßburger. Montant de la collaboration pour le LIX: euros. This grant supports short visits from LIX researchers to Bonn. Extending the Realm of the Curry-Howard-Correspondence ( ) (Type: PHC GER- MAINE DE STAEL) Titre: Extending the Realm of the Curry-Howard-Correspondence. Partenaires: INRIA Saclay Île-de-France, Universität Bern. Responsable: Lutz Straßburger. Montant de la collaboration pour le LIX: euros. This grant supported short visits from LIX researchers to Bern. Deep Inference and the Essence of Proofs ( ) (Type: PHC GERMAINE DE STAEL) Titre: Deep Inference and the Essence of Proof. Partenaires: INRIA Saclay Île-de-France, Universität Bern. Responsable: Lutz Straßburger. Montant de la collaboration pour le LIX: euros. This grant supported short visits from LIX researchers to Bern. IX Responsabilités de projets nationaux INFER ( ) (Type: Projet ANR blanc) Titre: Theory and Application of Deep Inference. Partenaires: LIX, PPS, LORIA. Responsable: Lutz Straßburger. Montant de la collaboration pour le LIX: euros. 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: // lutz/orgs/infer.html PSI ( ) (Type: Projet ANR JCJC) Titre: Proof-Search control in Interaction with domainspecific methods. Partenaires: LIX. Responsable: Stéphane Graham-Lengrand. Montant de la collaboration pour le LIX: euros. 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. lengrand/psi/ Eternal ( ) (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: 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. IX Participation à des projets internationaux STRUCTURAL ( ) (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: euros. This three-year ANR project supports several postdocs at all four sites, regular workshops, and travel expenses for mutual visits and for conferences. fr/ lutz/orgs/structural.html

353 IX.7.2. ADMINISTRATION DE LA RECHERCHE 353 REUSSI ( ) (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: euros. These funds paid for travel between the USA and France for summer interns working on the Slimmer and the Rapt projects. france/reussi.htm CPCFQ ( ) (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: euros. These funds paid for travel and accommodations for junior researchers from Parsifal to travel to McGill University in Quebec. IX Participation à des projets nationaux Projet CPP ( ) (Type: Projet ANR) Titre: Confidence, Proofs, and Probabilities. Partenaires: LIX, LSV, CEA, Supelec. Responsable: J. Goubault-Larrecq. Montant de la collaboration pour le LIX: euros. These fund supported a Ph.D. student (Gazeau) who was co-advised by the team leaders of Comè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. bouissou/cpp/ Projet Panda ( ) (Type: Projet ANR) Titre: Parallel and Distributed Analysis. Partenaires: LIX, CEA, LIPN, PPS. Responsable: C. Palamidessi. Montant de la collaboration pour le LIX: 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). lix.polytechnique.fr/ mh/panda/index.php IX.7.2 IX Administration de la recherche Activités éditoriales Membres de comités éditoriaux ACM Transactions on Computational Logic (ACM) Dale Miller (1999-). Voir tocl.acm.org/. Journal of Automated Reasoning (Springer) Dale Miller (2011-). Voir com/computer/theoretical+computer+science/journal/ Journal of Applied Logic (Elsevier) Dale Miller (2003-). elsevier.com/journal-of-applied-logic/. Voir Journal of Logic and Computation (Oxford University Press) Dale Miller ( ). Voir Theory and Practice of Logic Programming (Cambridge University Press) Dale Miller (1999-). Voir

354 354 CHAPTER IX.7. ANNEXES : PARSIFAL Edition de numéros spéciaux Logical Methods in Computer Science (online publication) Special Issue on Computational Logic in honour of Roy Dyckhoff Stéphane Graham-Lengrand, LIX Electronic Proceedings in Theoretical Computer Science (online publication) Post-proceedings of the 6th workshop on Intersection Types and Related Systems Stéphane Graham-Lengrand, LIX IX Gestion scientifique de conférences Présidence de comités de pilotage Participation à des comité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) ( ). Dale Miller. Présidence de comités de programme 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. Participation à des comités de programme 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). Miller. Dale 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.

355 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) (2010). Dale Miller. IFIP-TCS (International Conference on Theoretical Computer Science) (2010). Miller. Dale 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) (2009). Dale Miller. 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) (2008). Dale Miller. 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). Stéphane Graham-Lengrand. IJCAR (International Joint Conference on Automated Reasoning) (2012). Stéphane Graham- Lengrand.

356 356 CHAPTER IX.7. ANNEXES : PARSIFAL ITRS (Intersection Types and Related Systems) (2012). Stéphane Graham-Lengrand. LICS (Logic in Computer Science) (2010). Stéphane Graham-Lengrand. CLAC (Classical Logic and Computation) (2010). Stéphane Graham-Lengrand. PSTT-PSATTT (Proof-Search in Type Theory, Proof-Search in Axiomatic Theories and Type Theory) (2008,2009,2010,2011,2013). Stéphane Graham-Lengrand. IX Organisation d événements scientifiques Présidence de comités d organisation 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). Stéphane Graham-Lengrand. Journées LAC - GeoCal (rencontre commune des groupes de travail GEOCAL (Géométrie du calcul) et LAC (Logique, Algèbre et Calcul) du GDR Informatique mathématique) (2011). Sté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) (2009). Lutz Straßburger. Participation à des comités d organisation 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) (2009). Lutz Straßburger. IX Participation à des comités et jurys scientifiques Au niveau international Beth Dissertation Award ( ) 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 Comité de programmes ( ) Dale Miller. Member.

357 IX.7.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION 357 Commission de sélection INRIA Saclay hiring committee for CR (Dale Miller) 2008 Comité de sélection sur le poste 27PR90 Logique et vérification à Rennes 1 (Dale Miller) 2010 Université Paris 7, poste MdC (Stéphane Graham-Lengrand) 2010 IX.7.3 Activités de formation, encadrement et évaluation IX Liste des thèses et HDR soutenues Habilitations à dirigers les recherches Lutz Straßburger (7 January 2010). Towards a Theory of Proofs of Classical Logic Thèses de doctorat 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 étude logique du contrôle. Miller. IX Liste de rapports de thèses et HDR Rapports d habilitations à diriger les recherches Encadrant: Dale Stefan Hetzl (5 November 2012). Computational Proof Analysis. Rapporteur: Dale Miller. Rapports de thèse Novak Novakovic (8 November 2011). Sémantique algé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. Bologna. Rapporteur: Dale Miller. University of 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. Wien. Rapporteur: Dale Miller. Technische Universität Anders Starcke Henriksen (December 2011). University of Copenhagen. Rapporteur: Dale Miller.

358 358 CHAPTER IX.7. ANNEXES : PARSIFAL Jury member Robert Simmons (22 October 2012). Substructural Logical Specifications. Membre: Carnegie Mellon University. Dale Miller Francois Garillot (5 December 2011). Generic Proof Tools and Finite Group Theory. Pré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). Représentation et interaction des preuves en superdéduction modulo. Membre: Université Henri Poincaré, Nancy. Dale Miller Elie Soubiran (27 September 2010). Modular development of theories and name-space management for the Coq proof assistant. Président: Ecole Polytechnique. Dale Miller Denis Cousineau (1 December 2009). Models and proof normalization. Polytechnique. Dale Miller Membre: Ecole Samuel Mimram (1 December 2008). Asynchronous Games: from Sequentiality to Concurrency. Membre: Université 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 Enseignements dispensés Cours universitaires en M2 Jury Dale Miller teaches part of Logique linéaire et paradigmes logiques du calcul, Course 2-1 at MPRI ( ). Stéphane Graham-Lengrand teaches part of Logique linéaire et paradigmes logiques du calcul, Course 2-1 at MPRI ( ). During , Dale Miller has served on 14 juries of Ph.D. students, include 5 (listed above) where he was also a reporter. Ecoles thématiques et cours spécialisés Miller taught during the CUSO Winter School in Mathematics and Computer Science Proof and Computation, Les Diablerets, Switerland, January Miller taught a graduate level course on Proof theory with applications to computation and deduction, Dipartimento di Informatica, Università di Pisa, September Miller gave a three hour tutorial at PLS8: 8th Panhellenic Logic Symposium, Ioannina, Greece, July 4-8, Miller gave six hours of lectures at ISCL: International School on Computational Logic, Bertinoro, April 2011.

359 IX.7.4. AUTRES ÉLÉMENTS DE VISIBILITÉ 359 Straßburger taught a course on Introduction to Proof Theory at ESSLLI 10, Copenhagen, August 9 20, Miller taught a graduate level course on Proof search and Computation. Dipartimento di Scienze dell Informazione, Universitá degli studi di Milano, March Miller taught a graduate level course on Proof systems for linear, intuitionistic, and classical logic. Dipartimento di Informatica, Universitá Ca Foscari di Venezia, April Vulgarisation Straßburger gave a talk on C est quoi, une preuve? at Unithé ou café at the INRIA Saclay research center, March 11, IX.7.4 Autres éléments de visibilité IX 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). Miller gave an invited talk. 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). Miller gave an invited talk. 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. Journé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 360 CHAPTER IX.7. ANNEXES : PARSIFAL 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, Polaritá e Cognizione (2008). Miller gave an invited talk. CLaC 2008: International Workshop on Classical Logic and Computation (2008). Graham- Lengrand gave an invited talk. ICTAC 2010: 7th International Colloquium on Theoretical Aspects of Computing (2010). Chaudhuri co-authored an invited paper. IX Prix et distinctions Dale Miller won the LICS Test-of-Time Award 2011 for a paper he co-authored with Joshua Hodas in LICS Vivek Nigam won a Fellowship from the Alexander von Humboldt Scholarship after his Ph.D. studies. Alexis Saurin s thesis won the Prix de thèse de l Ecole Polytechnique and the Prix de thèse ASTI PARSIFALParsifal

361 X Équipe Sysmo (Sysmo) 361

362

363 X.1 Liste des membres : Sysmo X.1.1 X Liste actuelle des membres Membres permanents Nom Fonction Employeur HDR Arrivée Philippe Baptiste Directeur de recherche CNRS HDR Claudia d Ambrosio Chargée de recherche CNRS Daniel Krob Professeur École Polytechnique HDR Leo Liberti Professeur Chargé de Cours École Polytechnique HDR Antoine Rauzy Professeur, PCC Centrale-Supélec, École HDR Polytechnique Evelyne Rayssac Assistante Ecole Polytechnique David Savourey Ingénieur de recherche CNRS Sylvie Tonda-Goldstein Chargée d Affaire Ecole Polytechnique, 2004 DRIP Michalis Vazirgiannis Professeur École Polytechnique HDR Notes: Philippe Baptiste est affilié au LIX mais a été détaché auprès de la direction du CNRS. Il est au 30 juin 2013 détaché auprès du Ministère de la Recherche. Leo Liberti est depuis le 1er Janvier 2013 en congé sans solde et travaille chez IBM Research ( T.J. Watson research labs, Yorktown Heights, USA). Il reprendra service en Août Antoine Rauzy est au 30 juin 2013 Professeur à l Ecole Centrale, et Professeur Chargé de Cours à temps partiel à l Ecole Polytechnique. La DRIP est la Direction des Relations Industrielles et Partenariales de l École polytechnique. X Doctorants et postdoctorants Doctorants Nom Financement Arrivée Encadrant Nicolas Bonifas CIFRE Philippe Baptiste Dominik Kirchler CIFRE Leo Liberti Tatiana Prosvirnova EDX Antoine Rauzy Thomas Friedlhuber CIFRE Antoine Rauzy Vu Khac Ky Chaire OSD Leo Liberti Gustavo Dias Da Silva CNPq (Brésil) Leo Liberti Claire Lizon CIFRE Leo Liberti Claire Lucas HEC Montreal Leo Liberti Yann Hourdel Contrat doctoral ENS Lyon Daniel Krob Abraham Cherfi CIFRE Antoine Rauzy Pierre-Antoine Brameret ENS Cachan Antoine Rauzy François Rousseau DIGITEO Michalis Vazirgiannis Youcef Sahraoui CIFRE Claudia d Ambrosio Christos Giatsidis DIGITEO Michalis Vazirgiannis Fragiskos Malliaros Google Michalis Vazirgiannis Luca Mencarelli Projet Europeen Claudia d Ambrosio 363

364 364 CHAPTER X.1. LISTE DES MEMBRES : SYSMO Postdoctorants Nom Financement Dates Responsable Andrea Cassioli ANR Leo Liberti X Visiteurs et autres membres Autres Nom Fonction Financement Dates Youssef Hamadi Chercheur Microsoft Research Chaire OSD Leila Kloul MdC à l UVSQ X.1.2 Anciens membres X Membres permanents Nom Fonction Employeur HDR Départ Position actuelle Vincent Jost Chargé de recherche CNRS CR a G-SCOP X Doctorants et postdoctorants Doctorants Nom Financement Départ Encadrant Position actuelle Johanna Berrebi CIFRE Daniel Krob Ingénieur EADS Innovation & Works Fabio Roda CIFRE Leo Liberti Ingénieur-architecte à l institut C.E.S.A.M.E.S. Alberto Costa Digiteo Leo Liberti Postdoc à Singapore University of Technology and Design Abdelkrim Doufene CIFRE Daniel Krob Postdoc au MIT Boris Golden Monge Daniel Krob Chef de produit chez Viadeo Antoine Jeanjean CIFRE Philippe Baptiste Recommerce Solutions Giacomo Nannicini CIFRE Leo Liberti Associate Professor à Singapore University of Technology and Design Emilie Winter CIFRE Philippe Baptiste DGA

365 X.1.2. ANCIENS MEMBRES 365 Postdoctorants Nom Financement Dates Responsable Position actuelle Dimo Brockhoff Chaire OSD Leo Liberti CR INRIA Lille Alvaro Fialho Chaire OSD Youssef Hamadi chercheur au General Electric Global Research à Rio de Janeiro Hassan Hijazi CNRS Leo Liberti chercheur au NICTA à Camberra Nora Touati Chaire OSD Philippe Baptiste Enseingnante à l ESME- SUDRIA Antonio Mucherino IDF Leo Liberti MdC à l IRISA à Rennes Sonia Cafieri ANR Leo Liberti MdC à l ENAC à Toulouse Yann Hendel Microsoft Philippe Baptiste Consultant chez YKems Klaus Berberich Digiteo 2011 M. Vazirgiannis Postdoc au Max Planck Institut Dimitrios Thilikos Digiteo 2011 M. Vazirgiannis DR CNRS Vassilis Plachouras Digiteo 2011 M. Vazirgiannis Researcher at ATHENA Institute, Greece Mbarka Mabrouki DGA Antoine Rauzy non connu Michel Batteux DGA Antoine Rauzy Thales X Autres membres Visiteurs de longue durée Nom Financement Dates Invitant Pierre Hansen DIGITEO Leo Liberti Autres Nom Fonction Financement Dates Michel Batteux Chercher contractuel Valeo Antoine Rauzy

366 366 CHAPTER X.1. LISTE DES MEMBRES : SYSMO

367 X.2 Rapport scientifique : Sysmo X.2.1 Thématique générale et principaux objectifs X 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 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 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 g(x) 0, (X.2.1) where x R n, X R p Z q (with p + q = n), f : R n R, and g : R n R m. 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.

369 X.2.1. THÉMATIQUE GÉNÉ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 Séminaire Francilien de Sûreté 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 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 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 Exemples de résultats significatifs 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 370 CHAPTER X.2. RAPPORT SCIENTIFIQUE : SYSMO 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 Animation scientifique, rayonnement, prix et récompenses 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

371 X.2.1. THÉMATIQUE GÉNÉ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 comité 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: X 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: th 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) 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) PC member SIAM International Conference on Data Mining (SDM) PC member 2011 IEEE International Conference on Data Engineering (ICDE) 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 372 CHAPTER X.2. RAPPORT SCIENTIFIQUE : SYSMO X York, USA EDBT 2010 (13th International Conference on Extending Database Technology,Lausanne, Switzerland, Fonctionnement interne 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 Formation par la recherche We are involved with MPRI (Master Parisien en Recherche Informatique), are co-founders of the MPRO (Master Parisien en Recherche Operationnélle), and founded the COMASIC Master. We also teach undergraduate level courses at Polytechnique.

373 X.3 Projet de recherche : Sysmo X.3.1 Objectifs scientifiques X 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 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

374 374 CHAPTER X.3. PROJET DE RECHERCHE : SYSMO 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 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 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

375 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 376 CHAPTER X.3. PROJET DE RECHERCHE : SYSMO

377 X.4 Analyse AFOM : Sysmo INTERNE POSITIF Team expertise. Strong industrial connections, in particular through the two industrial chairs. An largely-open, exciting and industrially-key domain to explore Atouts Opportunit es A F O M Not enough permanent people to handle all research themes at stake Faiblesses Menaces The recent part-time involvement of D. Krob, current leave of absence of L. Liberti and future departure of SYSMO s team leader is strongly reducing the research capability of the team. Recruitment of permanent researchers in SysMo is now a strong need. NEGATIF EXTERNE Figure X.4.1: Analyse AFOM de l équipe Sysmo : Atouts, Faiblesses, Opportunités, Menaces 377

378 378 CHAPTER X.4. ANALYSE AFOM : SYSMO

379 X.5 Fiche résumé : Sysmo X.5.1 Membres 2013 : 1 chercheur (1 CNRS), 5 enseignants-chercheurs, 1 postdoc, 16 doctorants Départ de membres de l équipe Philippe Baptiste (Directeur de Recherche, CNRS) (from 2010) Christophe Dür (Directeur de Recherche, CNRS) (from 2010) Vincent Jost (Chargé de Recherche, CNRS) (from 2013) Antoine Rauzy, Professeur à Centrale-Supélec (from 2013), Nouveaux membres Claudia d Ambrosio, Chargée de recherche CNRS (from 2011), Michalis Vazirgiannis (Professeur at École Polytechnique (from 2011), Leila Kloul (Maître de conférence, UVSQ), (from 2012) X.5.2 Résultats scientifiques 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 Production scientifique X Publications Journaux : 91 Conférences internationales : 116 X 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 Actions de formation D. Krob created training to System Architecture for engineers. 379

380 380 CHAPTER X.5. FICHE RÉSUMÉ : SYSMO

381 X.6 Production scientifique : Sysmo X.6.1 Livres et chapitres de livres [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 Elsevier, ISBN [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, [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 Springer New York, [933] Pietro Belotti, Leo Liberti, Andrea Lodi, Giacomo Nannicini, and Andrea Tramontani. Disjunctive Inequalities: Applications And Extensions. John Wiley & Sons, Inc., [934] A. Bloch and Daniel Krob. Comment estimer la loi de diffusion d un nouveau produit? Proposition d un modèle de comportement client. In A. Bloch and S. Morin Delerm, editors, Innovation et création d entreprise, pages Editions ESKA, [935] P. Bonami, L. Liberti, A. Miller, and A. Sartenaer, editors. European Workshop on MINLP, 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, [939] C. D Ambrosio, J. Lee, and A. Wä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 Springer New York, [940] Daniel Krob. Eléments d architecture des systèmes complexes. In A. Appriou, editor, Gestion de la complexité et de l information dans les grands systèmes critiques, pages CNRS Editions, [941] Daniel Krob. Eléments de modélisation systémique. In R. Mossery and C. Jeandel, editors, L Energie à découvert, pages CNRS Editions, [942] Daniel Krob. Eléments de systémique - Architecture de systèmes. In A. Berthoz and J. L. Petit, editors, Complexité-Simplexité. Editions Odile Jacob, [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,

382 382 BIBLIOGRAPHY [944] L. Liberti. Symmetry in mathematical programming. In S. Leyffer and J. Lee, editors, Mixed Integer Nonlinear Programming. Springer, [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, [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, [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, [948] L. Liberti and E. Ortiz. Ottaviano fabrizio mossotti. In Dizionario Biografico degli Italiani, vol. 77. Istituto della Enciclopedia Italiana, [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 Springer Berlin Heidelberg, [950] G. Nannicini, G. Cornuéjols, M. Karamanov, and L. Liberti. Branching on split disjunctions. In V. Chvátal, editor, Combinatorial Optimization: Methods and Applications. IOS Press, [951] A. Rauzy. BDD for Reliability Studies. In K.B. Misra, editor, Handbook of Performability Engineering, pages Elsevier, ISBN [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, X.6.2 Édition de livres et de numéros spé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 Springer Verlag, [954] M. Aiguier, Y. Caseau, D. Krob, and A. Rauzy, editors. Proceedings of the Third International Conference on Complex Systems Design & Management CSD&M Springer Verlag, [955] P.J. Benghozi, D. Krob, and F. Rowe, editors. Proceedings of the First International Conference on Digital Enterprise Design & Management DED&M Springer Verlag, [956] P. Bonami, L. Liberti, A. Miller, and A. Sartenaer, editors. Proceedings of the European Workshop on MINLP, Marseille. [957] S. Cafieri, U. Faigle, and L. Liberti, editors. Graphs and Combinatorial Optimization, special issue of Discrete Applied Mathematics dedicated to the CTW09 Conference, 159(16): [958] S. Cafieri, L. Liberti, and F. Messine, editors. Toulouse Global Optimization Workshop 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, Paris.

383 X.6.3. DOCUMENTS PÉDAGOGIQUES 383 [960] S. Cafieri, B. Tóth, E. Hendrix, L. Liberti, and F. Messine, editors. Proceedings of the Toulouse Global Optimization Workshop, Toulouse. [961] D. Delling and L. Liberti, editors. 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization and Systems, 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 Springer Verlag, [963] L. Liberti and N. Maculan, editors. Reformulation Techniques in Mathematical Programming, 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, X.6.3 Documents pédagogiques [966] L. Liberti. C++ Notes. Ecole Polytechnique, pages. [967] L. Liberti. Data structures and algorithms. Ecole Polytechnique, pages. X.6.4 Revues internationales [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 [969] Daniel Aloise, Pierre Hansen, and Leo Liberti. An improved column generation algorithm for minimum sum-of-squares clustering. Mathematical Programming, 131(1 2): , [970] E. Amaldi, K. Dhyani, and L. Liberti. A two-phase heuristic for the bottleneck k- hyperplane 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: , [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): , November [973] Philippe Baptiste, Antoine Jouglet, and David Savourey. Lower bounds for parallel machine scheduling problems. International Journal of Operational Research, 3(6): , [974] P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wächter. Branching and bounds tightening techniques for non-convex minlp. Optimization Methods and Software, 24(4): , [975] A. Bettinelli, P. Hansen, and L. Liberti. Algorithm for parametric communities detection in networks. Physical Review E, Accepté. [976] Andrea Bettinelli, Leo Liberti, Franco Raimondi, and David Savourey. The anonymous subgraph problem. Computers & Operations Research, 2012.

384 384 BIBLIOGRAPHY [977] Simon Bliudze and Daniel Krob. Modelling of complex systems: Systems as dataflow machines. Fundam. Inform., 91(2): , [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: , [979] Nadia Brauner and Vincent Jost. Small deviations, JIT sequencing and symmetric case of fraenkel s conjecture. Discrete Mathematics, 308(11): , [980] M. Bruglieri and L. Liberti. Optimal running and planning of a biomass-based energy production process. Energy Policy, 36: , [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 [982] S. Cafieri, A. Costa, and P. Hansen. Reformulation of a model for hierarchical divisive graph modularity maximization. Annals of Operations Research, page À paraître, Accepté. [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, [984] S. Cafieri, P. Hansen, and L. Liberti. Edge ratio and community structure in networks. Physical Review E., 81(2):026105, 14 pages, [985] S. Cafieri, P. Hansen, and L. Liberti. Locally optimal heuristic for modularity maximization of networks. Physical Review E, 83(5):056105, May [986] S. Cafieri, P. Hansen, and L. Liberti. Improving heuristics for network modularity maximization using an exact algorithm. Discrete Applied Mathematics, page À paraître, Accepté. [987] S. Cafieri, J. Lee, and L. Liberti. On convex relaxations of quadrilinear terms. Journal of Global Optimization, 47: , [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): , [989] Denis Cornaz and Vincent Jost. A one-to-one correspondence between colorings and stable sets. Oper. Res. Lett., 36(6): , [990] G. Cornuéjols, L. Liberti, and G. Nannicini. Improved strategies for branching on general disjunctions. Mathematical Programming A, 130: , [991] A. Costa and P. Hansen. Comment on evolutionary method for finding communities in bipartite network. Physical Review E, 84(5):058101, [992] A. Costa and P. Hansen. A locally optimal hierarchical divisive heuristic for bipartite modularity maximization. Optimization Letters, page À paraître, Accepté. [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, [994] Alberto Costa, Leo Liberti, and Pierre Hansen. Formulation symmetries in circle packing. Electronic Notes in Discrete Mathematics, 36: , 2010.

385 BIBLIOGRAPHY 385 [995] C. D Ambrosio, A. Frangioni, L. Liberti, and A. Lodi. On interval subgradient and nogood cuts. Operations Research Letters, 38: , [996] C. D Ambrosio, A. Frangioni, L. Liberti, and A. Lodi. A storm of feasibility pumps for nonconvex minlp. Mathematical Programming, 136(2): , [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): , [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): , December [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): , [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 À paraître, Accepté. [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 András Sebö. Batch processing with interval graph compatibilities between tasks. Discrete Applied Mathematics, 156(5): , [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): , [1005] Christos Giatsidis, Dimitrios M. Thilikos, and Michalis Vazirgiannis. D-cores: measuring collaboration of directed graphs based on degeneracy. Knowl. Inf. Syst., 35(2): , [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): , [1007] Maria Halkidi, Diomidis Spinellis, George Tsatsaronis, and Michalis Vazirgiannis. Data mining in software engineering. Intell. Data Anal., 15(3): , [1008] Youssef Hamadi. Conclusion to the special issue on parallel SAT solving. JSAT, 6(4):263, [1009] Youssef Hamadi, Saïd Jabbour, Cédric Piette, and Lakhdar Sais. Deterministic parallel DPLL. JSAT, 7(4): , [1010] Youssef Hamadi, Saïd Jabbour, and Lakhdar Sais. ManySAT: a Parallel SAT Solver. JSAT, 6(4): , [1011] Youssef Hamadi, Saïd Jabbour, and Lakhdar Sais. Learning for dynamic subsumption. International Journal on Artificial Intelligence Tools, 19(4): , 2010.

386 386 BIBLIOGRAPHY [1012] Youssef Hamadi, Saïd Jabbour, and Lakhdar Sais. Learning from conflicts in propositional satisfiability. 4OR, 10(1):15 32, [1013] Youssef Hamadi and Georg Ringwelski. Boosting distributed constraint satisfaction. J. Heuristics, 17(3): , [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, [1015] P. Hansen and C. Lucas. Bounds and conjectures for the signless laplacian index of graphs. Linear Algebra and its Applications, 432(12): , [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, [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, [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): , [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): , [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, [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: , [1022] C. Lavor, L. Liberti, N. Maculan, and A. Mucherino. The discretizable molecular distance geometry problem. Computational Optimization and Applications, 52: , [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: , [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, [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: , [1027] J. Lee and L. Liberti. A matroid view of key theorems for edge-swapping algorithms. Mathematical Methods of Operations Research, 76: , [1028] L. Liberti. Spherical cuts for integer programming problems. International Transactions in Operational Research, 15: , 2008.

387 BIBLIOGRAPHY 387 [1029] L. Liberti. Reformulations in mathematical programming: Definitions and systematics. RAIRO-RO, 43(1):55 86, [1030] L. Liberti. Reformulations in mathematical programming: Automatic symmetry detection and exploitation. Mathematical Programming A, 131: , [1031] L. Liberti, L. Alfandari, and M.-C. Plateau. Edge cover by connected bipartite subgraphs. Annals of Operations Research, 188(1): , [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, [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: , [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): , [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, [1037] L. Liberti, N. Maculan, and Y. Zhang. Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem. Optimization Letters, 3: , [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. Mladenović, and G. Nannicini. A recipe for finding good solutions to minlps. Mathematical Programming Computation, 3: , [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, [1042] Fragkiskos D. Malliaros and Michalis Vazirgiannis. Clustering and community detection in directed networks: A survey. Physics Reports, (To appear). [1043] A. Mucherino, C. Lavor, and L. Liberti. The discretizable distance geometry problem. Optimization Letters, 6(8): , [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): (15), [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): , 2008.

388 388 BIBLIOGRAPHY [1046] G. Nannicini, D. Delling, and D. Schultes. Bidirectional a search on time-dependent road networks. Networks, 59(2): , [1047] G. Nannicini and L. Liberti. Shortest paths on dynamic graphs. International Transactions in Operations Research, 15: , [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): , [1049] C. Ibà nez Llano, A. Rauzy, E. Melé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): , [1050] C. Ibà nez Llano, A. Rauzy, E. Melé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): , [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, [1052] A. Rauzy. Guarded transition systems: a new states/events formalism for reliability studies. Journal of Risk and Reliability, 222(4): , [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): , [1054] A. Rauzy. Sequence algebra, sequence decision diagrams and dynamic fault trees. Reliability Engineering and System Safety, 96(7): , [1055] Nikos Salamanos and Michalis Vazirgiannis. Diffusion of information and phase transition in the fisher market. IJKL, 8(3/4): , [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: , [1057] H. Sherali, E. Dalkiran, and L. Liberti. Reduced rlt representations for nonconvex polynomial programming problems. Journal of Global Optimization, 52: , [1058] Christoph M. Wintersteiger, Youssef Hamadi, and Leonardo Mendonça de Moura. Efficiently solving quantified bit-vector formulas. Formal Methods in System Design, 42(1):3 23, 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): , X.6.6 Conférences internationales [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.

389 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, [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 DI- MACS Implementation Challenge - Graph Partitioning and Graph Clustering, pages , February [1063] Nicolas Anciaux, Walid Bezza, Benjamin Nguyen, and Michalis Vazirgiannis. Minexpcard: limiting data collection using a smart card. In EDBT, pages , [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, [1065] Alejandro Arbelaez and Youssef Hamadi. Exploiting weak dependencies in tree-based search. In Symposium on Applied Computing, pages , [1066] Alejandro Arbelaez and Youssef Hamadi. Improving parallel local search for sat. In LION, pages 46 60, [1067] Alejandro Arbelaez, Youssef Hamadi, and Michèle Sebag. Continuous search in constraint programming. In ICTAI (1), pages 53 60, [1068] Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, and Lakhdar Sais. A generalized framework for conflict analysis. In SAT, pages 21 27, [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, 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 9 th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pages University of Köln, [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, [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), pages, INCOSE, [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 8 th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pages , Paris, École Polytechnique. [1074] Lucas Bordeaux, Youssef Hamadi, and Horst Samulowitz. Experiments with massively parallel constraint solving. In IJCAI, pages , [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 , 2011.

390 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, [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 , Hong Kong, Global-Link Publishers. [1078] S. Cafieri, L. Liberti, F. Messine, and B. Nogarède. Discussion about formulations and resolution techniques of electrical machine design problems. In Proceedings of the XIX International Conference on Electrical Machines. IEEE, [1079] Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, and Frédé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 Springer. [1080] G. Cornué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 8 th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pages , Paris, É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 , Amsterdam, Elsevier. [1082] A. Costa, P. Hansen, and L. Liberti. Static symmetry breaking in circle packing. In U. Faigle, editor, Proceedings of the 9 th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pages University of Köln, [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, Università 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, 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 , Marseille, France, avril [1086] A. Costa, L. Liberti, and P. Hansen. Formulation symmetries in circle packing. In ISCO Proceedings, Electronic Notes in Discrete Mathematics, volume 36, pages , [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, [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 , Villa Mondragone, Frascati, Italy, June [1089] C. D Ambrosio and C. Buchheim. A fast exact method for box constrained polynomial optimization. In ECCO 2013, France, May 2013.

391 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, 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 [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 [1093] Claudia D Ambrosio, Andrea Lodi, Silvano Martello, and Riccardo Rovatti. Optimistically Approximating Non-linear Optimization Problems through MILP. In EURO 2012, Lithuania, July [1094] A. Dauron, Abdelkrim Doufè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), pages, Paris, France, [1095] D. Delling and G. Nannicini. Bidirectional core-based routing in dynamic timedependent road networks. In Algorithms and Computation, volume 5369 of LNCS, pages , New York, 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, Springer. [1097] Abdelkrim Doufène, H. G. Chalé 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 Springer Verlag, [1098] Abdelkrim Doufè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), [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 Seatle, USA (also in E. Fadier ed., Actes du congrès LambdaMu 10). [1100] Álvaro Fialho, Youssef Hamadi, and Marc Schoenauer. Optimizing architectural and structural aspects of buildings towards higher energy efficiency. In GECCO (Companion), pages , [1101] Álvaro Fialho, Youssef Hamadi, and Marc Schoenauer. A multi-objective approach to balance buildings construction cost and energy efficiency. In ECAI, pages , [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 York, Springer. [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 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 Springer Verlag, Paris, France, [1105] Christos Giatsidis, Klaus Berberich, Dimitrios M. Thilikos, and Michalis Vazirgiannis. Visual exploration of collaboration networks based on graph degeneracy. In KDD, pages , [1106] Christos Giatsidis, Fragkiskos D. Malliaros, and Michalis Vazirgiannis. Advanced graph mining for community evaluation in social networks and the web. In WSDM, pages , [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, (Tutorial). [1108] Christos Giatsidis, Dimitrios M. Thilikos, and Michalis Vazirgiannis. D-cores: Measuring collaboration of directed graphs based on degeneracy. In ICDM, pages , [1109] Christos Giatsidis, Dimitrios M. Thilikos, and Michalis Vazirgiannis. Evaluating cooperation in communities with the k-core structure. In ASONAM, pages 87 93, [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), pages, Paris, France, [1111] E. Goubault, S. Le Roux, J. Leconte, L. Liberti, and F. Marinelli. Static analysis by abstract interpretation: a mathematical programming approach. In A. Miné and E. Rodriguez- Carbonell, editors, Proceeding of the Second International Workshop on Numerical and Symbolic Abstract Domains, volume 267(1) of Electronic Notes in Theoretical Computer Science, pages Elsevier, [1112] Long Guo, Youssef Hamadi, Saïd Jabbour, and Lakhdar Sais. Diversification and intensification in parallel sat solving. In CP, pages , [1113] Youssef Hamadi, Saïd Jabbour, and Lakhdar Sais. Control-based clause sharing in parallel sat solving. In IJCAI, pages , [1114] Youssef Hamadi, Saïd Jabbour, and Lakhdar Sais. Learning for dynamic subsumption. In ICTAI, pages , [1115] Youssef Hamadi, Jo ao Marques-Silva, and Christoph M. Wintersteiger. Lazy decomposition for distributed decision procedures. In PDMC, pages 43 54, [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, [1117] Youssef Hamadi and Christoph M. Wintersteiger. Seven challenges in parallel SAT solving. In AAAI, [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 [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.

393 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 IEEE, [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, [1122] L. Iwaza, M. Kieffer, L. Liberti, and K. Al-Agha. Joint decoding of multiple-description network-coded data. In Network Coding. IEEE, [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, [1124] Margarita Karkali, Dimitris Pontikis, and Michalis Vazirgiannis. Match the news: a firefox extension for real-time news recommendation. In SIGIR, (To appear). [1125] Margarita Karkali and Michalis Vazirgiannis. S-suite: a multipart service oriented architecture for the car rental sector. In BCI, pages , [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 , Heidelberg, 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, [1128] Daniel Krob. Comment sécuriser la conception et le déploiement des logiciels métiers par une démarche d architecture collaborative? In Journée Française des Tests Logiciels, pages, CFTL [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 , Washington D.C., USA, 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 , Mragowo, Poland, 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, [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 (CO- COA08), volume 5165 of LNCS, pages , Berlin, 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, München, Universitä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 , New York, Springer.

394 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, 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, Università 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 , New York, Springer. [1138] L. Liberti, N. Mladenović, and G. Nannicini. A good recipe for solving MINLPs. In V. Maniezzo, T. Stützle, and S. Voß, editors, Hybridizing metaheuristics and mathematical programming, volume 10 of Annals of Information Systems, pages , New York, 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 , Amsterdam, 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, 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 , Leuven, Belgium, [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 , [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 IEEE, [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, 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, 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 8 th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pages , Paris, É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 , Berlin, Springer.

395 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 , New York, 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 , Montreal, 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 , Berlin, 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 , New York, 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 , [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, Hong Kong. [1154] C. Iba nez Llano, A. Rauzy, E. Melé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, [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 [1156] Cédric Piette, Youssef Hamadi, and Lakhdar Sais. Vivifying propositional clausal formulae. In ECAI, pages , [1157] Cédric Piette, Youssef Hamadi, and Lakhdar Sais. Efficient combination of decision procedures for mus computation. In FroCoS, pages , [1158] Vassilis Plachouras, Matthieu Rivière, and Michalis Vazirgiannis. Named entity recognition and identification for finding the owner of a home page. In PAKDD (1), pages , [1159] Michalis Rallis and Michalis Vazirgiannis. Rank prediction in graphs with locally weighted polynomial regression and em of polynomial mixture models. In ASONAM, pages , [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 [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 , Rome, Università 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 8 th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pages , Paris, École Polytechnique.

396 396 BIBLIOGRAPHY [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 , Villa Mondragone, Frascati, Italy, June [1164] Francois Rousseau and Michalis Vazirgiannis. Composition of tf normalizations: new insights on scoring functions for ad hoc ir. In SIGIR, (To appear). [1165] Nikos Salamanos, Elli Voudigari, Theodore Papageorgiou, and Michalis Vazirgiannis. Discovering correlation between communities and likes in facebook. In GreenCom, pages , [1166] Stamatina Thomaidou, Konstantinos Leymonis, Kyriakos Liakopoulos, and Michalis Vazirgiannis. Ad-mad: Automated development and optimization of online advertising campaigns. In ICDM Workshops, pages , [1167] Stamatina Thomaidou and Michalis Vazirgiannis. Multiword keyword recommendation system for online advertising. In ASONAM, pages , [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 , [1169] Jérémie Vautard, Arnaud Lallouet, and Youssef Hamadi. A parallel solving algorithm for quantified constraints problems. In ICTAI (1), pages , [1170] Michalis Vazirgiannis. Advanced graph mining and community evaluation metrics for social networks and the web. In ASONAM, (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, [1172] Elli Voudigari, John Pavlopoulos, and Michalis Vazirgiannis. A framework for web page rank prediction. In EANN/AIAI (2), pages , [1173] Ariel Waserhole, Vincent Jost, and Nadia Brauner. Pricing for vehicle sharing using densest oriented subgraph in markov chains. In ECCO, Amsterdam, Hollande, [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 , [1175] Christoph M. Wintersteiger, Youssef Hamadi, and Leonardo Mendonça de Moura. A concurrent portfolio approach to smt solving. In CAV, pages , [1176] Christoph M. Wintersteiger, Youssef Hamadi, and Leonardo Mendonça de Moura. Efficiently solving quantified bit-vector formulas. In FMCAD, pages , [1177] Boyan Yordanov, Christoph M. Wintersteiger, Youssef Hamadi, and Hillel Kugler. Smtbased analysis of biological computation. In NASA Formal Methods, pages 78 92, X.6.7 Conférences nationales [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, février 2010.

397 BIBLIOGRAPHY 397 [1179] E. Arbaretier, Z. Brick, and A. Rauzy. Sûreté de fonctionnement et analyse de performances. In A. Lannoy, editor, Actes du congrès LambdaMu 16 (actes électroniques), October 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 Congrès Lambda-Mu 18, Octobre [1181] S. Cafieri and P. Hansen. Modularity clustering on trees. In Proceedings of ROADEF 2012, Angers, France, avril [1182] S. Cafieri, P. Hansen, and L. Liberti. Reformulations between structured global optimization problems and algorithms. In Proceedings of ROADEF 2009, Nancy, France, février [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 [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 [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 [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 [1187] C. Dupart, P. Morel, A. Rauzy, and P. Thomas. Allocation de disponibilité avec Aralia. In E. Fadier, editor, Actes du congrès LambdaMu 17 (actes électroniques), October [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, pages, Presses Universitaires de l Université Blaise Pascal, Clermont- Ferrand, [1189] B. Perrot, T. Prosvirnova, A. Rauzy, and J.-P. Sahut d Izarn. Arbres de défaillance dynamiques : une bibliothèque pour la nouvelle génération d altarica. In E. Fadier, editor, Actes du congrès LambdaMu 17 (actes électroniques). IMdR, October [1190] B. Perrot, T. Prosvirnova, A. Rauzy, and J.-P. Sahut d Izarn. Introduction au nouveau langage pour la sûreté de fonctionnement : Altarica nouvelle génération. In E. Fadier, editor, Actes du congrès LambdaMu 17 (actes électroniques). IMdR, October [1191] B. Perrot, T. Prosvirnova, A. Rauzy, J.-P. Sahut d Izarn, and R. Schoening. Expériences de couplages de modèles AltaRica avec des interfaces métiers. In E. Fadier, editor, Actes du congrès LambdaMu 17 (actes électroniques). IMdR, October [1192] T. Prosvirnova and A. Rauzy. Modélisation des systèmes avec des composants mobiles en AltaRica. In J.F. Barbet, editor, Actes du Congrès Lambda-Mu 18, Octobre [1193] T. Prosvirnova and A. Rauzy. Système de transitions gardées : formalisme pivot de modélisation pour la sûreté de fonctionnement. In J.F. Barbet, editor, Actes du Congrès Lambda-Mu 18, Octobre [1194] A. Rauzy. Diagrammes binaires de décision pondérés : vieilles idées, nouvelle mise en œuvre. In E. Fadier, editor, Actes du congrès LambdaMu 17 (actes électroniques), October 2010.

398 398 BIBLIOGRAPHY [1195] A. Rauzy. Xfta: Pour que cent arbres de défaillance fleurissent au printemps. In J.F. Barbet, editor, Actes du Congrès Lambda-Mu 18, Octobre [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 [1197] L. Liberti. Distance geometry (plenary), [1198] L. Liberti. Symmetry in mathematical programming (plenary), [1199] L. Liberti. Distance geometry (plenary), [1200] L. Liberti. Symétrie en programmation mathématique (tutorial), [1201] L. Liberti. Combinatorial distance geometry (plenary), [1202] L. Liberti. Molecular distance geometry (tutorial), [1203] L. Liberti. Optimization and sustainable development (plenary), [1204] L. Liberti. Symmetry in mathematical programming (plenary), [1205] L. Liberti. Symmetry in mathematical programming (tutorial), [1206] L. Liberti. History of distance geometry (plenary), X.6.8 Brevets [1207] L. Liberti, G. Barbier, Ph. Baptiste, and D. Krob. Estimation de trafic dans un réseau routier. Technical Report Brevet n o , European Patent Office, Aug [1208] A. Rauzy. Xfta. Technical report, Software Protection (APP), [1209] M. Thomaidou and M. Vazirgiannis. AD-MAD softwarer: automated web advertising. Technical Report Inter Deposit Digital Number IDDN.FR S.P , Software Protection (APP), Aug 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), X.6.10 Thèses [1211] J. Berrebi. Contribution à l intégration d une liaison avionique sans fil L ingénierie système appliquée à une problématique industrielle. PhD thesis, Ecole Polytechnique, [1212] A. Costa. Applications of reformulations in mathematical programming. PhD thesis, Ecole Polytechnique, [1213] Douffene. Architecture des systèmes complexes et optimisation Application aux véhicules électriques. PhD thesis, Ecole Polytechnique, [1214] B. Golden. A unified formalism for complex systems architecture. PhD thesis, Ecole Polytechnique, 2013.

399 BIBLIOGRAPHY 399 [1215] G. Nannicini. Point-to-point shortest paths on dynamic time-dependent road networks. PhD thesis, Ecole Polytechnique, [1216] F. Roda. Integrating high-level requirements in optimization problems: theory and applications. PhD thesis, Ecole Polytechnique, [1217] E. Winter. Des outils d optimisation combinatoire et d ordonnancement pour la gestion des radars embarqués. PhD thesis, Ecole Polytechnique, 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 école polytechnique - LIX, November X.6.12 Autres [1219] Y. Hamadi and L. Liberti. Microsoft-cnrs optimization and sustainable development polytechnique chair: activity report for , MSR-TR [1220] Youssef Hamadi, Saïd Jabbour, and Lakhdar Sais. Learning for dynamic subsumption. CoRR, abs/ , [1221] Guyslain Naves and Vincent Jost. The graphs with the max-mader-flow-min-multiwaycut property. Preprint, 2010, [1222] A. Rauzy. A sound semantics for dynamic fault trees. Unpublished yet., [1223] A. Rauzy. Probabilistic risk assessment: Mathematical and algorithmic challenges. Notes from the invited talk given at ESREL2012/PSAM11, to appear in ESRA NewsLetter, [1224] Stamatina Thomaidou, Michalis Vazirgiannis, and Kyriakos Liakopoulos. Toward an integrated framework for automated development and optimization of online advertising campaigns. CoRR, abs/ , [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, [1227] Ariel Waserhole and Vincent Jost. Vehicle Sharing System Pricing Regulation: Transit Optimization of Intractable Queuing Network. Preprint, November 2012, archives-ouvertes.fr/hal [1228] Ariel Waserhole, Vincent Jost, and Nadia Brauner. Vehicle Sharing System Optimization: Scenario-based approach. Preprint, August 2012, hal

400 400 BIBLIOGRAPHY

401 X.7 Annexes : Sysmo Leo Liberti est membre du comité d evaluation pour le European Doctoral Dissertation Award (EDDA) (période 2013). est membre de la fondation COIN-OR (période 2012-). est vice president du département d enseignement (période ). est co-responsable de la Chaire Microsoft-CNRS Optimisation et Dévéloppement Durable (période 2010-). est responsable d équipe (System Modelling and Optimization SYSMO) (période ). est éditeur associé de Computational Management Science (période 2011-). est éditeur associé de EURO Journal of Computational Optimization (période 2012-). est éditeur en chef de 4OR (période 2010-). est membre du comité éditorial de Discrete Applied Mathematics (période 2010-). Daniel Krob est responsable de la chaire Ecole Polytechnique ENSTA ParisTech Telecom Paris- Tech Dassault Aviation DCNS DGA Thales Ingénierie des systèmes complexes (période 2008-). est membre de l advisory committee de la chaire Optimisation et Développement Durable Ecole Polytechnique-Microsoft (période 2009-). a été membre du groupe de travail 1 (Computational Models) d Allistène (période 2010). a été membre représentant l Ecole Polytechnique pendant deux ans du Comité de Pilotage du réseau thématique de recherche avancée (RTRA) Digiteo (période ). a été membre du comité international de normalisation ISO/TC 184/SC 5 Study Group to Explore OPM for Modeling Standards dédié à la définition du standard Object-Process Methodology (OPM) de modélisation systémique (période ). est membre fondateur de l association Omega Alpha (période 2008-). est président de l association C.E.S.A.M.E.S. (Centre d Excellence Sur l Architecture, le Management et l Economie des Systèmes (période 2009-). a été vice-président pendant 4 ans du club Systèmes complexes de la Société de l Electricité, de l Electronique et des Technologies de l Information et de la Communication (SEE) (période ). David Savourey est le représentant de l École Polytechnique dans le bureau du Master Parisien de Recherche Opérationnelle (période 2012-). Pierre Hansen est professeur titulaire à HEC Montréal (période 1991-). est titulaire de la Chaire d exploitation des données de HEC Montréal (période ). 401

402 402 CHAPTER X.7. ANNEXES : SYSMO X Responsabilités de projets internationaux Optimality for Tough Combinatorial Hydro Valley Problems ( ) (Type: Projet Programme Gaspard Monge pour l Optimisation) Titre: Optimisation vallées Hydrauliqueshttp: // dambrosio/ PGMO.php. Partenaires: LIX, EdF, Università di Pisa, CNR (Italie), LIPN (Paris 13). Responsable: Claudia d Ambrosio. Montant de la collaboration pour le LIX: euros. MINO ( ) (Type: Marie-Curie ITN) Titre: Programmation mathématique nonliné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 ( ) (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 pro- vided 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: euros. OSD ( ) (Type: Chaire Microsoft pour le Dévé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: euros. DGA ( ) (Type: Financement de la Direction Générale de l Armement) Titre: Modélisation de systèmes de systèmes. Responsable: Daniel Krob. Montant de la collaboration pour le LIX: euros. DGA ( ) (Type: Financement de la Direction Générale de l Armement) Titre: Validation de systèmes de systèmes. Responsable: Daniel Krob. Montant de la collaboration pour le LIX: euros. X Responsabilités de projets nationaux Chip2Grid ( ) (Type: Projet ADEME) Titre: Smart Grids. Un consortium d industriels, d écoles et d universitaires a été constitué afin de bâtir, ensemble, un projet démonstrateur dénommé Chip2Grid dont l objet principal est de concevoir, développer, installer et tester l ensemble des composants constituant une chaîne de communication complète full CPL G3 des compteurs jusqu aux postes sources d ERDF et s appuyant sur des ruptures technologiques (système-sur-puce, coupleurs HTA et capteurs intégrés) offrant des performances supérieures à l état de l art actuel (performances de communication) particulièrement pour le pilotage temps réel des réseaux électriques intelligents. Tache de l equipe LIX: le probleme de positionnement

403 403 des concentrateurs de reseau. Responsable: Leo Liberti. Montant de la collaboration pour le LIX: euros. Bip:Bip ( ) (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: euros. IFPen ( ) (Type: Thèse) Titre: techniques MINLP boîte-noire appliqués aux problèmes d ingenierie des reservoirs. Optimisation non lineéaire mixte en variables entières et réeelles: application au problême de placement des puits en ingénierie de réservoir (contrat d accompagnement d une these industrielle). Partenaires: Lix et IFPen. Responsable: Leo Liberti. Montant de la collaboration pour le LIX: euros. Mediamobile ( ) (Type: Thèse CIFRE) Titre: Calcul de plus courts chemins multimodaux sur des réseaux routiers dynamiques. L objectif du projet consiste à concevoir et à comparer des algorithmes rapides de recherche de plus courts chemins multimodaux dans des graphes structurés à dynamique aléatoire (contrat d accompagnement d une these CIFRE avec Mediamobile). Partenaires: Lix et Mediamobile. Responsable: Leo Liberti. Montant de la collaboration pour le LIX: 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 ( ) (Type: Emergence Digiteo) Titre: Reformulations en programmation mathé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: euros. CTW09 (2009) (Type: Support Digiteo) Titre: Confé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 ( ) (Type: Chaire Senior ) Titre: Reformulations en programmation mathé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 404 CHAPTER X.7. ANNEXES : SYSMO 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: euros. ASOPT ( ) (Type: Projet ANR) Titre: Vé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: euros (5 partenaires). PASO ( ) (Type: Projet Digiteo Emergence) Titre: Vérification logicielle. La proposition PASO (Preuve, Analyse Statique et Optimisation) s inscrit dans le thème 1 Maitrise du logiciel, en se proposant de réunir cinqé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 propriétés numériques de programmes, issus en particulier de la modélisation de systèmes complexes critiques pour la sécurité. 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 explorées. Il fédère ainsi 3 équipes d informaticiens et 2 equipes d automaticiens. Responsable: Leo Liberti. Montant de la collaboration pour le LIX: euros (4 partenaires). FLUCTUAT ( ) (Type: Projet Digiteo OMTE) Titre: Vérification logicielle. Projet de maturation technico-economique. FLUCTUAT est un analyseur statique de code source C par interprétation abstraite, qui a été développé originellement par MeASI (CEA LIST), depuis environ 7 ans. FLUCTUAT intéresse dorénavant de nombreux industriels (Airbus, Dassault-Aviation, Esterel etc.). FLUCTUAT est livré sur site, et utilisé, chez certains de ces industriels. Malgré tout, FLUCTUAT reste un prototype pré-industriel, et demande encore un certain investissement afin de pouvoir être transféré plus complètement (éditeur et industriels). Responsable: Leo Liberti. Montant de la collaboration pour le LIX: euros (2 partenaires). Digiteo Visiting Professor ( ) 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, Bré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.. Responsable: Leo Liberti. CNRS Visting Professor (2009) Titre: 3 mois de salaire pour Carlile Lavor (UniCamps, Bré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.. Responsable: Leo Liberti. X Participation à des projets internationaux MINO ( ) (Type: Marie Curie Initial Training Network (EU project) eu/domains_actions/ict/actions/td1207) Titre: Mixed Integer Nonlinear Optimizationhttp: // Responsable: Andrea Lodi (U. Bologna, Italie). Montant de la collaboration pour le LIX: roughly euros (on a total of euros).

405 X.7.1. ADMINISTRATION DE LA RECHERCHE 405 EU COST Action TD1207 ( ) (Type: EU COST Actionhttp:// 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 ( ) (Type: Thème Optimisation et modélisation) Titre: Projet europé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: euros. X Participation à des projets nationaux ATOMIC ( ) (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 euros managed by ENAC). Projet ModRival ( ) (Type: Thème MoDriVal du projet Usine Logicielle) Titre: Nouveaux modèles pour les systèmes complexes. Partenaires: LIX et pôle de compétitivité System@tic. Responsable: Daniel Krob. Montant de la collaboration pour le LIX: euros. X Participation à des projets locaux Convention Cifre ( ) Titre: Thèse de G. Nannicini. Partenaires: Convention avec Mediamobile. Responsable: Daniel Krob. Montant de la collaboration pour le LIX: euros. Convention Cifre ( ) Titre: Thèse de A. Douffène. Partenaires: Convention avec Renault. Responsable: Daniel Krob. Montant de la collaboration pour le LIX: euros. Convention Cifre ( ) Titre: Thèse de J. Berrebi. Partenaires: Convention avec EADS Innovation Works. Responsable: Daniel Krob. Montant de la collaboration pour le LIX: euros. Contrat MINEFI - IGPDE ( ) Titre: Formation professionnelle continue. Partenaires: Conception, déploiement et animation d une formation à l urbanisation des systèmes d information. Responsable: Daniel Krob. Montant de la collaboration pour le LIX: euros. Chaire Ingénierie des systèmes complexes ( ) Titre: Convention de mécenat. Partenaires: Développement des activités d enseignement et de recherche en ingénierie systèmehttp: // Responsable: Daniel Krob. Montant de la collaboration pour le LIX: euros. X.7.1 X Administration de la recherche Activités éditoriales Membres de comités éditoriaux Computational Management Science (Springer) Leo Liberti (2011-). Voir.

406 406 CHAPTER X.7. ANNEXES : SYSMO 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 Intelligent Data Analysis, An International Journal (IOS Press) Michalis Vazirgiannis (2002-). Voir Machine Learning (Springer) Michalis Vazirgiannis (2011). Voir com/computer/ai/journal/ Data Mining and Knowledge Discovery (Springer) Michalis Vazirgiannis (2011). Voir journal/ 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 com/journal/357. top (Springer) Pierre Hansen (2007-). Voir applicable analysis and discrete mathematics (University of Belgrade and Academic Mind) Pierre Hansen ( ). Voir computer science and information systems (ComSIS consortium) Pierre Hansen (2005-). Voir ejor, european journal of operational research (Elsevier) Pierre Hansen ( ). Voir international game theory review (Worls Scientific) Pierre Hansen (1998-). Voir www. worldscientific.com/worldscinet/igtr. journal of heuristics (Springer) Pierre Hansen (1995-). Voir journal/ yujor, yugoslav journal of operations research ( ) Pierre Hansen (1991-). Voir fon.bg.ac.rs/index.php/journal. rairo, recherche opérationnelle (Cambridge university Press) Pierre Hansen (1991-). Voir. annals of operations research (Springer) Pierre Hansen (1984-). Voir com/journal/ discrete applied mathematics (Elsevier) Pierre Hansen (1979-). Voir elsevier.com/discrete-applied-mathematics/.

407 X.7.1. ADMINISTRATION DE LA RECHERCHE 407 Edition de numéros spéciaux Discrete Applied Mathematics (Reformulation techniques in Mathematical Programming) Leo Liberti avec Nelson Maculan X Gestion scientifique de conférences Présidence de comités de pilotage CSDM (Complex Systems Design and Management) (2009-). Daniel Krob. DEDM (Digital Enterprise Design and Management) (2012-). Daniel Krob. Participation à des comités de pilotage 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 été Systèmes de systèmes de la Direction Géné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 ) ( ). Michalis Vazirgiannis. Présidence de comités de programme 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. Participation à des comités de programme 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 408 CHAPTER X.7. ANNEXES : SYSMO 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. (Comité de programme de Digiteo) ( ). Leo Liberti. UML-AADL (6-ième workshop IEEE UML and AADL 2011, Las Vegas, USA) (2011). Daniel Krob. ICECCS 2011 (16-ième confé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) (2013). Michalis Vazirgiannis. WWW (22nd International World Wide Web Conference (WWW) - Web Mining Track) (2013). Michalis Vazirgiannis. 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) (2012). Michalis Vazirgiannis. 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). Vazirgiannis. Michalis 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.

409 X.7.1. ADMINISTRATION DE LA RECHERCHE 409 X Organisation d événements scientifiques Présidence de comités d organisation MATHEU (Third Matheuristics 2010) (2010). Pierre Hansen. MATHEU (Second Matheuristics 2008) (2008). Pierre Hansen. EXDO (École d été 2008 sur les progrès de l exploitation de donné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. CSDM 2011 (Complex Systems Design and Management 2011) (2011). Daniel Krob. CSDM 2012 (Complex Systems Design and Management 2011) (2012). Daniel Krob. ICECCS 2012 (Dix-septième conférence IEEE International Conference on Complex Computer Systems (ICECCS 2012), Ecole Normale Supérieure) (2012). Daniel Krob. CSDM 2013 (Complex Systems Design and Management 2011) (2013). 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. Participation à des comités d organisation Organization of the workshop Pretty Structures 2011 (IHP, Paris, May 2011, with J. Edmonds) é (période p). riode 2011). Conf2010Organisation de la sixième journée Optimeo (Paris, mars 2010) Comité d organisation de la conférence internationale CSDM 2010 é (période p). riode 2010). Conf2008Organisation de la première journée Optimeo 2008

410 410 CHAPTER X.7. ANNEXES : SYSMO X Participation à des comités et jurys scientifiques Au niveau international Au niveau national DGA ( ) Daniel Krob. Président du Comité d évaluation de l activité Architecture et évaluation des systèmes de systèmes de la Direction Générale de l Armement. ONERA ( ) Daniel Krob. Président du Comité d évaluation et d orientation du département Traitement de l information et modélisation de l ONERA. SystemX (2013-) Daniel Krob. Membre du Comité de Programme Systèmes de systèmes Institut de Recherche Technologique SystemX. Commission de sélection Université de Rennes (Leo Liberti) 2011 Université de Paris UMPC (Leo Liberti) Université de Paris Sud (Leo Liberti) Département d informatique de l Ecole Polytechnique (Daniel Krob) Ecole Centrale de Paris - 27-ième section (Daniel Krob) 2011 Département d informatique de l Ecole Polytechnique (David Savourey) X.7.2 X Activités de formation, encadrement et évaluation Liste des thèses et HDR soutenues Habilitations à dirigers les recherches Thèses de doctorat G. Nannicini (2009). Point-to-point shortest paths on dynamic time-dependent road networks. Encadrant: Leo Liberti et Daniel Krob. Encad- A. Costa (2012). Applications of reformulations in mathematical programming. rant: Leo Liberti. F. Roda (2013). Integrating high-level requirements in optimization problems: theory and applications. Encadrant: Leo Liberti. J. Berrebi (21 Février 2013). Contribution à l intégration d une liaison avionique sans fil L ingénierie système appliquée à une problématique industrielle. Encadrant: Daniel Krob. A. Douffène (5 Mars 2013). Architecture des systèmes complexes et optimisation Application aux véhicules é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 embarqués. Encadrant: Philippe Baptiste.

411 X.7.2. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION 411 X Liste de rapports de thèses et HDR Rapports d habilitations à dirigers les recherches Rapports de thè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 premières et optimisation des graphes décomposables. Université d Amiens. Rapporteur: Daniel Krob. Alexandre Borghi (Octobre 2011). 11. Daniel Krob Thèse d Université. Rapporteur: Université Paris Sud X Enseignements dispensés Cours universitaires en M2 Programmation Mathématique Avancée (PMA) au Master Parisien de Recherche Opérationnelle (MPRO) Programmation Mathématique Avancée. Donné a l MPRO, CNAM. 15 étudiants. Amphis: 8h. Niveau: M2. Recherche Operationnelle et Développement Durable. Donné a l MPRO, CNAM. 15 étudiants. Amphis: 8h. Niveau: M2. Ordonnancement, programmation linéaire et problèmes de flots. Donné à l Université Paris VI pour le Master Parisien en Recherche Informatique (MPRI), 2 fois, avec C. Dürr et Ph. Baptiste. 35 étudiants. Amphis: 8 heures. Niveau: M2. Année 2008/2009 : Introduction aux systèmes industriels complexes, Master Ingénierie des systèmes industriels complexes, Ecole Polytechnique, INSTN, Université Paris Sud Eléments d architecture logicielle, Cycle C, Conservatoire National des Arts et Métiers Année 2009/2010 : Introduction aux systèmes industriels complexes, Master Conception et management des systèmes informatiques complexes, Ecole Centrale de Paris, Ecole Polytechnique, Ecole Supérieure d Electricité, INSTN, Télécoms Paristech, Université Paris Sud Année 2010/2011 : Eléments d architecture des systèmes complexes, Master Conception et management des systèmes informatiques complexes, Ecole Centrale de Paris, Ecole Polytechnique, Ecole Supérieure d Electricité, INSTN, Télécoms Paristech, Université Paris Sud Année 2011/2012 : Eléments d architecture des systèmes complexes, Master Conception et management des systèmes informatiques complexes, Ecole Centrale de Paris, Ecole Polytechnique, Ecole Supérieure d Electricité, INSTN, Télécoms Paristech, Université Paris Sud

412 412 CHAPTER X.7. ANNEXES : SYSMO x Année 2012/2013 : Eléments d architecture des systèmes complexes, Master Conception et management des systèmes informatiques complexes, Ecole Centrale de Paris, Ecole Polytechnique, Ecole Supérieure d Electricité, INSTN, Télécoms Paristech, Université Paris Sud Machine Learning for Bigdata URL: MPRI, Optimisation, MPRO, Graphes, MPRO, Initiation a la recherche, MPRO (Master Parisien de Recherche Opérationnelle) : Bases de l Ordonnancement, 2012,2013 MPRO (Master Parisien de Recherche Opérationnelle) : Programmation Par Contraintes, 2012,2013 Jury Septembre 2009: Membre du jury pour la thèse de Doctorat de Makhlouf Hadji (Telecom SudParis et Paris 6). Octobre 2008: Membre du jury pour la thèse de Doctorat de Ronald Zumkeller (École Polytechnique). Octobre 2008: Membre du jury pour la thèse de Doctorat de Cheikh Brahim Ould El Mounir (Université d Amiens). C.B. Ould El Mounir, Thèse d Université, Extensions premières et optimisation des graphes décomposables, Université d Amiens, Septembre 2008 (Rapporteur) A. Chapoutot, Thèse d Université, Simulation abstraite :une analyse statique de modèles Simulink, Ecole Polytechnique, Décembre 2008 G. Nannicini, Thèse d Université, Calcul des chemins les plus rapides dans des réseaux structurés à dynamique aléatoire: une application aux réseaux routiers, Ecole Polytechnique, Juin 2009 (Directeur) N. Ayache, Thèse d Université, Vérification formelle, compositionnelle et automatique de systèmes de composants, Université Paris Sud, Janvier 2010 S. Peyronnet, Habilitation à diriger des recherches, Université Paris Sud, Décembre 2010 (Président) M. Mabrouki, Thèse d Université, Étude de la préservation des propriétés temporelles des réseaux de régulation génétique au travers du plongement : vers une caractérisation des systèmes complexes par l émergence de propriétés, Université d Evry Val d Essonne, Décembre 2010 Alexandre Borghi, Thèse d Université, Université Paris Sud, Octobre 2011 (Rapporteur) Bilal Kanso, Thèse d Université, Modélisation et validation des systèmes à base d états, Ecole Centrale de Paris, Novembre 2011

413 X.7.3. AUTRES ÉLÉMENTS DE VISIBILITÉ 413 Ecoles thématiques et cours spécialisés Urbanisation des systèmes d information et alignement stratégique, Tutoriel 2.1, conférence invitée, Ecole des Systèmes de systèmes, DGA, Paris, Avril 2008 Architecture système et réduction de la complexité, conférence invitée, Ingénierie des Grands Projets et Systèmes Complexes, 3-ième édition, Arcachon, Juin 2008 Elements of complex systems architecture, conférence invitée, Genetic Regulatory Networks and other Complex Systems, GENNETEC Training Course, Paris, Janvier 2009 A short presentation of the Ecole Polytechnique chair èngineering of Complex Systems, conférence invitée, 2-ième International Engineering Systems Symposium, MIT, Cambridge (USA), Juin 2009 Systemic Modelling, conférence invité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 système d information grˆace à l architecture d entreprise?, conférence invitée, Après 10 ans d urbanisation, l architecture d entreprise, Marcus Evans Conferences, Paris, Avril 2010 Architectures modulaires : mythe ou réalité?, conférence invitée, Conférence Ingénierie des Grands Projets et Systèmes Complexes, 6-ième édition, Arcachon, Juin 2011 Elements of requirements engineering, conférence invité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 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 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 activités de vulgarisation à l architecture des systèmes au sein de l association CESAMES X.7.3 Autres éléments de visibilité X Invitations Singapore University of Technology and Design, Singapore (2013). Claudia D Ambrosio a été invité a tenir un seminaire.. EDF R&D, Clamart (2012). Claudia D Ambrosio a été invité a tenir un seminaire.. PGMO Seminars, Palaiseau (2012). Claudia D Ambrosio a été invité a tenir un seminaire..

414 414 CHAPTER X.7. ANNEXES : SYSMO Technische Universität Dortmund, Germany (2012). Claudia D Ambrosio a été invité a tenir un seminaire.. LIF, Marseille (2012). Claudia D Ambrosio a été invité a tenir un seminaire.. GYSS 2013 (2013). Claudia D Ambrosio a été invité au GLOBAL YOUNG SCIENTISTS SUMMIT 2013 (GYSS), Singapour. DGA13 (Juin 2013). Leo Liberti a été invité à donner une conférence plénière. GOW12 (Juin 2012). Leo Liberti a été invité à donner une conférence plénière. GSC12 (Juin 2012). Leo Liberti a été invité à donner une conférence plénière. LION6 (Janvier 2012). Leo Liberti a été invité à donner une conférence plénière. BALCOR11 (Septembre 2011). Leo Liberti a été invité à donner une conférence plénière. HybridNL11 (Mai 2011). Leo Liberti a été invité à donner une conférence plénière. ORBEL10 (Février 2011). Leo Liberti a été invité à donner une conférence plénière. JFRO10 (Mars 2010). Leo Liberti a été invité à donner une conférence plénière. SOBRAPO09 (Septembre 2009). Leo Liberti a été invité à donner une conférence plénière. IFI09 (Juillet 2009). Leo Liberti a été invité à donner une conférence plénière. JPOC06 (Juin 2009). Leo Liberti a été invité à donner une conférence plénière. PGMO (Septembre 2012). Leo Liberti a été orateur invité. MIP11 (Juin 2011). Leo Liberti a été orateur invité. Pretty Structures 2011 (Mai 2011). Leo Liberti a été orateur invité. AUSSOIS11 (Janvier 2011). Leo Liberti a été orateur invité. ewminlp (Décembre 2010). Leo Liberti a été orateur invité. AUSSOIS10 (Janvier 2010). Leo Liberti a été orateur invité. CIMINLP (Mars 2009). Leo Liberti a été orateur invité. DIIGA, Università Politecnica delle Marche (2012). Leo Liberti a donné un séminaire. Comp. Sci. Dept., IIT Delhi (2012). Leo Liberti a donné un séminaire. LIPN6, Université Paris XIII (2011). Leo Liberti a donné un séminaire. COPPE, Universidade Federal do Rio de Janeiro; et IMECC, Universidade Estadual de Campinas (2011). Leo Liberti a été invité un mois et a donné deux séminaires. CERFACS, Toulouse (2010). Leo Liberti a donné un séminaire. Tepper School of Business, Carnegie-Mellon University (2009). Leo Liberti a donné un séminaire. Chemical Engineering, Carnegie-Mellon University (2009). Leo Liberti a donné un séminaire. T.J. Watson IBM Research Center, Yorktown Heights (2008). séminaire. Leo Liberti a donné un Google EMEA faculty summiti (2011). Mihalis Vazirgiannis a été invité..

415 X.7.3. AUTRES ÉLÉMENTS DE VISIBILITÉ 415 Google EMEA faculty summiti (2012). Mihalis Vazirgiannis a été invité.. TOGO10 Global Optimization (2010). Pierre Hansen a été conférencier pléniers lors du congrès. International Conference on Mathematical Chemistry (2010). Pierre Hansen a été conférencier pléniers lors du congrès. EURO XXVI Lisbon (2010). Pierre Hansen a été conférencier pléniers lors du congrès. Journée sur la théorie des graphes (2010). Pierre Hansen a été conférencier pléniers lors du congrès. Journée sur la théorie des graphes (2009). Pierre Hansen a présenté la conférence inaugurale lors du congrès. SIMOPSYS08 (2008). Pierre Hansen a été conférencier pléniers lors du congrès. Stochastic and Global Optimization (2008). Pierre Hansen a été conférencier pléniers lors du congrès. Palaiseau, France (octobre 2008 mars 2009, novembre 2009, mai juin 2010, mai août 2011, septembre novembre 2012). Pierre Hansen a été invité par École Polytechnique.. Londres, Angleterre (2008). Pierre Hansen a été invité 1 mois par Brunel University.. X Prix et distinctions Certificat d excellence au 10 th DIMACS Implementation Challenge Graph Partitioning and Graph Clustering, Pierre Hansen, Colloque international, TOGO2010, Toulouse Global Optimization 2010, organisé à l occasion de mon 70 e anniversaire, Pierre Hansen, Prix de recherche Pierre-Laurin, HEC Montréal,Pierre Hansen,2010. Prix Jacques-Rousseau de l ACFAS (Association francophone pour le savoir), Pierre Hansen, ème position dans la section Modularity Clustering Quality Challenge du 10ème DI- MACS Implementation Challenge ème prix Robert Faure 2009 de la ROADEF (prix tri-annuel de la société Française de recherche operationelle). Prix meilleur poster à Digiteo Annual Forum Digiteo Chair grant ( ) - LEVETONE Google Phd Scholarship for his student F. Malliaros ( ) Vincent Jost et David Savourey ont remporté le challenge ROADEF-EURO-EDF dans la catégorie Senior, 2010 SYSMOSysmo

416 416 CHAPTER X.7. ANNEXES : SYSMO

417 XI Équipe Typical (Typical) 417

418

419 XI.1 Liste des membres : Typical XI.1.1 Liste actuelle des membres XI Membres permanents Nom Fonction Employeur HDR Arrivée Bruno Barras CR INRIA Ian Mackie CR CNRS Oui 1994 Jean-Marc Notin IR CNRS 2005 Benjamin Werner Professeur École Polytechnique Oui Valérie Lecomte Assistant INRIA 2010 XI Doctorants et postdoctorants Doctorants Nom Financement Arrivée Encadrant Alexis Bernadet Allocation couplée ENS Cachan 2010 Stéphane Graham-Lengrand Victor Magron FORMATH Oct B. Werner XI.1.2 Anciens membres XI Membres permanents Nom Fonction Employeur HDR Départ Position actuelle Gilles Dowek Professeur École Polytechnique Oui Oct DR INRIA, équipe Deducteam Germain Faure CR INRIA Aug Professeur des écoles Hugo Herbelin CR INRIA Oui Dec DR INRIA, équipe πr 2 Assia Mahboubi CR INRIA Jun CR INRIA, équipe SpecFun Enrico Tassi CR INRIA Jun CR INRIA, équipe SpecFun 419

420 420 CHAPTER XI.1. LISTE DES MEMBRES : TYPICAL XI Doctorants et postdoctorants Doctorants Nom Financement Départ Encadrant Position actuelle Lisa Allali Région Îlede-France Sep G. Dowek Web development Company, Berlin Bruno Bernardo DGA 2012 B. Barras Trusted Lab, France Éric Biagoli INRIA Sep B. Werner Mathieu Boespflug AMN Jan G. Dowek Postdoc à McGill University Cyril Cohen AMN Oct A. Mahboubi - Postdoc, Göteborg B. Werner Denis Cousineau MENRT 2009 G. Dowek Prove and Run, France François Garillot INRIA 2011 B. Werner Software Engineer, Typesafe, Switzerland Danko Ilik Monge Dec H. Herbelin Researcher, Macedonian Academy of Sciences Chantal Keller ENS Lyon Jun B. Werner Sylvain Lebresne MENRT Dec H. Herbelin Engineer, DataStax, Besançon Vincent Silès AMN Dec H. Herbelin Prove and Run, France Élie Soubiran Dec H. Herbelin R&D Engineer, Alstom Transport Arnaud Spiwack AMN Mar B. Werner Postdoc, ENS Pierre-Yves Strub EADS Sep J.-P. Jouannaud IMDEA, Madrid Roland Zumkeller MESR Oct B. Werner Knight Capital Group Postdoctorants Nom Financement Dates Responsable Position actuelle Benoît Valiron 2009 G. Dowek Postdoc à l INRIA Paris-Rocquencourt Enrico Tassi ANR Paral-ITP 2011 A. Mahboubi CR INRIA, équipe SpecFun XI Autres membres Stagiaires Master 2 Nom Financement Dates Responsable Position actuelle Mathias Puech 2008 H. Herbelin ATER à l Université Paris Diderot Éric Biagoli 2009 B. Werner Cyril Cohen 2009 A. Mahboubi Postdoc, Göteborg Chantal Keller 2009 B. Werner PhD student Maxime Dénès 2010 G. Dowek Thèse à l INRIA Sophia-Antipolis Aloïs Brunel 2010 G. Dowek Thèse au LIPN Visiteurs de longue durée Nom Financement Dates Invitant Jianhua Gao Institute of Software, Science Academy of China 2010 G. Dowek Qian Wang Tsinghua University Jan to Oct B. Barras

421 XI.1.2. ANCIENS MEMBRES 421 Autres Nom Fonction Financement Dates Vincent Gross Ingénieur INRIA 2008

422 422 CHAPTER XI.1. LISTE DES MEMBRES : TYPICAL

423 XI.2 Rapport scientifique : Typical XI.2.1 Thématique générale et principaux objectifs XI Current Context The team in its present form is clearly in a restructuring state. It is a descendant of Gé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 It still exists as a LIX team though. Following this, Assia Mahboubi created a new INRIA team with Frédé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 Chargés de Recherche at Typical (Germain Faure and Enrico Tassi), Assia Mahboubi having been hired in XI 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 20 th 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

424 424 CHAPTER XI.2. RAPPORT SCIENTIFIQUE : TYPICAL 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 = 4 evaluates to the proposition 4 = 4, and these two propositions are logically identified. This means that = 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 Curry- Howard isomorphism. XI Thèmes de recherche 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

425 XI.2.1. THÉMATIQUE GÉNÉ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 426 CHAPTER XI.2. RAPPORT SCIENTIFIQUE : TYPICAL 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 Exemples de résultats significatifs 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 IN- RIA 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 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 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.

427 XI.2.1. THÉMATIQUE GÉNÉ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: 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: 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: 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 Animation scientifique, rayonnement, prix et récompenses 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 Thèse from Ecole Polytechnique, for his PhD advised by Assia Mahboubi and Benjamin Werner.

428 428 CHAPTER XI.2. RAPPORT SCIENTIFIQUE : TYPICAL

429 XI.3 Projet de recherche : Typical XI.3.1 Objectifs scientifiques 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 Saclay 1. 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 Grégoire, Thé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

430 430 CHAPTER XI.3. PROJET DE RECHERCHE : TYPICAL XI 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 (INRIA- Saclay 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 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.

431 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 432 CHAPTER XI.3. PROJET DE RECHERCHE : TYPICAL

433 XI.4 Fiche résumé : Typical XI.4.1 Membres 2008 : 6 chercheurs (1 CNRS, 5 INRIA), 1 enseignant-chercheur, 1 ingénieur CNRS, 10 doctorants 2013 : 2 chercheurs (1 CNRS, 1 INRIA), 1 enseignant-chercheur, 1 ingénieur CNRS, 2 doctorants Départ de membres de l é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 Résultats scientifiques 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 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 Production scientifique Publications Journaux : 24 Conférences internationales :

434 434 CHAPTER XI.4. FICHE RÉSUMÉ : TYPICAL XI 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 Science (LICS). Bruno Barras and Assia Mahboubi were invited during 3 months at the Institute for Advanced Study, Princeton, USA as participants to the program Univalent Foundations of Mathematics. XI Actions de formation Many members of the TypiCal team are involved in teaching activities, mainly at École polytechnique and Master Parisien de Recherche en Informatique (MPRI). Benjamin Werner is a Professor at Ecole polytechnique and head of the Computer Science department. He teaches various undergraduate (L3) and master (M1) courses. Gilles Dowek and Benjamin Werner have been teaching a master (M2) course on foundations of proof systems at MPRI for several years. Assia Mahboubi and Bruno Barras have been teaching a master (M2) course on proof assistants at MPRI. Teaching at master levels helps to attract internships and PhD students. Indeed, during the period , TypiCal welcomed 15 PhD students; 13 of them successfully defended their thesis and one is about to.

435 XI.5 Production scientifique : Typical XI.5.1 Livres et chapitres de livres [1229] Alessandro Armando, Peter Baumgartner, and Gilles Dowek, editors. Automated Reasoning, 4th International Joint Conference, IJCAR 2008, Sydney, Australia, August 12-15, 2008, Proceedings, volume 5195 of Lecture Notes in Computer Science. Springer, [1230] Simon Gay and Ian Mackie, editors. Semantic Techniques in Quantum Computation. Cambridge University Press, ISBN [1231] Arnaud Spiwack and Thierry Coquand. Constructively Finite? In Laureano Lambán Pardo, Ana Romero Ibá nez, and Julio Rubio García, editors, Contribuciones científicas en honor de Mirian Andrés Gómez, pages Universidad de La Rioja, XI.5.2 Documents pédagogiques [1232] Gilles Dowek. Les principes des langages de programmation. Les Éditions de l École polytechnique, [1233] Gilles Dowek. Les démonstrations et les algorithmes. Introduction à la logique et à la calculabilité. Les Éditions de l École polytechnique, [1234] Benjamin Werner and François Pottier. Algorithmique et programmation. Polycopié du cours INF431 de l École polytechnique. Les Éditions de l École polytechnique, XI.5.3 Revues internationales [1235] Sandra Alves, Maribel Fernández, Mário Florido, and Ian Mackie. Gödel s System T revisited. Theoretical Computer Science, 411(11-13): , [1236] Sandra Alves, Maribel Fernández, Mário Florido, and Ian Mackie. Linearity and iterator types for Gödel s System T. Higher-Order and Symbolic Computation, 23(1):1 27, [1237] Sandra Alves, Maribel Fernández, Mário Florido, and Ian Mackie. Linearity: A roadmap. Journal of Logic and Computation, 23(6), To appear. [1238] Sandra Alves, Mário Florido, Ian Mackie, and François-Régis Sinot. Minimality in a linear calculus with iteration. Electronic Notes in Theoretical Computer Science, 204: , [1239] Zena M. Ariola and Hugo Herbelin. Control reduction theories: the benefit of structural substitution. Journal of Functional Programming, 18(3): , [1240] Alessandro Armando, Peter Baumgartner, and Gilles Dowek. Preface. Journal of Automated Reasoning, 45(2):89, [1241] Bruno Barras. Sets in Coq, Coq in Sets. Journal of Formalized Reasoning, 3(1):29 48, [1242] Yves Bertot, Frédérique Guilhot, and Assia Mahboubi. A formal study of Bernstein coefficients and polynomials. Mathematical Structures in Computer Science, 21(4): , [1243] Bob Coecke, Ian Mackie, Prakash Panangaden, and Peter Selinger. Preface. Electronic Notes in Theoretical Computer Science, 270(1):1 2,

436 436 BIBLIOGRAPHY [1244] Cyril Cohen and Thierry Coquand. A constructive version of Laplace s proof on the existence of complex roots. Journal of Algebra, 381: , May [1245] Cyril Cohen and Assia Mahboubi. Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination. Logical Methods in Computer Science, 8(1:02):1 40, February [1246] Gilles Dowek. On the convergence of reduction-based and model-based methods in proof theory. Logic Journal of the Interest Group in Pure and Applied Logics, 17(5): , [1247] Gilles Dowek, Murdoch James Gabbay, and Dominic P. Mulligan. Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques. Logic Journal of the Interest Group in Pure and Applied Logics, 18(6): , [1248] Gilles Dowek and Ying Jiang. Enumerating proofs of positive formulae. The Computer Journal, 52(7): , [1249] Maribel Fernández, Ian Mackie, Shinya Sato, and Matthew Walker. Recursive functions with pattern matching in interaction nets. Electronic Notes in Theoretical Computer Science, 253(4):55 71, [1250] Georges Gonthier and Assia Mahboubi. An introduction to small scale reflection in Coq. Journal of Formalized Reasoning, 3(2):95 152, [1251] Abubakar Hassan, Ian Mackie, and Shinya Sato. Compilation of interaction nets. Electronic Notes in Theoretical Computer Science, 253(4):73 90, [1252] Sylvain Lebresne. A type system for call-by-name exceptions. Logical Methods in Computer Science, 5(4:1):1 25, [1253] Gyesik Lee and Benjamin Werner. Proof-irrelevant model of cc with predicative induction and judgmental equality. Logical Methods in Computer Science, 7(4:05):1 25, [1254] Luigi Liquori and Arnaud Spiwack. Extending FeatherTrait Java with Interfaces. Theoretical Computer Science, 398(1-3): , May [1255] Luigi Liquori and Arnaud Spiwack. FeatherTrait: A modest extension of Featherweight Java. Association for Computing Machinery Transactions on Programming Languages and Systems, 30(2:11):1 32, March [1256] Ian Mackie and Detlef Plump. Preface. Electronic Notes in Theoretical Computer Science, 203(1):1 2, [1257] Ian Mackie and Shinya Sato. A calculus for interaction nets based on the linear chemical abstract machine. Electronic Notes in Theoretical Computer Science, 192(3):59 70, [1258] Benjamin Werner. On the strength of proof-irrelevant type theories. Logical Methods in Computer Science, 4(3:13):1 20, XI.5.4 Conférences internationales [1259] Xavier Allamigeon, Stéphane Gaubert, Victor Magron, and Benjamin Werner. Certification of bounds of non-linear functions : the templates method. In J. Carette, D. Aspinall, C. Lange, P. Sojka, and W. Windsteiger, editors, Intelligent Computer Mathematics, MKM, Calculemus, DML, and Systems and Projects 2013, Held as Part of CICM 2013, Bath, UK, July 8-12, 2013, Proceedings, volume 7961 of Lecture Notes in Artificial Intelligence. Springer, 2013.

437 BIBLIOGRAPHY 437 [1260] Xavier Allamigeon, Stéphane Gaubert, Victor Magron, and Benjamin Werner. Certification of inequalities involving transcendental functions: combining sdp and max-plus approximation. In Proceedings of the European Control Conference, ECC 13, Zurich, Switzerland, To appear. [1261] Sandra Alves, Maribel Fernández, Mário Florido, and Ian Mackie. Linearity and recursion in a typed lambda-calculus. In Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2011), Odense, Denmark, pages ACM Press, July [1262] Sandra Alves, Maribel Fernández, and Ian Mackie. A new graphical calculus of proofs. In Rachid Echahed, editor, Proceedings 6th International Workshop on Computing with Terms and Graphs (TERMGRAPH 2011), Saarbrücken, Germany, volume 48 of Electronic Proceedings in Theoretical Computer Science, pages 69 84, [1263] Michaël Armand, Germain Faure, Benjamin Grégoire, Chantal Keller, Laurent Théry, and Benjamin Werner. A modular integration of SAT/SMT solvers to coq through proof witnesses. In Jean-Pierre Jouannaud and Zhong Shao, editors, Certified Programs and Proofs, First International Conference, CPP 2011, Kenting, Taiwan, December 7-9, 2011, Proceedings, volume 7086 of Lecture Notes in Computer Science, pages Springer, [1264] Michaël Armand, Benjamin Grégoire, Arnaud Spiwack, and Laurent Théry. Extending Coq with imperative features and its application to SAT verification. In Matt Kaufmann and Lawrence C. Paulson, editors, Interactive Theorem Proving - First International Conference, ITP 2010, Edinburgh, UK, July 11-14, Proceedings, volume 6172 of Lecture Notes in Computer Science, pages Springer, [1265] Pablo Arrighi and Gilles Dowek. Linear-algebraic lambda-calculus: higher-order, encodings, and confluence. In Andrei Voronkov, editor, Rewriting Techniques and Applications - 19th International Conference, RTA 2008, Hagenberg, Austria. Proceedings, volume 5117 of Lecture Notes in Computer Science, pages Springer, July [1266] Pablo Arrighi and Gilles Dowek. On the completeness of quantum computation models. In Fernando Ferreira, Benedikt Löwe, Elvira Mayordomo, and Luís Mendes Gomes, editors, Programs, Proofs, Processes, 6th Conference on Computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, Proceedings, volume 6158 of Lecture Notes in Computer Science, pages Springer, [1267] Bruno Barras and Bruno Bernardo. The implicit calculus of constructions as a programming language with dependent types. In Roberto Amadio, editor, Foundations of Software Science and Computational Structures - 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, Proceedings, volume 4962 of Lecture Notes in Computer Science, pages Springer, [1268] Bruno Barras, Pierre Corbineau, Benjamin Grégoire, Hugo Herbelin, and Jorge Luis Sacchini. A new elimination rule for the calculus of inductive constructions. In Stefano Berardi, Ferruccio Damiani, and Ugo de Liguoro, editors, Types for Proofs and Programs, International Conference, TYPES 2008, Torino, Italy, March 26-29, 2008, Revised Selected Papers, volume 5497 of Lecture Notes in Computer Science, pages Springer, [1269] Bruno Barras, Pierre Corbineau, Benjamin Grégoire, Hugo Herbelin, and Luis Sacchini, Jorge. A New Elimination Rule for the Calculus of Inductive Constructions. In Stefano Berardi, Ferruccio Damiani, and Ugo de Liguoro, editors, Types for Proofs and Programs - International Conference, TYPES 2008 Torino, Italy, March 26-29, 2008 Revised Selected Papers, volume 5497 of Lecture Notes in Computer Science, pages 32 48, Torino, Italie, Springer.

438 438 BIBLIOGRAPHY [1270] Bruno Barras, Jean-Pierre Jouannaud, Pierre-Yves Strub, and Qian Wang. CoqMTU: a higher-order type theory with a predicative hierarchy of universes parametrized by a decidable first-order theory. In LICS 11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pages IEEE Computer Society, [1271] Frédéric Blanqui, Jean-Pierre Jouannaud, and Pierre-Yves Strub. From formal proofs to mathematical proofs: A safe, incremental way for building in first-order decision procedures. In Giorgio Ausiello, Juhani Karhumäki, Giancarlo Mauri, and C.-H. Luke Ong, editors, Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy, volume 273 of Advances in Information and Communication Technology, pages Springer, [1272] François Bobot, Sylvain Conchon, Evelyne Contejean, Mohamed Iguernelala, Assia Mahboubi, Alain Mebsout, and Guillaume Melquiond. A simplex-based extension of Fourier- Motzkin for solving linear integer arithmetic. In Bernhard Gramlich, Dale Miller, and Uli Sattler, editors, Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, Proceedings, volume 7364 of Lecture Notes in Computer Science, pages Springer, [1273] Mathieu Boespflug. Conversion by evaluation. In Manuel Carro and Ricardo Peña, editors, Practical Aspects of Declarative Languages - 12th International Symposium, PADL 2010, Madrid, Spain, January 18-19, Proceedings, volume 5937 of Lecture Notes in Computer Science, pages Springer, [1274] Mathieu Boespflug, Maxime Dénès, and Benjamin Grégoire. Full reduction at full throttle. In Jean-Pierre Jouannaud and Zhong Shao, editors, Certified Programs and Proofs - First International Conference, CPP 2011, Kenting, Taiwan, December 7-9, 2011, Proceedings, volume 7086 of Lecture Notes in Computer Science, pages Springer, [1275] Guillaume Burel and Gilles Dowek. How can we prove that a proof search method is not an instance of another? In James Cheney and Amy P. Felty, editors, Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, LFMTP 09, McGill University, Montreal, Canada, August 2, 2009, pages ACM, [1276] Ricky W. Butler, George Hagen, Jeffrey Maddalon, César A. Mu noz, Anthony Narkawicz, and Gilles Dowek. How formal methods impels discovery: A short history of an air traffic management project. In César Mu noz, editor, Second NASA Formal Methods Symposium - NFM 2010, Washington D.C., USA, April 13-15, Proceedings, volume NASA/CP of NASA Conference Proceedings, pages 34 46, [1277] Cyril Cohen. Construction of real algebraic numbers in Coq. In Lennart Beringer and Amy Felty, editors, Interactive Theorem Proving - Third International Conference, ITP 2012, Princeton, NJ, USA, August 13-15, Proceedings, volume 7406 of Lecture Notes in Computer Science, pages Springer, [1278] Cyril Cohen and Assia Mahboubi. A formal quantifier elimination for algebraically closed fields. In Serge Autexier, Jacques Calmet, David Delahaye, PatrickD.F. Ion, Laurence Rideau, Renaud Rioboo, and AlanP. Sexton, editors, Intelligent Computer Mathematics - 10th International Conference, AISC 2010, 17th Symposium, Calculemus 2010, and 9th International Conference, MKM 2010, Paris, France, July 5-10, Proceedings, volume 6167 of Lecture Notes in Computer Science, pages Springer, [1279] Gilles Dowek. Polarized resolution modulo. In Cristian S. Calude and Vladimiro Sassone, editors, Theoretical Computer Science - 6th IFIP TC 1/WG 2.2 International Conference,

439 BIBLIOGRAPHY 439 TCS 2010, Held as Part of WCC 2010, Brisbane, Australia, September 20-23, Proceedings, volume 323 of IFIP Advances in Information and Communication Technology, pages Springer, [1280] Gilles Dowek and Murdoch James Gabbay. Permissive-nominal logic. In Temur Kutsia, Wolfgang Schreiner, and Maribel Fernández, editors, Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 26-28, 2010, Hagenberg, Austria, pages ACM, [1281] Gilles Dowek, César A. Mu noz, and Camilo Rocha. Rewriting logic semantics of a plan execution language. In Bartek Klin and Pawel Sobocinski, editors, Proceedings Sixth Workshop on Structural Operational Semantics, volume 18 of Electronic Proceedings in Theoretical Computer Science, pages 77 91, [1282] Maribel Fernández, Ian Mackie, and Matthew Walker. Bigraphical nets. In Rachid Echahed and Detlef Plump, editors, Proceedings 7th International Workshop on Computing with Terms and Graphs, volume 110 of Electronic Proceedings in Theoretical Computer Science, pages 74 81, [1283] François Garillot, Georges Gonthier, Assia Mahboubi, and Laurence Rideau. Packaging mathematical structures. In Stefan Berghofer, Tobias Nipkow, Christian Urban, and Makarius Wenzel, editors, Theorem Proving in Higher Order Logics - 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, Proceedings, volume 5674 of Lecture Notes in Computer Science, pages Springer, [1284] Georges Gonthier and Enrico Tassi. A language of patterns for subterm selection. In Lennart Beringer and Amy P. Felty, editors, Interactive Theorem Proving - Third International Conference, ITP 2012, Princeton, NJ, USA, August 13-15, Proceedings, volume 7406 of Lecture Notes in Computer Science, pages Springer, [1285] Abubakar Hassan, Ian Mackie, and Jorge Sousa Pinto. Visual programming with interaction nets. In G. Stapleton, J. Howse, and J. Lee, editors, Diagrams 2008, volume 5223 of Lecture Notes in Artificial Intelligence, pages Springer, [1286] Abubakar Hassan, Ian Mackie, and Shinya Sato. Interaction nets: programming language design and implementation. In J. de Lara C. Ermel and R. Heckel, editors, Proceedings of the Seventh International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2008), volume 10 of Electronic Communications of the European Association of Software Science and Technology, Budapest, Hungary, EASST. [1287] Abubakar Hassan, Ian Mackie, and Shinya Sato. A lightweight abstract machine for interaction nets. In Jochen Küster and Emilio Tuosto, editors, Proceedings of the Ninth International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010), volume 29 of Electronic Communications of the European Association of Software Science and Technology, Paphos, Cyprus, EASST. [1288] Hugo Herbelin and Silvia Ghilezan. An approach to call-by-name delimited continuations. In George C. Necula and Philip Wadler, editors, Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008, pages ACM, [1289] Chantal Keller. Extended resolution as certificates for propositional logic. In Jasmin Christian Blanchette and Josef Urban, editors, PxTP 13: Third International Workshop on Proof Exchange for Theorem Proving, volume 14 of EasyChair Proceedings in Computing, pages EasyChair, 2013.

440 440 BIBLIOGRAPHY [1290] Chantal Keller and Thorsten Altenkirch. Hereditary Substitutions for Simple Types, Formalized. In V. Capretta and J. Chapman, editors, MSFP - Third Workshop on Mathematically Structured Functional Programming , Baltimore, États-Unis, ACM Press. [1291] Chantal Keller and Marc Lasson. Parametricity in an impredicative sort. In Patrick Cégielski and Arnaud Durand, editors, Computer Science Logic (CSL 12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France, volume 16 of Leibniz International Proceedings in Informatics, pages Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, [1292] Chantal Keller and Benjamin Werner. Importing hol light into coq. In Matt Kaufmann and LawrenceC. Paulson, editors, Interactive Theorem Proving - First International Conference, ITP 2010, Edinburgh, UK, July 11-14, Proceedings, volume 6172 of Lecture Notes in Computer Science, pages Springer, [1293] Sylvain Lebresne. A system F with call-by-name exceptions. In Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, and Igor Walukiewicz, editors, Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, volume 5126 of Lecture Notes in Computer Science, pages Springer, [1294] Ian Mackie. A rewriting paradigm for program and algorithm animation. In IEEE Symposium on Visual Languages and Human-Centric Computing, VL/HCC 2009, Corvallis, OR, USA, September 2009, Proceedings, pages IEEE Computer Society, [1295] Ian Mackie. A visual model of computation. In J. Kratochvil et al., editor, Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, volume 6108 of Lecture Notes in Computer Science, pages Springer, June [1296] Ian Mackie. An interaction net implementation of closed reduction. In Sven-Bodo Scholz and Olaf Chitil, editors, Implementation and Application of Functional Languages - 20th International Symposium, IFL 2008, Hatfield, UK, September 10-12, 2008, volume 5836 of Lecture Notes in Computer Science, pages Springer, [1297] Vincent Siles and Hugo Herbelin. Equality is typable in semi-full pure type systems. In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, July 2010, Edinburgh, United Kingdom, pages IEEE Computer Society, [1298] David Teller, Arnaud Spiwack, and Till Varoquaux. Catch me if you can. In Sven-Bodo Scholz and Olaf Chitil, editors, Implementation and Application of Functional Languages - 20th International Symposium, IFL 2008, Hatfield, UK, September 10-12, Revised Selected Papers, volume 5836 of Lecture Notes in Computer Science, pages Springer, XI.5.5 Conférences nationales [1299] Cyril Cohen. Construction des nombres algébriques réels en Coq. In JFLA - Journées Francophones des Langages Applicatifs , Carnac, France, February 2012.

441 XI.5.6. LOGICIELS 441 XI.5.6 Logiciels [1300] The Coq proof assistant. Available at [1301] Dedukti: a universal proof checker based on the λπ-calculus modulo. Available at http: //hackage.haskell.org/package/dedukti. [1302] HOL-Coq: an interface to import and check hol-light s theorems in coq. Available at [1303] SMT-Coq: a modular and efficient coq checker for sat and smt proof witnesses. Available at [1304] Ssreflect: small scale reflection extension for the coq proof assistant. Available at http: // XI.5.7 Thèses [1305] Lisa Allali. Coupures et réécriture. La super-cohérence comme critère universel de l élimination des coupures. These, Ecole Polytechnique X, October [1306] Mathieu Boespflug. Conception d un noyau de preuves pour le λπ-calcul modulo. These, Ecole Polytechnique X, January [1307] Cyril Cohen. Formalisation des nombres algébriques : construction et théorie du premier ordre. These, Ecole Polytechnique X, November [1308] Denis Cousineau. Modèles et normalisation des preuves. These, Ecole Polytechnique X, December [1309] François Garillot. Outils de preuve générique et théorie des groupes finis. These, Ecole Polytechnique X, January [1310] Danko Ilik. Constructive Completeness Proofs and Delimited Control. These, Ecole Polytechnique X, October [1311] Chantal Keller. A Matter of Trust: Skeptical Communication Between Coq and External Provers. These, Ecole Polytechnique X, June [1312] Sylvain Lebresne. Une approche de la détection statique d exceptions non rattrapées en appel par nom. These, Ecole Polytechnique X, December [1313] Vincent Silès. Investigation on the typing of equality in type systems. These, Ecole Polytechnique X, November [1314] Elie Soubiran. Modular development of theories and name-space management for the Coq proof assistant. These, Ecole Polytechnique X, September [1315] Arnaud Spiwack. Calculs vérifiés en algèbre homologique. These, Ecole Polytechnique X, March [1316] Pierre-Yves Strub. Théorie des Types et Procédures de Décision. These, Ecole Polytechnique X, July [1317] Roland Zumkeller. Global Optimization in Type Theory. These, Ecole Polytechnique X, November 2008.

442 442 BIBLIOGRAPHY XI.5.8 Habilitation à diriger des recherches [1318] Benjamin Werner. Faire simple pour pouvoir faire compliqué: contributions à une théorie des types pratique. Hdr, Université Paris Sud, April XI.5.9 Rapports techniques [1319] Jade Alglave and Assia Mahboubi. A Generic Formalised Framework for Reasoning About Weak Memory Models. Technical Report , INRIA, http: //hal.inria.fr/inria [1320] Denis Cousineau. A completeness theorem for strong normalization in minimal deduction modulo. Technical Report , INRIA, inria [1321] Denis Cousineau. A semantic method to prove strong normalization from weak normalization. Technical Report , INRIA, inria [1322] Mahfuza Farooque, Stéphane Lengrand, and Assia Mahboubi. Two simulations about DPLL(T). Technical Report , INRIA, April archives-ouvertes.fr/hal [1323] Germain Faure. Encoding rewriting strategies in lambda-calculi with patterns. Technical Report RR-7025, INRIA, September [1324] Germain Faure. Higher-order matching modulo (super)developements. Applications to second-order matching. Technical Report , INRIA, November http: //hal.inria.fr/inria [1325] Germain Faure and Alexandre Miquel. A Categorical Semantics for The Parallel Lambda- Calculus. Technical Report RR-7063, INRIA, October inria [1326] Georges Gonthier, Assia Mahboubi, and Enrico Tassi. A Small Scale Reflection Extension for the Coq system. Technical Report RR-6455, INRIA, September inria.fr/inria XI.5.10 Autres [1327] Sandra Alves, Maribel Fernández, Mário Florido, and Ian Mackie. Linear recursion. Computing Research Repository, abs/ , [1328] Pablo Arrighi and Gilles Dowek. A computational definition of the notion of vectorial space. Computing Research Repository, abs/ , [1329] Chantal Keller and Marc Lasson. The refined calculus of inductive construction: Parametricity and abstraction. Computing Research Repository, abs/ , [1330] Ian Mackie, Jorge Sousa Pinto, and Miguel Vilaça. Iterators, recursors and interaction nets. Computing Research Repository, abs/ , 2009.

443 XI.6 Annexes : Typical XI.6.1 Participations à la communauté scientifique et responsabilités administrative Responsabilités administratives des membres de l équipe incluants responsabilité de recherche et d enseignement Benjamin Werner serves as head of the Computer Science Department of Ecole Polytechnique (période 2010-). was a member of the scientific council of INRIA (période ). Gilles Dowek was vice-head of the Computer Science Department of Ecole Polytechnique (période ). XI XI Responsabilités de projets internationaux Responsabilités de projets nationaux Corias ( ) (Type: INRIA ARC) Titre: Conception et réalisation d assistants à la preuve basés sur la super-déduction. Partenaires: LIX and INRIA Nancy Grand Est. Responsable: Germain Faure. Montant de la collaboration pour le LIX: environ euros. Action INRIA pour développer la mise en œuvre effective de cette approche de la preuve entre Nancy et Saclay. XI Participation à des projets internationaux FORMATH ( ) (Type: Projet européen) Titre: Formalisation of Mathematics. Partenaires: University of Gothenburg, Radboud University Nijmegen, INRIA, Universidad de La Rioja. Responsable: Thierry Coquand. Montant de la collaboration pour le LIX: euros (total euros). The objective of this project is to develop libraries of formalised mathematics concerning algebra, linear algebra, real number computation, and algebraic topology. These libraries are especially chosen to have long-term applications in areas where software interacts with the physical world. The main originality of the work is to structure these libraries as a software development, relying on a basis that has already shown its power in the formal proof of the four-colour theorem, and to address topics that were mostly left untouched by previous research in formal proof or formal methods. Website: XI Participation à des projets nationaux DeCert ( ) (Type: ANR) Titre: Décision Certifiée. Partenaires: INRIA, CNRS, Systerel, CEA-LIST. Responsable: Thomas Jensen. This project is funded by the call Domaines Emergents 2008, a program of the Agence Nationale de la Recherche. It started in January 2009 and will end in December The objective of the DECERT project is to design an architecture for cooperating decision procedures, with a particular emphasis on fragments of arithmetic, including bounded and unbounded arithmetic over the integers and the reals, and on their combination with other theories for data structures such as lists, arrays or sets. To ensure trust in the architecture, the decision procedures will either be proved correct inside a proof assistant or produce proof witnesses allowing external checkers to verify the validity of their answers. 443

444 444 CHAPTER XI.6. ANNEXES : TYPICAL Website: PSI ( ) (Type: ANR) Titre: Proof Search Interaction. Partenaires: LIX. Responsable: Stéphane Lengrand. Montant de la collaboration pour le LIX: euros. This project is is funded by the call Jeunes Chercheurs Jeunes Chercheuses 2009, a program of the Agence Nationale de la Recherche. It started in September 2009 and will end in September The PSI project aims at investigating how to take into account the specificities of a given theory when designing proof search methods, both in the theory of proof search and in the design of automated tools. Website: lengrand/psi/ Paral-ITP ( ) (Type: ANR) Titre: Parallel interactive theorem proving. Partenaires: LRI,PPS. Responsable: Burkhart Wolff. Montant de la collaboration pour le LIX: euros. This project is is funded by the call Ingénierie Numérique et Sécurité 2011, a program of the Agence Nationale de la Recherche. The Paral-ITP project intends to overcome the sequential model for Coq, to make the resources of multi-core hardware available for even larger proof developments. Beyond traditional processing of proof scripts as sequence of proof commands, there is a large space of possibilities and challenges for pervasive parallelism. Coq shall be connected to a uniform document model that integrates parallel and asynchronous evaluation processes with notions of history and change management, over the rich structure of formal content. This can then serve as a basis for an editor document model in direct user interaction, and background library management with continuous proof checking, in the style of modern IDEs like Eclipse or Netbeans. Ultimately, the general document model and front-end technology will accommodate end-users and builders of add-on tools. One typical instance is the add-on that imports proofs constructed by automated deduction systems (SAT and SMT solvers). Website: Coq ( ) (Type: INRIA ADT) Titre: Développement de l assistant à la preuve Coq. Partenaires: LIX, LRI, Université Paris 7, INRIA. Responsable: Hugo Herbelin. Montant de la collaboration pour le LIX: euros. The ADT (Action de Développement Technologique) Coq involves a collection of people and teams working together to roll out Coq proof assistant software. The involved teams are the following: TypiCal, ProVal, Marelle and πr 2 from INRIA as well as the CPR team from CNAM. XI Participation à des projets locaux PASO ( ) (Type: Digiteo) Titre: Preuve, analyse statique et optimisation. Partenaires: CEA-LIST, LIX, CMAP, L2S. Responsable: Sylvie Putot. Montant de la collaboration pour le LIX: environ 8000 euros. The PASO project (Preuves, Interprétation abstraite, and Optimisation) gathers computer scientists from CEA-LIST/MeASI, INRIA Saclay/Typical and LIX and specialists from Optimization or Control theory from LIX/MeASI, INRIA Saclay/Maxplus and CMAP, and Supelec/L2S. The goal of this exploratory project is to cross-fertilize these fields, by applying advanced algorithms or techniques inspired by global optimization, by the analysis and identification of dynamical systems, or by zero-sum game theory, in order to improve the precision or the scalability of current methods in proof and static analysis. These applications coming from computer science turn out to raise new challenges for the applied mathematicians. Coquelicot ( ) (Type: Digiteo) Titre: A Coq library for real numbers. Partenaires: LIX, LRI, INRIA Saclay Île-de-France. Responsable: Sylvie Boldo. The Coquelicot project aims at creating a modern formalization of the real numbers in Coq, with a focus on practicality. This is sorely needed to ease the verification of numerical applications, especially those involving advanced mathematics.

445 XI.6.2. ADMINISTRATION DE LA RECHERCHE 445 Website: XI.6.2 XI Administration de la recherche Activités éditoriales Membres de comités éditoriaux Undergraduate Topics in Computer Science (Springer) Ian Mackie (). Voir. Programs and Proofs series (Polimetrica) Ian Mackie (). Voir. The Programming Languages Column (EATCS Bulletin) Ian Mackie (). Voir. XI Gestion scientifique de conférences Présidence de comités de pilotage DCM (International Workshop on Developments in Computational Models) (2013). Ian Mackie. Participation à des comités de pilotage RTA (International Conference on Rewriting Techniques and Applications) ( ). Ian Mackie. TERMGRAPH (International Workshop on Computing with Terms and Graphs) (). Ian Mackie. Présidence de comités de programme IJCAR (The International Joint Conference on Automated Reasoning) (2008). Dowek. Gilles LINEARITY (First International Workshop on Linearity.) (2009). Ian Mackie. RULE (The Tenth International Workshop on Rule-Based Programming) (2009). Ian Mackie. JFLA (Journées Francophones des Langages Applicatifs) (2011). Assia Mahboubi. DCM (International workshop on Developments in Computational Models) (2013). Ian Mackie. Participation à des comités de programme TERMGRAPH (International workshop in Computing with Terms and Graphs) (2009,2013). Ian Mackie. LATA (7th International Conference on Language and Automata Theory and Applications) (2013). Ian Mackie. DCM (International Workshop on Developments in Computational Models.) (2009,2010,2012). Ian Mackie. RuleML (International Web Rule Symposium) ( ). Ian Mackie. RC (International Workshop on Reversible Computation) (2010). Ian Mackie.

446 446 CHAPTER XI.6. ANNEXES : TYPICAL PPDP (International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming) (2010). Ian Mackie. TAASN (2nd International Workshop on Theory and Applications of Abstraction, Substitution and Naming) (2009). Ian Mackie. WRS (8th International Workshop on Reduction Strategies in Rewriting and Programming) (2009). Ian Mackie. FM (Formal Methods Doctoral Symposium) (2009). Ian Mackie. DCM (Joint 5th QPL and 4th DCM Workshops. Quantum Physics and Logic Developments in Computational Models.) (2008). Ian Mackie. WRS (International Workshop on Reduction Strategies in Rewriting and Programming) (2008). Ian Mackie. CSL (EACSL Annual Conference on Computer Science Logic) (2008). Gilles Dowek. LSFA (Workshop on Logical and Semantic Frameworks, with Applications) (2008,2010). Gilles Dowek. PLMMS (Programming Languages for Mechanized Mathematics Systems) (2008). Hugo Herbelin. ITP (Interactive theorem proving) ( ). Assia Mahboubi. JFLA (Journées Francophones des Langages Applicatifs) (2009,2010). Bruno Barras, Assia Mahboubi. Assia Mah- CICM (Conferences on Intelligent Computer Mathematics) (2010,2011). boubi. LICS (Annual ACM/IEEE Symposium on Logic In Computer Science) (2010). Dowek. Gilles ICALP (International Colloquium on Automata, Languages and Programming) (2010). Gilles Dowek. IJCAR (The International Joint Conference on Automated Reasoning) (2010). Dowek. Gilles RTA (International Conference on Rewriting Techniques and Applications) (2010). Gilles Dowek. NFM (NASA Formal Methods Symposium) (2010). Gilles Dowek. FLOPS (International Symposium on Functional and Logic Programming) (2008,2009). Benjamin Werner. XI Organisation d événements scientifiques PSATTT (International Workshop on Proof-Search in Axiomatic Theories and Type Theories) (2011). Germain Faure, Assia Mahboubi. Présidence de comités d organisation JFLA (Journées Francophones des Langages Applicatifs) (2011,2012). Assia Mahboubi.

447 XI.6.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION 447 XI Participation à des comités et jurys scientifiques Au niveau international University of Edinburgh (2008) Gilles Dowek. Membre du comité d évaluation. Au niveau national Commission de sélection Université Paris 7 (Gilles Dowek) 2008 ENS Lyon (Assia Mahboubi) 2009 Université d Évry/ENSIIE (Assia Mahboubi) 2010 Université Paris 13 (Gilles Dowek) 2011 INRIA Saclay Île-de-France (présidence du jury CR) (Benjamin Werner) Ecole Polytechnique (présidence des AG pour la sélection) (Benjamin Werner) ENS Cachan (Benjamin Werner) 2009 XI.6.3 XI Activités de formation, encadrement et évaluation Liste des thèses et HDR soutenues Habilitations à dirigers les recherches Benjamin Werner (Avril 2008). Faire simple pour pouvoir faire compliqué: contributions à une théorie des types pratique. Thèses de doctorat Lisa Allali (Octobre 2010). Coupures et réécriture. La super-cohérence comme critère universel de l élimination des coupures. Encadrant: Gilles Dowek. Mathieu Boespflug (Janvier 2011). Conception d un noyau de preuves pour le λπ-calcul modulo. Encadrant: Gilles Dowek. Cyril Cohen (Novembre 2012). Formalisation des nombres algébriques: construction et théorie du premier ordre. Encadrant: Assia Mahboubi, Benjamin Werner. Denis Cousineau (Décembre 2009). Models and proof normalization. Dowek. Encadrant: Gilles François Garillot (Décembre 2011). Outils de preuve générique et théorie des groupes finis. Encadrant: Benjamin Werner. Chantal Keller (Juin 2013). A Matter of Trust: Skeptical Communication Between Coq and External Provers. Encadrant: Germain Faure, Benjamin Werner. Sylvain Lebresne (Décembre 2008). Une approche de la détection statique d exceptions non rattrapées en appel par nom. Encadrant: Hugo Herbelin. Vincent Silès (Novembre 2010). Investigation on the typing of equality in type systems. Encadrant: Bruno Barras, Hugo Herbelin.

448 448 CHAPTER XI.6. ANNEXES : TYPICAL Encadrant: Ben- Arnaud Spiwack (Mars 2011). Calculs vérifiés en algèbre homologique. jamin Werner. Pierre-Yves Strub (Juillet 2008). Théorie des types et procédures de décision. Encadrant: Jean-Pierre Jouannaud. XI Liste de rapports de thèses et HDR Rapports d habilitations à dirigers les recherches Rapports de thèse Alexander Summers (November 2008). Curry-Howard Term Calculi for Gentzen Style Classical Logics. Imperial College London, London, UK. Rapporteur: Hugo Herbelin. Guillaume Burel (March 2009). Bonnes démonstrations en déduction modulo. Université Henri Poincaré, Nancy, France. Rapporteur: Gilles Dowek. Clément Houtmann (March 2010). Représentation et interaction des preuves en superdéduction modulo. Université Henri Poincaré, Nancy, France. Rapporteur: Gilles Dowek. XI Enseignements dispensés Cours universitaires en M2 Gilles Dowek and Benjamin Werner teach Fondements des Systèmes de Preuves at MPRI. Bruno Barras and Assia Mahboubi teach Preuves en Coq at MPRI. Cours universitaires en M1 Assia Mahboubi (2009) and Chantal Keller (2010) have taught a course on formal proofs at the École Nationale Supérieure des Techniques Avancées (ENSTA). Coordination d enseignements Benjamin Werner is the main person in charge for the teaching of Computer Science at Ecole Polytechnique. He teaches and coordinates the main L3 course together with François Pottier. Jury Gilles Dowek has participated to the HDR jury of David Delahaye, Étienne Moreau, Frédéric Prost and Pierre Valarcher. Gilles Dowek has participated to the Ph.D. thesis jury of David Baelde, Paul Brauner, Christophe Calvès, Clément Houtmann, Danko Ilik, Éric Jeager, Benoît Montagu, Yvan Noyer and Cristobal Rojas. Hugo Herbelin was Ph.D. jury member for Alexander Summers, Sylvain Lebresne and Boris Yakobowski. Benjamin Werner has been HDR jury member for Alexandre Miquel. Benjamin Werner has been has acted a the Ph.D. jury president for Ioana Pasca, Nicolas Guénot and Jorge Luis Sacchini. He has been Ph.D. jury member forchantal Keller, Roland Zumkeller, François Garillot and Arnaud Spiwack.

449 XI.6.3. ACTIVITÉS DE FORMATION, ENCADREMENT ET ÉVALUATION 449 Ecoles thématiques et cours spécialisés Assia Mahboubi has given a course on the Ssreflect extension for Coq at the JFLA national conference (2009). Assia Mahboubi has taught a course on introduction to type-theory based proof assistant to the UNESCO-CIMPA summer school Méthodes Effectives et Logiciels de la Logique et de l Algèbre pour la Géomètrie Algébrique Réelle et la Cryptographie at Yaoundé University, Cameroon (2009). Assia Mahboubi taught a course on Modelization and Verification of Algorithms in Coq during the CEA-EDF-INRIA school (2010). Assia Mahboubi taught a course on Modelization and Verification of Algorithms in Coq during the CEA-EDF-INRIA school (2011). Assia Mahboubi taught a course on the Mathematical components libraries at the MAP 2012 International Spring School on the formalization of mathematics (2012). Assia Mahboubi gave a 8 hour tutorial on Cylindrical Algebraic Decomposition in Coq at University de la Rioja, Spain (2011). Benjamin Werner gave a course on Coq at the VTSA 09 organized in Nancy by Stephan Merz fir INRIA Lorraine and Max Planck Institute. Vulgarisation Denis Cousineau, Bruno Bernardo and Élie Soubiran conceived and presented a poster about Programming Languages and Compilation at the Fête de la Science (2008). Cyril Cohen participated to the Faites de la science days (October 2011) Gilles Dowek has given a talk at the public library of Plessis-Trévise (January 16th, 2010), at Petite Université Libre of Tence (January 23rd, 2010), and Tables Ronde La Recherche (Collège de France, June 12th, 2010) and at Institut Bull (October 21st, 2010). Gilles Dowek has also given talks at the mathematical colloquiums of Strasbourg university (January 28th, 2010) and Poitier university (September 30th, 2010) and at École Centrale (November 3rd, 2010). Gilles Dowek has given a talk to the seminar common to CHSPAM REHSEIS of SPHERE Histoire and Philosophie des mathématiques and another talk at the seminar Philosophie et Mathématiques. Gilles Dowek has been a member of the expert group who has proposed a curriculum for the specialty Informatique et sciences du numériques in high schools. This program has been published on the Bulletin officiel on October, 13th Germain Faure has given a popular science talk at Les olympiades mathématiques (2010). Assia Mahboubi has given a popular science talk at the INRIA Saclay Île-de-France popular science seminar Unithé ou café Assia Mahboubi has given a talk at the Lycée Molière (Rio de Janeiro, Brazil) in the context of the Semaine de la Science (October 2011) Benjamin Werner gave an interview to the magazine La Recherche (2008) Benjamin Werner has been invited to the seminars of the Physics Department on Ecole Normale Supérieure and the physics department of Université Paris-Sud (2008).

450 450 CHAPTER XI.6. ANNEXES : TYPICAL XI.6.4 Autres éléments de visibilité XI Invitations Games for Logic and Programming Laguages (GaLoP), ETAPS (2011). Ian Mackie gave an invited talk. International School on Rewriting (2008). Ian Mackie gave an invited talk. Journées Francophone des Langages Applicatifs (2009). Bruno Barras gave an invited talk. International Workshop on Philosophy of the Information and Computing Sciences (Netherlands) (2010). Gilles Dowek gave an invited talk.. International Workshop on Strategies in Rewriting, Proving, and Programming (2010). Assia Mahboubi gave an invited talk.. International Conference on Mathematics Algorithms and Proofs (2010). Assia Mahboubi gave an invited tutorial on Cylindrical Algebraic Decomposition in Coq.. Institute for Advance Studies, Princeton, USA (2012). Bruno Barras and Assia Mahboubi were invited for 3 months as participants to the Univalent Foundations of Mathematics programme. TYPICALTypical