Mezzina, Claudio Antares and Pérez, Jorge A. Reversibility in session-based concurrency: A fresh look. Journal of Logical and Algebraic Methods in Programming, 90. pp. 2-30. ISSN 2352-2208 (2017)
|
PDF
- Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (683kB) | Preview |
Abstract
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
| Item Type: | Article |
|---|---|
| Identification Number: | https://doi.org/10.1016/j.jlamp.2017.03.003 |
| Uncontrolled Keywords: | ConcurrencyReversible computationBehavioral typesProcess calculi |
| Subjects: | Q Science > QA Mathematics > QA76 Computer software |
| Research Area: | Computer Science and Applications |
| Depositing User: | Claudio Antares Mezzina |
| Date Deposited: | 20 Jul 2017 10:37 |
| Last Modified: | 20 Jul 2017 10:37 |
| URI: | http://eprints.imtlucca.it/id/eprint/3724 |
Actions (login required)
 |
Edit Item |
