8 citations · 15 across the 10 of their papers we have counts for
10 papers
Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
Luca Aceto, Antonis Achilleos, Duncan Paul Attard +4
Runtime verification, also known as runtime monitoring, consists of checking whether a system satisfies a given specification by observing the trace it produces during its executio…
The complexity of verifying the release-acquire semantics over register machines
Parosh Abdulla, Elli Anastasiadi, Mohamed Faouzi Atig +2
The Release-Acquire (RA) semantics and its variants are some of the most fundamental models of concurrent semantics for architectures, programming languages, and distributed system…
Denotational Semantics for Probabilistic and Concurrent Programs
Noam Zilberstein, Daniele Gorla, Alexandra Silva
We develop a denotational model for probabilistic and concurrent imperative programs, a class of programs with standard control flow via conditionals and while-loops, as well as pr…
A Generic Solution to Register-bounded Synthesis with an Application to Discrete Orders
Léo Exibard, Emmanuel Filiot, Ayrat Khalimov
We study synthesis of reactive systems interacting with environments using an infinite data domain. A popular formalism for specifying and modelling such systems is register automa…
A Generic Solution to Register-bounded Synthesis with an Application to Discrete Orders
Léo Exibard, Emmanuel Filiot, Ayrat Khalimov
We study synthesis of reactive systems interacting with environments using an infinite data domain. A popular formalism for specifying and modelling such systems is register automa…
Computability of Data-Word Transductions over Different Data Domains
Léo Exibard, Emmanuel Filiot, Nathan Lhote +1
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data -words). The notion of computability is defined…
On Computability of Data Word Functions Defined by Transducers
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data omega-words). The notion of computability is define…
The Complexity of Transducer Synthesis from Multi-Sequential Specifications
Léo Exibard, Emmanuel Filiot, Ismaël Jecker
The transducer synthesis problem on finite words asks, given a specification , where and are sets of finite words, whether there exists an implement…
Synthesis of Data Word Transducers
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
In reactive synthesis, the goal is to automatically generate an implementation from a specification of the reactive and non-terminating input/output behaviours of a system. Specifi…
Two-way Two-tape Automata
Olivier Carton, Léo Exibard, Olivier Serre
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such altern…