Analysing Snapshot Isolation

Cerone, Andrea; Gotsman, Alexey

doi:10.1145/2933057.2933096

Cited by 27 publications

(38 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Initially, x = y = 0 The above is also known as the write skew anomaly in the database literature [14]. Such outcomes are analogous to those allowed by weak memory models, such as x86-TSO [29,34] and C11 [9], for non-transactional programs.…”

Section: Introductionmentioning

confidence: 92%

“…Informally, the WR corresponds to our rf T ; the WW corresponds to our mo T ; and the RW corresponds to our rb T . Adya's dependency graphs have been used to develop declarative specifications of the PSI consistency model [14]. In Sect.…”

Section: Rwmentioning

confidence: 99%

“…4, we revisit this model, redefine it as specification graphs in our setting, and develop a reference lock-based implementation that is sound and complete with respect to this abstract specification. The model in [14] does not account for non-transactional accesses. To remedy this, later in Sect.…”

Section: Rwmentioning

confidence: 99%

“…In order to formally characterise the weak behaviour and anomalies admitted by PSI, Cerone and Gotsman [14,15] formulated a declarative PSI specification. (In fact, they provide two equivalent specifications: one using dependency graphs proposed by Adya et al [5,7]; and the other using abstract executions.)…”

Section: A Declarative Specification Of Psi Stms In Ramentioning

confidence: 99%

“…It is straightforward to verify that our definition coincides with the dependency graph specification in [15]. As with [14,15], throughout this section, we take PSI execution graphs to be those in which E = T ⊆ (R ∪ W) \ U. That is, the PSI model handles transactional code only, consisting solely of read and write events (excluding updates).…”

Section: A Declarative Specification Of Psi Stms In Ramentioning

confidence: 99%

See 4 more Smart Citations

On Parallel Snapshot Isolation and Release/Acquire Consistency

Raad

Lahav

Vafeiadis

2018

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Parallel snapshot isolation (PSI) is a standard transactional consistency model used in databases and distributed systems. We argue that PSI is also a useful formal model for software transactional memory (STM) as it has certain advantages over other consistency models. However, the formal PSI definition is given declaratively by acyclicity axioms, which most programmers find hard to understand and reason about.To address this, we develop a simple lock-based reference implementation for PSI built on top of the release-acquire memory model, a wellbehaved subset of the C/C++11 memory model. We prove that our implementation is sound and complete against its higher-level declarative specification.We further consider an extension of PSI allowing transactional and non-transactional code to interact, and provide a sound and complete reference implementation for the more general setting. Supporting this interaction is necessary for adopting a transactional model in programming languages.

show abstract

Section: Introductionmentioning

confidence: 92%

Section: Rwmentioning

confidence: 99%

Section: Rwmentioning

confidence: 99%

Section: A Declarative Specification Of Psi Stms In Ramentioning

confidence: 99%

Section: A Declarative Specification Of Psi Stms In Ramentioning

confidence: 99%

See 3 more Smart Citations

On Parallel Snapshot Isolation and Release/Acquire Consistency

Raad

Lahav

Vafeiadis

2018

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

On the Semantics of Snapshot Isolation

Raad

Lahav

Vafeiadis

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Automatic Analysis of Consistency Properties of Distributed Transaction Systems in Maude

Liu

Ölveczky

Zhang

et al. 2019

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Many transaction systems distribute, partition, and replicate their data for scalability, availability, and fault tolerance. However, observing and maintaining strong consistency of distributed and partially replicated data leads to high transaction latencies. Since different applications require different consistency guarantees, there is a plethora of consistency properties-from weak ones such as read atomicity through various forms of snapshot isolation to stronger serializability propertiesand distributed transaction systems (DTSs) guaranteeing such properties. This paper presents a general framework for formally specifying a DTS in Maude, and formalizes in Maude nine common consistency properties for DTSs so defined. Furthermore, we provide a fully automated method for analyzing whether the DTS satisfies the desired property for all initial states up to given bounds on system parameters. This is based on automatically recording relevant history during a Maude run and defining the consistency properties on such histories. To the best of our knowledge, this is the first time that model checking of all these properties in a unified, systematic manner is investigated. We have implemented a tool that automates our method, and use it to model check state-ofthe-art DTSs such as P-Store, RAMP, Walter, Jessy, and ROLA.

show abstract

Analysing Snapshot Isolation

Cited by 27 publications

References 29 publications

On Parallel Snapshot Isolation and Release/Acquire Consistency

On Parallel Snapshot Isolation and Release/Acquire Consistency

On the Semantics of Snapshot Isolation

Automatic Analysis of Consistency Properties of Distributed Transaction Systems in Maude

Contact Info

Product

Resources

About