IRIF members and visitors are asked to comply with the
** COVID-19 Directives** of CNRS and Université de Paris.

## Welcome

IRIF, the Research Institute on the Foundations of Computer Science, is a research laboratory of CNRS and Université de Paris, also hosting two Inria project-teams.

The research conducted at IRIF is based on the study and understanding of the foundations of all computer science, in order to provide innovative solutions to the current and future challenges of digital sciences.

IRIF hosts about 200 people. Six of its members have been distinguished by the European Research Council (ERC), five are members of the Institut Universitaire de France IUF), and two are members of the Academia Europæa.

## Notion of the day

## News

*10.1.2020*

Université de Paris has opened **one permanent associate professor** position in Computer Science. Recruited researcher will join IRIF. Apply by **April 9th, 4pm** (Paris time).

*6.2.2020*

Sylvain Périfel from IRIF, together with Damiano Mazza and Thomas Seiller, organize the Caleidoscope Research School in Computational Complexity, to be held in Paris, **15-19 June 2020**.

(These news are displayed using a randomized-priority ranking.)

## Events

**All events are currently organized remotely (or postponed).**

Verification

Monday March 30, 2020, 11AM, (online, using BigBlueButton)

**[Rescheduled] Filip Mazowiecki** (MPI SWS) *Lower bounds for polynomial recurrence sequences*

Verification

Monday March 30, 2020, 11AM, Salle 1007

**[Cancelled] Adrian Francalanza** (University of Malta) *An Operational Guide to Monitorability*

Algorithms and complexity

Tuesday March 31, 2020, 2:30PM, Online

**Vincent Jugé** (LIGM) *Adaptive ShiversSort - A new sorting algorithm*

Live stream: https://bbb2.math.univ-paris-diderot.fr/b/yas-gge-2ka

PhD students seminar

Wednesday April 1, 2020, 11AM, Online

**Simona Etinski** (IRIF & INRIA) *To be announced.*

Automata

Friday April 3, 2020, 2:30PM, Online

**Nathanaël Fijalkow** (LaBRI) *Assume Guarantee Synthesis for Prompt Linear Temporal Logic*

In this talk I will discuss the case where both Assumptions and Guarantees are given by Prompt Linear Temporal Logic (Prompt LTL), which is a logic extending LTL by adding bound requirements such as “every request is answered in bounded time”.

The solution to the AG problem for Prompt LTL will be an invitation to the theory of regular cost functions.

Joint work with Bastien Maubert and Moshe Y. Vardi.

Séminaire Virtuel sur BigBlueButton

Verification

Monday April 6, 2020, 11AM, (online, using BigBlueButton)

**Amaury Pouly** (CNRS & IRIF) *To be announced.*