The paper “Equivalence and Separation between Heard-Of and Asynchronous Message-Passing Models” with Armando Castañeda, Dhrubajyoti Ghosh, Thomas Nowak, was accepted to SIROCCO 2026. arxiv

The paper shows that with a majority of correct processes, the Heard-Of model is  equivalent to the standard asynchronous message-passing model with respect to the solvability of colorless tasks, and that for colored tasks the equivalence holds only for one failure. The proofs proceed through bidirectional simulations between and via an intermediate model that captures a notion of silenced processes.

Our paper Recoverable Lock-Free Locks (with Panagiota Fatourou, Eleftherios Kosmas and Yuanhao Wei) has won the Best Systems Paper Award at OPODIS 2025.

My talk “Specifying binding and commitment with ghost outputs and strong refinement” in FRIDA 2025 is now on youtube.
(For some reason, only the audio was recorded.)

The paper Arbitration-Free Consistency is Available (and Vice Versa), with Constantin Enea and Enrique Román-Calvo was accepted to POPL 2026. arxiv

The paper shows that a distributed object has an available implementation (in which operations can be answered based on local information) if and only if its consistency model does not require a total arbitration order to resolve visibility or read  dependencies.

Two papers will appear in DISC 2025

• Auditable Shared Objects: From Registers to Synchronization Primitives, by Hagit Attiya, Antonio Fernández Anta, Alessia Milani, Alexandre Rapetti, and Corentin Travers arxiv
• Brief Announcement: Communication Patterns for Optimal Resilience, by Hagit Attiya, Itay Flam, and Jennifer L. Welch arxiv

The paper “Preserving hyperproperties of programs using primitives with consensus number 2” (with Armando Castañeda and Constantin Enea) was published in a collection on Hyperproperties: Foundations and Applications in Acta Informatica. open access

Two papers accepted to PODC 2025:

• Auditing without Leaks Despite Curiosity, with Antonio Fernandez Anta, Alessia Milani, Alexandre Rapetti and Corentin Travers arxiv
• Solvability Characterization for General Three-Process Tasks, with Pierre Fraigniaud, Ami Paz and Sergio Rajsbaum

The journal version of “Asynchronous fully-decentralized SGD in the cluster-based model” (with Noa Schiller) is published in Theoretical Computer Science. link

Solvability of Three-Process General Tasks, with Pierre Fraigniaud, Ami Paz and Sergio Rajsbaum will appear in DISC 2024. longer version