Internships 2021/2022

  1. Algorithms with Learnable Predictions for Combinatorial Optimization
    NGUYEN Kim Thang
    Algorithms and Uncertainty, Randomness in complexity
  2. Types for complexity analysis in a process calculus
    Patrick Baillot - CRIStAL (Villeneuve d'Ascq / Lille)
    2.3.1, 2.4
  3. Étude d’une méthode probabiliste d’estimation de paramètres pour un modèle continu de dynamique de population océanique
    Guillaume Cantin et Benoit Delahaye - Université de Nantes / LS2N
  4. Using Data Science to derive stochastic models for parallel applications scheduling
    Guillaume Pallez + Fanny Dufossé - Inria Bordeaux
    2.24.1 (Algorithmes et incertitude), éventuellement 2.17.1 (Fondements sur la modélisation des réseaux )
  5. Implicit computational complexity in Pi-calculus
    Patrick Baillot - CRIStAL (Villeneuve d'Ascq / Lille)
    2.3.1,2.4
  6. Estimation robuste de modèles en IRM de diffusion
    Olivier Commowick - Inria Rennes
  7. un analyseur flots de données paramétré par un ordre d'itération pour le compilateur formellement vérifié CompCert
    Sandrine Blazy, professeur Univ Rennes - UMR IRISA
    2-04, 2-06, 2-07-1, 2-07-2, 2-36-1
  8. Coq formalization of graph transformation
    Russ Harmer & Damien Pous - Equipe Plume, LIP, ENS Lyon
  9. Logical Models of Multi-scale Biological Processes
    Aurelien Naldi - Inria Saclay - Palaiseau
    C2-19
  10. Compiling Mathematical Functions in Biochemical Reaction Networks
    François Fages - Inria Saclay - Palaiseau
    C2-19
  11. Good error messages and documentation for OCaml modules via diffing
    Gabriel Radanne and Florian Angeletti – Lyon
  12. Quantum networks theory
    Pablo Arrighi—LMF, U. Paris-Saclay
    2.34.1
  13. Type indexing in OCaml: search and find functions in a large ecosystem
    Gabriel Radanne and Laure Gonnord – ENS Lyon, LIP, Cash
  14. Open Automata meet Sessions Types
    Rabea Ameur-Boulifa and Ludovic Henrio
  15. Improved parser for model descriptions in an open-source software for simulations in computational neuroscience
    Marcel Stimberg - Institut de la Vision, Paris
  16. CFG Patterns: A new tool to formally verify optimisations in Vellvm
    Yannick Zakowski, Gabriel Radanne – CASH, LIP, ENS Lyon
  17. Reasoning with hard and soft constraints to repair and query inconsistent data
    Meghyn Bienvenu (LaBRI, Bordeaux) & Camille Bourgaux (DI ENS, Paris)
    2.26.2, 1-39
  18. Fault invariance, quantum algorithms and architectures
    DI MOLFETTA Giuseppe - Marseille LIS
  19. Complexity theory with Discrete Differential Equations/Finite differences.
    Olivier Bournez
  20. Characterization of NP or PSPACE with polynomial Ordinary Differential Equations Continuous time Analog machines and models of computation.
    Olivier Bournez
  21. Randomness and Continuous Time Dynamical Systems. Kolmogorov Complexity and Analog Models of Computation.
    Olivier Bournez
  22. Continuous Time Models of Computations and Computations Over the Ordinals.
    Olivier Bournez
  23. Conception d’un langage de spécification et programmation fonctionnelle réactive.
    Christine Tasson - LiP6
  24. Forêts de Schnyder pour des graphes en genre supérieur, avec applications au dessin
    Luca Castelli Aleardi - LIX (Ecole Polytechnique)
    2-38-1
  25. Knowledge Compilation and Enumeration for Efficient Query Evaluation Algorithms
    Antoine Amarilli and Pierre Bourhis (Télécom Paris or INRIA Lille)
    2.26.1, 2.26.2
  26. Combinatorics of the remixed eulerian numbers
    Sylvie Corteel (IRIF Universite de Paris) Philippe Nadeau (ICJ, Universite de Lyon 1)
    C2-10
  27. Local Reasoning about Reconfigurable Component-based Systems
    Radu Iosif - VERIMAG, Grenoble
  28. Verifying Concurrent Systems with Automata over Infinite Alphabets
    Radu Iosif - VERIMAG, Grenoble
  29. Decision Procedures for Separation Logic Modulo Theories of Data
    Radu Iosif - VERIMAG, Grenoble
  30. Modification problems on graphs: algorithms, logic, and combinatorics
    Ignasi SAU (LIRMM, Montpellier)
  31. Meshing Singular Surfaces - Application in Robotics
    Marc Pouget et Guillaume Moroz
  32. How does the shape of the hippocampus affects automatic segmentation ?
    Claire Cury and Pierre-Yves Jonin at the IRISA - Inria research center in Rennes
    Computational Geometry Learning
  33. Symétries et extensions des intervalles de Tamari à travers des bijections
    Wenjie Fang et Éric Fusy, LIGM, Université Gustave Eiffel
    2.10, 2.15
  34. Produit de battage et intervalles dans les polytopes d'hypergraphes
    Bérénice Delcroix-Oger - IRIF
  35. Planar maps endowed with an ABAB configuration
    Marie Albenque (LIX – École Polytechnique) and Valentin Bonzom (LIPN – Université Paris 13)
  36. Online Financial Optimization with Predictions
    Spyros Angelopoulos–LIP6, Sorbonne University
  37. Prophet inequalities with paid samples
    Christoph Dürr, LIP6
    2-24-1
  38. Automatisation de preuves calculatoires de protocoles par typage
    Stéphanie Delaune & Joseph Lallemand, IRISA, Rennes
    2.30
  39. Proof Systems for Post-Quantum Signatures
    Rafael del Pino & Thomas Prest – PQShield SAS (Paris, FR)
    2.12.1, 2.12.2, 2.13.2
  40. Internship on Code Completion with Machine Learning
    Gabriel Synnaeve – Paris (remote)
  41. Symbolic-Model-Guided Fuzzing of Cryptographic Protocols
    Lucca Hirschi - LORIA
  42. Minimum number of edges in $k$-critical digraphs on $n$ vertices
    Pierre Aboulker, ENS Paris
    Algorithmique des graphes, Fouille de graphes
  43. Learning-Based Formalization and Verification of Block-Box Cyber-Physical Systems
    Mo Foughali and Eugene Asarin (IRIF, Université de Paris)
  44. Robust Formal Verification of Real-Time Systems
    Mo Foughali and Aldric Degorre (IRIF, Université de Paris)
  45. Monitoring efficace à l’aide de méthodes formelles
    Mo Foughali (IRIF, Université de Paris) and Étienne André (LORIA, Université de Lorraine)
  46. Recoloring in Temporal Graphs
    Mikaël Rabie - IRIF - Université de Paris
    2.18.1, 2.29.1
  47. Chemins à grands pas dans le quart de plan
    Mireille Bousquet-Mélou, LaBRI, Université de Bordeaux
    Aspects algorithmiques de la combinatoire
  48. Quantum (walk) algorithms for graph problems
    Simon Apers (IRIF, Université de Paris)
    2.34.1 (Quantum information), 2.34.2 (Quantum information and cryptography)
  49. Sujets data science appliqués au e-commerce
    Cdiscount, Bordeaux
  50. Code-level Cybersecurity & Program Analysis: Vulnerabilities, Verification, Reverse
    Sébastien Bardin – CEA Saclay (IdF)
    2.5, 2.6, 2.9, 2.36
  51. Enumerating Regular Language Matches on Dynamic Data
    Antoine Amarilli, Télécom Paris
    2.26.1, 2.26.2
  52. Semantics of Probabilistic Reactive Programming
    Guillaume Baudart, Christine Tassn, LiP6, Paris
  53. Synchronization in Stochastic Games
    Laurent Doyen - LMF, ENS Paris-Saclay
    2.8.1, 2.20.1
  54. Data Quality, Uncertainty, and Lineage (Master's Internship and PhD Position)
    Pierre Senellart & Stéphane Bressan, ENS Paris & National University of Singapore
    2.26.1, 2.26.2, 2.29.2
  55. Shifts substitutifs en dimension 1
    Marie-Pierre Béal et Dominique Perrin, Université Gustave Eiffel, Marne-la-Vallée
    2.20.2 Dynamique symbolique
  56. Equational Proofs for
    Kristina Sojakova (Inria Paris)
    2.7.2 (Proof Assistants) 2.3.1 (Concurrency) 2.4 (Functional Programming and Type Systems)
  57. Equational Proofs for Distributed Cryptographic Protocols
    Kristina Sojakova (Inria Paris)
    2.7.2 (Assistants de preuves) 2.4 (Programmation fonctionnelle et systèmes de types) 2.3.1 (Concurrence)
  58. Query-Directed Width Measures for Probabilistic Graph Homomorphisms
    Antoine Amarilli and Mikaël Monet
  59. V´erification param´etr´ee de r´eseaux avec communication non contrˆol´ee
    Arnaud Sangnier, Tali Sznajder - IRIF
    2.8.1
  60. Compiler/runtime support for dynamic DAG optimizations
    Christophe Alias (ENS de Lyon) et Samuel Thibault (Université de Bordeaux)
    compilers, parallel runtimes, code optimization, polyhedral model
  61. Compiler-guided runtime scheduling under resource constraints
    Christophe Alias (ENS de Lyon) et Jean-Baptiste Besnard (Paratools)
    compilers, parallel runtimes, code optimization, polyhedral model
  62. DevSecOps pipeline for application fuzzing
    Paris
  63. Support for fixed-point data types in QGen
    Paris
  64. Enhance Processor-in-the-Loop (PIL) capabilities in QGen
    Paris
  65. Verifying Simulink models with SPARK
    Paris
  66. Mémoire visuelle et cybersécurité
    Enka Blanchard et Antoine Gallais, Université Polytechnique Hauts-de-France
    2.3.2, 2.11.1, 2-24-2
  67. yeyueya
    aey_a
  68. Reconstruction de types riches
    Akim Demaille – Faveod
    2.4
  69. Commonsense Reasoning For Question Answering
    Julien Romero - Telecom SudParis (Palaiseau ou Evry)
  70. AI-based adaptive human-computer interfaces
    Christophe Jouffrais (DR CNRS), Bogdan Cautis (PR U Paris-Saclay) - CNRS IPAL Singapore
  71. Stochastic Accountability in Distributed Systems
    Petr
    2.18.1, 2.18.2
  72. AI-based adaptive human-computer interfaces
    Bogdan Cautis - CNRS, IPAL, Singapore
    2.26.2,2.29.2
  73. Learning-Based formalization and verification of black-box Cyber-Physical Systems
    Eugene Asarin, Mo Foughali, IRIF
  74. Studying French Media Polarization with Graph Neural Networks
    Fragkiskos Malliaros (CentraleSupelec, Inria), Nicolas Herve (INA), Zeynep Pehlival (INA)
  75. Constraint-Programming approach for traffic routing problems
    Youcef Magnouche (youcef.magnouche@huawei.com) and Dr. Pierre Bauguion (pierre.bauguion@huawei.com) - Boulogne-Billancourt
    Constraint-Programming, Combinatorial optimization
  76. Vector addition systems and weighted automata
    Filip Mazowiecki, Wojciech Czerwinski
  77. Flux d'information et analyse de pureté: application à l'initialisation non-ambiguë de modules OCaml
    Benoît Montagu, Thomas Jensen, Épicure team, Inria Rennes
    2.4, 2.6