activity
20082026
most citedConstrained Differentially Private Federated Learning for Low-bandwidth Devices

2 citations · 3 across the 14 of their papers we have counts for

collaborators

16 papers

cs.AI2026

DPNL: A DPLL-based Algorithm for Probabilistic Neurosymbolic Learning

Thomas Jean-Michel Valentin, Pierre Genev{è}s, Luisa Sophie Werner +3

Probabilistic Neurosymbolic Learning (PNL) combines neural predictions with symbolic reasoning, enabling end-to-end learning from final-output supervision without labels for interm…

cs.AI2026

Beyond Accuracy: Measuring Logical Compliance of Predictive Models

Guillaume Olivier Delplanque, Pierre Genevès, Nabil Layaïda +1

Machine learning models are predominantly evaluated through predictive performance metrics such as ranking quality, prediction error, or classification accuracy. While these metric…

cs.PL2026

Towards Multiparty Session Types for Highly-Concurrent and Fault-Tolerant Web Applications

Richard Casetta, Nils Gesbert, Pierre Genevès

Modern web applications combine persistent state updates, concurrent interactions, and unreliable communication with external services. Failures such as timeouts can occur after pa…

cs.DB2026

Optimizing Relational Queries over Array-Valued Data in Columnar Systems

Maroua Zeblah, Etienne Couritas, Sarah Chlyah +3

Modern analytical workloads increasingly combine relational data with array-valued attributes. While columnar database systems efficiently process such workloads, their ability to…

cs.AI2025

On Scaling Neurosymbolic Programming through Guided Logical Inference

Thomas Jean-Michel Valentin, Luisa Sophie Werner, Pierre Genevès +1

Probabilistic neurosymbolic learning seeks to integrate neural networks with symbolic programming. Many state-of-the-art systems rely on a reduction to the Probabilistic Weighted M…

cs.DB2024

Schema-Based Query Optimisation for Graph Databases

Chandan Sharma, Pierre Genevès, Nils Gesbert +1

Recursive graph queries are increasingly popular for extracting information from interconnected data found in various domains such as social networks, life sciences, and business a…

cs.DB2023

Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers

Amela Fejza, Pierre Genevès, Nabil Layaïda

Query optimizers built on the transformation-based Volcano/Cascades framework are used in many database systems. Transformations proposed earlier on the logical query dag (LQDAG) d…

cs.LO2023

Efficient Iterative Programs with Distributed Data Collections

Sarah Chlyah, Nils Gesbert, Pierre Geneves +1

Big data programming frameworks have become increasingly important for the development of applications for which performance and scalability are critical. In those complex framewor…

cs.AI2023★ 1 cited

Knowledge Enhanced Graph Neural Networks for Graph Completion

Luisa Werner, Nabil Layaïda, Pierre Genevès +1

Graph data is omnipresent and has a wide variety of applications, such as in natural science, social networks, or the semantic web. However, while being rich in information, graphs…

cs.DB2021

Distributed Evaluation of Graph Queries using Recursive Relational Algebra

Sarah Chlyah, Pierre Genevès, Nabil Layaïda

We present a system called Dist--RA for the distributed evaluation of recursive graph queries. Dist--RA builds on the recursive relational algebra and extends it with evaluat…

cs.CR2021★ 2 cited

Constrained Differentially Private Federated Learning for Low-bandwidth Devices

Raouf Kerkouche, Gergely Ács, Claude Castelluccia +1

Federated learning becomes a prominent approach when different entities want to learn collaboratively a common model without sharing their training data. However, Federated learnin…

cs.LG2020

Compression Boosts Differentially Private Federated Learning

Raouf Kerkouche, Gergely Ács, Claude Castelluccia +1

Federated Learning allows distributed entities to train a common model collaboratively without sharing their own data. Although it prevents data collection and aggregation by excha…

cs.DB2010

On the Count of Trees

Everardo Barcenas, Pierre Geneves, Nabil Layaida +1

Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so…

cs.PL2008

XML Static Analyzer User Manual

Pierre Geneves, Nabil Layaida

This document describes how to use the XML static analyzer in practice. It provides informal documentation for using the XML reasoning solver implementation. The solver allows auto…

cs.PL2008

Ensuring Query Compatibility with Evolving XML Schemas

Pierre Genevès, Nabil Layaïda, Vincent Quint

During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validit…

cs.PL2008

Logics for XML

Pierre Geneves

This thesis describes the theoretical and practical foundations of a system for the static analysis of XML processing languages. The system relies on a fixpoint temporal logic with…