A formal approach to undo operations in programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Notes on the history of reversible computation
IBM Journal of Research and Development
A survey of rollback-recovery protocols in message-passing systems
ACM Computing Surveys (CSUR)
Basic Concepts and Taxonomy of Dependable and Secure Computing
IEEE Transactions on Dependable and Secure Computing
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
CONCUR 2005 - Concurrency Theory
Lightweight checkpointing for concurrent ml
Journal of Functional Programming
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
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
Concurrent flexible reversibility
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Modelling of bonding with processes and events
RC'13 Proceedings of the 5th international conference on Reversible Computation
Reversibility and asymmetric conflict in event structures
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
We present in this paper a fine-grained rollback primitive for the higher-order π-calculus (HOπ), that builds on the reversibility apparatus of reversible HOπ [9]. The definition of a proper semantics for such a primitive is a surprisingly delicate matter because of the potential interferences between concurrent rollbacks. We define in this paper a high-level operational semantics which we prove sound and complete with respect to reversible HOπ backward reduction. We also define a lowerlevel distributed semantics, which is closer to an actual implementation of the rollback primitive, and we prove it to be fully abstract with respect to the high-level semantics.