T. Akgul & V. J. Mooney III (2004):
Assembly instruction level reverse execution for debugging.
ACM Trans. Softw. Eng. Methodol. 13(2),
pp. 149–198,
doi:10.1145/1018210.1018211.
T. Altenkirch & J. Grattage (2005):
A Functional Quantum Programming Language.
In: LICS.
IEEE Computer Society,
pp. 249–258,
doi:10.1109/LICS.2005.1.
A. Avizienis, J.-C. Laprie, B. Randell & C. E. Landwehr (2004):
Basic Concepts and Taxonomy of Dependable and Secure Computing.
IEEE Trans. Dependable Sec. Comput. 1(1),
pp. 11–33,
doi:10.1109/TDSC.2004.2.
J. Barnard, J. Whitworth & M. Woodward (1996):
Communicating X-machines.
Information and Software Technology 38(6),
pp. 401–407,
doi:10.1016/0950-5849(95)01066-1.
A. Bernadet & I. Lanese:
A Modular Formalization of Reversibility for Concurrent Models and Languages (TR).
http://www.cs.unibo.it/~lanese/work/ice2016-TR.pdf.
G. Boudol & I. Castellani (1988):
Permutation of transitions: An event structure semantics for CCS and SCCS.
In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency,
LNCS 354.
Springer,
pp. 411–427,
doi:10.1007/BFb0013028.
L. Cardelli & C. Laneve (2011):
Reversible structures.
In: CMSB.
ACM,
pp. 131–140,
doi:10.1145/2037509.2037529.
I. D. Cristescu, J. Krivine & D. Varacca (2013):
A Compositional Semantics for the Reversible Pi-calculus.
In: LICS.
IEEE Press,
pp. 388–397,
doi:10.1109/LICS.2013.45.
V. Danos & J. Krivine (2004):
Reversible Communicating Systems.
In: CONCUR,
LNCS 3170.
Springer,
pp. 292–307,
doi:10.1007/978-3-540-28644-8_19.
V. Danos, J. Krivine & P. Sobocinski (2006):
General Reversibility.
In: EXPRESS,
ENTCS 175(3),
pp. 75–86,
doi:10.1016/j.entcs.2006.07.036.
S. Eilenberg & B. Tilson (1976):
Automata, languages and machines. Volume B.
Pure and applied mathematics.
Academic Press.
E. Giachino, I. Lanese, C. A. Mezzina & F. Tiezzi (2015):
Causal-Consistent Reversibility in a Tuple-Based Language.
In: PDP.
IEEE Computer Society Press,
pp. 467–475,
doi:10.1109/PDP.2015.98.
R. Landauer (1961):
Irreversibility and heat generation in the computing process.
IBM Journal of Research and Development 5,
pp. 183–191,
doi:10.1147/rd.53.0183.
I. Lanese, C. A. Mezzina & J.-B. Stefani (2010):
Reversing Higher-Order Pi.
In: CONCUR,
LNCS 6269.
Springer,
pp. 478–493,
doi:10.1007/978-3-642-15375-4_33.
I. Lanese, C. A. Mezzina & J.-B. Stefani (2016):
Reversibility in the higher-order π-calculus.
Theor. Comput. Sci. 625,
pp. 25–84,
doi:10.1016/j.tcs.2016.02.019.
M. Lienhardt, I. Lanese, C. A. Mezzina & J.-B. Stefani (2012):
A Reversible Abstract Machine and Its Space Overhead.
In: FMOODS/FORTE,
LNCS 7273.
Springer,
pp. 1–17,
doi:10.1007/978-3-642-30793-5.
A. W. Mazurkiewicz (1988):
Basic notions of trace theory.
In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency,
LNCS 354.
Springer,
pp. 285–363,
doi:10.1007/BFb0013025.
R. Milner (1989):
Communication and concurrency..
Prentice-Hall.
I. Phillips & I. Ulidowski (2007):
Reversing Algebraic Process Calculi.
J. Log. Algebr. Program. 73(1-2),
pp. 70–96,
doi:10.1016/j.jlap.2006.11.002.
I. Phillips, I. Ulidowski & S. Yuen (2012):
A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway.
In: RC,
LNCS 7581.
Springer,
pp. 218–232,
doi:10.1007/978-3-642-36315-3_18.
T. Yokoyama & R. Glück (2007):
A Reversible Programming Language and Its Invertible Self-interpreter.
In: PEPM.
ACM Press,
pp. 144–153,
doi:10.1145/1244381.1244404.
eptcs@eptcs.org