Pole Algorithms and discrete structures

Pole Automata, structures and verification

Pole Proofs, programs and systems

Inria project-team $\pi r^2$ (Inria)

Thematic team Algebra and computation

Thematic team Algorithms and complexity

Thematic team Automata and applications

Thematic team Combinatorics

Thematic team Modeling and verification

Thematic team Proofs and programs

Thematic team Theory and algorithmics of graphs

## Non-permanent members’ seminar

#### Day, hour and place

Thursday at 4pm, room 3052

The calendar of events (iCal format).

In order to add the event calendar to your favorite agenda, subscribe to the calendar by using this link.

#### Contact(s)

Welcome to a new series of non-permanent weekly seminars on **Thursdays at 4 p.m., room 3052**. This is an excellent opportunity for all non-permanent members, including postdocs, ATERs, PhD students, and interns, to connect, share research interests, and create a welcoming scientific atmosphere.

*Introduction Section*

We'll start with an introduction section **(Thursday, October 10, 2024, 4 PM, room 3052)** where everyone can briefly share their name, background, and research topic (if desired). This is a casual and friendly setting, so don't be shy!

*Upcoming Talks*

All talks are open to everyone, regardless of experience level. We encourage beginners to attend and learn from our more experienced colleagues.

*Refreshments*

To make it even more enjoyable, we'll have IRIF cake right after the seminar!

We look forward to seeing you there!

**Computer Science Q&A Forum**

If you wish to ask or answer a Computer Science question at the seminar, you can use this link.

### Next talks

Non-permanent members' seminar

Thursday October 17, 2024, 4PM, Room 3052

**Niklas Kochdumper** (Post-Doc) *Automated Verification of Dynamic Systems*

Non-permanent members' seminar

Thursday October 24, 2024, 4PM, Room 3052

**Avinandan Das** (PhD Student) *To be announced*

Non-permanent members' seminar

Thursday November 28, 2024, 4PM, Salle 3052

**Vincent Moreau** *To be announced.*

### Previous talks

#### Year 2024

Non-permanent members' seminar

Thursday October 10, 2024, 4PM, Salle 3052

**Everyone** *Introductory session & social event*

After the session, we will have some refreshment and play some games, everyone is welcome.

Non-permanent members' seminar

Thursday June 20, 2024, 4PM, Salle 1020

**Jean Abou Samra** *Parsing: from theory to practice and back*

Non-permanent members' seminar

Thursday June 13, 2024, 4PM, Salle 3052 and Zoom Link

**Arjan Cornelissen** *Algorithms for volume estimation of convex bodies*

Non-permanent members' seminar

Thursday June 6, 2024, 4PM, Salle 3052

**Allen Ibiapina** *k-Linkage on Temporal Graphs*

Non-permanent members' seminar

Thursday May 30, 2024, 4PM, Salle 3052 and Zoom Link

**Victor Arrial** *The Bang-Calculus: An Accessible Introduction to Subsuming Paradigms*

In this talk, we will present the Bang Calculus and provide multiple examples of (simple) properties that can be subsumed within this framework. Absolutely no prerequisites are required.

Non-permanent members' seminar

Thursday May 23, 2024, 4PM, Salle 3052 and Zoom Link

**Dung Bui** *Efficient MPC from correlated randomness*

cryptography that creates methods for parties to jointly compute a

function over their inputs while keeping those inputs private. MPC

often is constructed from a trusted source of correlated randomness to

achieve better efficiency.

In this talk, we show how useful forms of correlated randomness can be

generated using a cheap, one-time interaction, followed by only

“silent” local computation. This is achieved via a pseudorandom

correlation generator (PCG), a deterministic function that stretches

short correlated seeds into long instances of a target correlation.

However, PCGs come with a major limitation: The expansion of the

correlated seeds is an “all-or-nothing” procedure, where the target

correlation is produced all at once without enabling fast random

access to the long output. Later, a pseudorandom correlation function

(PCF) is introduced to overcome these limits by designing short

correlations of keys that can be expanded “on the fly” to a virtually

unbounded number of pseudorandom correlation instances, and which

further enable fast random access to these instances.

This talk is very general and intuitive, no cryptography background is

required.

Non-permanent members' seminar

Thursday May 16, 2024, 4PM, Salle 3052 and Zoom link

**Clément Ducros** *How to Achieve Secure Computation Using Coding Theory?*

Non-permanent members' seminar

Thursday May 2, 2024, 4PM, Salle 3052 and Zoom link

**Ulysse Lechine** *Introduction to Kolmogorov complexity*

We will present an introduction to Kolmogorov theory and some beautiful applications. We will also talk about a new recent result of Léchine and Seiller ( https://hal.science/hal-04539439 ) which features a very neat open combinatorics problem which you may help solve. No background is needed.

Non-permanent members' seminar

Thursday April 25, 2024, 4PM, Salle 3052

**Etienne Objois** *A width-independent algorithm for approximating the $\ell_p$ norm of a nonnegative matrix and its applications.*

In the second part of the talk, we will see how such an algorithm can be used to compute competitive oblivious linear routings.

Non-permanent members' seminar

Thursday March 28, 2024, 4PM, Salle 3052 and Zoom link

**Arturo De Faveri** *A gentle introduction to universal algebra*

Non-permanent members' seminar

Thursday March 21, 2024, 4PM, Salle 3052

**Olivier Idir** *Explorable automata : expressiveness and decidability*

Non-permanent members' seminar

Thursday March 14, 2024, 4PM, Salle 3052 and Zoom link

**Klara Nosan** *How we compute with polynomials*

Non-permanent members' seminar

Thursday March 7, 2024, 4PM, Salle 3052 and Zoom link

**Christoph Egger** *Proving Negative Results: Oracle Separations*

As such a statement will necessarily depend on a concrete theory of proof we are going to look into a specific technique commonly used in complexity theory called oracle separations (Impagliazzo, Rudich, STOC 1989) and how we can use an elementary counting argument to create a contradiction to proofs (Gennaro, Trevisan, FOCS 2000).

Given the topic at hand we are going to struggle with too many negations. Also it comes natural to re-introduce reduction proofs but it clearly helps to have seen those already (say in undergrad np completeness). There's virtually no cryptography in it and I assume we can keep it broadly accessible to all lab members even though it is a somewhat technical topic!

Non-permanent members' seminar

Thursday February 29, 2024, 4PM, Salle 3052

**Huan Zhou** *Graph colouring: Extending brooks’ Theorem*

In this talk, I will introduce some basic conceptions and theorems of graph colouring, such as brooks’ Theorem. Moreover, I will introduce a new conception called k-truncated-degree choosability and some open problems.

Non-permanent members' seminar

Thursday February 15, 2024, 4PM, Salle 3052

**Aymeric Walch** *What is the meaning of functional random programs ?*

This approach has received an increase in interest following the rise of probabilistic programming. The goal of probabilistic programming is to write a random program, called a model, and to provide generic inference tools to condition this program with regard to some observations. It is then very important to assign a precise meaning to the distribution computed by the model, and to the inferred distribution. This is where semantics shines.

The goal of this talk is to provide an intuition of what the semantics of a functional programming language with higher order should look like. Surprisingly, this is deeply tied to linear logic and differential linear logic. In particular, a probabilistic program should be interpreted as an “analytic maps” in some sense.

Please be reassured. We will not talk about categorical abstract nonsense. The goal of the talk is to stay as grounded as possible and to provide intuitions, not to explain why the Kleisli category of the exponential comonad of probabilistic coherence spaces is a cartesian closed category (it is, though).

This will be a whiteboard talk.

Non-permanent members' seminar

Thursday February 8, 2024, 4PM, Salle 3052 and Zoom link

**Loïc Peyrot** *Polymorphic records for dynamic languages*

Non-permanent members' seminar

Thursday February 1, 2024, 4PM, Salle 3052 and Zoom link

**Roman Edenhofer** *Quantum Space-bounded Computation and Graph Connectivity*

Non-permanent members' seminar

Thursday January 25, 2024, 4PM, Salle 3052 and Zoom link

**Rida Ait-El-Manssour** *Synthesising Simple loop Programs and Toric Ideals*

Non-permanent members' seminar

Thursday January 18, 2024, 4PM, Salle 3052 and Zoom link

**Shamisa Nematollahi** *Airports and Railways Problem*

Non-permanent members' seminar

Thursday January 11, 2024, 4PM, Salle 3052

**Srinidhi Nagendra** *Two directions to testing distributed systems using coverage: random and reinforcement learning*

#### Year 2023

Non-permanent members' seminar

Friday December 15, 2023, 11AM, Salle 3052 and Zoom link

**Vincent Moreau** *Stone spaces explained and exemplified*

Non-permanent members' seminar

Thursday December 7, 2023, 4PM, Salle 3052

**Esaie Bauer** *Proof theory in Multiplicative-Additive Linear Logic*

Non-permanent members' seminar

Thursday November 30, 2023, 4PM, Salle 1007 and Zoom Link

**Mariana Milicich** *Useful Evaluation, Inductively and Quantitatively*

Non-permanent members' seminar

Thursday November 23, 2023, 4PM, Salle 3052

**Herman Goulet-Ouellet** *Density of rational languages*

Non-permanent members' seminar

Thursday November 16, 2023, 4PM, Salle 3052 and Zoom link

**Sacha Servan-Schreiber** *The power of subtractive secret sharing in secure computation*

Non-permanent members' seminar

Thursday November 9, 2023, 4PM, Salle 1007

**Minh-Hang Nguyen** *Agreement tasks: An introduction of Combinatorial Topology in Distributed Network Computing*

No prior knowledge is required.

Non-permanent members' seminar

Thursday October 26, 2023, 4PM, Salle 3052 and Zoom link

**All Non-Permanent Members** *Assemblée Générale*

Non-permanent members' seminar

Thursday October 19, 2023, 4PM, Salle 1007

**All Non-Permanent Members** *Introductory session*

Non-permanent members' seminar

Thursday October 12, 2023, 4PM, Salle 3052

**Lucie Guillou** *How to verify Parameterised Broadcast Networks?*

This talk will not assume any prior knowledge in verification nor in distributed networks.

Non-permanent members' seminar

Thursday September 28, 2023, 4PM, Salle 3052

**Emily Clement** *Layered controller synthesis for dynamic multi-agent systems*

Non-permanent members' seminar

Thursday June 22, 2023, 4PM, Olympe de Gouges 147 and Zoom link

**Anna Gujgiczer** (Budapest University of Technology and Economics) *Introduction to Information Theoretic Graph Parameters*

The talk is introductory, so we will go through a few examples and skip the difficult proofs. No previous knowledge in information theory is required.

Non-permanent members' seminar

Thursday June 15, 2023, 4PM, Olympe de Gouges 147 and Zoom link

**Maud Szusterman** (IMJ-PRG) *How non-negative matrices and fooling sets / randomised protocols can help bounding the extension complexity*

NB : no previous knowledge in polytopes or in complexity theory is required.

Non-permanent members' seminar

Thursday June 8, 2023, 4PM, Olympe de Gouges 147 and Zoom link

**Bernardo Jacobo-Inclan** *Timed automata and information of timed languages*

Time permitting, I will talk about how starting from these tools, with some necessary additional work, it was possible to establish a characterization of the amount of “information per time unit” generated by a given automaton. This notion of “information” is to be defined during the presentation, it is the one we introduced recently, inspired by Kolmogorov and Tikhomirov's notion of epsilon-entropy.

Non-permanent members' seminar

Thursday June 1, 2023, 4PM, Olympe de Gouges 147 and Zoom link

**Thomas Colcombet** *Some guides for writing your thesis, or some other documents*

In this talk, I will try to give some hints that may be of help in such writing processes. I will also talk of some technical tools that may turn to be useful, and in particular the « knowledge package » for LaTeX (that I happened to have written).

Non-permanent members' seminar

Thursday May 25, 2023, 4PM, Olympe de Gouges 147 and Zoom link

**Sophie Laplante** *Qubobs: interactive devices to explain quantum computing*

This is joint work with Loris Perez, Sylvie Tissot and Lou Vettier and the talk is based on the following paper https://arxiv.org/abs/2211.16324

Non-permanent members' seminar

Friday May 19, 2023, 11AM, 3052 and Zoom link

**Herman Goulet-Ouellet** (IRIF) *An introduction to free profinite monoids*

From an algebraic perspective, running a finite-state automaton is like computing images under a morphism going to a finite monoid. Taken simultaneously, these morphic images act like a fingerprint which can tell apart words from each other. This also defines a metric, the profinite distance, based on how large monoids need to be in order to separate two given words.

The space defined by this metric is discrete and infinite, hence full of holes. Its metric completion is called the free profinite monoid. It is an intriguing object in which algebra, topology and combinatorics interact in subtle ways. Topologically, it looks like the Cantor space, but it also has an algebraic structure which extends the usual word concatenation.

Inside the free profinite monoid, rational languages turn into clopen subsets by topological closure, while clopen subsets turn back into rational languages by intersection. This back-and-fourth adds to the three classical representations of regular languages – automata, regexes and morphisms – a fourth one, which is purely topological.

Non-permanent members' seminar

Thursday May 11, 2023, 4PM, 3052 and Zoom link

**Alexandra Rogova** *Graph databases : how we got here, what they are and how to query them*

Non-permanent members' seminar

Thursday May 4, 2023, 4PM, 3052 and Zoom link

**Maël Luce** *Distributed Grover: a quantum advantage in the CONGEST model*

In this talk, the basics of quantum computing will first be defined. Afterwards, I will try to give a feel of how the Grover algorithm operates before finally exploring one or two of its applications in the CONGEST model.

Non-permanent members' seminar

Thursday April 27, 2023, 4PM, Olympe de Gouges 146 and Zoom link

**Arjan Cornelissen** *Introduction to quantum algorithms*

Non-permanent members' seminar

Thursday April 20, 2023, 4PM, Olympe de Gouges 146 and Zoom link

**Daniel Vaz** *An Introduction to Treewidth and Parameterized Algorithms*

In this talk, we will give an introduction to parameterized algorithms, starting by some simple examples of problems where this approach is useful. Then, we will turn our focus to a specific parameter, called treewidth, which has lead to many new algorithms and also has some practical applications. We will start by looking at an intuitive view of what treewidth is, and how that intuition can be formally defined; then, we will look at how the treewidth of a graph can be computed; and finally, how we can solve problems in graphs with low treewidth.

This will be an introductory talk, so no prior knowledge is needed!

Non-permanent members' seminar

Friday April 14, 2023, 11AM, 3052 and Zoom link

**Enrique Román Calvo** *But… what is verification? (A short introduction to distributed databases and DPOR)*

Non-permanent members' seminar

Friday April 7, 2023, 11AM, 3052 and Zoom link

**Avinandan Das** *Efficient Semi-Streaming Algorithms and Lower Bounds for Degeneracy Based Graph Coloring*

No prerequisite is assumed and every notion used will defined in the talk.

This presentation is based on the paper “Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models” by Suman Kalyan Bera, Amit Chakrabarti and Prantar Ghosh.

Non-permanent members' seminar

Thursday March 30, 2023, 4PM, 3052 and Zoom link

**Shamisa Nematollahi** *Submodular Maximization Problem*

Let $N = {u_1, u_2, ..., u_n}$ be a ground set of elements, A function $F : 2^{\mathcal{N}} \to R_{\geq 0}$ is submodular if for every $A \subset B \subset \mathcal{N}$ and $u \in \mathcal{N} \setminus B$, $F(A\cup\{u\})−F(A) \geq F (B \cup \{u\}) − F (B)$. Since the submodular maximization problem is NP-hard, we will discuss some important approximation algorithms of the constrained versions of the problem in both monotone and non-monotone cases.

Non-permanent members' seminar

Friday March 24, 2023, 11AM, 3052 and Zoom link

**Robin Vacus** *Introduction to Game-Theory: Braess-like paradoxes*

Non-permanent members' seminar

Thursday March 16, 2023, 4PM, 3052 and Zoom link

**Clément Ducros** *Secure Multiparty Computation: a brief introduction*

No prior knowledge is required.

Non-permanent members' seminar

Thursday March 9, 2023, 4PM, 3052 and Zoom link

**Dániel Szabó** *Simplicial complexes - an introduction to Topological Data Analysis*

Non-permanent members' seminar

Thursday February 16, 2023, 4PM, 3052 and Zoom link

**Klara Nosan** *Identity Testing for Radical Expressions*

In a LICS’22 paper we showed that the RIT problem is in coNP assuming the Generalised Riemann Hypothesis (GRH), improving on the straightforward PSPACE upper bound obtained by reduction to the existential theory of reals. We also considered a restricted version, called 2-RIT, where the radicals are square roots of prime numbers; and showed that 2-RIT is in coRP assuming GRH and in coNP unconditionally.

Our proof relies on theorems from algebraic and analytic number theory, such as the Chebotarev density theorem and quadratic reciprocity, however, no prior knowledge on algebraic circuits, identity testing, or any of the underlying math will be required!

Non-permanent members' seminar

Thursday February 2, 2023, 4PM, 3052 and Zoom link

**Aymeric Walch** *The categorical semantic iceberg finally explained*

After a quick review of the idea behind denotational semantic, we will show that the word “denotational” can in fact be replaced by the word “categorical”. A program will not be interpreted as a mere function, but rather as a morphism in some category. This enlargement of perspective allows us to consider a lot more interesting interpretations for programs: relations, games, probability kernels…

We will then cover the basic categorical ingredients that makes a category a good candidate for interpreting computation. That is, a category must handle tupling and curryfication. If the time allows for it, we will then quickly introduce how those categorical ideas lead to the development of linear logic.

This talk *will not* assume any prior knowledge in category theory nor in denotational semantic.

Non-permanent members' seminar

Thursday January 26, 2023, 4PM, 3052 and Zoom link

**Filippo Brunelli** *Computing minimum-cost temporal walks*

I will introduce the problem of computing minimum-cost temporal walks, using an algebraic framework for manipulating abstract costs enabling the optimization of a large variety of criteria. I will then present some algorithmic results recently obtained together with my supervisor (Laurent Viennot).

No prior knowledge of graph theory is going to be required.

Non-permanent members' seminar

Thursday January 19, 2023, 4PM, 3052 and Zoom link

**Christoph Egger** *From Complexity to Cryptography: Key Agreement in Bounded Space*

Concretely we start from the space-time lower bound for (parity-)learning by Raz (FOCS'16) – which we are using in a blackbox manner – and see how this almost directly gives us encryption. In a second step we will explore key agreement using the same building blocks as proposed by Guan and Zhandry (EuroCrypt'19).

Non-permanent members' seminar

Thursday January 12, 2023, 4PM, 3052 and Zoom link

**Yaëlle Vinçont** *Combining fuzzing and symbolic methods for smarter automated test generation*

However, if a program contains specific conditions (such as x = 0x42, where x is a user input), the probability of a fuzzer generating a solution is rather low.

During my thesis, we tried to improve AFL, an existing fuzzer, by combining it with a symbolic analysis. This analysis analyzes traces of generated test cases, in order to identify such conditions (e.g, it would identify that input[0] = 0x0042). From this information we deduce under-approximated path predicates, which we call “easily enumerable”. The solutions to those path predicates are then generated by our fuzzer, which we modified to this purpose, rather than an SMT solver.

This work resulted in a tool, called Confuzz, combining a modified AFL and the symbolic analysis written as a plug-in to the Binsec binary code analysis platform.

#### Year 2022

Non-permanent members' seminar

Thursday December 8, 2022, 4PM, 3052 and Zoom link

**Srinidhi N** *Domain specific language for Testing consensus implementations*

No prior knowledge of distributed systems/algorithms is required.

Non-permanent members' seminar

Thursday November 24, 2022, 4PM, 3052 and Zoom link

**Esaïe Bauer** *Method of analytic tableaux for first-order logic*

Non-permanent members' seminar

Thursday November 17, 2022, 4PM, 3052 and Zoom link

**Sander Gribling** *Quantum query complexity*

Non-permanent members' seminar

Thursday November 10, 2022, 4PM, 3052 and Zoom link

**El Mehdi Cherradi** *($\infty$-)Categorical semantic of type theory: an introduction*

Non-permanent members' seminar

Thursday November 3, 2022, 4PM, 3052

**Mouna Safir** *Agreement Problems: Optimal Algorithm for Synchronous Byzantine Agreement*

Non-permanent members' seminar

Thursday October 27, 2022, 4PM, 3052

**All Non-Permanent Members** *Introductory session*

Non-permanent members' seminar

Thursday October 13, 2022, 11AM, 3052

**Amanda Burcroff** (Harvard University) *Fundamentals of Hyperplane Arrangements*

Non-permanent members' seminar

Thursday October 6, 2022, 4PM, 3052 and Zoom link

**Adrienne Lancelot** (IRIF) *Equivalences of Programs in the lambda calculus*

The previous talk by Victor Arrial is a nice introduction to this talk but concepts tied to the lambda calculus (and its variants) will be re-explained. We will also need the (more generic) concept of co-induction to form program equivalences, which will be briefly explained as well.

Non-permanent members' seminar

Thursday September 22, 2022, 4PM, 3052 and Zoom link

**Victor Arrial** (IRIF) *Introduction to Lambda-Calculus and Quantitative Typing Systems*

Non-permanent members' seminar

Thursday September 15, 2022, 4PM, 3052 and Zoom link

**Vincent Moreau** (IRIF) *Categories for the uninitiated*

Non-permanent members' seminar

Thursday June 2, 2022, 4PM, Salle 3052

**Avinandan Das** *Streaming and computing Frequency Moments in Streaming.*

Non-permanent members' seminar

Thursday May 19, 2022, 4PM, Salle 1007

**Lucía Rossi** (University of Leoben, Austria) *Limit words for N-continued fractions*

Non-permanent members' seminar

Thursday May 12, 2022, 4PM, Salle 1007

**Daniel Szabo** *Quantum algorithms for the longest common substring problem*

Non-permanent members' seminar

Thursday April 28, 2022, 4PM, Salle 3052

**Félix Castro** *An interpretation of E-HA^ω inside HA^ω*

Non-permanent members' seminar

Thursday March 24, 2022, 4:30PM, Salle 3052

**Patrick Lambein-Monette** *Average consensus in spite of dynamic interactions*

Classically, this problem is considered in a setting where the agents hold no unique identifier, and do not start knowing a bound over the size of the system. These restrictive assumptions give rise to two major obstacles to our problem. First, it is generally impossible for an agent to detect that it has reached the desired answer; as such, we only expect the system to asymptotically converge towards the average, rather than to irrevocably decide on it. Second, it is generally impossible to properly account for the multiplicities of the initial values; we therefore restrict our considerations to bidirectional communication links.

For fixed bidirectional networks, an efficient solution is to be found in the /Metropolis/ averaging algorithm, first proposed by Xiao and colleagues in 2005. However, when moving to consider /dynamic/ networks – i.e., where the communication links can arbitrarily change at each step of the execution – the Metropolis rule isn't algorithmic, in the sense that it requires the agents cannot themselves gather all the information required to implement the rule. Other average consensus protocols proposed in the literature fare no better for the same reasons.

We propose the /MaxMetropolis/ rule, an adaptation of the Metropolis rule that is history-dependent, and admits a totally decentralized and local implementation. Over bidirectional dynamic networks with $n$ agents and connectivity delay $B$, $O(B n^4 log n/r)$ communication rounds are required to achieve a relative disagreement of $r > 0$ over the value of the average. This is the first truly distributed average consensus algorithm for bidirectional dynamic networks.

Non-permanent members' seminar

Thursday March 10, 2022, 4PM, Salle 3052

**Robin Vacus** *Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication*

Non-permanent members' seminar

Thursday February 24, 2022, 4PM, Salle 3052

**Filippo Brunelli** *Walk Temporalisation and Reachability Maximisation in Temporal Graphs*

We will speak about results on the complexity of maximising reachability via trip temporalisation. We will show that the problem is hard to approximate even when we assume the nice property that for each pair of nodes, there exists a trip temporalisation connecting them. On the positive side, we show that there must exist a trip temporalisation connecting a constant fraction of all pairs if we additionally assume symmetry in the trip network.

Non-permanent members' seminar

Thursday February 17, 2022, 4PM, Salle 3052

**Klara Nosan** *On matrix groups, the Zariski topology and what they both have to do with automata and verification*

This talk will be a gentle introduction to (computing) the Zariski closure of finitely generated matrix groups with examples of applications in automata theory and program verification. We will describe an existing algorithm for computing the closure due to Derksen, Jeandel and Koiran. We will conclude by discussing our result, which is to obtain an upper bound on the degree of the polynomials that define the Zariski closure. Having an a priori bound allows us to give a simple algorithm for the problem, via linear algebra, similar to Karr's algorithm for obtaining affine invariants for affine programs.

#### Year 2021

Non-permanent members' seminar

Thursday December 16, 2021, 11AM, Salle 3052

**Abhishek De & Pierre Meyer** *Multi-party encrypted communication between ASD, ASV and PPS*

PPS looks at abstractions of programming languages and studies logics motivated to better understand these abstractions. How can tools developed here be used in other fields like automata theory and complexity theory? In this talk, I will give some ideas roughly along the lines of implicit complexity and hope to forge further collaborations between the 3rd floor and 4th floor.

Talk 2 (Pierre): What does it take to hide patterns of communication?

Secure Multiparty Computation (MPC) allows N mutually distrusting parties to perform some computation f(x_1,…,x_N) without having to reveal anything about their private inputs x_1,…,x_N beyond what is revealed by the output of the computation itself. Making sure that “adversaries”, which are internal to the system rather than external, cannot learn more information than they should is a well-understood task in the setting where any pair of parties can communicate directly (and privately). However, in many scenarios, setting up a complete communication network is impractical (e.g. too expensive) or impossible (e.g. some parties may outright refuse to communicate with some others). Therefore, we consider the more realistic setting where the parties are nodes in some incomplete graph, and can communicate only along the edges. In fact, knowledge of this network could be kept private too: each party knows who they are talking to but they do not need to know the metadata of how others are communicating, which may be sensitive information. There are two difficulties to achieving this extra privacy requirement: (1) the MPC protocol must be run even if the each party only knows their local view of the network (i.e. their neighbourhood), and (2) the MPC protocol should reveal nothing more about the graph.

In this talk, we will try and understand how hard this task is by relating it to a foundational hierarchy of cryptographic primitives: - Secure Communication: Two parties need to communicate privately even in the presence of an external eavesdropper monitoring all their interactions. - Secure Computation: Two parties need to compute some function without trusting each other with their inputs. Prerequisites: No background in cryptography is required.

Non-permanent members' seminar

Wednesday November 24, 2021, 11AM, Salle 3052

**Corentin Henriet & Simon Mauras** *Fighting fish and assigning students*

Fighting fishes are combinatorial objects generalizing parallelogram polyominoes introduced in 2016 by Duchi et al. The enumeration of these objects with respect to their natural parameter of size (the half-perimeter) leads to a sequence that counts also other objects : two-stack sortable permutations, non-separable planar rooted maps, synchronized intervals of the Tamari lattice. In this presentation, I will define some bijections between fighting fishes and other objects that preserve a lot of structure and statistics, and I will give some perspectives about the generalization of considered objects and bijections.

Talk 2 (Simon): Random models for stable matching

In a two sided matching market, two types of agents have preferences over one another. Examples include college admissions (students and colleges), residency programs (doctors and hospitals), job markets (workers and jobs) and, in the classical analogy, stable marriages (men and women). In a founding paper, Gale and Shapley introduced the deferred acceptance procedure, where one side proposes and the other disposes, which computes a stable matching. In the worst case, the choice of which side of the market proposes has a big importance, both in terms of outcome (the output matching is optimal for the proposing side) and truthfulness (the receiving side might have incentives to lie). We will show that things are much nicer in the average case. Assuming that preferences of agents are drawn from certain distributions, then each agent receives with high probability the same allocation in the two variants of deferred acceptance.

Non-permanent members' seminar

Wednesday June 2, 2021, 4PM, Salle 3052

**Quentin Ferro** (IRIF) *Distributed Recoloring using the LOCAL Model*

Non-permanent members' seminar

Wednesday May 26, 2021, 4PM, Salle 3052

**Avinandan Das** (IRIF) *Combinatorial Proof for Chernoff-Hoeffding Concentration Bound*

#### Year 2020

Non-permanent members' seminar

Wednesday December 2, 2020, 11AM, Online

**Phd Students** *Welcome session!*

Non-permanent members' seminar

Wednesday May 6, 2020, 11AM, Online

**Cédric Ho Thanh** (IRIF) *An introduction to Docker*

Non-permanent members' seminar

Wednesday April 22, 2020, 11AM, Online

**Simon Mauras** (IRIF) *How to aggregate top-lists*

This talk will start with a quick survey on rank aggregation (the special case where every input list is a complete ranking of the elements), its relation to feedback arc sets in directed graphs, NP-Hardness, and approximation algorithms. Then we will discuss how such results can be extended to the aggregation of top-lists.

Preprint available: https://arxiv.org/abs/1811.01537

Non-permanent members' seminar

Wednesday April 15, 2020, 11AM, Online

**Chaitanya Leena Subramaniam** (IRIF) *The plus-construction for sheaves and factorisation systems*

However, the plus-construction makes sense in much more generality than sheaves, and a result (joint with M. Anel) shows that it is in fact closely related to orthogonal factorisation systems on a category. Indeed, it can be used to construct such factorisation systems.

This has many applications, including in dependent type theory, where it has a fundamental application to modalities.

The talk will be a gentle introduction to the plus-construction and its various examples.

Non-permanent members' seminar

Wednesday April 8, 2020, 11AM, Online

**Nicolas Jeannerod** (IRIF) *Analysing installation scenarios of Debian packages*

Deban currently includes more than 28 thousand maintainer scripts, almost all of them written in POSIX shell. These scripts are executed with root privileges at installation, update, and removal of a package, which make them critical for system maintenance. While Debian policy provides guidance for package maintainers producing the scripts, few tools exist to check the compliance of a script to it.

This presentation reports on the application of a formal verification approach based on symbolic execution to find violations of some non-trivial properties required by Debian policy in maintainer scripts. We present our methodology and give an overview of the toolchain. We focus in particular on the tree logics used to represent symbolically a file system transformation, and the use of such a logic in the symbolic engine.

Non-permanent members' seminar

Wednesday April 1, 2020, 11AM, Online

**Simona Etinski** (IRIF & INRIA) *Stern's Zero Knowledge Identification Scheme*

Non-permanent members' seminar

Wednesday March 25, 2020, 11AM, Online

**Nguyễn Lê Thành Dũng** (LIPN) *Aperiodicity in a non-commutative logic*

Non-permanent members' seminar

Monday March 2, 2020, 3PM, Salle 3014

**Pierre Cagne** *Les symmétries des sphères en fondations univalentes*

#### Year 2019

Non-permanent members' seminar

Wednesday November 27, 2019, 11AM, Salle 3052

**(Old) Phd Students** *Return of the PhD Seminar*

Each talk will be 2-5 minutes long, and should be understandable by everyone.

Non-permanent members' seminar

Wednesday November 20, 2019, 11AM, Salle 3052

**Pierre Ohlmann** (IRIF) *Controlling a random population*

Non-permanent members' seminar

Wednesday November 13, 2019, 11AM, Salle 3052

**(New) Phd Students** *The PhD Seminar strikes back*

Each talk will be 2-5 minutes long, without any slides, and should be understandable by everyone

Non-permanent members' seminar

Wednesday July 24, 2019, 11AM, Salle 3052

**Hugo Moeneclaey** (IRIF) *Toward a Cubical Type Theory Univalent by Definition*

Non-permanent members' seminar

Wednesday March 6, 2019, 11AM, Salle 3014

**Isaac Konan** (IRIF) *Partitions and Bijections*

I will discuss bijections for some well-known partition identities, such as Schur partition identity and q-binomial coefficient.

NB: Open talk, all you need is just how to count objects.

Non-permanent members' seminar

Wednesday February 27, 2019, 11AM, Salle 3052

**Pierre Ohlmann** (IRIF) *Lower bounds for arithmetic circuits via the Hankel matrix*

Our first and main conceptual result is a characterization result: we show that the size of the smallest circuit computing a given non-associative polynomial is exactly the rank of a matrix constructed from the polynomial and called the Hankel matrix. This result applies to the class of all circuits in both commutative and non-commutative settings, and can be seen as an extension of the seminal result of Nisan giving a similar characterization for non-commutative algebraic branching programs.

The study of the Hankel matrix provides a unifying approach for proving lower bounds for polynomials in the (classical) associative setting. We demonstrate this by giving alternative proofs of recent results proving superpolynomial and exponential lower bounds for different classes of circuits as corollaries of our characterization result.

Our main technical contribution is to provide generic lower bound theorems based on analyzing and decomposing the Hankel matrix. This yields significant improvements on lower bounds for circuits with many parse trees, in both (associative) commutative and non-commutative settings. In particular in the non-commutative setting we obtain a tight result showing superpolynomial lower bounds for any class of circuits which has a small defect in the exponent of the total number of parse trees.

#### Year 2018

Non-permanent members' seminar

Wednesday November 28, 2018, 11AM, Salle 3052

**Cédric Ho Thanh** (IRIF) *Type theoretical approach to opetopes*

Non-permanent members' seminar

Wednesday November 14, 2018, 11AM, Salle 3052

**Thomas Colcombet** (Automata team) *Writing (large) LaTeX documents with the knowledge package.*

Clearly, there are some pitfalls to avoid. Sometimes a scientifically excellent thesis turns out to be barely usable, because definitions are difficult to find, hard to parse, etc… And the reviewers get mad at you (but say it gently because they are polite). It is your duty to pay attention to all these details (it is also the duty of your PhD advisor to help you in that) and make a document as user friendly as possible.

One can find many documents describing how to write good science/a good thesis on the internet (read some of them!). I will not try to cover this wide subject. My goal in this talk will be to emphasize on some presentation points, and show you how some tools can help you in your writing (this is an advertisement for the LaTeX package « knowledge »).

If you want to test, you can bring your laptop with an up-to-date distribution of LaTeX.

Non-permanent members' seminar

Wednesday October 31, 2018, 11AM, Salle 3052

**Anupa Sunny & Zhouningxin Wang** *New PhD session*

by Anupa Sunny

Abstract: This talk is based on a paper by Amnon Ta-Shma on the construction of epsilon biased sets which have a support size close to the Gilbert-Varshamov bound, a notion from coding theory. We will look at the Rozenman-Wigderson construction of the epsilon-biased set in which the bias of a set is amplified by taking a walk over an expander graph. We will then look at Ta-Shma's construction which is based on a modified version of the zigzag product, namely the s-wide replacement product.

Homomorphism of signed graphs

by Zhouningxin Wang

Abstract: The signed graph is a graph whose edges are assigned with the signs + and -. A homomorphism of one graph to the other preserves the adjacencies and incidences of these two edges. We extend the concept of homomorphism for signed graphs. An intuitive example will be given to explain why we consider the homomorphism of signed graphs. We will give the minimum signed graph, namely Spal_5, to which all the signed K_4-minor-free graph admits homomorphism to. In the last part, we will show the necessary and sufficient conditions for a signed K_4-subdivision being a core.

Non-permanent members' seminar

Wednesday October 17, 2018, 11AM, Salle 3052

**Abishek De & Simon Mauras** *Newcomers' session*

The distributed synthesis problem is about constructing correct distributed systems, i.e., systems that satisfy a given specification. We consider a slightly more general problem of distributed control, where the goal is to restrict the behavior of a given distributed system in order to satisfy the specification. Our systems are finite state machines that communicate via rendezvous (asynchronous automata). There are a few classes of systems for which the problem has been shown decidable. We solve it for free choice systems, systems whose entire behaviour can be expressed in a (possibly infinite) tree.

Simon Mauras : Social choice theory, and a small survey about rank aggregation

How should we vote? This question has been adressed by philosophers and mathematicians since the XVIIIth century, but no satisfactory solution exists. The talk will start with classical results on social choice theory and move on to the aggregation of rankings seen as an optimization problem. We will discuss NP-Hardness, Hardness of approximation and Approximation algorithms for several variants of this problem.

Non-permanent members' seminar

Wednesday September 12, 2018, 11AM, Salle 3052

**Farzad Jafarrahmani** *Denotational semantics of Linear Logic with least and greatest fixpoints*

Short session

Non-permanent members' seminar

Wednesday June 27, 2018, 11AM, Salle 3052

**Victor Lanvin** (Équipes Preuves, programmes, et Systèmes) *Introduction to gradual typing with union and intersection types*

Note: this will (should) be a very general presentation about gradual typing and set-theoretic types consisting mostly of practical examples and without too many technical details. Don't hesitate to bring your computer, a book, or your Nintendo Switch™ if you already know the topic.

Non-permanent members' seminar

Wednesday June 20, 2018, 11AM, Salle 3052

**Laurent Feuilloley** (Équipes Compsys, GANG et graphes) *Distributed decision*

The underlying model of this study is the local model. The local model is defined to answer questions of the following type: given a communication network, whose nodes are machines, and edges are communication links, is it possible that the nodes solve some task X, if they communicate only with the nodes that are close to them? A classic problem is colouring: can a node choose a colour, with only the knowledge of a small neighbourhood of the graph, such that the colours chosen by the nodes form a proper colouring of the graph? As in the centralized setting, it is interesting to study decision problems, that are yes-no questions, and to define complexity classes to classify these problems; this is distributed decision.

The complexity class we use as the equivalent of the class P in the centralized setting, is pretty small, and it is then natural to look at some form of non-determinism, to have a chance to understand more problems. In this model, non-determinism can be thought as a piece of global information that can be verified locally. The theoretical motivation is that to understand how local a problem is, one can ask how much global information is needed to solve it. The more practical motivation is that if one can design schemes with little global information then it can help to design more robust distributed algorithms such as self-stabilizing algorithms. The results I will present play with different natural notions of non-determinism, and how they influence the complexity classes defined.

I will spend time to carefully describe the model, thus no prior knowledge is needed.

Non-permanent members' seminar

Wednesday June 6, 2018, 11AM, Salle 3052

**Pierre Ohlmann & Sidi Mohammed Beillahi** (Équipe automate & Équipe vérification) *Unifying non-commutative arithmetic circuit lower bounds & Robustness of Programs Against Consistency Relaxation*

We develop an algebraic lower bound technique in the context of non-commutative arithmetic circuits. To this end, we introduce polynomials for which the multiplication is also non-associative, and focus on their circuit complexity. We show a connection with multiplicity tree automata, leading to a general algebraic characterization. We use it to derive meta-theorems for the non-commutative case, and highlight numerous consequences in terms of lower bounds.

&&

Robustness of Programs Against Consistency Relaxation (Sidi Mohammed Beillahi)

Sequential Consistency (SC) and Serializability (Ser) are the classical consistency models for concurrent and distributed programs. They are the intuitive models for developers. Due to the costly synchronization required by the two models, most of existing memory models and distributed implementations of data structures do not use these two models. Instead, in order to reduce the latency and remove unnecessary synchronization, modern processors and databases adopt relaxed and weaker consistency models. However, this weakening of the consistency models implies new unexpected behaviors when running programs over the weaker models. We address in this work the problem of detecting unexpected behaviors of a program that were observed when weakening the consistency model. In particular, we check whether the two sets of executions traces of a program over the SC (resp, Ser) model and some weaker consistency model coincide or not. We characterize the set of executions traces that violate this equality and drive a decision procedure to detect these traces. In the case where there are no traces that violate this equality we refer to a program to be Robust.

A joint work with Ahmed Bouajjani and Constantin Enea

Non-permanent members' seminar

Wednesday May 23, 2018, 11AM, Salle 3052

**Léo Stefanesco** (Algebra and calculus, proofs and programs teams) *An Asynchronous Soundness Theorem for Concurrent Separation Logic*

—

Abstract:

Concurrent separation logic (CSL) is a specification logic for concurrent imperative programs with shared memory and locks. In this talk, we develop a concurrent and interactive account of the logic inspired by asynchronous game semantics. To every program C, we associate a pair of asynchronous transition systems [C]S and [C]L which describe the operational behavior of the Code when confronted to its Environment, both at the level of machine states (S) and of machine instructions and locks (L). We then establish that every derivation tree π of a judgment Γ ⊢ {P}C{Q} defines a winning and asynchronous strategy [π] with respect to both asynchronous semantics [C]S and [C]L. From this, we deduce an asynchronous soundness theorem for CSL, which states that the canonical map L : [C]S → [C]L from the stateful semantics [C]S to the stateless semantics [C]L satisfies a basic fibrational property. We advocate that this fibrational property provide a clean and conceptual explanation for the usual soundness theorem of CSL, including the absence of data races.

(Joint work with Paul-André Melliès)

Non-permanent members' seminar

Wednesday May 2, 2018, 11AM, Salle 3052

**Emiliano Lancini** (Laboratoire d'Informatique de Paris Nord) *Box-Total Dual Integrality and k-Edge-Connectivity*

Nowadays it is often required that telecommunication networks keep unaltered their functionality even after the failure of some of their links. This leads to a generalisation of the minimum spanning tree problem named k-edge-connected spanning subgraph problem.

In this talk we show a characterisation of a graph class in terms of integrality properties of polyhedra naturally associated to the k-edge-connected spanning subgraph problem.

The concept of total dual integrality (TDI) dates back to the works of Edmonds, Giles and Pulleyblank in the late 70's, and is strongly connected to min-max relations in combinatorial optimisation.

The system Ax>=b is TDI if, in the following equation, for each integer vector c, for which the minimum in the following equation is finite, there exists an integer optimal solution for the maximum.

min {cx: Ax>= b} = max {yb: yA = c, y >= 0}

We are interested in the stronger property of box-TDIness. A system Ax>=b is called *box-TDI* if the system Ax >= b, l ⇐ x ⇐ u is TDI for all rational vectors l and u.

We prove that, for k>=2, the k-edge-connected spanning subgraph polyhedron is a box-TDI polyhedron if and only if the graph is series-parallel. Moreover, in this case, we provide a box-TDI system with integer coefficients describing this polyhedron.

Non-permanent members' seminar

Wednesday April 25, 2018, 11AM, Salle 3052

**Raphaëlle Crubillé** (Algebra and calculus, proofs and programs teams) *Probabilistic Stable Functions on Discrete Cones are Power Series.*

Non-permanent members' seminar

Wednesday April 18, 2018, 11AM, Salle 3052

**Paulina Cecchi & Antoine Allioux** (Automata, Combinatorics teams & Algebra and calculus, proofs and programs teams) *New PhD student introduction session*

Title: Some interactions between words combinatorics and symbolic dynamics.

Abstract: Word combinatorics has been fruitfully used to study several topological and mesure-theoretic properties of dynamical systems, through the analysis of suitably chosen symbolic dynamical systems. In this talk, we will introduce some notions of symbolic dynamics and present some examples which illustrate how word combinatorics can be used as a tool to solve questions arising from this branch of mathematics.

*

* Antoine Allioux

Title: The curse of Martin-Löf identity type

Abstract: The identity type of Intuitionistic Type Theory (ITT) endows types with a structure of infinity-groupoid. This higher structure follows from the fact that the Uniqueness of Identity Proof (UIP) is not derivable in ITT. Homotopy Type Theory (HoTT) takes advantage of this observation by enriching ITT with new principles which are coherent with this interpretation, namely the Univalence Axiom and the Higher Inductive Types (HITs).

HITs are a generalization of inductive types which allow, in addition to create regular inhabitants of an inductive type, to postulate identities between them as well as identities between these identities, and that ad infinitum. It is then tempting to try to present mathematical structures using these new types like one would do in mathematics using generators and relations.

However, problems quickly arise as soon as one needs a strict equality. Indeed, the identity type expresses a weak equality leading to the usual coherence problems. Trying to solve these naively, we run into the problem of having to define an infinite sequence of coherence data.

If HoTT is to be a credible foundation of mathematics, the question of formalizing structures which need a strict equality is crucial. The answer to this question rests, in part, upon our achievement to either present these structures differently in the existing theory or to enrich it so that it becomes tractable to express them.

*

Non-permanent members' seminar

Wednesday April 11, 2018, 11AM, Salle 3052

**Brieuc Guinard** *Intermittent Locomotion in Graphs*

Non-permanent members' seminar

Wednesday March 28, 2018, 11AM, Salle 3052

**Yann Hamdaoui** (Proofs and Programs and Conception and Analysis of Systems teams) *Translating a Concurrent Lambda Calculus into Linear Logic proof (nets)*

Non-permanent members' seminar

Wednesday March 21, 2018, 11AM, Salle 3052

**Mengchuan Zou** (Theory and algorithmics of graphs team) *Generalization of binary search in trees and other structures*

We will also introduce some known facts on other structures and how tree search problem is related to other problems via equivalences.

Non-permanent members' seminar

Wednesday February 21, 2018, 11AM, Salle 3052

**Zeinab Galal & Ranadeep Biswas** (Algebra and computation & Modeling and verification) *Species of structure: a Bridge between Differential Lambda Calculus and Combinatorics & Verifying Database Histories*

Species of structure lie at the intersection of combinatorics and denotational semantics. They were first introduced by Joyal as a unified framework for the theory of generating series in enumerative combinatorics and multiple tools were developed for the resolution of differential equations of species in this setting. Later, Fiore presented a generalized definition that both encompasses Joyal's species and constitutes a model of linear logic.

We will first introduce and connect the different viewpoints of species of structure and their series counterpart (analytic and normal functors) presented by Joyal, Girard and Hasegawa. Next, we will examine how the bicategory of generalized species of structure forms a model of differential linear logic.

As our end goal is to develop methods of resolution of differential equations for λ-terms, we will investigate the possible directions to tackle this problem.

&

*Verifying Database Histories*

Popular databases offer control over the isolation level to which the operations in one transaction are visible to the operations in other concurrent transactions. Lower levels allow weaker consistency. So, we have to ensure that the histories of a database are consistent with their isolation levels.

Unfortunately, these isolation levels are mostly defined as low-level operations which makes it complicated to reason about the behavior of the system running under those isolations.

In this talk, we will present some popular isolation levels and consistency criteria for databases. We will introduce a framework, in which it becomes easier to formally reason about the behavior of a system. Then we will explore the complexities of deciding some consistency criteria using that framework.

Non-permanent members' seminar

Wednesday February 14, 2018, 11AM, Salle 3052

**Narcisse Nya Kamtchoum** (LIP6) *Modèles analytiques pour les performances des réseaux cellulaires*

Cependant, les opérateurs ont du mal à s'adapter à la proportion toujours grandissante d'utilisateurs mobiles et à leur offrir une qualité d'expérience (QoE) satisfaisante. Dans ce contexte, il est importante pour les opérateurs et les équipementiers de disposer d'outils simples et efficaces pour mieux comprendre le comportement de leurs réseaux et évaluer la qualité des services offerts aux utilisateurs. Notre objectif est de proposer des modèles analytiques pour l'évaluation des performances des réseaux cellulaires en tenant compte de la mobilité des utilisateurs. Tout en permettant de résoudre des problèmes d'évaluation de performance les plus complexes, ces modèles se doivent d'être simple afin de faciliter leur utilisation.

Le séminaire sera donné en français.

Non-permanent members' seminar

Wednesday February 7, 2018, 11AM, Salle 3052

**Nicolas Jeannerod** (Team Analysis and conception of systems) *Unix filesystems and First-Order Theory of an Algebra of Feature Trees with Updates*

We investigate a logic of an algebra of trees with an update operation, which expresses that a tree is obtained from an input tree by replacing a particular direct subtree while leaving the rest intact. This operation improves on the expressivity of existing logics of tree algebras in our case of feature trees. These allow for an unbounded number of children of a node in a tree.

We show an efficient way of testing the satisfiability of existential clauses in this algebra that can lead to an efficient implementation of our symbolic execution engine. We also show the decidability of the first-order theory of this algebra via a weak quantifier elimination procedure which is allowed to swap existential quantifiers for universal quantifiers.

Non-permanent members' seminar

Wednesday January 31, 2018, 11AM, Salle 3052

**Thomas Williams** (Gallium, INRIA) *Refactoring ML programs using ornaments*

In this talk, I will explain how ornaments can be used to automatically lift a function. I will present a prototype implementation of lifting along ornaments for a subset of OCaml and describe some families of use cases. I will introduce a principled approach to obtaining a lifting from the base code, as abstraction followed by specialization. I will explain how this approach allows us to prove the correctness of the lifting.

Non-permanent members' seminar

Wednesday January 24, 2018, 11AM, Salle 3052

**Alessandro Luongo & Ny Aina Andriambolamalala** (Algorithms and complexity team & Combinatorics team) *Recent updates in quantum machine learning & Election de leader dans un réseau radio simple saut avec detection de collision*

In this talk we are going through some recent algorithms in the field of quantum machine learning. Most of the techniques use tools from quantum algorithmics such as counting, optimizing, estimating distances and singular values which will be introduced here. Using these primitives it's possible to build more complex operations of a matrix algebra. I'll also describe a classical machine learning algoritm in the process of being translated in a fully fledged quantum algorithm. This is the first biologically plausible quantum algorithm with an exponential speedup w.r.t the dimension of the space and the number of datapoints. This quantum algorithm has been simulated and used to classify handwritten digits with high accuracy.

*Election de leader dans un réseau radio simple saut avec detection de collision*

Les résultats de Dan Willard (1986) montrent un algorithme randomizé d'élection de leader en temps moyen $O(\log\log{n})$.

Depuis, la question de savoir s'il existe un algorithme convergeant en temps log-logarithmique mais avec très forte probabilité est ouverte.

Nous répondons affirmativement à cette question. Nous montrons aussi comment utiliser nos résultats pour élaborer des protocoles d'élection dans divers modèles de systèmes distribués.

These are two newcomers talk, 30 minutes each. The first will be in English, the second in French.

#### Year 2017

Non-permanent members' seminar

Wednesday December 20, 2017, 11AM, Salle 3052

**Leo Stefanesco** (Équipes “Preuves et Programmes” et “Algèbre et Calcul”) *“A concise introduction to logical relations” followed by “A Logical Relation for Monadic Encapsulation of State”*

Logical relations are a powerful technique to prove properties about programs. In particular, for proving that two programs are contextually equivalent.

In this talk, we will see that, in System F (aka the polymorphic lambda calculus), the only program of type ∀ a, a → a is the identity.

I will also sketch how to extend logical relations to realistic languages such as ML.

2nd part (POPL talk rehearsal):

A Logical Relation for Monadic Encapsulation of State

We present a logical relations model of a higher-order functional programming language with impredicative polymorphism, recursive types, and a Haskell-style ST monad type with runST. We use our logical relations model to show that runST provides proper encapsulation of state, by showing that effectful computations encapsulated by runST are heap independent. Furthermore, we show that contextual refinements and equivalences that are expected to hold for pure computations do indeed hold in the presence of runST. This is the first time such relational results have been proven for a language with monadic encapsulation of state. We have formalized all the technical development and results in Coq.

Non-permanent members' seminar

Wednesday December 13, 2017, 11AM, Salle 3052

**Simon Halfon** (ENS Cachan) *Well Quasi-Orders and Extreme Stratospheric-Complexity-Classes of Death — Beaux pré-ordres et classes de complexité stratosphériques de la mort*

No special knowledge is required to follow the talk.

—

Nous savons tous qu’il est très pratique pour prouver la terminaison d’un algorithme d’utiliser des ordres bien fondés. Cependant, il est commun de penser que cette technique ne donne aucune information sur la complexité de l’algorithme, car la preuve est non constructive. Dans cet exposé, je présenterai quelques idées pour extraire une borne supérieur de complexité d’une telle preuve de terminaison. J’essaierai de vous donner une idée de la combinatoire compliquée que cela engendre, et qui résulte en des complexité très élevée. Bouteilles d’oxygène et combinaisons pressurisées obligatoire, on s’envole au delà de l’Élémentaire.

Aucune connaissance spécifique n'est nécessaire pour suivre l'exposé.

Non-permanent members' seminar

Wednesday December 6, 2017, 11AM, Salle 3052

**Axel Osmond & Yassine Hamoudi** ([1] “Algebra and calculus” and “Proofs and programs” teams, [2] Algorithms and complexity team) *New PhD student introduction session. [1] From pointless topology to formal topology [2] ACC0 and multiparty communication: fighting the log n barrier.*

Formal topology goes further into this last direction, using systems of axioms about coverings as a deductive systems which leads to a type-theoretic flavored, predicative and constructive topology, endowed with multiple and finer notions of points, separability… and suited for intuitionistic reasoning.

[2] The Number On the Forehead model is a multiparty communication game between k players that collaboratively want to evaluate a given function F : X1 x … x Xk → Y on some input (x1, …, xk) by broadcasting bits according to a predetermined protocol. The input is distributed between the players in such a way that each player i sees all of it except xi (as if xi is written on the forehead of player i).

A central open question in this model, called the log n barrier, is to find a function which is hard to compute when the number of players is polylog(n) or more (where the xi's have size poly(n)). This has an important application in circuit complexity, as it could help to separate ACC0 from other complexity classes.

In this talk, we will recall first the connection between ACC0 and communication complexity, and then describe a new efficient communication protocol that prevents some important functions from breaking the log n barrier.

Non-permanent members' seminar

Wednesday November 22, 2017, 11AM, Salle 3052

**Jules Chouquet** (Proofs and Programs team) *Linear logic proof nets and Taylor expansion.*

Once these notions are introduced, I will explain how it is possible to express this computational paradigm in a linear setting through a syntactical Taylor expansion. The idea is to understand exponential boxes in a differential variant of linear logic, and to represent it with linear combination.

If we have time, I will try to give an idea of some algebraic issues concerning this construction, and a method to show for example, that the normal form of the Taylor expansion of a MELL always converges.

NB: Taylor expansion is here analogical to the lambda calculus (with its differential version too) one, if someone heard about it, it can give a first intuition.

Non-permanent members' seminar

Wednesday November 15, 2017, 11AM, Salle 3052

**Chaitanya Leena Subramaniam** (“Algebra and calculus” and “proofs and programs” teams) *Homotopy type theory and the fibred structure of dependent types*

Chaitanya will do a 30 minutes talk. Given that the talk will not last as long as usual, we will also take advantage of the opportunity to discuss the organization of the seminar.

Abstract:

The talk will not be about my particular research problem. It will seek instead to give a gentle pictorial introduction to the inherent structure of dependent types and how this structure determines what dependent types and dependently-typed programs (or proofs) *mean*.

The focus will be on why this structure naturally leads to homotopy type theory and univalence. As a bonus, and if time permits, there will be some remarks on univalence and extensionality.

Non-permanent members' seminar

Wednesday November 8, 2017, 11AM, Salle 3052

**Francesco Antonio Genco** (Technische Universität Wien) *Typing Parallelism and Communication through Hypersequents*

Non-permanent members' seminar

Wednesday October 25, 2017, 11AM, Salle 3052

**Cédric Ho Thanh & Isaac Konan** (Algebra and calculus team / Combinatorics team) *New PhD student introduction session*

Isaac Konan, Bijective proof and generalization of Siladic's theorem

In a recent paper, Dousse introduced a refinement of Siladic̀’s theorem on partitions, by using the method of weighted words, where the different parts could take 2 colours. The proof of that refined theorem used some recursive equations with q-series. In this presentation, I will give the big lines of a bijective proof of the Dousse’s theorem, moreover which could be extended on a coloring with more than 2 colours.

Cédric Ho Thanh, Opétopes, Réécriture, et Koszulité

Ma thèse consiste en 3 mots que je vais tenter d'expliquer.

Non-permanent members' seminar

Wednesday October 11, 2017, 11AM, Salle 3052

**Hadrien Batmalle** (Équipe Preuves et Programmes) *From Cohen's Forcing to Classical Realisability: A New Approach*

Du forcing à la réalisabilité classique: une nouvelle approche

La réalisabilité classique permet d'interpréter des théories mathématiques classiques, comme la théorie des ensembles ZF, dans divers modèles de calculs (lambda-calcul avec continuations, domaines…). L'intérêt est double: côté informatique, il s'agit d'extraire des interprétations calculatoires de preuves classiques; côté mathématique, on obtient de nouveaux modèles de ces théories classiques (les deux aspects étant intimement liés). Une grande partie de la recherche en réalisabilité classique étudie la structure de ces modèles, qui apparaissent comme une généralisation du forcing de Cohen. Nous nous intéresserons ici à une nouvelle méthode pour exporter des propriétés des modèles de forcing aux modèles de réalisabilité, qui permet de construire des interprétations de deux théories contradictoires dans un même modèle de calcul, ce qui ouvre la voie à une analyse fine des conséquences calculatoires de la présence ou non de tel ou tel axiome.

From Cohen's Forcing to Classical Realisability: A New Approach

Classical realisability is a framework for interpreting classical theories in mathematics, such as the ZF set theory, in various models of computation (lambda-calculus with continuations, domains…). The goal is twofold: from the computer scientist's point of view, this is a method for extracting computational interpretations out of classical proofs; from the mathematician's, this is a trove of new models for these classical theories (both sides being tightly interwoven). A good deal of the research in this area is focussing on the structure of these models, arising as a generalisation of Cohen's forcing. In this talk we'll present some consequences of a new method for exporting properties of Cohen's forcing models into properties of classical realisability models. In particular we obtain interpretations of two incompatible theories in the same model of computation, which clears the path to studying the computational consequences of the presence, or lack thereof, of some axiom.

Non-permanent members' seminar

Wednesday September 27, 2017, 11AM, Salle 3052

**Baptiste Louf & Victor Lanvin** (Combinatorics and PPS teams) *New PhD student introduction session*

Combinatorial maps : algebraic and bijective enumeration

Combinatorial maps (which are embeddings of graphs on surfaces) are well studied objects in combinatorics, which have applications in other domains, such as quantum gravity. The goal is to enumerate them (sometimes exactly, sometimes asymptotically). For this purpose, one can resort to (among other things) bijective or algebraic methods. The algebraic method is often more powerful and yields results more easily, however bijections give a more in-depth understanding of the models. Often, formulas are found via powerful methods, then people try to re-prove them bijectively. In this talk, I present what I’m focusing on, on the bijective side (Carell-Chappy formula) and on the algebraic side (KP equations). If time permits, I will explain a simple bijection I discovered during my Master’s internship.

Gradual Set-Theoretic Types

A static type system can be an extremely powerful tool for a programmer, providing early error detection, and offering strong compile-time guarantees on the behavior of a program. However, compared to dynamic typing, static typing often comes at the expense of development speed and flexibility, as statically- typed code might be more difficult to adapt to changing requirements. Gradual typing is a recent and promising approach that tries to get the best of both worlds, by allowing the programmer to finely tune the distribution of dynamic and static checking over a program. However, this “gradualization” is sometimes too coarse, and an expression is often either fully dynamic or fully static. We argue that adding full-fledged union and intersection types (a.k.a. set-theoretic types) to a gradual type system solves this issue by making the transition between dynamic typing and static typing smoother.

Non-permanent members' seminar

Wednesday June 28, 2017, 11AM, Salle 3052

**Tommaso Petrucciani** (PPS team) *Semantic subtyping: an introduction*

In the semantic subtyping approach, instead, types are interpreted as sets and subtyping is defined in terms of set containment. Then, an algorithm is derived from the definition. While the algorithm is complex, the interpretation of types serves as a fairly simple specification. This approach also ensures that union and intersection on types behave as the corresponding operations on sets.

I will give an introduction to this approach and show how to define subtyping semantically for types including arrows, union, intersection, and negation, following [Frisch et al., 2008]. Then, we will look at ongoing work on adapting this approach (originally studied for call-by-value languages) to lazy semantics.

[Frisch et al., 2008] A. Frisch, G. Castagna, and V. Benzaken, Semantic subtyping, JACM, 2008.

Non-permanent members' seminar

Wednesday June 14, 2017, 11AM, Salle 3052

**Timo Zijlstra & Emmanuel Arrighi** *Quantum algorithms and Learning With Errors- based Cryptography & Distance Labels and Tree Skeletons*

Post quantum cryptography is meant to replace today's standards like RSA and Elliptic Curve Cryptography (ECC), since these standards are threathened by quantum algorithms. The most researched post-quantum candidates are based on lattice problems, and in particular the Learning with Errors (LWE) problem. It is assumed that there exists no quantum algorithm that solves this problem efficiently. However, in a particular setting and under some strong hypothesis, it is very easy to solve LWE using a generalization of the Bernstein-Vazirani quantum algorithm. We will take a look at possible quantum cryptanalysis on LWE-based cryptographic applications.

Distance Labels and Tree Skeletons:

To answer distance queries on a fix known graph, it is interesting to do precalculation in order to reduce query time. A methode is to use Hub Labeling. Hub Labeling works well on road transport network. We will take a look at this methode and introduce the notion of Skeleton Dimension which give an insight on why it works well on road network.

Non-permanent members' seminar

Wednesday May 31, 2017, 11AM, Salle 3052

**Clément Jacq** (PPS team) *A playful introduction to game semantics (category-light)*

Une introduction ludique à la sémantique des jeux (allégée en catégories)

La sémantique des jeux est une branche de la théorie des modèles dont l'objectif est d'interpréter des formules de certaines logiques sous forme de jeux à deux joueurs. Son objectif initial était de lier les notions de vérité et de validité à des concepts de théorie des jeux tels que l'existence de stratégies gagnantes…

Après quelques exemples historiques, nous nous intéresserons dans cet exposé de manière informelle à un cas plus récent ou la sémantique des jeux modélise désormais des langages de programmation.

En guise de conclusion, nous évoquerons l'aspect formel avec la notion de structure catégorielle.

A playful introduction to game semantics (category-light)

Game semantics is a branch of model theory that aims at interpreting formulas of a given logic as two-player games. Initially, it was developed to link the notions of truth and validity to game-theoretic notions such as the existence of winning strategies.

After an historical example, we will look informally at a more recent case of game semantics where the games are used to model programming languages.

At the end, we'll mention the formal part with the notion of categorical model.

Non-permanent members' seminar

Wednesday May 17, 2017, 11AM, Salle 3052

**Pierre Vial** (PPS team) *An Introduction to Intersection Type Systems, and a New Answer to Klop's Problem*

L'exposé aura deux buts:

1) Présenter les systèmes de types-intersection (ITS, intersection type systems), en particulier, les ITS à intersection non-idempotente. Je commencerai par des rappels basiques en lambda-calcul. On verra en quoi la représentation des lambda-termes par des arbres (bien qu'élémentaire) permet de comprendre la façon dont les ITS sont conçus et vérifient naturellement des propriétés que les systèmes de types simples ne peuvent (raisonnablement) pas avoir. Par exemple, dans un ITS, un terme est normalisable (i.e. il termine) ssi il est typable. Par opposition, dans un système de types simples, on aura seulement l'implication “Si le terme t est typable, alors il est normalisable” (*Propriété de Terminaison*). La notion de normalisation (i.e. terminaison) admet de nombreuses variantes: on en verra deux, la réduction de tête (HN, Head Normalization) et la réduction faible (WN, Weak Normalization). On verra aussi que les ITS ont des conséquences en lambda-calcul qui sont *externes* à la théorie des types.

Etant donné un système de type Sys (que Sys soit un ITS ou un système de types simples, d'ordre supérieur ou non), la propriété de terminaison (typable dans Sys ⇒ normalisable) est souvent difficile à établir (on doit généralement recourir à un argument dit de réalisabilité, attribué à Tait). Cependant, je présenterai le système R, introduit par Gardner et de de Carvalho, dans lequel l'opérateur d'intersection peut être vu comme non-idempotent et la terminaison repose sur un argument très simple que nous verrons ensemble.

2) Présenter un article (accepté récemment à LICS) traitant de lambda-calcul et de réduction infinitaires et dont voici l'abstract:

Infinitary Intersection Types as Sequences: a New Answer to Klop’s Problem

We provide a type-theoretical characterization of weakly-normalizing terms in an infinitary lambda-calculus. We adapt for this purpose the standard quantitative (with non-idempotent intersections) type assignment system of the lambda-calculus to our infinite calculus. Our work provides a positive answer to a semi-open question known as Klop’s Problem, namely, finding out if there is a type system characterizing the set of hereditary head-normalizing (HHN) lambda-terms. Tatsuta showed in 2007 that HHN could not be characterized by a finite type system. We prove that an infinitary type system endowed with a validity condition called approximability can achieve it. As it turns out, approximability cannot be expressed when intersection is represented by means of multisets. Multisets are then replaced coinductively by sequences of types indexed by integers, thus defining a type system called System S.

Non-permanent members' seminar

Wednesday May 3, 2017, 11AM, Salle 3052

**Alexandre Nolin** (Algorithms and complexity Group) *Quantum, a look through nonlocality*

Non-permanent members' seminar

Wednesday April 19, 2017, 11AM, Salle 3052

**Pierre Cagne** (PPS team) *Lawvere’s hyperdoctrines and notions of equality*

Non-permanent members' seminar

Wednesday April 5, 2017, 11AM, Salle 3052

**Guillaume Lagarde** (Automata and applications Group) *On the stability of the Lempel-Ziv compression algorithm*

The presentation will just use basic combinatorics.

Non-permanent members' seminar

Wednesday March 22, 2017, 11AM, Salle 3052

**Gabriel Radanne** (PPS team) *GADTs gone mild*

Since their adoption in “mainstream” languages, GADTs have been known for allowing to elegantly write toy typed interpreter at the cost of horrible type error messages and numerous headaches. Or, as Yaron Misky said, “I assumed that it was the kind of nonsense you get when you let compiler writers design your programming language.”.

In this talk, I will present GADTs, what they are, and what useful things we can do with them. This will take us on quite a journey, with some traces of C, a pinch of memory layout, a cameo from pushdown automata and a healthy amount of Prolog. The only requirements will be a passing familiarity with OCaml and the caffeinated beverage of your choice.

Non-permanent members' seminar

Wednesday March 8, 2017, 11AM, Salle 3052

**Pablo Eduardo Rotondo** (Automata and applications Group) *Continued Fractions and the Recurrence of Sturmian Words*

Non-permanent members' seminar

Wednesday February 22, 2017, 11AM, Salle 3052

**Lucas Boczkowski** (Algorithms and complexity Group) *Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits*

This paper considers the basic PULL model of communication, in which in each round, each agent extracts information from few randomly chosen agents. We seek to identify the smallest amount of information revealed in each interaction (message size) that nevertheless allows for efficient and robust computations of fundamental information dissemination tasks. We focus on the Majority Bit Dissemination problem that considers a population of n agents, with a designated subset of source agents. Each source agent holds an input bit and each agent holds an output bit. The goal is to let all agents converge their output bits on the most frequent input bit of the sources (the majority bit). Note that the particular case of a single source agent corresponds to the classical problem of Broadcast (also termed Rumor Spreading). We concentrate on the severe fault-tolerant context of self-stabilization, in which a correct configuration must be reached eventually, despite all agents starting the execution with arbitrary initial states. In particular, the specification of who is a source and what is its initial input bit may be set by an adversary.

We first design a general compiler which can essentially transform any self-stabilizing algorithm with a certain property (called “the bitwise-independence property”) that uses l-bits messages to one that uses only (log l)-bits messages, while paying only a small penalty in the running time. By applying this compiler recursively we then obtain a self-stabilizing Clock Synchronization protocol, in which agents synchronize their clocks modulo some given integer T, within O(log n log T) rounds w.h.p., and using messages that contain 3 bits only. We then employ the new Clock Synchronization tool to obtain a self-stabilizing majority broadcast protocol which converges in O(log n) time, w.h.p., on every initial configuration, provided that the ratio of sources supporting the minority opinion is bounded away from half. Moreover, this protocol also uses only 3 bits per interaction.

Based on joint work with A. Korman and E. Natale.

Non-permanent members' seminar

Wednesday January 25, 2017, 11AM, Salle 3052

**Thibaut Girka** (PPS team) *Oracle-based Differential Operational Semantics (or Explaining program differences with programs)*

We illustrate this framework by instantiating it on a toy imperative language and by presenting several /difference languages/ ranging from trivial equivalence-preserving syntactic transformations to characterized semantic differences. Through those examples, we will present the basis of our framework, show how to use it to relate syntactic changes with their effect on semantics, how one can abstract away from the small-step semantics presentation, and discuss the composability of oracles.

Non-permanent members' seminar

Wednesday January 11, 2017, 11AM, Salle 3052

**Fabian Reiter** (Automata and applications Group) *Asynchronous Distributed Automata*