Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Automated Technology for Verification and Analysis (ATVA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9364))

  • 909 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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. 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. 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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  7. Mukund, M., Kumar, K.N., Sohoni, M.A.: Bounded time-stamping in message-passing systems. Theor. Comput. Sci. 290(1), 221–239 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. Mukund, M., Sohoni, M.A.: Keeping track of the latest gossip in a distributed system. Distributed Comput. 10(3), 137–148 (1997)

    Article  Google Scholar 

  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. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chennai Mathematical Institute, Chennai, India

    Madhavan Mukund, Gautham Shenoy R. & S. P. Suresh

Authors
  1. Madhavan Mukund
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gautham Shenoy R.
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. P. Suresh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Madhavan Mukund .

Editor information

Editors and Affiliations

  1. Universität des Saarlandes, Saarbrücken, Germany

    Bernd Finkbeiner

  2. East China Normal University, Shanghai, China

    Geguang Pu

  3. Chinese Academy of Sciences, Beijing, China

    Lijun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Mukund, M., Shenoy R., G., Suresh, S.P. (2015). Effective Verification of Replicated Data Types Using Later Appearance Records (LAR). In: Finkbeiner, B., Pu, G., Zhang, L. (eds) Automated Technology for Verification and Analysis. ATVA 2015. Lecture Notes in Computer Science(), vol 9364. Springer, Cham. https://doi.org/10.1007/978-3-319-24953-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24953-7_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24952-0

  • Online ISBN: 978-3-319-24953-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation