Our paper Recoverable Lock-Free Locks (with Panagiota Fatourou, Eleftherios Kosmas and Yuanhao Wei) has won the Best Systems Paper Award at OPODIS 2025.
Category Archives: Uncategorized
FRIDA talk is online
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.)
Paper accepted to POPL 2026
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 (where 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.
Papers accepted to DISC 2025
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
Paper on hyperproperties appeared in Acta Informatica
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
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
Paper on “History-Independent Concurrent Hash Tables” accepted to STOC 2025
Link
The paper “History-Independent Concurrent Hash Tables“, with Michael Bender (Stony Brook University); Martin Farach-Colton (New York University); Rotem Oshman (Tel-Aviv University); Noa Schiller (Tel Aviv University) was accepted to STOC 2025. arxiv
Journal version of “Asynchronous fully-decentralized SGD in the cluster-based model”
The journal version of “Asynchronous fully-decentralized SGD in the cluster-based model” (with Noa Schiller) is published in Theoretical Computer Science. link
Brief announcement in DISC 2024
Solvability of Three-Process General Tasks, with Pierre Fraigniaud, Ami Paz and Sergio Rajsbaum will appear in DISC 2024. longer version
Journal version of “Lower Bounds on the Amortized Time Complexity of Shared Objects”
The journal version of “Lower Bounds on the Amortized Time Complexity of Shared Objects” (with Arie Fouren & Jeremy Ko) is published in Theory of Computing Systems. link