default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIain C. C. Phillips
Person information
- affiliation: Imperial College London, UK
Other persons with the same name
- Iain Phillips — disambiguation page
- Iain W. Phillips
![[0000-0001-8503-7651]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-8503-7651")
(aka: Iain William Phillips, Iain Phillips 0002) — Loughborough University, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Ivan Lanese, Iain C. C. Phillips, Irek Ulidowski:
An Axiomatic Theory for Reversible Computation. ACM Trans. Comput. Log. 25(2): 11:1-11:40 (2024)- 2023
- [c35]Robert Glück, Ivan Lanese, Claudio Antares Mezzina, Jaroslaw Adam Miszczak, Iain C. C. Phillips, Irek Ulidowski, Germán Vidal:
Towards a Taxonomy for Reversible Computation Approaches. RC 2023: 24-39 - [i4]Ivan Lanese, Iain C. C. Phillips, Irek Ulidowski:
An Axiomatic Theory for Reversible Computation. CoRR abs/2307.13360 (2023) - 2022
- [j18]Eva Graversen, Iain Phillips, Nobuko Yoshida:
Event structures for the reversible early internal π-calculus. J. Log. Algebraic Methods Program. 124: 100720 (2022) - 2021
- [j17]Eva Graversen, Iain C. C. Phillips, Nobuko Yoshida:
Event structure semantics of (controlled) reversible CCS. J. Log. Algebraic Methods Program. 121: 100686 (2021) - [c34]Ivan Lanese, Iain Phillips:
Forward-Reverse Observational Equivalences in CCSK. RC 2021: 126-143 - 2020
- [j16]Doriana Medic, Claudio Antares Mezzina, Iain Phillips, Nobuko Yoshida:
A parametric framework for reversible π-calculi. Inf. Comput. 275: 104644 (2020) - [c33]Ivan Lanese, Iain C. C. Phillips, Irek Ulidowski:
An Axiomatic Approach to Reversible Computation. FoSSaCS 2020: 442-461 - [c32]Hernán C. Melgratti, Claudio Antares Mezzina, Iain Phillips, G. Michele Pinna, Irek Ulidowski:
Reversible Occurrence Nets and Causal Reversible Prime Event Structures. RC 2020: 35-53 - [c31]Eva Graversen, Iain Phillips, Nobuko Yoshida:
Event Structures for the Reversible Early Internal π-Calculus. RC 2020: 71-90 - [c30]Doriana Medic, Claudio Antares Mezzina, Iain Phillips, Nobuko Yoshida:
Towards a Formal Account for Software Transactional Memory. RC 2020: 255-263 - [p1]Bogdan Aman, Gabriel Ciobanu, Robert Glück, Robin Kaarsgaard, Jarkko Kari, Martin Kutrib, Ivan Lanese, Claudio Antares Mezzina, Lukasz Mikulski, Rajagopal Nagarajan, Iain C. C. Phillips, G. Michele Pinna, Luca Prigioniero, Irek Ulidowski, Germán Vidal:
Foundations of Reversible Computation. Selected Results of the COST Action IC1405 2020: 1-40 - [i3]Eva Graversen, Iain C. C. Phillips, Nobuko Yoshida:
Event structures for the reversible early internal Pi-calculus. CoRR abs/2004.01211 (2020)
2010 – 2019
- 2019
- [j15]Eva Graversen, Iain Phillips, Nobuko Yoshida:
Towards a categorical representation of reversible event structures. J. Log. Algebraic Methods Program. 104: 16-59 (2019) - [i2]Hernán C. Melgratti, Claudio Antares Mezzina, Iain C. C. Phillips, G. Michele Pinna, Irek Ulidowski:
Reversible Causal Nets and Reversible Event Structures. CoRR abs/1910.10987 (2019) - 2018
- [j14]Irek Ulidowski, Iain Phillips, Shoji Yuen:
Reversing Event Structures. New Gener. Comput. 36(3): 281-306 (2018) - [c29]Eva Graversen, Iain Phillips, Nobuko Yoshida:
Event Structure Semantics of (controlled) Reversible CCS. RC 2018: 102-122 - [c28]Doriana Medic, Claudio Antares Mezzina, Iain Phillips, Nobuko Yoshida:
A Parametric Framework for Reversible Pi-Calculi. EXPRESS/SOS 2018: 87-103 - [i1]Doriana Medic, Claudio Antares Mezzina, Iain Phillips, Nobuko Yoshida:
A Parametric Framework for Reversible π-Calculi. CoRR abs/1807.11800 (2018) - 2017
- [c27]Eva Graversen, Iain Phillips, Nobuko Yoshida:
Towards a Categorical Representation of Reversible Event Structures. PLACES@ETAPS 2017: 49-60 - [e3]Iain Phillips, Hafizur Rahaman:
Reversible Computation - 9th International Conference, RC 2017, Kolkata, India, July 6-7, 2017, Proceedings. Lecture Notes in Computer Science 10301, Springer 2017, ISBN 978-3-319-59935-9 [contents] - 2015
- [j13]Iain Phillips, Irek Ulidowski:
Reversibility and asymmetric conflict in event structures. J. Log. Algebraic Methods Program. 84(6): 781-805 (2015) - [c26]Tommi Pesu, Iain Phillips:
Real-Time Methods in Reversible Computation. RC 2015: 45-59 - 2014
- [j12]Iain Phillips, Irek Ulidowski:
Event Identifier Logic. Math. Struct. Comput. Sci. 24(2) (2014) - [c25]Irek Ulidowski, Iain Phillips, Shoji Yuen:
Concurrency and Reversibility. RC 2014: 1-14 - 2013
- [c24]Iain Phillips, Irek Ulidowski:
Reversibility and Asymmetric Conflict in Event Structures. CONCUR 2013: 303-318 - [c23]Iain Phillips, Irek Ulidowski, Shoji Yuen:
Modelling of Bonding with Processes and Events. RC 2013: 141-154 - 2012
- [j11]Iain Phillips, Irek Ulidowski:
A hierarchy of reverse bisimulations on stable configuration structures. Math. Struct. Comput. Sci. 22(2): 333-372 (2012) - [c22]Iain Phillips, Irek Ulidowski, Shoji Yuen:
A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway. RC 2012: 218-232 - 2011
- [c21]Iain Phillips, Irek Ulidowski:
A Logic with Reverse Modalities for History-preserving Bisimulations. EXPRESS 2011: 104-118
2000 – 2009
- 2009
- [j10]Mohammad Reza Mousavi, Iain Phillips, Michel A. Reniers, Irek Ulidowski:
Semantics and expressiveness of ordered SOS. Inf. Comput. 207(2): 85-119 (2009) - [c20]Iain C. C. Phillips, Irek Ulidowski:
Reverse Bisimulations on Stable Configuration Structures. SOS 2009: 62-76 - 2008
- [j9]Iain Phillips, Maria Grazia Vigliotti:
Symmetric electoral systems for ambient calculi. Inf. Comput. 206(1): 34-72 (2008) - [j8]Iain Phillips:
CCS with priority guards. J. Log. Algebraic Methods Program. 75(1): 139-165 (2008) - 2007
- [j7]Iain C. C. Phillips, Irek Ulidowski:
Reversing algebraic process calculi. J. Log. Algebraic Methods Program. 73(1-2): 70-96 (2007) - [j6]Jos C. M. Baeten, Iain C. C. Phillips:
Preface. Theor. Comput. Sci. 386(3): 167-168 (2007) - [j5]Maria Grazia Vigliotti, Iain Phillips, Catuscia Palamidessi:
Tutorial on separation results in process calculi via leader election problems. Theor. Comput. Sci. 388(1-3): 267-289 (2007) - [c19]Bjørn Haagensen, Sergio Maffeis, Iain Phillips:
Matching Systems for Concurrent Calculi. EXPRESS 2007: 85-99 - [c18]Iain Phillips, Irek Ulidowski:
Reversibility and Models for Concurrency. SOS@LICS/ICALP 2007: 93-108 - [e2]Roberto M. Amadio, Iain Phillips:
Proceedings of the 13th International Workshop on Expressiveness in Concurrency, EXPRESS 2006, Bonn, Germany, August 26, 2006. Electronic Notes in Theoretical Computer Science 175(3), Elsevier 2007 [contents] - 2006
- [j4]Iain Phillips, Maria Grazia Vigliotti:
Leader election in rings of ambient processes. Theor. Comput. Sci. 356(3): 468-494 (2006) - [c17]Iain C. C. Phillips, Irek Ulidowski:
Reversing Algebraic Process Calculi. FoSSaCS 2006: 246-260 - [c16]Mohammad Reza Mousavi, Iain C. C. Phillips, Michel A. Reniers, Irek Ulidowski:
The Meaning of Ordered SOS. FSTTCS 2006: 333-344 - [c15]Roberto M. Amadio, Iain Phillips:
Preface. EXPRESS 2006: 1-2 - [e1]Jos C. M. Baeten, Iain C. C. Phillips:
Proceedings of the 12th Workshop on Expressiveness on Concurrency, EXPRESS 2005, San Francisco, CA, USA, August 27, 2005. Electronic Notes in Theoretical Computer Science 154(3), Elsevier 2006 [contents] - 2005
- [j3]Sergio Maffeis, Iain Phillips:
On the computational strength of pure ambient calculi. Theor. Comput. Sci. 330(3): 501-551 (2005) - [c14]Maria Grazia Vigliotti, Iain Phillips, Catuscia Palamidessi:
Separation Results Via Leader Election Problems. FMCO 2005: 172-194 - [c13]Jos C. M. Baeten, Iain C. C. Phillips:
Preface. EXPRESS 2005: 1-2 - [c12]Iain C. C. Phillips, Irek Ulidowski:
Operational Semantics of Reversibility in Process Algebra. APC 25 2005: 281-286 - 2004
- [c11]Iain Phillips, Maria Grazia Vigliotti:
Electoral Systems in Ambient Calculi. FoSSaCS 2004: 408-422 - [c10]Iain Phillips, Maria Grazia Vigliotti:
Leader Election in Rings of Ambient Processes. EXPRESS 2004: 185-199 - 2003
- [c9]Sergio Maffeis, Iain Phillips:
On the Computational Strength of Pure Ambient Calculi. EXPRESS 2003: 29-49 - 2002
- [j2]Irek Ulidowski, Iain C. C. Phillips:
Ordered SOS Process Languages for Branching and Eager Bisimulations. Inf. Comput. 178(1): 180-213 (2002) - [c8]Iain Phillips, Maria Grazia Vigliotti:
On Reduction Semantics for the Push and Pull Ambitent Calculus. IFIP TCS 2002: 550-562 - [c7]Maria Grazia Vigliotti, Iain Phillips:
Barbs and Congruences for Safe Mobile Ambients. F-WAN@ICALP 2002: 37-51 - 2001
- [c6]Iain Phillips:
CCS with Priority Guards. CONCUR 2001: 305-320
1990 – 1999
- 1997
- [c5]Irek Ulidowski, Iain C. C. Phillips:
Formats of Ordered SOS Rules with Silent Actions. TAPSOFT 1997: 297-308 - 1995
- [c4]Marta Kwiatkowska, Iain C. C. Phillips:
Possible and Guaranteed Concurrency in CSP. STRICT 1995: 220-235 - 1993
- [c3]Marta Z. Kwiatkowska, Iain Phillips:
Concurrency and Conflict in CSP. Theory and Formal Methods 1993: 209-225 - [c2]Iain Phillips:
A Note on Expressiveness of Process Algebra. Theory and Formal Methods 1993: 260-264
1980 – 1989
- 1987
- [j1]Iain Phillips:
Refusal Testing. Theor. Comput. Sci. 50: 241-284 (1987) - 1986
- [c1]Iain Phillips:
Refusal Testing. ICALP 1986: 304-313
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
