Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-37036-6_21 | ESOP |
Keywords | Field | DocType |
flexible reversibility,complex idiom,concurrent reversibility,present croll,concurrent calculus,concurrent flexible reversibility,past state,different area | Computer science,Transactional memory,Theoretical computer science,Robustness (computer science),Rollback,Encoding (memory),Computation | Conference |
Volume | ISSN | Citations |
7792 | 0302-9743 | 4 |
PageRank | References | Authors |
0.46 | 19 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ivan Lanese | 1 | 733 | 53.86 |
| Michael Lienhardt | 2 | 75 | 8.24 |
| Claudio Antares Mezzina | 3 | 145 | 16.93 |
| Alan Schmitt | 4 | 547 | 31.50 |
| Jean-Bernard Stefani | 5 | 1201 | 77.02 |