Advertisement

EPTL - A Temporal Logic for Weakly Consistent Systems (Short Paper)

  • Mathias Weber
  • Annette Bieniusa
  • Arnd Poetzsch-Heffter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10321)

Abstract

The high availability and scalability of weakly-consistent system attracts system designers. Yet, writing correct application code for this type of systems is difficult; even how to specify the intended behavior of such systems is still an open question. There has not been established any standard method to specify the intended dynamic behavior of a weakly consistent system.

In this paper, we present a event-based parallel temporal logic (EPTL), that is tailored to specify properties of weakly consistent systems. In contrast to LTL and CTL, EPTL takes into account that operations of weakly consistent systems are in many cases not serializable and have to be treated respectively to capture their behavior. We embed our temporal logic in Isabelle/HOL and can thereby leverage strong semi-automatic proving capabilities.

References

  1. 1.
    Alur, R., McMillan, K., Peled, D.: Deciding global partial-order properties. Formal Methods Syst. Des. 26(1), 7–25 (2005)CrossRefzbMATHGoogle Scholar
  2. 2.
    Burckhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, pp. 271–284. ACM, New York (2014)Google Scholar
  3. 3.
    Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982). doi: 10.1007/BFb0025774 CrossRefGoogle Scholar
  4. 4.
    Diekert, V., Gastin, P.: Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Inf. Comput. 204(11), 1597–1619 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Havelund, K., Rosu, G.: Testing linear temporal logic formulae on finite execution traces. Technical report, RIACS (2001)Google Scholar
  6. 6.
    Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)CrossRefzbMATHGoogle Scholar
  7. 7.
    Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. Ser. 6(78), 1–51 (1977)Google Scholar
  8. 8.
    Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, pp. 46–57 (1977)Google Scholar
  9. 9.
    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). doi: 10.1007/978-3-642-24550-3_29 CrossRefGoogle Scholar
  10. 10.
    Thiagarajan, P.S., Walukiewicz, I.: An expressively complete linear time temporal logic for Mazurkiewicz traces. Inf. Comput. 179(2), 230–249 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Weber, M., Bieniusa, A., Poetzsch-Heffter, A.: EPTL - a temporal logic for weakly consistent systems abs/1704.05320 (2017). https://arxiv.org/abs/1704.05320

Copyright information

© IFIP International Federation for Information Processing 2017

Authors and Affiliations

  • Mathias Weber
    • 1
  • Annette Bieniusa
    • 1
  • Arnd Poetzsch-Heffter
    • 1
  1. 1.University of KaiserslauternKaiserslauternGermany

Personalised recommendations