Causality tracking mechanisms, such as vector clocks and version vectors, rely on map**s
from globally unique identifiers to integer counters. In a system with a well known set of …

We study Merkle-DAGs as a transport and persistence layer for Conflict-Free Replicated
Data Types (CRDTs), coining the term Merkle-CRDTs and providing an overview of the …

Runtime verification focuses on analyzing the execution of a given program by a monitor to
determine if it is likely to violate its specifications. There is often an impedance mismatch …

Conflicts naturally arise in optimistically replicated systems. The common way to detect
update conflicts is via version vectors, whose storage and communication overhead are …

The ability to access and query data stored in multiple versions is an important asset for
many applications, such as Web graph analysis, collaborative editing platforms, data …

Many distributed services need to be scalable: internet search, electronic commerce, e-
government ...… In order to achieve scalability those applications rely on replicated …

A large family of distributed transactional protocols have a common structure, called
Deferred Update Replication (DUR). DUR provides dependability by replicating data, and …

Vector clock algorithms are basic wait-free building blocks that facilitate causal ordering of
events. As wait-free algorithms, they are guaranteed to complete their operations within a …

Conflicts naturally arise in optimistically replicated systems. The common way to detect
update conflicts is via version vectors, whose storage and communication overhead are …

Eventual consistency is a relaxation of strong consistency that guarantees that if no new
updates are made to a replicated data object, then all replicas will converge. The conflict …