Concurrent flexible reversibility

Authors:
Ivan Lanese;Michael Lienhardt;Claudio Antares Mezzina;Alan Schmitt;Jean-Bernard Stefani
Affiliations:
Focus Team, University of Bologna/Inria, Italy;PPS Laboratory, Paris Diderot University, France;SOA Unit, FBK, Trento, Italy;Inria, France;Inria, France
Venue:
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Year:
2013

Citing 20
Cited 0

A formal approach to undo operations in programming languages

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Minimal and Optimal Computations of Recursive Programs

Journal of the ACM (JACM)
Zero-safe nets: comparing the collective and individual token approaches

Information and Computation - Special issue on EXPRESS 1997
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical foundations for compensations in flow composition languages

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstractions for fault-tolerant global computing

Theoretical Computer Science - Special issue: Foundations of wide area network computing
Transactions in RCCS

CONCUR 2005 - Concurrency Theory
High-level small-step operational semantics for transactions

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transactional events1

Journal of Functional Programming
Perspectives on Transactional Memory

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Lightweight checkpointing for concurrent ml

Journal of Functional Programming
Reversing higher-order pi

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Communicating transactions

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Reversible structures

Proceedings of the 9th International Conference on Computational Methods in Systems Biology
On the statistical thermodynamics of reversible communicating processes

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Controlling reversibility in higher-order Pi

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
A trace semantics for long-running transactions

CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
A reversible abstract machine and its space overhead

FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Concurrent reversibility has been studied in different areas, such as biological or dependable distributed systems. However, only "rigid" reversibility has been considered, allowing to go back to a past state and restart the exact same computation, possibly leading to divergence. In this paper, we present croll-π, a concurrent calculus featuring flexible reversibility, allowing the specification of alternatives to a computation to be used upon rollback. Alternatives in croll-π are attached to messages. We show the robustness of this mechanism by encoding more complex idioms for specifying flexible reversibility, and we illustrate the benefits of our approach by encoding a calculus of communicating transactions.