Laetitia Laversa
PhD in Computer Science

About me

I hold a PhD in Computer Science from Université Côte d'Azur, defended in December 2021.
My research interests are in the area of modelisation, distributed systems and verification of systems.
I did my PhD under the supervision of Pr. Etienne Lozes and Dr. Cinzia Di Giusto.
My thesis is entitled Synchronizability for distributed systems. It is about communications within distributed systems modelled as automata and especially properties comparing synchronous and asynchronous communications.
Currently, I am an ATER at Université Côte d'Azur.

Download my CV here
Download my thesis here



Bollig, B., Di Giusto, C., Finkel, A., Laversa, L., Lozes, E., Suresh, A. (2021)
A Unifying Framework for Deciding Synchronizability
In 32nd International Conference on Concurrency Theory (CONCUR 2021).
Di Giusto, C., Laversa, L., & Lozes, E. (2021).
Guessing the buffer bound for k-synchronizability
In International Conference on Implementation and Application of Automata
(pp. 102-114). Springer, Cham.
Di Giusto, C., Laversa, L., & Lozes, E. (2020).
On the k-synchronizability of Systems
In International Conference on Foundations of Software Science and Computation Structures
(pp. 157-176). Springer, Cham.
De Maria, E., Di Giusto, C., & Laversa, L. (2019).
Spiking neural networks modelled as timed automata: with parameters learning
Natural Computing, 19.1 (pp. 135-155)

Phd Subject

Synchronizability for distributed systems

Most of the distributed systems we use nowadays are based on the message-passing paradigm where systems are structured into parties that interact only by sending/receiving messages. Message-passing programming is largely employed in high performance computing (MPI, OpenMP, etc), event-driven applications built on top of actor-based languages (Scala, Erlang,etc), service-oriented architectures, peer-to-peer applications, etc. Unfortunately, because of the variety of communication models (peer to peer, mailbox, etc.), of the ambiguities of the specifications of the communication primitives, and of the difficulty of running representative tests, etc., it is error prone and therefore often reserved to experts. The majority of the issues above stem from the asynchronous nature of messages exchange. Indeed, the conception and the analysis of message-passing programs is greatly simplified if one can assume that all communications occur synchronously, i.e., that each message is received exactly at the same time it has been sent. As a matter of fact, some properties (e.g., reachability) becomes decidable if the underlying communication model is synchronous. We are thus interested in understanding under which conditions we could avoid using asynchronous models and being able to design and prove correct simpler but equally powerful systems. This is a property that goes under the name of synchronizability. Synchronizability of a distributed system is the property that the observable behaviour of the system is the same whether or not the communications are synchronous. The main topic of my PhD is to develop methods and tools that help designing safe distributed systems based on the notion of synchronizability.

Participation à Ma Thèse en 180 secondes


Université Côte d'Azur

Bases de l'Informatique (Licence 1) 2018 - 2021
Referent: Dr. Di Giusto Cinzia.
Bases de données (Licence 2) 2019, 2021
Referent: Dr. Lezowski Pierre (2019), Dr. Tichit Laurent (2021).
Programmation Orientée Objet (Licence 3) 2018, 2020
Referent: Dr. Provillard Julien.



Office 224
Laboratoire I3S - UMR CNRS 7271
2000, Route des Lucioles
Les Algorithmes, bâtiment Euclide B
06900 Sophia-Antipolis, FRANCE