Job offers

The Links project of Inria Lille and the CRIStAL lab is working on foundations and applications for querying Web databases based on logics and automata. Links’ general objective is to develop novel techniques for querying heterogeneous collections of linked Web databases as if they were integrated into a single homogeneous database. Beside other challenges, this requires to develop novel algorithms that enable the management of dynamic networks of linked and distributed data in a real time. Links has opening for research positions on all different levels, offered by Inria, CNRS, the Universities of Lile 1 and Lille 3. The opportunities are listed below. Whenever you are interested in working with us, please contact us by email to links-apply@lists.gforge.inria.fr.

Currently we have the following openings:

    1. PhD fellowships.

      Currently, we have the following openings:

      1. Querying Data Graphs with GPath efficiently. Joachim Niehren
      2. other that subscribe to our ANR projects are possible on demand.
    2. Postdocs

      The openings of postdoc positions at INRIA are usually in March, so that the postdoc can start in September. Some of the topics proposed above for a PhD thesis could also be persued by a postdoc.

    3. Engineering position

      No openings currently.

    4. Masters students and internships.

      On demand. We always have offers available, so please contact us in case of interest and we see what we can do for you.

Future openings and their usual calendar.

  1. Permanent researcher positions at Inria.

    We always search excellent junior or senior researchers wanting to join in the Links’ project via Inria. In 2016, there were 3 openings for junior researchers at Inria Lille and one opening for a senior researcher in Inria’s national competition. The application deadline was mid of February; the competitions is closed. The opening of the next competition is expected for begin of 2018.

  2. Permanent researcher positions at CNRS.

    We search excellent junior or senior researchers wanting to join in the Links’ project via CNRS. Begin of 2016 there were 6 junior researcher positions opened for all of France. The competition is closed. There are also senior researcher positions. The next opening is expected for December 2017.

  3. Professorships at the Universities of Lille.

    There will be an opening but not targeted towads Links.

  4. Assistant Professorships at the Universities of Lille.

    There will be an opening at  the University of Lille 3 with  a profile on machine learning and a submission deadline begin of March 2018.

  5. Temporary researcher positions at Inria.

    Inria offers 3 years researcher positions on junior ad senior levels. For the junior level see the Starting Research Positions. For the senior level see the Advanced research positions. The deadline of the 2018 may be begin of April.

Permanent link to this article: https://team.inria.fr/links/job-offers/

Equivalence of Tree Transducers

Subject Equivalence of Tree Transducers Location The position is open in the LINKS project-team at INRIA Lille. Supervisors Aurélien Lemay (Université de Lille, INRIA, Links),Sylvain Salvati (Université de Lille, INRIA, Links). Duration INRIA is financing 12 to 16 months of postdoc. The postdoc could be extended up to 24 months using the ANR colis fundings. …

Linux Packages and Tree Transducers

Linux Packages and Tree Transducers Abstract This project deals with verification of install and uninstall scripts for Linux distributions. We aim at formalizing scripts by tree tranduscers in order to verify static properties during their activity. For instance, we aim at checking whether the composition of the install and the uninstall script is equivalent to …

Safety of Data Transformations (SaDaT)

Abstract This project takes place within the context of the ANR project Colis. Its goal is to certify properties of transformations of data trees, such as the installation scripts for Linux distributions. In previous work, we developed algorithms that can automatically verify properties of top-down transducers on data trees. The main bottleneck of this approach …