C. H. Bennett, Notes on the history of reversible computation, IBM Journal of Research and Development, vol.32, issue.1, pp.16-23, 1988.
DOI : 10.1147/rd.321.0016

R. Landauer, Irreversibility and Heat Generation in the Computing Process, IBM Journal of Research and Development, vol.5, issue.3, pp.183-191, 1961.
DOI : 10.1147/rd.53.0183

M. P. Frank, Introduction to reversible computing, Proceedings of the 2nd conference on Computing frontiers , CF '05, pp.385-390, 2005.
DOI : 10.1145/1062261.1062324

L. Cardelli and C. Laneve, Reversible structures, Proceedings of the 9th International Conference on Computational Methods in Systems Biology, CMSB '11, pp.131-140, 2011.
DOI : 10.1145/2037509.2037529

T. Akgul, V. J. Mooney, and I. , Assembly instruction level reverse execution for debugging, ACM Transactions on Software Engineering and Methodology, vol.13, issue.2, pp.149-198, 2004.
DOI : 10.1145/1018210.1018211

T. Altenkirch and J. Grattage, A Functional Quantum Programming Language, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.249-258, 2005.
DOI : 10.1109/LICS.2005.1

P. Bishop, Using reversible computing to achieve fail-safety, Proceedings The Eighth International Symposium on Software Reliability Engineering, pp.182-191, 1997.
DOI : 10.1109/ISSRE.1997.630863

A. Avizienis, J. Laprie, B. Randell, and C. E. Landwehr, Basic concepts and taxonomy of dependable and secure computing, IEEE Transactions on Dependable and Secure Computing, vol.1, issue.1, pp.11-33, 2004.
DOI : 10.1109/TDSC.2004.2

B. Jacobs and F. Piessens, Failboxes: Provably Safe Exception Handling, pp.470-494, 2009.
DOI : 10.1007/978-3-540-24851-4_24

E. N. Elnozahy, L. Alvisi, Y. Wang, and D. B. Johnson, A survey of rollback-recovery protocols in message-passing systems, ACM Computing Surveys, vol.34, issue.3, pp.375-408, 2002.
DOI : 10.1145/568522.568525

G. Weikum and G. Vossen, Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery, 2002.

V. Danos and J. Krivine, Reversible Communicating Systems, in: CONCUR LNCS, vol.6, issue.4, pp.292-307, 2004.
DOI : 10.1007/BFb0012800
URL : https://hal.archives-ouvertes.fr/hal-00784051

I. C. Phillips and I. Ulidowski, Reversing algebraic process calculi, The Journal of Logic and Algebraic Programming, vol.73, issue.1-2, pp.70-96, 2007.
DOI : 10.1016/j.jlap.2006.11.002

R. Milner, Communicating and mobile systems -the ?-calculus, 1999.

I. Lanese, C. A. Mezzina, and J. Stefani, Reversing Higher-Order Pi, LNCS, vol.6269, pp.478-493, 2010.
DOI : 10.1007/978-3-642-15375-4_33

D. Sangiorgi, Bisimulation for Higher-Order Process Calculi, Information and Computation, vol.131, issue.2, pp.141-178, 1996.
DOI : 10.1006/inco.1996.0096
URL : https://hal.archives-ouvertes.fr/inria-00074170

I. Lanese, C. A. Mezzina, A. Schmitt, and J. Stefani, Controlling Reversibility in Higher-Order Pi, LNCS, vol.6901, pp.297-311, 2011.
DOI : 10.1007/11539452_31

I. Lanese, M. Lienhardt, C. A. Mezzina, A. Schmitt, and J. Stefani, Concurrent Flexible Reversibility, 22nd European Symposium on Programming (ESOP), pp.370-390, 2013.
DOI : 10.1007/978-3-642-37036-6_21
URL : https://hal.archives-ouvertes.fr/hal-00811629

I. Cristescu, J. Krivine, and D. Varacca, A Compositional Semantics for the Reversible p-Calculus, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.388-397, 2013.
DOI : 10.1109/LICS.2013.45

M. Boreale and D. Sangiorgi, A fully abstract semantics for causality in the ??-calculus, Acta Informatica, vol.35, issue.5, pp.353-400, 1998.
DOI : 10.1007/3-540-59042-0_77

M. Lienhardt, I. Lanese, C. A. Mezzina, and J. Stefani, A Reversible Abstract Machine and Its Space Overhead, pp.1-17, 2012.
DOI : 10.1007/978-3-642-30793-5_1
URL : https://hal.archives-ouvertes.fr/hal-00909384

D. Sangiorgi, Expressing mobility in process algebras: First-order and higher-order paradigms, 1992.

R. De-nicola, U. Montanari, and F. W. Vaandrager, Back and forth bisimulations, LNCS, vol.458, pp.152-165, 1990.
DOI : 10.1007/BFb0039058

I. Hasuo, Generic Forward and Backward Simulations, CONCUR LNCS, vol.4137, pp.406-420, 2006.
DOI : 10.1007/11817949_27

I. C. Phillips and I. Ulidowski, A Logic with Reverse Modalities for History-preserving Bisimulations, Electronic Proceedings in Theoretical Computer Science, vol.64, pp.104-118, 2011.
DOI : 10.4204/EPTCS.64.8

J. Lévy, An algebraic interpretation of the ????K-calculus; and an application of a labelled ??-calculus, Theoretical Computer Science, vol.2, issue.1, pp.97-114, 1976.
DOI : 10.1016/0304-3975(76)90009-8

G. L. Cattani and P. Sewell, Models for name-passing processes: interleaving and causal, Inf. Comput, vol.190, issue.2
DOI : 10.1016/j.ic.2003.12.003
URL : http://doi.org/10.1016/j.ic.2003.12.003

S. Crafa, D. Varacca, and N. Yoshida, Compositional event structure semantics for the internal pi-calculus, LNCS, vol.4703, pp.317-332, 2007.

D. Varacca and N. Yoshida, Typed event structures and the linear <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-calculus, Theoretical Computer Science, vol.411, issue.19, pp.1949-1973, 2010.
DOI : 10.1016/j.tcs.2010.01.024

C. Fournet and G. Gonthier, The reflexive chemical abstract machine and the join-calculus, pp.372-385, 1996.

C. Fournet and G. Gonthier, The Join Calculus: A Language for Distributed Mobile Programming, LNCS, vol.2395, pp.268-332, 2000.
DOI : 10.1007/3-540-45699-6_6

R. Milner, Functions as processes, Mathematical Structures in Computer Science, vol.4, issue.02, pp.119-141, 1992.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075405

D. Sangiorgi, From ?? to ??; or, Rediscovering continuations, Mathematical Structures in Computer Science, vol.9, issue.4, pp.367-401, 1999.
DOI : 10.1017/S0960129599002881

H. P. Barendregt, The Lambda Calculus ? Its Syntax and Semantics, revised Edition, 1984.

A. Schmitt and J. Stefani, The M-calculus: a higher-order distributed process calculus, pp.50-61, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00072227

S. Lenglet, A. Schmitt, and J. Stefani, Normal Bisimulations in Calculi with Passivation, FOSSACS LNCS, vol.5504, pp.257-271, 2009.
DOI : 10.1007/978-3-540-31794-4_9
URL : https://hal.archives-ouvertes.fr/inria-00330565

S. M. Abramov and R. Glück, Principles of Inverse Computation and the Universal Resolving Algorithm, Lecture Notes in Computer Science, vol.2566, 2002.
DOI : 10.1007/3-540-36377-7_13

K. Czarnecki, J. N. Foster, Z. Hu, R. Lämmel, A. Schürr et al., Bidirectional transformations: A cross-discipline perspective, in: 2nd Int, Conference on Theory and Practice of Model Transformations (ICMT) Lecture Notes in Computer Science, vol.5563, 2009.

J. N. Foster, M. B. Greenwald, J. T. Moore, B. C. Pierce, and A. Schmitt, Combinators for bidirectional tree transformations, ACM Transactions on Programming Languages and Systems, vol.29, issue.3
DOI : 10.1145/1232420.1232424
URL : https://hal.archives-ouvertes.fr/inria-00484971

Y. Lecerf, Machines de turing réversibles Insolubilité récursive en n ? n de l'´ equation n = ? n , o` u ? est un " isomorphisme de codes, Comptes- Rendus Académie des Sciences, vol.257, pp.2597-2600, 1963.

C. H. Bennett, Logical Reversibility of Computation, IBM Journal of Research and Development, vol.17, issue.6, pp.525-532, 1973.
DOI : 10.1147/rd.176.0525

K. Morita, Reversible computing and cellular automata???A survey, Theoretical Computer Science, vol.395, issue.1, pp.101-131, 2008.
DOI : 10.1016/j.tcs.2008.01.041

M. Zelkowitz, Reversible execution, Communications of the ACM, vol.16, issue.9
DOI : 10.1145/362342.362360

G. B. Leeman-jr, A formal approach to undo operations in programming languages, ACM Transactions on Programming Languages and Systems, vol.8, issue.1, pp.50-87, 1986.
DOI : 10.1145/5001.5005

S. Abramsky, A structural approach to reversible computation, Theoretical Computer Science, vol.347, issue.3, pp.441-464, 2005.
DOI : 10.1016/j.tcs.2005.07.002

V. Danos and L. Regnier, Reversible, irreversible and optimal ??-machines, Theoretical Computer Science, vol.227, issue.1-2, pp.79-97, 1999.
DOI : 10.1016/S0304-3975(99)00049-3

W. E. Kluge, A Reversible SE(M)CD Machine, 11th International Workshop on Implementation of Functional Languages (IFL), no. 1868 in Lecture Notes in Computer Science, 1999.
DOI : 10.1007/10722298_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.8496

B. Stoddart, R. Lynas, and F. Zeyda, A Virtual Machine for Supporting Reversible Probabilistic Guarded Command Languages, Electronic Notes in Theoretical Computer Science, vol.253, issue.6
DOI : 10.1016/j.entcs.2010.02.005

T. Yokoyama and R. Glück, A reversible programming language and its invertible self-interpreter, Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation , PEPM '07, pp.144-153, 2007.
DOI : 10.1145/1244381.1244404

T. Yokoyama, H. B. Axelsen, and R. Glück, Principles of a reversible programming language, Proceedings of the 2008 conference on Computing frontiers , CF '08, pp.43-54, 2008.
DOI : 10.1145/1366230.1366239

T. Yokoyama, H. B. Axelsen, and R. Glück, Reversible Flowchart Languages and the Structured Reversible Program Theorem, LNCS, vol.5126, pp.258-270, 2008.
DOI : 10.1007/978-3-540-70583-3_22

S. Mu, Z. Hu, and M. Takeichi, An Injective Language for Reversible Computation, 7th International Conference Mathematics of Program Construction (MPC), no. 3125 in Lecture Notes in Computer Science, pp.289-313, 2004.
DOI : 10.1007/978-3-540-27764-4_16

T. Yokoyama, H. B. Axelsen, and R. Glück, Towards a Reversible Functional Language, 3rd International Workshop on Reversible Computation (RC), 2011.
DOI : 10.1007/978-3-642-29517-1_2

R. P. James and A. Sabry, Information effects, 39th ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages (POPL), pp.73-84, 2012.

V. Danos and J. Krivine, Formal Molecular Biology Done in CCS-R, Electronic Notes in Theoretical Computer Science, vol.180, issue.3, pp.31-49, 2007.
DOI : 10.1016/j.entcs.2004.01.040

I. Phillips, I. Ulidowski, and S. Yuen, A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway, 4th International Workshop on Reversible Computation (RC), 2013.
DOI : 10.1007/978-3-642-36315-3_18

R. M. Balzer, EXDAMS, Proceedings of the May 14-16, 1969, spring joint computer conference on XX, AFIPS '69 (Spring), pp.567-580, 1969.
DOI : 10.1145/1476793.1476881

S. I. Feldman and C. B. Brown, Igor: A system for program debugging via reversible execution, Workshop on Parallel and Distributed Debugging, pp.112-123, 1988.

B. Boothe, Efficient algorithms for bidirectional debugging, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), ACM, pp.299-310, 2000.

E. Giachino, I. Lanese, and C. A. Mezzina, Causal-Consistent Reversible Debugging, 17th International Conference Fundamental Approaches to Software Engineering (FASE), pp.370-384, 2014.
DOI : 10.1007/978-3-642-54804-8_26
URL : https://hal.archives-ouvertes.fr/hal-01089270

C. D. Carothers, K. S. Perumalla, and R. Fujimoto, Efficient optimistic parallel simulations using reverse computation, ACM Transactions on Modeling and Computer Simulation, vol.9, issue.3, pp.224-253, 1999.
DOI : 10.1145/347823.347828

T. Leblanc and J. Mellor-crummey, Debugging Parallel Programs with Instant Replay, IEEE Transactions on Computers, vol.36, issue.4
DOI : 10.1109/TC.1987.1676929

J. J. Cook, Reverse Execution of Java Bytecode, The Computer Journal, vol.45, issue.6
DOI : 10.1093/comjnl/45.6.608

H. Buhrman, J. Tromp, and P. M. Vitányi, Time and space bounds for reversible simulation, 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001.

P. M. Vitányi, Time, space, and energy in reversible computing, Proceedings of the 2nd conference on Computing frontiers , CF '05, 2005.
DOI : 10.1145/1062261.1062335

N. Klarlund and F. Schneider, Proving Nondeterministically Specified Safety Properties Using Progress Measures, Information and Computation, vol.107, issue.1, pp.151-170, 1993.
DOI : 10.1006/inco.1993.1064
URL : http://doi.org/10.1006/inco.1993.1064

N. A. Lynch and F. W. Vaandrager, Forward and backward simulations: I. untimed systems, Inf. Comput, vol.121, issue.2

N. A. Lynch and F. W. Vaandrager, Forward and backward simulations, ii: Timing-based systems, Inf. Comput, vol.128, issue.1

I. Phillips and I. Ulidowski, Reversibility and asymmetric conflict in event structures, 24th International Conference on Concurrency Theory (CONCUR), 2013.

I. C. Phillips and I. Ulidowski, Reverse Bisimulations on Stable Configuration Structures, Proceedings 6th Workshop on Structural Operational Semantics (SOS), 2009.
DOI : 10.4204/EPTCS.18.5

P. Degano and C. Priami, Non-interleaving semantics for mobile processes, Theoretical Computer Science, vol.216, issue.1-2, pp.237-270, 1999.
DOI : 10.1016/S0304-3975(99)80003-6

S. Crafa, D. Varacca, and N. Yoshida, Event Structure Semantics of Parallel Extrusion in the Pi-Calculus, 15th International Conference Foundations of Software Science and Computational Structures (FOSSACS), pp.2012-225
DOI : 10.1007/978-3-642-28729-9_15
URL : https://hal.archives-ouvertes.fr/hal-00687502