TY  - CONF
TI  - Causal-Consistent Reversibility in a Tuple-Based Language
ID  - eprints2664
M2  - Turku, Finland
AV  - public
KW  - Reversebility; cloning; operational semantics; tuple spaces.
N2  - 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.
UR  - http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7092671
PB  - IEEE
EP  - 475
SN  - 978-1-4799-8491-6
A1  - Giachino, Elena
A1  - Lanese, Ivan
A1  - Mezzina, Claudio Antares
A1  - Tiezzi, Francesco
T2  - 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2015, Turku, Finland, March 4-6, 2015
SP  - 467
Y1  - 2015///
ER  -