Robustness Against Transactional Causal Consistency.

DOI10.4230/LIPIcs.CONCUR.2019.30OpenAlexW2971298211MaRDI QIDQ5875392

Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/pdf/1906.12095.pdf

zbMATH Keywords

model checkingdistributed databasescausal consistency

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Robustness against Read Committed for Transaction Templates with Functional Constraints

Cites Work

• Effective abstractions for verification under relaxed memory models
• The covering and boundedness problems for vector addition systems
• 'Cause I'm strong enough: Reasoning about consistency choices in distributed systems
• What’s Decidable about Weak Memory Models?
• Deciding Robustness against Total Store Ordering
• Owicki-Gries Reasoning for Weak Memory Models
• Impossibility of distributed consensus with one faulty process
• The serializability of concurrent database updates
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Time, clocks, and the ordering of events in a distributed system
• Analysing Snapshot Isolation
• Robustness against Consistency Models with Atomic Visibility
• Causal memory: definitions, implementation, and programming
• Robustness against Power is PSpace-complete
• Checking and Enforcing Robustness against TSO
• Ogre and Pythia: an invariance proof method for weak consistency models
• Serializability for eventual consistency: criterion, analysis, and applications
• On verifying causal consistency
• Replicated data types
• Unnamed Item
• Unnamed Item

This page was built for publication: Robustness Against Transactional Causal Consistency.