In this article we study the properties of distributed systems that mix eventual and strong consistency. We formalize such through acute cloud types (ACTs), abstractions similar to conflict-free replicated data types (CRDTs), which by default work in a highly available, eventually consistent fa...

Abstract Commutative Replicated Data Types (CRDTs) are a promising new class of data structures for large-scale shared mutable content in applications that only require eventual consistency. The WithOut Operational Transforms (WOOT) framework is the first CRDT collaborative text editing introduced by Oster et al. (In: Conference on Computer Supported Cooperative Work (CSCW). ACM, New York, pp 2...

Transactional enterprise applications today depend on the ACID property of the underlying database. ACID is a valuable model to reason about concurrency and consistency constraints in the application requirements. The new class of NoSQL databases that is used at the foundation of many big data architectures drops the ACID properties and especially gives up strong consistency for eventual consis...

Filtering techniques are essential to efficiently look for a solution in a constraint network (CN). However, for a long time it has been considered that to efficiently reduce the search space, the best choice is the limited local consistency achieved by forward checking [15, 17]. However, more recent works [18, 4, 16] show that maintaining arc consistency (which is a more pruningful local consi...

In globally distributed systems, shared state is never perfect. When communication is neither fast nor reliable, we cannot achieve strong consistency, low latency, and availability at the same time. Unfortunately, abandoning strong consistency has wide ramifications. Eventual consistency, though attractive from a performance viewpoint, is challenging to understand and reason about, both for sys...