Recherche
Runtime verification consists in checking whether a program satisfies a given specification by observing the trace it produces during its execution
Title: Rewriting consistent answers on annotated data Abstract: In this talk, I'll be discussing results on consistent query answering over databases
Sébastien Bouchard, LaBRI Titre: Byzantine gathering in polynomial time. Abstract: Gathering is a key task in distributed and mobile systems, which
In this talk, I will present the research activities undertaken by our group focused on the study of the electronic structure of molecular systems
Simulating noninteracting systems of fermionic particles (such as electrons) -- so called 'free fermions' -- is a basic routine in computational many
On the one hand, the use of graphical language in quantum computing for the representation of algorithms, although intuitive, is not very useful for
(Uniquement en présentiel / Only offline, no online version) We introduce a limit theory for Latin squares, paralleling the recent limit theories of
Towards “Good-Enough” Quantum Low-Density Parity-Check Codes The accumulation of errors in quantum computers obstructs the execution of powerful
In the first half of the talk, I will talk about the EXPSPACE lower bound for PTA reachability developed during my phd thesis. Parametric timed