Advertisement

Effective Verification of Replicated Data Types Using Later Appearance Records (LAR)

  • Madhavan MukundEmail author
  • Gautham Shenoy R.
  • S. P. Suresh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9364)

Abstract

Replicated data types store copies of identical data across multiple servers in a distributed system. For the replicas to satisfy strong eventual consistency, these data types should be designed to guarantee conflict free convergence of all copies in the presence of concurrent updates. This requires maintaining history related metadata that, in principle, is unbounded.

While earlier work such as [2] and [9] has concentrated on declarative frameworks for formally specifying Conflict-free Replicated Data Types (CRDTs) and conditions that guarantee the existence of finite-state (distributed) reference implementations, there has not been a systematic attempt so far to use the declarative specifications for effective verification of CRDTs.

In this work, we propose a simple global reference implementation for CRDTs specified declaratively, and simple conditions under which this is guaranteed to be finite. Our implementation uses the technique of Later Appearance Record (LAR). We also outline a methodology for effective verification of CRDT implementations using CEGAR.

Keywords

Network Node Message Delivery Reference Implementation Relevant Node Maximum Arity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Bieniusa, A., Zawirski, M., Preguiça, N.M., Shapiro, M., Baquero, C., Balegas, V., Duarte, S.: An optimized conflict-free replicated set. CoRR, abs/1210.3368 (2012)Google Scholar
  2. 2.
    Burkhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, 20–21 January, 2014, San Diego, CA, USA, pp. 271–284 (2014)Google Scholar
  3. 3.
    Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752–794 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Gilbert, S., Lynch, N.A.: Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2), 51–59 (2002)CrossRefGoogle Scholar
  5. 5.
    Gurevich, Y., Harrington, L.: Trees, automata, and games. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, STOC 1982, pp. 60–65. ACM, New York (1982)Google Scholar
  6. 6.
    Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Advances in Petri Nets 1986. LNCS, vol. 255, pp. 278–324. Springer, Heidelberg (1987) CrossRefGoogle Scholar
  7. 7.
    Mukund, M., Kumar, K.N., Sohoni, M.A.: Bounded time-stamping in message-passing systems. Theor. Comput. Sci. 290(1), 221–239 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Mukund, M., Shenoy R., G., Suresh, S.P.: Optimized OR-sets without ordering constraints. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 227–241. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  9. 9.
    Mukund, M., Shenoy R., G., Suresh, S.P.: Bounded implementations of replicated data types. In: D’Souza, D., Lal, A., Larsen, K.G. (eds.) VMCAI 2015. LNCS, vol. 8931, pp. 355–372. Springer, Heidelberg (2015) Google Scholar
  10. 10.
    Mukund, M., Sohoni, M.A.: Keeping track of the latest gossip in a distributed system. Distributed Comput. 10(3), 137–148 (1997)CrossRefGoogle Scholar
  11. 11.
    Shapiro, M., Preguiça, N., Baquero, C., Zawirski, M.: A comprehensive study of Convergent and Commutative Replicated Data Types. Rapport de recherche RR-7506, INRIA (2011). http://hal.inria.fr/inria-00555588/PDF/techreport.pdf
  12. 12.
    Shapiro, M., Preguiça, N., Baquero, C., Zawirski, M.: Conflict-free replicated data types. In: Défago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 386–400. Springer, Heidelberg (2011) CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Madhavan Mukund
    • 1
    Email author
  • Gautham Shenoy R.
    • 1
  • S. P. Suresh
    • 1
  1. 1.Chennai Mathematical InstituteChennaiIndia

Personalised recommendations