Optimal stateless model checking for causal consistency
From MaRDI portal
Publication:6535346
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 4030996 (Why is no real title available?)
- scientific article; zbMATH DE number 7327945 (Why is no real title available?)
- Causal memory: definitions, implementation, and programming
- Checking robustness between weak transactional consistency models
- Computer aided verification. 33rd international conference, CAV 2021, virtual event, July 20--23, 2021. Proceedings. Part I
- From causal consistency to sequential consistency in shared memory systems
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Mathematizing C++ concurrency
- On verifying causal consistency
- Optimal dynamic partial order reduction
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Proving the safety of highly-available distributed objects
- Robustness against consistency models with atomic visibility
- State space reduction using partial order techniques
- Stateless model checking for TSO and PSO
- Stateless model checking under a reads-value-from equivalence
- Time, clocks, and the ordering of events in a distributed system
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)
