%0 Conference Proceedings
%T EPTL - A Temporal Logic for Weakly Consistent Systems (Short Paper)
%+ University of Kaiserslautern [Kaiserslautern]
%A Weber, Mathias
%A Bieniusa, Annette
%A Poetzsch-Heffter, Arnd
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 37th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
%C Neuchâtel, Switzerland
%Y Ahmed Bouajjani
%Y Alexandra Silva
%I Springer International Publishing
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-10321
%P 236-242
%8 2017-06-19
%D 2017
%R 10.1007/978-3-319-60225-7_17
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01658414/document
%2 https://inria.hal.science/hal-01658414/file/446833_1_En_17_Chapter.pdf
%L hal-01658414
%U https://inria.hal.science/hal-01658414
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-10321