32 citations · 67 across the 19 of their papers we have counts for
19 papers
A Datalog Framework for Conflict-Free Replicated Data Types
Elena Yanakieva, Annette Bieniusa, Stefania Dumbrava
Distributed applications increasingly support local-first collaboration over shared data, allowing multiple users to perform updates concurrently without global coordination. Such…
CobbleDB: Modelling Levelled Storage by Composition
Emilie Ma, Ayush Pandey, Annette Bieniusa +1
We present a composition-based approach to building correctby-construction database backing stores. In previous work, we specified the behaviour of several store variants and prove…
PRDTs: Composable Design and Verification of Consensus Protocols using Replicated Data Types
Julian Haas, Ragnar Mogk, Annette Bieniusa +1
Consensus protocols are fundamental in distributed systems as they enable services with strong consistency properties. However, designing protocols optimized for specific use-cases…
Distributed Locking as a Data Type
Julian Haas, Ragnar Mogk, Annette Bieniusa +1
Mixed-consistency programming models assist programmers in designing applications that provide high availability while still ensuring application-specific safety invariants. Howeve…
Models for Storage in Database Backends
Edgard Schiebelbein, Saalik Hatia, Annette Bieniusa +3
This paper describes ongoing work on developing a formal specification of a database backend. We present the formalisation of the expected behaviour of a basic transactional system…
LoRe: A Programming Model for Verifiably Safe Local-First Software
Julian Haas, Ragnar Mogk, Elena Yanakieva +2
Local-first software manages and processes private data locally while still enabling collaboration between multiple parties connected via partially unreliable networks. Such softwa…
Set-theoretic Types for Erlang
Albert Schimpf, Stefan Wehr, Annette Bieniusa
Erlang is a functional programming language with dynamic typing. The language offers great flexibility for destructing values through pattern matching and dynamic type tests. Erlan…
Antidote SQL: Relaxed When Possible, Strict When Necessary
Pedro Lopes, João Sousa, Valter Balegas +5
Geo-replication poses an inherent trade-off between low latency, high availability and strong consistency. While NoSQL databases favor low latency and high availability, relaxing c…
Ensuring referential integrity under causal consistency
Marc Shapiro, Annette Bieniusa, Peter Zeller +1
Referential integrity (RI) is an important correctness property of a shared, distributed object storage system. It is sometimes thought that enforcing RI requires a strong form of…
ACGreGate: A Framework for Practical Access Control for Applications using Weakly Consistent Databases
Mathias Weber, Annette Bieniusa
Scalable and highly available systems often require data stores that offer weaker consistency guarantees than traditional relational databases systems. The correctness of these app…
Just-Right Consistency: reconciling availability and safety
Marc Shapiro, Annette Bieniusa, Nuno Preguiça +2
By the CAP Theorem, a distributed data storage system can ensure either Consistency under Partition (CP) or Availability under Partition (AP), but not both. This has led to a split…
Techreport: Time-sensitive probabilistic inference for the edge
Christian Weilbach, Annette Bieniusa
In recent years the two trends of edge computing and artificial intelligence became both crucial for information processing infrastructures. While the centralized analysis of massi…
Practical Evaluation of the Lasp Programming Model at Large Scale - An Experience Report
Christopher S. Meiklejohn, Vitor Enes, Junghun Yoo +3
Programming models for building large-scale distributed applications assist the developer in reasoning about consistency and distribution. However, many of the programming models f…
Global-Local View: Scalable Consistency for Concurrent Data Types
Deepthi Devaki Akkoorath, José Brandão, Annette Bieniusa +1
Concurrent linearizable access to shared objects can be prohibitively expensive in a high contention workload. Many applications apply ad-hoc techniques to eliminate the need of sy…
EPTL - A temporal logic for weakly consistent systems
Mathias Weber, Annette Bieniusa, Arnd Poetzsch-Heffter
The high availability and scalability of weakly-consistent systems attracts system designers. Yet, writing correct application code for this type of systems is difficult; even how…
Eventually Consistent Register Revisited
Marek Zawirski, Carlos Baquero, Annette Bieniusa +2
In order to converge in the presence of concurrent updates, modern eventually consistent replication systems rely on causality information and operation semantics. It is relatively…
Decoupling conflicts for configurable resolution in an open replication system
Christian Weilbach, Konrad Kühne, Annette Bieniusa
Replikativ is a replication middleware supporting a new kind of confluent replicated datatype resembling a distributed version control system. It retains the order of write operati…
SwiftCloud: Fault-Tolerant Geo-Replication Integrated all the Way to the Client Machine
Marek Zawirski, Annette Bieniusa, Valter Balegas +4
Client-side logic and storage are increasingly used in web and mobile applications to improve response time and availability. Current approaches tend to be ad-hoc and poorly integr…
An optimized conflict-free replicated set
Annette Bieniusa, Marek Zawirski, Nuno Preguiça +4
Eventual consistency of replicated data supports concurrent updates, reduces latency and improves fault tolerance, but forgoes strong consistency. Accordingly, several cloud comput…