On verifying causal consistency

DOI10.1145/3009837.3009888zbMath1380.68270arXiv1611.00580OpenAlexW2546854465WikidataQ130960666 ScholiaQ130960666MaRDI QIDQ5370895

Ahmed Bouajjani, Constantin Enea, Jad Hamza, Rachid Guerraoui

Publication date: 20 October 2017

Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.00580

zbMATH Keywords

distributed systemsmodel checkingstatic program analysiscausal consistency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Unnamed Item ⋮ Decidability and complexity for quiescent consistency and its variations ⋮ Checking causal consistency of distributed databases ⋮ Robustness Against Transactional Causal Consistency. ⋮ Checking robustness between weak transactional consistency models ⋮ Unnamed Item

This page was built for publication: On verifying causal consistency