Optimal stateless model checking for causal consistency
DOI10.1007/978-3-031-30823-9_6zbMATH Open1543.68185MaRDI QIDQ6535346
Ashutosh Gupta, Parosh Aziz Abdulla, Mohamed Faouzi Atig, Omkar Tuppe, [[Person:6202206|Author name not available (Why is that?)]]
Publication date: 13 December 2023
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stateless model checking under a reads-value-from equivalence
- State space reduction using partial order techniques
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Computer aided verification. 33rd international conference, CAV 2021, virtual event, July 20--23, 2021. Proceedings. Part I
- Checking robustness between weak transactional consistency models
- From causal consistency to sequential consistency in shared memory systems
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Time, clocks, and the ordering of events in a distributed system
- Robustness against Consistency Models with Atomic Visibility
- Proving the Safety of Highly-Available Distributed Objects
- Causal memory: definitions, implementation, and programming
- Stateless Model Checking for TSO and PSO
- On verifying causal consistency
- Optimal dynamic partial order reduction
- Mathematizing C++ concurrency
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)
