Optimal stateless model checking for causal consistency
DOI10.1007/978-3-031-30823-9_6zbMATH Open1543.68185MaRDI QIDQ6535346FDOQ6535346
Authors: Parosh A. Abdulla, Mohamed Faouzi Atig, Ashutosh Gupta, Omkar Tuppe 
Publication date: 13 December 2023
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) 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)
Cites Work
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Causal memory: definitions, implementation, and programming
- Title not available (Why is that?)
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Time, clocks, and the ordering of events in a distributed system
- State space reduction using partial order techniques
- Mathematizing C++ concurrency
- Computer aided verification. 33rd international conference, CAV 2021, virtual event, July 20--23, 2021. Proceedings. Part I
- Optimal dynamic partial order reduction
- Stateless model checking under a reads-value-from equivalence
- On verifying causal consistency
- From causal consistency to sequential consistency in shared memory systems
- Stateless model checking for TSO and PSO
- Checking robustness between weak transactional consistency models
- Robustness against consistency models with atomic visibility
- Title not available (Why is that?)
- Proving the safety of highly-available distributed objects
This page was built for publication: Optimal stateless model checking for causal consistency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535346)
