Agenda
November
-
14:0015:00
Equivariant polynomial ideals and their membership problem
Abstract:
For an infinite set X (of variables) and a group G acting on X, an ideal J in the polynomial ring K[X] in X over the field K is called equivariant (w.r.t. G) if J is invariant under the action of G. We give a necessary and sufficient condition on the action of G on X for the following extension of Hilbert's basis theorem: every equivariant ideal in K[X] is finitely generated. We also prove that this condition implies decidability of the equivariant ideal membership problem: given a polynomial f and finite set of polynomials H, decide whether f is in the equivariant ideal generated by H.
These results in particular imply decidability of the zeroness problem of weighted register automata, of the universality problem of unambiguous register automata without guessing, and of the reachability problem of reversible data Petri nets for a wide range of data domains.
This is a joint work with Sławomir Lasota and Aliaume Lopez.Englishhttps://u-paris.zoom.us/j/82303001469?pwd=xapukD4PTaOrYkXkNJNeVLyC4FH7mX.1 -
16:0018:00
To meet the exascale challenge, parallel programming models tend to abstract the machine details with task-based programming or by exposing the hardware at the software level (network with RDMA capabilities) with the Partitioned Global Address Space (PGAS) model. The Message Passing Interface (MPI) standard proposes a similar communication model to the PGAS model, via the MPI One-Sided Communications. These operations allow a better overlap of communications by computations compared to classic two-sided communications. However, programmers must handle data consistency and synchronisation to prevent data races, which can be a challenging task. Our study proposes two solutions to facilitate the use of one-sided communications in MPI progams. The first is to improve an existing data race detection tool to make it more scalable. The second is a tool that automatically transform two-sided communications into one-sided communications.
EnglishAmphi LaBRI -
14:0015:00
Aditya Prakash
Resolving nondeterminism in automataIn this talk, we will look at automata where nondeterminism can be resolved on-the-fly, such that this resolution constructs accepting runs on accepting words. The automata where this is possible are called history deterministic automata. We will look at the complexity and algorithms for the problem of recognising history-deterministic automata. We will also look at automata where the resolution of nondeterminism can be done by a stochastic policy. I will end the talk with my currently favourite conjecture on such automata, which, if true, would have an elegant implication for population games.
English178 -
09:3010:30
Libraries of machine checked code are, nowadays, organized around hierarchies of algebraic structures. Unfortunately the language of Type Theory and the features provided by the Coq system make the construction of a hierarchy hard even for expert users. The difficulty begins with the non-orthogonal choices, between storing information as record fields or parameters, and between using type classes and canonical structures for inference. To this, one may add the concerns about performance and about the usability, by a non expert, of the final hierarchy.
HB gives the library designer a language to describe the building blocks of algebraic structures and to assemble them into a hierarchy. Similarly it provides the final user linguistic constructs to build instances (examples) of structures and to teach the elaborator of Coq how to take advantage of this knowledge during type inference. Finally HB lets the library designer improve the usability of his library by providing alternative interfaces to the primitive ones, a feature that can also be used to accommodate changes to the hierarchy without breaking user code.
This is a joint work with Kazuhiko Sakaguchi, Pierre Roux and Enrico Tassi
Salle 76
December
-
11:0012:00
Mouna Safir (ENS Lyon)
Title: Fault tolerance in distributed systems
Abstract:
One of the key principles of distributed computing is to replicate data and distribute tasks to improve the availability and fault-tolerance. But this distribution poses new challenges, in particular the coordination of processes. To ensure the consistency and proper functioning of the system, distributed entities must exchange information and reach joint decisions, even in the case of breakdowns or unpredictable behaviour. In this context, fault-tolerance becomes a central issue. Distributed systems must continue to operate despite partial failures or abnormal behaviours of certain components.
In my research, I explored two ways to strengthen the resilience of distributed systems:
- The k-agreement, which makes it possible to ensure coordination despite the faults.
- Self-stabilization, which aims to automatically restore the system after temporary disturbances.In the course of my presentation, I will present the main results achieved in these two lines of research.
EnglishLaBRI 178 -
14:0015:00
TBA
EnglishLaBRI, salle 178 -
15:3018:30
Clément Gaspard will defend his thesis on December 8, 2025, at 3:30 p.m., in Lecture Hall 2 of Building 2A at the Bordeaux University Institute of Technology (Gradignan).
The title of his thesis is: “Locomotion, step planning, and fall resistance in humanoid robots via reinforcement learning policies.”
Amphi 2 Bât 2A (IUT de Bx, Gradignan) -
15:3016:30
Locomotion, step planning, and fall resistance in humanoid robots via reinforcement learning policies
EnglishAmphi 2 Bat A IUT Gradignan -
14:0017:00
The adoption of electronic health records has considerably enhanced access to large volumes of clinical data. While this accessibility is invaluable for both healthcare delivery and research, it also introduces new challenges arising from the complexity of medical data. These challenges include its implicitness (i.e., the need for domain expertise to interpret data), imperfections such as inconsistency, uncertainty, and incompleteness , and its inherently temporal nature. This thesis investigates how logic-based approaches can address these challenges.
First, I investigated an ontology-driven approach to illustrate how ontologies can be used to evaluate medical data quality, with a focus on lung cancer phenotyping. This involved designing an ontology to capture essential domain knowledge and applying it to query the Clinical Data Warehouse of Bordeaux University Hospital. The work highlighted both the benefits of ontologies in representing domain knowledge and identifying inconsistencies, as well as their limitations, particularly in handling temporally inconsistent healthcare data.
Building on this experience, I then proposed a novel logic-based framework for inferring high-level events from temporal clinical data, in a way that better aligns with clinical reasoning and decision-making . The framework defines logical rules specifying the existence conditions of an event at a given time-point, along with optional termination conditions that signal its possible end. It also introduces two aggregation methods to construct event intervals from these conditions. Furthermore, the formalism supports the definition of meta-events, obtained by combining or generalizing other events, and integrates confidence levels and a repair mechanism to handle imperfections in event detection. To validate the framework, I implemented its core components using Answer Set Programming, a declarative logic programming paradigm, and evaluated the resulting system, CASPER, on two medical use cases. The evaluation showed both computational feasibility and alignment with expert medical opinions.
Amphi LaBRI