Iain Phillips
Iain Phillips has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Irek Ulidowski
University of Leicester
23 shared publications - Ivan Lanese
University of Bologna & Inria - Université Côte d’Azur
6 shared publications - Nobuko Yoshida
University of Oxford
5 shared publications Maria Grazia Vigliotti
4 shared publications- Claudio Antares Mezzina
University of Bari Aldo Moro
3 shared publications Eva Graversen
3 shared publications
Latest Publications
- 22 June 2025
- Published by Springer Nature
- p. 9-26
Independence and Causality in the Reversible Concurrent Setting
- 22 June 2025
- Published by Springer Nature
- p. 9-26
Independence and Causality in the Reversible Concurrent Setting
- Open Access
- 16 April 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 25 (2) , 1-40
An Axiomatic Theory for Reversible Computation
Undoing computations of a concurrent system is beneficial in many situations, such as in reversible debugging of multi-threaded programs and in recovery from errors due to optimistic execution in parallel discrete event simulation. A number of approaches have been proposed for how to reverse formal models of concurrent computation, including process calculi such as CCS, languages like Erlang, and abstract models such as prime event structures and occurrence nets. However, it has not been settled as to what properties a reversible system should enjoy, nor how the various properties that have been suggested, such as the parabolic lemma and the causal-consistency property, are related. We contribute to a solution to these issues by using a generic labelled transition system equipped with a relation capturing whether transitions are independent to explore the implications between various reversibility properties. In particular, we show how all properties we consider are derivable from a set of axioms. Our intention is that when establishing properties of some formalism, it will be easier to verify the axioms rather than proving properties such as the parabolic lemma directly. We also introduce two new properties related to causal-consistent reversibility, namely causal liveness and causal safety, stating, respectively, that an action can be undone if (causal liveness) and only if (causal safety) it is independent from all of the following actions. These properties come in three flavours: defined in terms of independent transitions, independent events, or via an ordering on events. Both causal liveness and causal safety are derivable from our axioms.
- 16 April 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 25 (2) , 1-40
Open AccessAn Axiomatic Theory for Reversible Computation
Undoing computations of a concurrent system is beneficial in many situations, such as in reversible debugging of multi-threaded programs and in recovery from errors due to optimistic execution in parallel discrete event simulation. A number of approaches have been proposed for how to reverse formal models of concurrent computation, including process calculi such as CCS, languages like Erlang, and abstract models such as prime event structures and occurrence nets. However, it has not been settled as to what properties a reversible system should enjoy, nor how the various properties that have been suggested, such as the parabolic lemma and the causal-consistency property, are related. We contribute to a solution to these issues by using a generic labelled transition system equipped with a relation capturing whether transitions are independent to explore the implications between various reversibility properties. In particular, we show how all properties we consider are derivable from a set of axioms. Our intention is that when establishing properties of some formalism, it will be easier to verify the axioms rather than proving properties such as the parabolic lemma directly. We also introduce two new properties related to causal-consistent reversibility, namely causal liveness and causal safety, stating, respectively, that an action can be undone if (causal liveness) and only if (causal safety) it is independent from all of the following actions. These properties come in three flavours: defined in terms of independent transitions, independent events, or via an ordering on events. Both causal liveness and causal safety are derivable from our axioms.
- Open Access
An Axiomatic Theory for Reversible Computation
Undoing computations of a concurrent system is beneficial in many situations, e.g., in reversible debugging of multi-threaded programs and in recovery from errors due to optimistic execution in parallel discrete event simulation. A number of approaches have been proposed for how to reverse formal models of concurrent computation including process calculi such as CCS, languages like Erlang, and abstract models such as prime event structures and occurrence nets. However it has not been settled what properties a reversible system should enjoy, nor how the various properties that have been suggested, such as the parabolic lemma and the causal-consistency property, are related. We contribute to a solution to these issues by using a generic labelled transition system equipped with a relation capturing whether transitions are independent to explore the implications between various reversibility properties. In particular, we show how all properties we consider are derivable from a set of axioms. Our intention is that when establishing properties of some formalism it will be easier to verify the axioms rather than proving properties such as the parabolic lemma directly. We also introduce two new properties related to causal consistent reversibility, namely causal liveness and causal safety, stating, respectively, that an action can be undone if (causal liveness) and only if (causal safety) it is independent from all the following actions. These properties come in three flavours: defined in terms of independent transitions, independent events, or via an ordering on events. Both causal liveness and causal safety are derivable from our axioms.
Open AccessAn Axiomatic Theory for Reversible Computation
Undoing computations of a concurrent system is beneficial in many situations, e.g., in reversible debugging of multi-threaded programs and in recovery from errors due to optimistic execution in parallel discrete event simulation. A number of approaches have been proposed for how to reverse formal models of concurrent computation including process calculi such as CCS, languages like Erlang, and abstract models such as prime event structures and occurrence nets. However it has not been settled what properties a reversible system should enjoy, nor how the various properties that have been suggested, such as the parabolic lemma and the causal-consistency property, are related. We contribute to a solution to these issues by using a generic labelled transition system equipped with a relation capturing whether transitions are independent to explore the implications between various reversibility properties. In particular, we show how all properties we consider are derivable from a set of axioms. Our intention is that when establishing properties of some formalism it will be easier to verify the axioms rather than proving properties such as the parabolic lemma directly. We also introduce two new properties related to causal consistent reversibility, namely causal liveness and causal safety, stating, respectively, that an action can be undone if (causal liveness) and only if (causal safety) it is independent from all the following actions. These properties come in three flavours: defined in terms of independent transitions, independent events, or via an ordering on events. Both causal liveness and causal safety are derivable from our axioms.
- 12 July 2023
- Published by Springer Nature
- p. 24-39
Towards a Taxonomy for Reversible Computation Approaches
- 12 July 2023
- Published by Springer Nature
- p. 24-39
Towards a Taxonomy for Reversible Computation Approaches
- 1 January 2022
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 124
Event structures for the reversible early internal π-calculus
- 1 January 2022
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 124
Event structures for the reversible early internal π-calculus
- 23 June 2021
- Published by Springer Nature
- p. 126-143
Forward-Reverse Observational Equivalences in CCSK
- 23 June 2021
- Published by Springer Nature
- p. 126-143
Forward-Reverse Observational Equivalences in CCSK
- 1 June 2021
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 121
Event structure semantics of (controlled) reversible CCS
- 1 June 2021
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 121
Event structure semantics of (controlled) reversible CCS
- 9 July 2020
- Published by Springer Nature
- p. 71-90
Event Structures for the Reversible Early Internal $\pi $-Calculus- 9 July 2020
- Published by Springer Nature
- p. 71-90
Event Structures for the Reversible Early Internal $\pi $-Calculus- Open Access
- 12 May 2020
- Published by Springer Nature
- p. 1-40
Foundations of Reversible Computation
Reversible computation allows computation to proceed not only in the standard, forward direction, but also backward, recovering past states. While reversible computation has attracted interest for its multiple applications, covering areas as different as low-power computing, simulation, robotics and debugging, such applications need to be supported by a clear understanding of the foundations of reversible computation. We report below on many threads of research in the area of foundations of reversible computing, giving particular emphasis to the results obtained in the framework of the European COST Action IC1405, entitled “Reversible Computation - Extending Horizons of Computing”, which took place in the years 2015–2019.
- 12 May 2020
- Published by Springer Nature
- p. 1-40
Open AccessFoundations of Reversible Computation
Reversible computation allows computation to proceed not only in the standard, forward direction, but also backward, recovering past states. While reversible computation has attracted interest for its multiple applications, covering areas as different as low-power computing, simulation, robotics and debugging, such applications need to be supported by a clear understanding of the foundations of reversible computation. We report below on many threads of research in the area of foundations of reversible computing, giving particular emphasis to the results obtained in the framework of the European COST Action IC1405, entitled “Reversible Computation - Extending Horizons of Computing”, which took place in the years 2015–2019.