Checking robustness between weak transactional consistency models
From MaRDI portal
Publication:2233450
DOI10.1007/978-3-030-72019-3_4zbMath1473.68063arXiv2101.09032OpenAlexW3139989314MaRDI QIDQ2233450
Sidi Mohamed Beillahi, Constantin Enea, Ahmed Bouajjani
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2101.09032
Database theory (68P15) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tools and algorithms for the construction and analysis of systems. 23rd international conference, TACAS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22--29, 2017. Proceedings. Part II
- Effective abstractions for verification under relaxed memory models
- The covering and boundedness problems for vector addition systems
- Checking robustness between weak transactional consistency models
- On the semantics of snapshot isolation
- '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
- The serializability of concurrent database updates
- Reduction
- Time, clocks, and the ordering of events in a distributed system
- Analysing Snapshot Isolation
- Robustness against Consistency Models with Atomic Visibility
- Robustness against Power is PSpace-complete
- On the verification problem for weak memory models
- Checking and Enforcing Robustness against TSO
- A Framework for Transactional Consistency Models with Atomic Visibility
- 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
This page was built for publication: Checking robustness between weak transactional consistency models
