EPTL - A Temporal Logic for Weakly Consistent Systems (Short Paper)
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.
- 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
- 5.Havelund, K., Rosu, G.: Testing linear temporal logic formulae on finite execution traces. Technical report, RIACS (2001)Google Scholar
- 7.Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. Ser. 6(78), 1–51 (1977)Google Scholar
- 8.Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, pp. 46–57 (1977)Google Scholar
- 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