EPTL - a temporal logic for weakly consistent systems (short paper)

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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 semiautomatic proving capabilities.

Cite

CITATION STYLE

APA

Weber, M., Bieniusa, A., & Poetzsch-Heffter, A. (2017). EPTL - a temporal logic for weakly consistent systems (short paper). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10321 LNCS, pp. 236–242). Springer Verlag. https://doi.org/10.1007/978-3-319-60225-7_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free