| No. |
Title |
Author |
Year |
| 1 |
Formal Methods and Distributed Computing: Stronger Together (Dagstuhl Seminar 22492) |
Attiya, Hagit et al. |
2023 |
| 2 |
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks |
Attiya, Hagit et al. |
2023 |
| 3 |
A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die |
Goubault, Éric et al. |
2022 |
| 4 |
Continuous Tasks and the Asynchronous Computability Theorem |
Galeana, Hugo Rincon et al. |
2022 |
| 5 |
Distributed Decision Problems: Concurrent Specifications Beyond Binary Relations (Invited Talk) |
Rajsbaum, Sergio |
2022 |
| 6 |
Locally Solvable Tasks and the Limitations of Valency Arguments |
Attiya, Hagit et al. |
2021 |
| 7 |
Relaxed Queues and Stacks from Read/Write Operations |
Castañeda, Armando et al. |
2021 |
| 8 |
Wait-Free Solvability of Equality Negation Tasks |
Goubault, Éric et al. |
2019 |
| 9 |
Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211) |
Esparza, Javier et al. |
2018 |
| 10 |
Decentralized Asynchronous Crash-Resilient Runtime Verification |
Bonakdarpour, Borzoo et al. |
2016 |
