• Publications
  • Influence
Cure: Strong Semantics Meets High Availability and Low Latency
TLDR
The protocols for highly available transactions, and an experimental evaluation showing that Cure is able to achieve scalability similar to eventually-consistent NoSQL databases, while providing stronger guarantees. Expand
Write Fast, Read in the Past: Causal Consistency for Client-Side Applications
TLDR
The SwiftCloud algorithms, design, and experimental evaluation show that client-side apps enjoy the high performance and availability, under the same guarantees as a remote cloud data store, at a small cost. Expand
SwiftCloud: Fault-Tolerant Geo-Replication Integrated all the Way to the Client Machine
TLDR
This work presents a principled approach to integrate client-and server-side storage that supports both mergeable and strongly consistent transactions that target either client or server replicas and provide access to causally-consistent snapshots efficiently. Expand
Legion: Enriching Internet Services with Peer-to-Peer Interactions
TLDR
A framework named Legion is designed that enables client web applications to securely replicate data from servers, and synchronize these replicas directly among them, and provides lower latency for update propagation with decreased network traffic for servers. Expand
Consistency in hindsight: A fully decentralized STM algorithm
TLDR
Decent STM is presented, a fully decentralized object-based STM algorithm that relies on mostly immutable data structures, which are well-suited for replication and migration and is the first decentralized STM implementing snapshot isolation semantics. Expand
An optimized conflict-free replicated set
TLDR
A reasoning abstraction, \emph{permutation equivalence}, is presented that systematizes the characterization of the expected concurrency semantics of concurrent types and presents one of the existing conflict-free replicated data types, Observed-Remove Set. Expand
Formal Specification and Verification of CRDTs
TLDR
A formal framework for the analysis and verification of CRDTs is developed within the interactive theorem prover Isabelle/HOL and it is shown how CRDT implementations can be expressed in this framework and present a general strategy for verifying CR DTs. Expand
Access permission contracts for scripting languages
TLDR
A novel kind of contract for object-based languages that specifies the side effects of an operation with access permissions, and finds that adding access permissions to contracts increases the effectiveness of error detection through contract monitoring by 6-13%. Expand
Brief Announcement: Semantics of Eventually Consistent Replicated Sets
TLDR
This paper studies the semantics of sets under eventual consistency, which supports concurrent updates, reduces latency and improves fault tolerance, but forgoes strong consistency (e.g., linearisability). Expand
Brief announcement: actions in the twilight - concurrent irrevocable transactions and inconsistency repair
TLDR
The Twilight STM enhances a transaction with twilight code that executes between the preparation to commit the transaction and its actual commit or abort, and may thus turn a failing transaction into a successful one. Expand
...
1
2
3
4
5
...