DS07 - Société de l'information et de la communication

Static analysis of fault-tolerant distributed algorithms – SAFTA

Submission summary

Fault-tolerant distributed data structures are at the core distributed systems.
Due to the multiple sources of non-determinism, their development is challenging.
The project aims to increase the confidence we have in distributed implementations of data structures.
We think that the difficulty does not only come from the algorithms but from the way we think about distributed systems.
We will investigate partially synchronous programming abstractions that reduce the number of interleavings, simplifying the reasoning about distributed systems and their proof arguments.
We will use partial synchrony to define reduction theorems from asynchronous semantics to partially synchronous ones, enabling the transfer of proofs from the synchronous world to the asynchronous one.
Moreover, we will define a domain specific language, that allows the programmer to focus on the algorithm task, it compiles into efficient asynchronous code, and it is equipped with automated verification engines.

Project coordination

Cezara Dragoi (Institut National de Recherche en Informatique et en Automatique)

The author of this summary is the project coordinator, who is responsible for the content of this summary. The ANR declines any responsibility as for its contents.


Inria de Paris Institut National de Recherche en Informatique et en Automatique

Help of the ANR 272,160 euros
Beginning and duration of the scientific project: - 48 Months

Useful links

Explorez notre base de projets financés



ANR makes available its datasets on funded projects, click here to find more.

Sign up for the latest news:
Subscribe to our newsletter