Iain C. C. Phillips

Orcid: 0000-0001-5013-5876

Affiliations:
  • Imperial College London, UK


According to our database1, Iain C. C. Phillips authored at least 49 papers between 1987 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Axiomatic Theory for Reversible Computation.
ACM Trans. Comput. Log., April, 2024

2023
Towards a Taxonomy for Reversible Computation Approaches.
Proceedings of the Reversible Computation - 15th International Conference, 2023

2022
Event structures for the reversible early internal <i>π</i>-calculus.
J. Log. Algebraic Methods Program., 2022

2021
Event structure semantics of (controlled) reversible CCS.
J. Log. Algebraic Methods Program., 2021

Forward-Reverse Observational Equivalences in CCSK.
Proceedings of the Reversible Computation - 13th International Conference, 2021

2020

A parametric framework for reversible <i>π</i>-calculi.
Inf. Comput., 2020

Event structures for the reversible early internal Pi-calculus.
CoRR, 2020

Reversible Occurrence Nets and Causal Reversible Prime Event Structures.
Proceedings of the Reversible Computation - 12th International Conference, 2020

Towards a Formal Account for Software Transactional Memory.
Proceedings of the Reversible Computation - 12th International Conference, 2020

Event Structures for the Reversible Early Internal π-Calculus.
Proceedings of the Reversible Computation - 12th International Conference, 2020

An Axiomatic Approach to Reversible Computation.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

2019
Reversible Causal Nets and Reversible Event Structures.
CoRR, 2019

2018
Reversing Event Structures.
New Gener. Comput., 2018

A Parametric Framework for Reversible Pi-Calculi.
Proceedings of the Proceedings Combined 25th International Workshop on Expressiveness in Concurrency and 15th Workshop on Structural Operational Semantics, 2018

A Parametric Framework for Reversible π-Calculi.
CoRR, 2018

2017
Towards a Categorical Representation of Reversible Event Structures.
Proceedings of the Proceedings Tenth Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, 2017

2015
Reversibility and asymmetric conflict in event structures.
J. Log. Algebraic Methods Program., 2015

Real-Time Methods in Reversible Computation.
Proceedings of the Reversible Computation - 7th International Conference, 2015

2014
Event Identifier Logic.
Math. Struct. Comput. Sci., 2014

Concurrency and Reversibility.
Proceedings of the Reversible Computation - 6th International Conference, 2014

2013
Modelling of Bonding with Processes and Events.
Proceedings of the Reversible Computation - 5th International Conference, 2013

2012
A hierarchy of reverse bisimulations on stable configuration structures.
Math. Struct. Comput. Sci., 2012

A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway.
Proceedings of the Reversible Computation, 4th International Workshop, 2012

2011
A Logic with Reverse Modalities for History-preserving Bisimulations
Proceedings of the Proceedings 18th International Workshop on Expressiveness in Concurrency, 2011

2009
Semantics and expressiveness of ordered SOS.
Inf. Comput., 2009

Reverse Bisimulations on Stable Configuration Structures
Proceedings of the Proceedings Sixth Workshop on Structural Operational Semantics, 2009

2008
CCS with priority guards.
J. Log. Algebraic Methods Program., 2008

Symmetric electoral systems for ambient calculi.
Inf. Comput., 2008

2007
Tutorial on separation results in process calculi via leader election problems.
Theor. Comput. Sci., 2007

Preface.
Theor. Comput. Sci., 2007

Reversing algebraic process calculi.
J. Log. Algebraic Methods Program., 2007

Reversibility and Models for Concurrency.
Proceedings of the Fourth Workshop on Structural Operational Semantics, 2007

Matching Systems for Concurrent Calculi.
Proceedings of the 14th International Workshop on Expressiveness in Concurrency, 2007

2006
Leader election in rings of ambient processes.
Theor. Comput. Sci., 2006

Preface.
Proceedings of the 13th International Workshop on Expressiveness in Concurrency, 2006

The Meaning of Ordered SOS.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005
On the computational strength of pure ambient calculi.
Theor. Comput. Sci., 2005

Operational Semantics of Reversibility in Process Algebra.
Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Separation Results Via Leader Election Problems.
Proceedings of the Formal Methods for Components and Objects, 4th International Symposium, 2005

2004
Electoral Systems in Ambient Calculi.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2002
Ordered SOS Process Languages for Branching and Eager Bisimulations.
Inf. Comput., 2002

Barbs and Congruences for Safe Mobile Ambients.
Proceedings of the Foundations of Wide Area Network Computing, 2002

On Reduction Semantics for the Push and Pull Ambitent Calculus.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

1997
Formats of Ordered SOS Rules with Silent Actions.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1995
Possible and Guaranteed Concurrency in CSP.
Proceedings of the International Workshop on Structures in Concurrency Theory, 1995

1993
A Note on Expressiveness of Process Algebra.
Proceedings of the Theory and Formal Methods 1993, 1993

Concurrency and Conflict in CSP.
Proceedings of the Theory and Formal Methods 1993, 1993

1987
Refusal Testing.
Theor. Comput. Sci., 1987


  Loading...