scientific article; zbMATH DE number 7327945
From MaRDI portal
Publication:5856416
Constantin Enea, Sidi Mohamed Beillahi, Ahmed Bouajjani
Publication date: 26 March 2021
Full work available at URL: https://arxiv.org/abs/1906.12095
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Robustness Against Transactional Causal Consistency. ⋮ Checking robustness between weak transactional consistency models
Cites Work
- Effective abstractions for verification under relaxed memory models
- The covering and boundedness problems for vector addition systems
- Semantics, specification, and bounded verification of concurrent libraries in replicated systems
- 'Cause I'm strong enough: Reasoning about consistency choices in distributed systems
- Taming release-acquire consistency
- 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
- Context-Bounded Analysis of TSO Systems
- On the verification problem for weak memory models
- Software Verification for Weak Memory via Program Transformation
- 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
This page was built for publication:
