Verifying eventual consistency of optimistic replication systems

DOI10.1145/2535838.2535877MaRDI QIDQ5408425zbMATH OpenOpenAlexFDO

Authors Ahmed Bouajjani, Constantin Enea, Jad Hamza

Publication date 10 April 2014

Published in Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2535838.2535877

zbMATH Keywords

message passing concurrencymodel checkingstatic program analysis

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms
• Consistency verification in transaction-based optimistic steering of distributed computations
• Principles of Distributed Systems
• Efficiently and completely verifying synchronized consistency models
• An Optimistic Concurrency Control Protocol for Replicated Databases
• On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency

Cited in

(8)

• Categorical specification and implementation of replicated data types
• Checking causal consistency of distributed databases
• Consistency verification in transaction-based optimistic steering of distributed computations
• From sequential specifications to eventual consistency
• On speculative replication of transactional systems
• scientific article; zbMATH DE number 1950693 (Why is no real title available?)
• Replicated data types, specification, verification, optimality
• Monotonic Prefix Consistency in Distributed Systems

This page was built for publication: Verifying eventual consistency of optimistic replication systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408425)