activity
20062025
most citedSatisfiability of General Intruder Constraints with and without a Set Constructor

4 citations · 11 across the 12 of their papers we have counts for

collaborators

12 papers

cs.CL2025

FairTranslate: An English-French Dataset for Gender Bias Evaluation in Machine Translation by Overcoming Gender Binarity

Fanny Jourdan, Yannick Chevalier, Cécile Favre

Large Language Models (LLMs) are increasingly leveraged for translation tasks but often fall short when translating inclusive language -- such as texts containing the singular 'the…

cs.CR2021

Implementing Security Protocol Monitors

Yannick Chevalier, Michaël Rusinowitch

Cryptographic protocols are often specified by narrations, i.e., finite sequences of message exchanges that show the intended execution of the protocol. Another use of narrations i…

cs.FL2013★ 1 cited

Fresh-Variable Automata for Service Composition

Walid Belkhir, Yannick Chevalier, Michael Rusinowitch

To model Web services handling data from an infinite domain, or with multiple sessions, we introduce fresh-variable automata, a simple extension of finite-state automata in which s…

cs.FL2013★ 4 cited

Guarded Variable Automata over Infinite Alphabets

Walid Belkhir, Yannick Chevalier, Michael Rusinowitch

We define guarded variable automata (GVAs), a simple extension of finite automata over infinite alphabets. In this model the transitions are labelled by letters or variables rangin…

cs.CR2012

Intruder deducibility constraints with negation. Decidability and application to secured service compositions

Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch +1

The problem of finding a mediator to compose secured services has been reduced in our former work to the problem of solving deducibility constraints similar to those employed for c…

cs.LO2012

Automated Synthesis of a Finite Complexity Ordering for Saturation

Yannick Chevalier, Mounira Kourjieh

We present in this paper a new procedure to saturate a set of clauses with respect to a well-founded ordering on ground atoms such that A < B implies Var(A) {\subseteq} Var(B) for…