i) P RM or (ii) P ?? P 1 and P 1 RM or (iii ,
A Concurrent Calculus with Atomic Transactions, ESOP'07, 2007. ,
DOI : 10.1007/978-3-540-71316-6_5
URL : https://hal.archives-ouvertes.fr/hal-00109264
On the Statistical Thermodynamics of Reversible Communicating Processes, CALCO 2011, 2011. ,
DOI : 10.1007/978-3-642-22944-2_1
Minimal and optimal computations of recursive programs, J. ACM, vol.26, issue.1, 1979. ,
Theoretical foundations for compensations in flow composition languages, POPL'05, 2005. ,
Zero-Safe Nets: Comparing the Collective and Individual Token Approaches, Information and Computation, vol.156, issue.1-2, 2000. ,
DOI : 10.1006/inco.1999.2819
A Trace Semantics for Long-Running Transactions, 25 Years CSP, number 3525, 2004. ,
DOI : 10.1007/11423348_8
Reversible structures, Proceedings of the 9th International Conference on Computational Methods in Systems Biology, CMSB '11, 2011. ,
DOI : 10.1145/2037509.2037529
Abstractions for fault-tolerant global computing, Theoretical Computer Science, vol.322, issue.3, 2004. ,
DOI : 10.1016/j.tcs.2003.09.014
Maude: specification and programming in rewriting logic, Theoretical Computer Science, vol.285, issue.2, 2002. ,
DOI : 10.1016/S0304-3975(01)00359-0
Reversible Communicating Systems, CONCUR'04, 2004. ,
DOI : 10.1007/BFb0012800
URL : https://hal.archives-ouvertes.fr/hal-00784051
Transactions in RCCS, CONCUR'05, 2005. ,
DOI : 10.1007/11539452_31
URL : https://hal.archives-ouvertes.fr/hal-00164585
Communicating Transactions, CONCUR 2010, 2010. ,
DOI : 10.1007/978-3-642-15375-4_39
Transactional events, Journal of Functional Programming, vol.18, pp.5-6, 2008. ,
DOI : 10.1145/1160074.1159821
Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments, POPL'05, 2005. ,
Composable memory transactions, Commun. ACM, issue.8, p.51, 2008. ,
DOI : 10.1145/1065944.1065952
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.415.7792
Concurrent flexible reversibility (TR), 2012. ,
DOI : 10.1007/978-3-642-37036-6_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.5393
Controlling Reversibility in Higher-Order Pi, CONCUR 2011, 2011. ,
DOI : 10.1007/11539452_31
Reversing Higher-Order Pi, CON- CUR 2010, 2010. ,
DOI : 10.1007/978-3-642-15375-4_33
A formal approach to undo operations in programming languages, ACM Transactions on Programming Languages and Systems, vol.8, issue.1, 1986. ,
DOI : 10.1145/5001.5005
A Reversible Abstract Machine and Its Space Overhead, FMOODS/FORTE 2012, 2012. ,
DOI : 10.1007/978-3-642-30793-5_1
URL : https://hal.archives-ouvertes.fr/hal-00909384
High-level small-step operational semantics for transactions, POPL'08, 2008. ,
Reversing algebraic process calculi, J. Log. Algebr. Program, vol.73, issue.12, 2007. ,
A Logic with Reverse Modalities for History-preserving Bisimulations, EXPRESS 2011, 2011. ,
DOI : 10.4204/EPTCS.64.8
A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway, Reversible Computation 2012, 2012. ,
DOI : 10.1007/978-3-642-36315-3_18
The ?-calculus: A Theory of Mobile Processes, 2001. ,
Lightweight checkpointing for concurrent ML, Journal of Functional Programming, vol.20, issue.02, p.2010 ,
DOI : 10.1145/190.357398