An Asynchronous Scheme for Rollback Recovery in Message-Passing Concurrent Programming Languages

Rollback recovery strategies are well-known in concurrent and distributed systems. In this context, recovering from unexpected failures is even more relevant given the non-deterministic nature of execution, which means that it is practically impossible to foresee all possible process interactions. In this work, we consider a message-passing concurrent programming language where processes interact through message sending and receiving, but shared memory is not allowed. In this context, we design a checkpoint-based rollback recovery strategy that does not need a central coordination. For this purpose, we extend the language with three new operators: check, commit, and rollback. Furthermore, our approach is purely asynchronous, which is an essential ingredient to developing a source-to-source program instrumentation implementing a rollback recovery strategy.Comment: This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive version was published in the Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing (SAC '24), April 8-12, 2024, Avila, Spain, ACM, https://doi.org/10.1145/3605098.363605

Realisability of branching pomsets

A communication protocol is realisable if it can be faithfully implemented in a distributed fashion by communicating agents. Pomsets offer a way to compactly represent concurrency in communication protocols and have been recently used for the purpose of realisability analysis. In this paper we focus on the recently introduced branching pomsets, which also compactly represent choices. We define well-formedness conditions on branching pomsets, inspired by multiparty session types, and we prove that the well-formedness of a branching pomset is a sufficient condition for the realisability of the represented communication protocol

Models, Languages, and Tools for Concurrent and Distributed Programming - Essays Dedicated to Rocco De Nicola on the Occasion of His 65th Birthday

This volume was published in honor of Rocco De Nicola’s 65th birthday. The Festschrift volume contains 27 papers written by close collaborators and friends of Rocco De Nicola and was presented to Rocco on the 1st of July 2019 during a two-day symposium held in Lucca, Italy. The papers present many research ideas that have been influenced by Rocco's work. They testify his intellectual curiosity, versatility and tireless research activity, and provide an overview of further developments to come. The volume consists of six sections. The first one contains a laudation illustrating the distinguished career and the main scientific contributions by Rocco and a witness of working experiences with Rocco. The remaining five sections comprise scientific papers related to specific research interests of Rocco and are ordered according to his scientific evolution: Observational Semantics; Logics and Types; Coordination Models and Languages; Distributed Systems Modelling; Security

Event structure semantics for multiparty sessions

We propose an interpretation of multiparty sessions as "Flow Event Structures", which allows concurrency within sessions to be explicitly represented. We show that this interpretation is equivalent, when the multiparty sessions can be described by global types, to an interpretation of such global types as "Prime Event Structures"