Algebraic laws for weak consistency

DOI10.4230/LIPICS.CONCUR.2017.26zbMATH Open1442.68104MaRDI QIDQ5111640FDOQ5111640

Authors: Andrea Cerone, Alexey Gotsman, Hongseok Yang 

Publication date: 27 May 2020

Recommendations

• Checking robustness between weak transactional consistency models
• A framework for transactional consistency models with atomic visibility
• Robustness against consistency models with atomic visibility
• scientific article; zbMATH DE number 7327945
• The complexity of weak consistency

zbMATH Keywords

dependency graphsdistributed databasesweak consistency models

Mathematics Subject Classification ID

Database theory (68P15) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Composite Replicated Data Types
• Replicated data types
• Checking and Enforcing Robustness against TSO
• Eventually Consistent Transactions
• Serializability for eventual consistency: criterion, analysis, and applications
• Transaction chopping for parallel snapshot isolation
• On verifying causal consistency
• On Thin Air Reads Towards an Event Structures Model of Relaxed Memory
• A Framework for Transactional Consistency Models with Atomic Visibility
• Robustness against Consistency Models with Atomic Visibility
• Title not available (Why is that?)
• Scalable Atomic Visibility with RAMP Transactions
• Analysing Snapshot Isolation

Cited In (4)

• Robustness against Read Committed for Transaction Templates with Functional Constraints
• Checking robustness between weak transactional consistency models
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• MS SQL Server

This page was built for publication: Algebraic laws for weak consistency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111640)