%T Causal-Consistent Reversibility in a Tuple-Based Language
%R 10.1109/PDP.2015.98
%C Turku, Finland
%P 467-475
%B 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, {PDP} 2015
%L eprints2664
%X 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.
%K Reversebility; cloning; operational semantics; tuple spaces.
%I IEEE
%A Elena Giachino
%A Ivan Lanese
%A Claudio Antares Mezzina
%A Francesco Tiezzi
%D 2015