Seeing is Believing

Crooks, Natacha; Pu, Youer; Alvisi, Lorenzo; Clement, Allen

doi:10.1145/3087801.3087802

Cited by 33 publications

(15 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper formalizes Crooks' state-based client-centric isolation model (ci) in tla + in order to check conformance to isolation levels using model checking. The running examples of Crooks et al [6] are reproduced and validated in tla + . An example of a transaction implementation using two phase locking (2pl) and two phase commit (2pc) is formalized in tla + .…”

Section: Discussionmentioning

confidence: 99%

“…If a cycle can be found in the graph of these dependencies, an isolation anomaly is present. Crooks et al [6] model a state-based and client-centric approach to isolation and prove that it is equivalent to Adya's formalization.…”

Section: Introductionmentioning

confidence: 99%

“…has the standard semantics. The rest of (Lines 4 to 5) follows the ci definition quite literally, except that the third alternative (Line 13) is not captured in the ci definition for RS above, but represents the "convention [that] write operations have read states too" [6] to include all states up until the parent state for writes.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Automated Validation of State-Based Client-Centric Isolation with TLA$$^+$$

Soethout

Storm

Vinju

2021

Software Engineering and Formal Methods. SEFM 2020 Collocated Workshops

View full text Add to dashboard Cite

Clear consistency guarantees on data are paramount for the design and implementation of distributed systems. When implementing distributed applications, developers require approaches to verify the data consistency guarantees of an implementation choice. Crooks et al. define a state-based and client-centric model of database isolation. This paper formalizes this state-based model in tla + , reproduces their examples and shows how to model check runtime traces and algorithms with this formalization. The formalized model in tla + enables semi-automatic model checking for different implementation alternatives for transactional operations and allows checking of conformance to isolation levels. We reproduce examples of the original paper and confirm the isolation guarantees of the combination of the well-known 2-phase locking and 2-phase commit algorithms. Using model checking this formalization can also help finding bugs in incorrect specifications. This improves feasibility of automated checking of isolation guarantees in synthesized synchronization implementations and it provides an environment for experimenting with new designs.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Automated Validation of State-Based Client-Centric Isolation with TLA$$^+$$

Soethout

Storm

Vinju

2021

Software Engineering and Formal Methods. SEFM 2020 Collocated Workshops

View full text Add to dashboard Cite

show abstract

“…It is unclear how the approach of Lesani et al would scale to a larger setting where a key-value store is just one component of a distributed system. Several approaches exist for reasoning about weaker consistency models of distributed databases and their clients, including declarative approaches, e.g., Adya et al [2000]; Ahamad et al [1995]; Burckhardt et al [2012]; Cerone et al [2015Cerone et al [ , 2017; Cooper et al [2008]; Gotsman et al [2016] as well as operational approaches, e.g., Crooks et al [2017]; Kaki et al [2018]; Schewe and Zhang [2018]; Xiong et al [2019]. Common for all these works is that they reason about high-level models of distributed replicated databases and protocols with tools tailored for reasoning about databases, specific combinations of consistency models, and specific consistency guarantees.…”

Section: Hocap-style Specification For the Write Operationmentioning

confidence: 99%

Distributed causal memory: modular specification and verification in higher-order distributed separation logic

Gondelman

Gregersen

Nieto

et al. 2021

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We present the first specification and verification of an implementation of a causally-consistent distributed database that supports modular verification of full functional correctness properties of clients and servers. We specify and reason about the causally-consistent distributed database in Aneris, a higher-order distributed separation logic for an ML-like programming language with network primitives for programming distributed systems. We demonstrate that our specifications are useful, by proving the correctness of small, but tricky, synthetic examples involving causal dependency and by verifying a session manager library implemented on top of the distributed database. We use Aneris's facilities for modular specification and verification to obtain a highly modular development, where each component is verified in isolation, relying only on the specifications (not the implementations) of other components. We have used the Coq formalization of the Aneris logic to formalize all the results presented in the paper in the Coq proof assistant.

show abstract

“…Specifically, Szekeres and Zhang [20] provide a system model and a formalism called result visibility to describe consistency guarantees, including real-time guarantees. Crooks et al [5], focusing on databases, provide a state-based formalization of isolation guarantees. Burckhardt, in his book on Eventual Consistency [4], provides a formalism to describe consistency models and protocols, with a focus on weaker guarantees.…”

Section: Related Workmentioning

confidence: 99%

Towards the Synthesis of Coherence/Replication Protocols from Consistency Models via Real-Time Orderings

Gavrielatos

Nagarajan

Fatourou

2021

Proceedings of the 8th Workshop on Principles and Practice of Consistency for Distributed Data

View full text Add to dashboard Cite

This work focuses on shared memory systems with a readwrite interface (e.g., distributed datastores or multiprocessors). At the heart of such systems resides a protocol responsible for enforcing their consistency guarantees. Designing a protocol that correctly and efficiently enforces consistency is a very challenging task. Our overarching vision is to automate this task. In this work we take a step towards this vision by establishing the theoretical foundation necessary to automatically infer a protocol from a consistency specification. Specifically, we propose a set of mathematical abstractions, called real-time orderings (rt-orderings), that model the protocol. We then create a mapping from consistency guarantees to the minimal rt-orderings that enforce the guarantees. Finally, we informally relate the rt-orderings to protocol implementation techniques. Consequently, rt-orderings serve as an intermediate abstraction between consistency and protocol design, that enables the automatic translation of consistency guarantees into protocol implementations. CCS Concepts• Computer systems organization → Cloud computing; Multicore architectures; • Software and its engineering → Consistency.

show abstract

Seeing is Believing

Cited by 33 publications

References 28 publications

Automated Validation of State-Based Client-Centric Isolation with TLA$$^+$$

Automated Validation of State-Based Client-Centric Isolation with TLA$$^+$$

Distributed causal memory: modular specification and verification in higher-order distributed separation logic

Towards the Synthesis of Coherence/Replication Protocols from Consistency Models via Real-Time Orderings

Contact Info

Product

Resources

About