TY  - JOUR
EP  - 30
ID  - eprints3724
N2  - Much research has studied foundations for correct and reliable communication-centric software systems. A salient approach to correctness uses verification based on session types to enforce structured communications; a recent approach to reliability uses reversible actions as a way of reacting to unanticipated events or failures. In this paper, we develop a simple observation: the semantic machinery required to define asynchronous (queue-based), monitored communications can also support reversible protocols. We propose a framework of session communication in which monitors support reversibility of (untyped) processes. Main novelty in our approach are session types with present and past, which allow us to streamline the semantics of reversible actions. We prove that reversibility in our framework is causally consistent, and define ways of using monitors to control reversible actions.
Keywords
SP  - 2
TI  - Reversibility in session-based concurrency: A fresh look
AV  - public
SN  - 2352-2208
KW  - ConcurrencyReversible computationBehavioral typesProcess calculi
Y1  - 2017///
UR  - http://doi.org/10.1016/j.jlamp.2017.03.003
A1  - Mezzina, Claudio Antares
A1  - Pérez, Jorge A.
JF  - Journal of Logical and Algebraic Methods in Programming
PB  - Elsevier
VL  - 90
ER  -