Giachino, Elena and Lanese, Ivan and Mezzina, Claudio Antares and Tiezzi, Francesco Causal-Consistent Reversibility in a Tuple-Based Language. In: 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2015, Turku, Finland, March 4-6, 2015, 4-6 March, 2015, Turku, Finland pp. 467-475. ISBN 978-1-4799-8491-6. (2015)
|
PDF
- Accepted Version
Download (418kB) | Preview |
Abstract
Causal-consistent reversibility is a natural way of undoing concurrent computations. We study causal-consistent reversibility in the context of µKlaim, a formal coordination language based on distributed tuple spaces. We consider both uncontrolled reversibility, suitable to study the basic properties of the reversibility mechanism, and controlled reversibility based on a rollback operator, more suitable for programming applications. The causality structure of the language, and thus the definition of its reversible semantics, differs from all the reversible languages in the literature because of its generative communication paradigm. In particular, the reversible behavior of µKlaim read primitive, reading a tuple without consuming it, cannot be matched using channel-based communication. We illustrate the reversible extensions of µKlaim on a simple, but realistic, application scenario.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Identification Number: | https://doi.org/10.1109/PDP.2015.98 |
| Uncontrolled Keywords: | Reversebility; cloning; operational semantics; tuple spaces. |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science T Technology > T Technology (General) |
| Research Area: | Computer Science and Applications |
| Depositing User: | Claudio Antares Mezzina |
| Date Deposited: | 04 May 2015 15:19 |
| Last Modified: | 04 May 2015 15:36 |
| URI: | http://eprints.imtlucca.it/id/eprint/2664 |
Actions (login required)
 |
Edit Item |
