Institution profile

Université de Lorraine

Academic institutioneurope · fr
Official website
Research library217linked papers
Opportunities0open roles
Selected work

Representative Papers

The Sup Connective in IMALL: A Categorical Semantics

May 04, 2022

Intuitionistic Multiplicative-Additive Linear Logic (IMALL) lacks a probabilistic elimination mechanism for additive connectives and struggles to uniformly handle summation and scalar multiplication. Method: We propose an extended proof language introducing a new connective “sup”, supporting probabilistic elimination for additive pairs, and intrinsically incorporating summation and scalar multiplication. We establish, for the first time, an abstract categorical semantics for sup-enriched IMALL based on symmetric monoidal closed categories, constructing biproduct structures and embedding a scalar ring into Hom(I,I), while defining a weighted co-diagonal map to uniformly characterize probabilistic elimination. Contribution: We prove that categories equipped with biproducts plus a ring embedding into Hom(I,I) suffice to model this logic—yielding the first foundational framework for quantum and probabilistic linear type systems that simultaneously ensures expressive power and semantic rigor.

5 citationsRead paper

The Bright Side of Timed Opacity

Aug 22, 2024IEEE International Conference on Formal Engineering Methods

This paper investigates the decidability of timed opacity for Timed Automata (TAs), i.e., whether a system can conceal designated secret states from an attacker who observes timestamped actions. Methodologically, it establishes decidability boundaries across multiple restricted subclasses—including one-clock, one-action, and observable-event-recording TAs—by leveraging zone-graph construction, fixed-point computation, and language inclusion checking. Key contributions include: (i) the first fine-grained decidability map for timed opacity; (ii) the introduction of a novel “bounded-observation attacker” model, where the adversary observes only the first $N$ occurrences or $N$ timestamps of observable events, and the complete decidability characterization and algorithmic solution for opacity under this constraint; and (iii) a proof that timed opacity is decidable for all natural TA subclasses except one-action TAs and one-clock TAs with $varepsilon$-transitions, accompanied by effective decision procedures for the newly identified decidable cases.

4 citationsRead paper

The Third VoicePrivacy Challenge: Preserving Emotional Expressiveness and Linguistic Content in Voice Anonymization

Jan 17, 2026

This work addresses the challenge of voice anonymization by preserving linguistic content and emotional expression while concealing speaker identity. It introduces the first systematic evaluation framework that explicitly incorporates emotional fidelity as a core assessment dimension, establishing a multi-objective optimization paradigm that jointly optimizes privacy protection, semantic preservation, and emotional consistency. By integrating techniques such as speaker embedding perturbation, voice conversion, and generative modeling, and by introducing objective metrics based on adversarial attack models, the framework enables comprehensive evaluation of various baseline and submitted anonymization systems. Experimental results demonstrate that the proposed approach effectively balances privacy guarantees with speech utility, offering a new benchmark and guiding direction for future research in voice privacy.

1 citationsRead paper

Diffusion-based Frameworks for Unsupervised Speech Enhancement

Jan 14, 2026

This work addresses the challenge of unsupervised single-channel speech enhancement in the absence of paired noisy-clean speech data by proposing a novel diffusion-based framework. The method explicitly models noise as a latent variable under an unsupervised setting and integrates an expectation-maximization (EM) algorithm, where the E-step jointly samples latent representations of both speech and noise. Crucially, it replaces conventional NMF-based noise models with a diffusion prior to construct a conditional diffusion generative mechanism. Experimental results demonstrate significant improvements in speech quality and intelligibility on the WSJ0-QUT and VoiceBank-DEMAND datasets: under matched conditions, the diffusion-based noise model achieves optimal performance, while under mismatched conditions, its explicit NMF modeling variant even surpasses several supervised baselines.

1 citationsRead paper

New Perspectives on Semiring Applications to Dynamic Programming

Dec 03, 2025

Counting minimum-cost solutions to NP-hard combinatorial optimization problems—such as Connected Dominating Set and Constraint Satisfaction—is computationally challenging due to the interplay between cost minimization and solution enumeration. Method: We propose a unified dynamic programming framework grounded in semiring algebra, centered on a novel Δ-product operation that relaxes the idempotence requirement of classical semirings, enabling efficient counting of minimum-cost solutions over non-idempotent semirings. The framework is parameterized by treewidth and clique-width to ensure tractability on structured inputs. Contribution/Results: We establish fixed-parameter tractable (FPT) enumeration for minimum-cost solutions under bounded treewidth or clique-width, proving polynomial-time solvability of the counting problem in these parameters. Our approach significantly extends classical DP’s expressiveness, unifying cost optimization and solution counting within a single algebraic model—thereby enabling rigorous analysis and efficient computation for previously intractable enumeration tasks.

1 citationsRead paper
Recent publications

Latest Papers