On the complexity of checking consistency for replicated data types

DOI10.1007/978-3-030-25543-5_19OpenAlexW2959051731MaRDI QIDQ6154887FDOQ6154887

Authors Ranadeep Biswas, Michael Emmi, Constantin Enea

Publication date 16 February 2024

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-25543-5_19

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Effective verification of replicated data types using later appearance records (LAR)
• Convergent and commutative replicated data types
• Automated parameterized verification of CRDTs
• Replicated data types, specification, verification, optimality
• Eventual consistency for CRDTs

Cited in

(1)

• Automated parameterized verification of CRDTs

This page was built for publication: On the complexity of checking consistency for replicated data types

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