Concurrent Flexible Reversibility

被引：0

作者：

Lanese, Ivan ^{[1
]}

Lienhardt, Michael ^{[2
]}

Mezzina, Claudio Antares ^{[3
]}

Schmitt, Alan ^{[4
]}

Stefani, Jean-Bernard ^{[4
]}

机构：

[1] Univ Bologna, Inria, Focus Team, I-40126 Bologna, Italy

[2] Paris Diderot Univ, PPS Lab, Paris, France

[3] FBK, SOA Unit, Trento, Italy

[4] Inria, Rocquencourt, France

来源：

PROGRAMMING LANGUAGES AND SYSTEMS | 2013年 / 7792卷

关键词：

TRANSACTIONS;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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-pi, a concurrent calculus featuring flexible reversibility, allowing the specification of alternatives to a computation to be used upon rollback. Alternatives in croll-pi 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.

引用

页码：370 / 390

页数：21

共 26 条

[1]

Abadi M, 2009, LECT NOTES COMPUT SC, V5710, P1, DOI 10.1007/978-3-642-04081-8_1

[2]

Bacci Giorgio, 2011, Algebra and Coalgebra in Computer Science. Proceedings 4th International Conference, CALCO 2011, P1, DOI 10.1007/978-3-642-22944-2_1

[3]

Ball W.W. Rouse., 1947, Mathematical Recreations and Essays

[4] MINIMAL AND OPTIMAL COMPUTATIONS OF RECURSIVE PROGRAMS [J].

BERRY, G ;

LEVY, JJ .

JOURNAL OF THE ACM, 1979, 26 (01) :148-175

[5]

Bruni R., 2000, INFORM COMPUTATION, V156

[6]

Bruni R., 2005, POPL 2005

[7]

Butler M, 2005, LECT NOTES COMPUT SC, V3525, P133

[8]

Cardelli L., 2011, CMSB 2011

[9]

Chothia T, 2004, THEOR COMPUT SCI, V322, P567, DOI [10.1016/j.tcs.2003.09.014, 10.1016/j.acs.2003.09.014]

[10]

Clavel M., 2002, THEOR COMP SCI, V285

← 1 2 3 →