Data Words

Runtime Monitoring for Hennessy-Milner Logic with Recursion over Systems with Data @ Séminaire LIGM

Runtime verification consists in monitoring the execution of a system to determine if it satisfies a property. We extend this to systems over data.

Léo Exibard

Dec 6, 2022

Runtime Monitoring for Hennessy-Milner Logic with Recursion over Systems with Data @ Séminaire Automates

Runtime verification consists in monitoring the execution of a system to determine if it satisfies a property. We extend this to systems over data.

Léo Exibard

Dec 2, 2022

Synthesis over Infinite Domains through Machines with Registers @ Journées GT Vérif 2021 (Invited talk)

Synthesis can be lifted to infinite domains through register automata, targeting register transducers implementations.

Léo Exibard

Nov 18, 2021

History-deterministic Register Automata @ NWPT 2021

History-deterministic register automata form a promising class for synthesis and runtime verification applications.

Léo Exibard, Karoliina Lehtinen

Nov 5, 2021

Automatic Synthesis of Systems with Data

We lift synthesis to infinite domains through register automata, targeting register transducers or computable implementations.

Léo Exibard

Sep 20, 2021

On Computability of Data Word Functions Defined by Transducers @ ETAPS 2021

We extend the correspondence between computability and continuity over regular functions to the case of data words.

Léo Exibard

Apr 1, 2021

Church Synthesis on Register Automata over Linearly Ordered Data Domains (STACS 2021)

The Church game for register automata over $(\mathbb{N}, \leq)$ is undecidable, but the one-sided game is, for deterministic ones.

Léo Exibard, Emmanuel Filiot, Ayrat Khalimov

Computability of Data-Word Transductions over Different Data Domains (LMCS Special Issue dedicated to FoSSaCS 2020)

We extend the correspondence between computability and continuity over regular functions to the case of data words.

Léo Exibard, Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier

On Computability of Data Word Functions Defined by Transducers @ HIGHLIGHTS 2020

We extend the correspondence between computability and continuity over regular functions to the case of data words.

Léo Exibard

Sep 17, 2020

On Computability of Data Word Functions Defined by Transducers @ MOVEP 2020

We extend the correspondence between computability and continuity over regular functions to the case of data words.

Léo Exibard

Jun 25, 2020