Submit an internship offer

  1. Formal Verification of Liveness in Distributed Systems via Reinforcement Learning
    Ocan Sankur, Florian Faissole (IRISA, Rennes)
    Related courses: ADVERIF, VCP
  2. Cryptographic Simulator Synthesis Using Program Logics
    Adrien Koutsos, Aymeric Fromherz (Inria Paris)
    Related courses: SECURE, PROGPROOFS
  3. Decision Procedure for Equivalence Relations
    Pierre Corbineau and Lionel Rieg at Verimag, Grenoble INP - UGA, in Grenoble
    Related courses: Foundations of Proof Systems, Proof Assistants
  4. WQO dichotomy for homogeneous structures (experimental evaluation)
    Slawomir Lasota, University of Warsaw
    Related courses: WQO
  5. Kleene Algebra with Tests for probabilistic programs
    Patrick Baillot, Leandro Gomes (Lille, CRIStAL)
  6. Variants of Higher-Dimensional Automata
    Uli Fahrenberg & Amazigh Amrane; location: LMF, ENS Paris-Saclay, 4 avenue des Sciences, 91190 Gif-sur-Yvette
  7. Deep Learning Prediction of Enzyme Functions Beyond EC Classification
    François Coste, Centre Inria de l’Université de Rennes
  8. Dolev-Yao-Model-Guided Fuzzing of E-Voting Protocols
    Lucca Hirschi, Inria Nancy, France
    Related courses: SECURE
  9. Optimising MBQC Patterns
    Maxime Garnier and Thierry Martinez, QAT, Inria/DIENS
    Related courses: QUANTUM, QALCO, APPROX, HEU
  10. Formalising MBQC in Rocq
    Maxime Garnier and Thierry Martinez, QAT, Inria/DIENS
    Related courses: QUANTUM, QALCO, PRFA, PROGPROOFS
  11. Drawing toroidal 3-connected graphs, via Schnyder woods
    Luca Castelli Aleardi (LIX, Ecole Poytechnique)
    Related courses: GEOMGRAPHS
  12. Chiffrement avancé fondé sur les problèmes LWE
    Thomas Ricosset - Thales Gennevilliers
    Related courses: LCRYPT
  13. Cryptanalyse symétrique aidée par MILP
    Nicolas David - Thales Gennevilliers
    Related courses: CODES
  14. Computational Differential Algebra for the Enumeration of Regular Bipartite Graphs
    Frédéric Chyzak, Inria Saclay (in Palaiseau)
    Related courses: COMPALG, COMBIAA, AOFA
  15. Conditional reasoning for mechanised cryptographic proofs
    Joseph Lallemand & David Baelde, équipe SPICY, IRISA, Rennes
    Related courses: SECURE
  16. Intégration des approches topologiques et géométriques dans le cadre de la modélisation 3D
    Bac Alexandra, Aldo Gonzalez-Lorenzo, Yann-Situ Gazull (LIS Marseille)
    Related courses: Computational Geometry and Topology, Algorithms and Combinatorics of Geometric Graphs
  17. Modélisation formelle des algorithmes de protection lanceur
    Danko Ilik, CNES Paris-Daumesnil
    Related courses: PRFA, CGT, COMPALG
  18. Circuit Complexity, Reaction Networks, and Analog Computations.
    Olivier Bournez, LIX, Ecole Polytechnique
  19. Various topics in proof assistants, programming languages, and logic
    Yannick Forster, Inria Paris, Team Cambium
    Related courses: PRFA, PRFSYS, PROGPROOFS, FUN, SEMPL, ECOLO, SECURE, HOTT
  20. A formal study of finite projective planes using Rocq
    Nicolas MAGAUD (ICube UMR 7357 CNRS-Université de Strasbourg)
    Related courses: Logic/Proof
  21. Automatic proofs in projective geometry : finite projective spaces, spreads, and packings
    Nicolas MAGAUD (ICube UMR 7357 CNRS-Université de Strasbourg)
    Related courses: Logic/Proof
  22. Probabilities of Regular Languages of Infinite Trees
    Paweł Parys, University of Warsaw, Poland
  23. Local extensions of type theory
    Théo Winterhalter, ENS Paris-Saclay
    Related courses: PRFA, PRFSYS, PROGPROOFS, FUN, SEMPL, ECOLO, SECURE, HOTT
  24. Improving the memory footprint of MPCitH
    Rafael del Pino & Morgane Guerreau, PQShield (Paris)
  25. Gamess with Boolean Combinations of Energy and Parity Objectives
    Aditya Prakash and Karoliina Lehtinen, LIS, Aix-Marseille Université
    Related courses: The intern would benefit from ADVERIF or JEUXSTO but it is not necessary.
  26. Circuit equational theories with control and ancillas
    Chris Heunen, Louis Lemonnier at Quantum Software Lab, University of Edinburgh
    Related courses: QUANTUM, SEMPL
  27. Transition Post-Quantique d'un Protocole VPN
    Sylvain Ruhault, Abdel Rahman Taleb (ANSSI, Paris)
  28. Approximating the safety value in partially observable Markov decision processes
    Thomas Brihaye & Pierre Vandenhove, Université de Mons (Belgium)
    Related courses: JEUXSTO, ADVERIF
  29. From Theory to Performance: Building Efficient Reasoners for Standpoint Logic
    Lucía Gómez Álvarez, at the Inria Centre at the University Grenoble Alpes
  30. Modelling Multi-Perspective Knowledge on the Semantic Web
    Lucía Gómez Álvarez, at the Inria Centre at the University Grenoble Alpes
  31. A formally verified equational theory of modern regular expressions
    Supervisors: Aurèle Barrière, Clément Pit-Claudel and Gabriel Radanne. Location: Lyon, France.
  32. Open Automata meet Choreographies
    Rabéa Ameur-Boulifa, Cinzia Di Giusto and Ludovic Henrio: Internship in Sophia Antipolis Eurecom and Lab I3S
  33. Développement d’une architecture de contrôle en corps complet par apprentissage par renforcement pour la manipulation d’objets articulés distants
    Mélodie DANIEL et Olivier LY - Laboratoire Bordelais de Recherche en Informatique (LaBRI) Bordeaux, France
  34. Perception multi-sensorielle et suivi temporel d’objets déformables pour la robotique agricole autonome
    Mélodie DANIEL et Olivier LY - Laboratoire Bordelais de Recherche en Informatique (LaBRI) Bordeaux, France
  35. Cooperation and Competition in Online Markets
    Felipe Garrido-Lucero, Université Toulouse Capitole, Toulouse, France
    Related courses: Probability and Algorithmic Applications, Algorithms for Stochastic Games
  36. Encoding type systems with universes in Dedukti
    Frédéric Blanqui, ENS Paris Saclay
    Related courses: PRFSYS, PRFA, FUN
  37. Translating Rocq or Lean proofs to Isabelle/HOL
    Frédéric Blanqui, ENS Paris Saclay
    Related courses: PRFSYS, PRFA, FUN
  38. Method Combinations for Programming Languages with Multiple Dispatch
    Didier Verna, EPITA Research Lab, 14-16 rue Voltaire, 94270 Le Kremlin-Bicêtre
  39. Mathematical Investigation of Non-Deterministic Switches in Cell Regulation
    Stefan HAAR, MUSCA Team, INRIA Saclay, Bât. Turing, Palaiseau
  40. Soundness of Rust Verification in the Presence of Safe and Unsafe Code
    Yannick Zakowski at Inria Paris in the Cambium Research Group. Co-advised remotely by Son Ho, designer of Aeneas.
  41. Boolean Complexity for Validated Numerical Resolution of Algebraic Curve Singularities
    Adrien Poteaux, Rémi Prébet and Florent Bréhard - CRIStAL, Univ. Lille
    Related courses: COMPALG
  42. Combinatorial and computational properties of hom shifts
    Benjamin Hellouin de Menibus ; LISN, université Paris-Saclay
    Related courses: Symbolic Dynamics, Algorithmic Aspects of Combinatorics
  43. Model Checking for Open Automata
    Rabéa Ameur-Boulifa (Télécom Paris – Sophia Antipolis) and Ludovic Henrio (ENS Lyon)
    Related courses: Foundations of Proof Systems
  44. Singular Euler-Maclaurin Expansion in Rocq
    Andreas Buchheit, Cyril Cohen (Inria Lyon), Dominik Kirst (Inria Paris), Assia Mahboubi (Inria Rennes, Nantes site)
    Related courses: Proof assistants
  45. Learning Tree Automata
    Adrien Pommellet & Amazigh Amrane - Location : EPITA Paris, LRE, 14-16 Rue Voltaire, 94270 Le Kremlin-Bicêtre
  46. Typst
    Gabriel Scherer, Paris
    Related courses: Functional programming and Type Systems (FUN)
  47. Comparing large genomic datasets with Invertible Bloom Lookup Tables
    Gregory Kucherov
    Related courses: PROBAS, AOFA, CODES
  48. Intersection Types for the Positive Lambda Calculus
    Delia Kesner and Giulio Manzonetto (IRIF, Universite Paris Cite)
  49. Parallel Abstract Interpretation
    Valentin Perrelle, CEA List (Palaiseau)
    Related courses: AISAV
  50. Program representations for Deep Learning
    Michele Alberti, Valentin Perrelle, CEA List (Palaiseau)
  51. Conception d’un langage de propriétés pour les protocoles cryptographiques en Squirrel
    David Baelde et Stéphanie Delaune (Équipe Spicy, IRISA, Rennes)
    Related courses: SECURE
  52. Verifying security protocols with exclusive-or using PROVERIF
    Vincent Cheval (Oxford UK) et Stéphanie Delaune, Équipe Spicy, IRISA, Rennes
    Related courses: SECURE
  53. Canonical for Rocq
    Pierre Boutry, Chase Norman, Loïc Pujet. In Strasbourg University.
    Related courses: PRFA, PRFSYS, HOTT
  54. A syntax for proof-relevant Observational Type Theory
    Loïc Pujet. In Strasbourg University.
    Related courses: PRFA, PRFSYS, HOTT, SEMPL
  55. Side-Channel Analysis of a post-quantum encryption scheme without re-encryption
    Gabriel Zaid and Mélissa Rossi
    Related courses: LCRYPT, CODES
  56. Post-Quantum Anonymous Credentials
    Matthieu Rivain and Thibauld Feneuil
    Related courses: LCRYPT, SECURE, FIP
  57. The Künneth theorem in Homotopy Type Theory
    Pierre Boutry, Viktoria Heu, Loïc Pujet. In Strasbourg University.
    Related courses: PRFA, PRFSYS, HOTT, SEMPL, CGT
  58. Code de Gray: délai et espace constant
    Victor Marsault et Yann Strozecki, LIGM (Université Gustave Eiffel)l
  59. Étude des automates à deque
    Victor Marsault et Yann Strozecki, LIGM (Université Gustave Eiffel)l
  60. Model-Checking Linear Dynamical Systems under Floating Point Rounding
    Engel Lefaucheux, Inria Nancy
    Related courses: ADVERIF, CTRLVERIF, WQO
  61. Model-Checking Techniques for Virus and Malware Detection
    Tayssir Touili (IRIF)
    Related courses: ADVERIF, VCP, AISAV
  62. Gradual and Semantic Typing for Elixir's Module System (2 internship subjects)
    Giuseppe Castagna (IRIF, Paris) in collaboration with the Elixir development team
    Related courses: Functional Programming and Type Systems
  63. Extending Polymorphic Type Inference for Dynamic Languages: Gradual Typing and Efficient Implementation (2 internship subjects)
    Giuseppe Castagna (IRIF, Paris) and Kim Nguyen (LMF, Paris Saclay)
    Related courses: Functional Programming and Type Systems
  64. Advanced Typing of Map Data Structures in Elixir (3 internship subjects)
    Giuseppe Castagna (IRIF, Paris) in collaboration with the Elixir development team
    Related courses: Functional Programming and Type Systems
  65. Certified compilation of concurrent programs
    Jean-Marie Madiot, Inria Paris
    Related courses: PRFSYS, PROGPROOFS
  66. Böhm Trees for the Bang Calculus
    Giulio Guerrieri and Delia Kesner
  67. Formally Secure Compilation Against Spectre Attacks
    Catalin Hritcu, MPI-SP, Bochum, Germany
    Related courses: FUN, PRFSYS, PRFA, SECURE, SYNC, PROGPROOF
  68. Finding points of interests for complex faults injection models
    Hadrien Barral, LIGM, Université Gustave Eiffel
  69. Repairing corrupt compressed streams
    Hadrien Barral, LIGM, Université Gustave Eiffel
  70. Secret quorums protecting byzantine reliable broadcast against adaptive adversaries
    Maxence Perion and Sara Tucci, Universite Paris-Saclay, CEA (Palaiseau)
    Related courses: PODC, DISC, CRYPTALG, SECURE
  71. Zero-Knowledge Proofs in Networks
    Ami PAZ, Paris-Saclay University
    Related courses: DISC, PODC, FIP
  72. Smoothed Analysis: Bridging Theory and Practice in Dynamic Networks
    Ami PAZ, Paris-Saclay University
    Related courses: DISC, PODC
  73. Distributed Dynamic Graph Algorithms
    Ami PAZ, Paris-Saclay University
    Related courses: DISC, PODC
  74. Solving Differential Equations in Rocq
    Florent Bréhard (CRIStAL, Univ Lille), Damien Pous, Nicolas Brisebarre (LIP, ENS Lyon)
    Related courses: PRFA, COMPALG
  75. Algorithms in Computer Assisted Proofs for Ordinary Differential Equations
    Florent Bréhard (CRIStAL, Univ Lille), Nicolas Brisebarre, Rémi Prébet (LIP, ENS Lyon), Maxime Breden (CMAP, École Polytechnique)
    Related courses: COMPALG, AISAV
  76. Relational Separation Logic for Compiler Verification
    Xavier Leroy and François Pottier, Inria Paris
    Related courses: FUN, PROGPROOFS, PRFA
  77. Certified Symbolic-Numeric Algorithms for Connectivity on semi-algebraic sets
    Rémi Prébet (LIP, ENS Lyon), Florent Bréhard and Nicolas Brisebarre
    Related courses: COMPALG, AISAV
  78. Interactive Program Verification Meets Abstract Interpretation
    Aymeric Fromherz (Prosecco team, Inria Paris). Co-advised by Benoit Montagu (Epicure Team, Irisa) and Son Ho (Microsoft Azure Research, Cambridge, UK)
    Related courses: AISAV, FUN, PROGPROOFS
  79. F* proof-oriented programming language
    Catalin Hritcu, MPI-SP, Bochum, Germany
    Related courses: FUN, PRFSYS, PRFA, SECURE, PROGPROOFS
  80. Large-Scale Seismic Imaging: Distributed Reverse Time Migration Accelerated by AI
    Wilfried Kirschenmann - Boulogne-Billancourt (France)
  81. Internship: MLOps Adversarial AI
    Wilfried Kirschenmann - Boulogne-Billancourt (France)
  82. Computation of distances between transducer models and application to approximate learning of word functions and relations
    Benjamin Monmege, Marseille (Aix-Marseille Université, Laboratoire d'Informatique et des Systèmes)
    Related courses: MATA, VCP, ADVERIF
  83. Exploring interactions between automated program analysis and witnesses
    Raphaël Monat, Inria Lille
    Related courses: AISAV
  84. Experimental evaluation of relational abstract domains
    Raphaël Monat, Inria Lille
    Related courses: AISAV
  85. Model Checking for Open Automata
    Rabéa Ameur-Boulifa (Télécom Paris – Sophia Antipolis) and Ludovic Henrio (ENS Lyon)
    Related courses: VCP, ADVERIF, CTRLVERIF
  86. M2 internship (ENS-PSL & Inria Paris) related to logic-based methods for AI and databases
    Michaël Thomazo and Meghyn Bienvnu, ENS-PSL, Inria
    Related courses: QD
  87. Réseaux booléens degré-bornés
    Adrien Richard - I3S (UMR CNRS 7271) - Sophia Antipolis (Nice)
    Related courses: MATA
  88. Graphe d’interaction, propriétés dynamiques, et complexité des réseaux booléens
    Adrien Richard - I3S (UMR CNRS 7271) - Sophia Antipolis (Nice)
    Related courses: MATA - COMPLB
  89. Synchronisation des réseaux booléens asynchrones
    Adrien Richard - I3S (UMR CNRS 7271) - Sophia Antipolis (Nice)
    Related courses: MATA
  90. Translation of formal proofs between set theory encodings
    Catherine Dubois, Thomas Traversié - Paris-Saclay ou Evry
  91. Formally Verified Compilation of an Interaction-Oriented Programming Language
    Cyril Allignol, Basile Pesin and Celia Picard; Ecole Nationale de l'Aviation Civile (Toulouse)
  92. M2 Internship Opportunity - Concurrent Autonomic Control for the Computing Continuum
    Farah AIT SALAHT (ESILV/DVRC) and Christian Perez (Inria/ENS Lyon). Internship Location: Research Center of the Léonard de Vinci Pôle Universitaire, 92916 Paris La Défense, France.
  93. Inference of Broadcast protocols
    Peter Habermehl and Tali Sznajder (IRIF, Paris)
    Related courses: MATA