Matthew Hennessy

172 papers A* 21A 4B 29C 5Misc 1Journal 73Unranked 34
YearRankTypeTitle / Venue / Authors
2019 — conf
An Equational Characterisation of the Must Testing Pre-order for Regular Processes.
Models, Languages, and Tools for Concurrent and Distributed Programming
Matthew Hennessy
2018 J jnl
Distinguishing between communicating transactions.
Inf. Comput.
Vasileios Koutavas, Maciej Gazda, Matthew Hennessy
2017 — conf
A Coinductive Equational Characterisation of Trace Inclusion for Regular Processes.
Models, Algorithms, Logics and Tools
Matthew Hennessy
2017 J jnl
Distinguishing between Communicating Transactions.
CoRR
Vasileios Koutavas, Maciej Gazda, Matthew Hennessy
2016 J jnl
Modelling session types using contracts.
Math. Struct. Comput. Sci.
Giovanni Tito Bernardi, Matthew Hennessy
2016 J jnl
Using higher-order contracts to model session types.
Log. Methods Comput. Sci.
Giovanni Bernardi, Matthew Hennessy
2015 B conf
Behavioural Equivalences for Co-operating Transactions (Invited Paper).
CONCUR
Matthew Hennessy
2015 J jnl
Modelling MAC-Layer Communications in Wireless Systems.
Log. Methods Comput. Sci.
Andrea Cerone, Matthew Hennessy, Massimo Merro
2015 J jnl
Mutually Testing Processes.
Log. Methods Comput. Sci.
Giovanni Bernardi, Matthew Hennessy
2014 B conf
Bisimulations for Communicating Transactions - (Extended Abstract).
FoSSaCS
Vasileios Koutavas, Carlo Spaccasassi, Matthew Hennessy
2014 — conf
Characterising Testing Preorders for Broadcasting Distributed Systems.
TGC
Andrea Cerone, Matthew Hennessy
2014 J jnl
Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency.
Log. Methods Comput. Sci.
Adrian Francalanza, Edsko de Vries, Matthew Hennessy
2014 J jnl
Real-reward testing for probabilistic processes.
Theor. Comput. Sci.
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan
2014 J jnl
Uniqueness typing for resource management in message-passing concurrency.
J. Log. Comput.
Edsko de Vries, Adrian Francalanza, Matthew Hennessy
2014 B conf
Using Higher-Order Contracts to Model Session Types (Extended Abstract).
CONCUR
Giovanni Bernardi, Matthew Hennessy
2013 — conf
Compliance and Testing Preorders Differ.
SEFM Workshops
Giovanni Bernardi, Matthew Hennessy
2013 J jnl
Compositional reasoning for weighted Markov decision processes.
Sci. Comput. Program.
Yuxin Deng, Matthew Hennessy
2013 C conf
Modelling MAC-Layer Communications in Wireless Systems.
COORDINATION
Andrea Cerone, Matthew Hennessy, Massimo Merro
2013 J jnl
Modelling Probabilistic Wireless Networks.
Log. Methods Comput. Sci.
Andrea Cerone, Matthew Hennessy
2013 B conf
Mutually Testing Processes - (Extended Abstract).
CONCUR
Giovanni Bernardi, Matthew Hennessy
2013 J jnl
On the semantics of Markov automata.
Inf. Comput.
Yuxin Deng, Matthew Hennessy
2013 B conf
Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract).
CONCUR
Vasileios Koutavas, Matthew Hennessy
2012 J jnl
Exploring probabilistic bisimulations, part I.
Formal Aspects Comput.
Matthew Hennessy
2012 J jnl
First-order reasoning for higher-order concurrency.
Comput. Lang. Syst. Struct.
Vasileios Koutavas, Matthew Hennessy
2012 — conf
Modelling Probabilistic Wireless Networks - (Extended Abstract).
FMOODS/FORTE
Andrea Cerone, Matthew Hennessy
2012 Misc conf
Modelling session types using contracts.
SAC
Giovanni Bernardi, Matthew Hennessy
2011 A conf
A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract).
ESOP
Vasileios Koutavas, Matthew Hennessy
2011 J jnl
A calculus for costed computations
Log. Methods Comput. Sci.
Matthew Hennessy
2011 — conf
Compositional Reasoning for Markov Decision Processes - (Extended Abstract).
FSEN
Yuxin Deng, Matthew Hennessy
2011 — conf
On the Semantics of Markov Automata.
ICALP (2)
Yuxin Deng, Matthew Hennessy
2011 — conf
Real-Reward Testing for Probabilistic Processes (Extended Abstract)
QAPL
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan
2010 B conf
Communicating Transactions - (Extended Abstract).
CONCUR
Edsko de Vries, Vasileios Koutavas, Matthew Hennessy
2010 B conf
Liveness of Communicating Transactions (Extended Abstract).
APLAS
Edsko de Vries, Vasileios Koutavas, Matthew Hennessy
2010 — conf
Process Behaviour: Formulae vs. Tests (Extended Abstract)
EXPRESS
Andrea Cerone, Matthew Hennessy
2009 C conf
Distributed Systems and Their Environments.
TAMC
Matthew Hennessy
2009 — ed.
Proceedings of the Fifth Workshop on Structural Operational Semantics, SOS@ICALP 2008, Reykjavik, Iceland, July 6, 2008
SOS@ICALP
Matthew Hennessy, Bartek Klin
2009 B conf
Testing Finitary Probabilistic Processes.
CONCUR
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan
2009 — conf
Uniqueness Typing for Resource Management in Message-Passing Concurrency
LINEARITY
Edsko de Vries, Adrian Francalanza, Matthew Hennessy
2008 J jnl
A theory of system behaviour in the presence of node and link failure.
Inf. Comput.
Adrian Francalanza, Matthew Hennessy
2008 J jnl
Characterising Testing Preorders for Finite Probabilistic Processes
CoRR
Yuxin Deng, Matthew Hennessy, Rob J. van Glabbeek, Carroll Morgan
2008 J jnl
Characterising Testing Preorders for Finite Probabilistic Processes.
Log. Methods Comput. Sci.
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan
2008 — conf
Counting the Cost in the Picalculus (Extended Abstract).
ICE@ICALP
Matthew Hennessy, Manish Gaur
2008 — conf
Preface.
SOS@ICALP
Matthew Hennessy, Bartek Klin
2008 — conf
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra.
Concurrency, Graphs and Models
Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Mogens Nielsen, Glynn Winskel
2007 A conf
A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract).
ESOP
Adrian Francalanza, Matthew Hennessy
2007 — book
A distributed Pi-calculus.
Matthew Hennessy
2007 J jnl
A theory for observational fault tolerance.
J. Log. Algebraic Methods Program.
Adrian Francalanza, Matthew Hennessy
2007 J jnl
Adding recursion to Dpi.
Theor. Comput. Sci.
Samuel Hym, Matthew Hennessy
2007 A* conf
Characterising Testing Preorders for Finite Probabilistic Processes.
LICS
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
2007 — conf
Preface.
SOS@LICS/ICALP
Rob J. van Glabbeek, Matthew Hennessy
2007 — ed.
Proceedings of the Fourth Workshop on Structural Operational Semantics, SOS@LICS/ICALP 2007, Wroclaw, Poland, July 9, 2007
SOS@LICS/ICALP
Rob van Glabbeek, Matthew Hennessy
2007 — conf
Remarks on Testing Probabilistic Processes.
Computation, Meaning, and Logic
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
2006 B conf
A Theory for Observational Fault Tolerance.
FoSSaCS
Adrian Francalanza, Matthew Hennessy
2006 J jnl
A bisimulation-based semantic theory of Safe Ambients.
ACM Trans. Program. Lang. Syst.
Massimo Merro, Matthew Hennessy
2006 C conf
Inferring dynamic credentials for rôle-based trust management.
PPDP
Daniele Gorla, Matthew Hennessy, Vladimiro Sassone
2005 B conf
A Theory of System Behaviour in the Presence of Node and Link Failures.
CONCUR
Adrian Francalanza, Matthew Hennessy
2005 — conf
Adding Recursion to Dpi: (Extended Abstract).
SOS@ICALP
Samuel Hym, Matthew Hennessy
2005 C conf
Proof Methodologies for Behavioural Equivalence in DPI.
FORTE
Alberto Ciaffaglione, Matthew Hennessy, Julian Rathke
2005 J jnl
Security Policies as Membranes in Systems for Global Computing
CoRR
Daniele Gorla, Matthew Hennessy, Vladimiro Sassone
2005 J jnl
Security Policies as Membranes in Systems for Global Computing.
Log. Methods Comput. Sci.
Daniele Gorla, Matthew Hennessy, Vladimiro Sassone
2005 J jnl
The security pi-calculus and non-interference.
J. Log. Algebraic Methods Program.
Matthew Hennessy
2005 J jnl
safeDpi: a language for controlling mobile code.
Acta Informatica
Matthew Hennessy, Julian Rathke, Nobuko Yoshida
2004 J jnl
Preface.
Theor. Comput. Sci.
Stephan J. Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo
2004 — conf
Security Policies as Membranes in Systems for Global Computing.
FGUC
Daniele Gorla, Matthew Hennessy, Vladimiro Sassone
2004 J jnl
Towards a behavioural theory of access and mobility control in distributed systems.
Theor. Comput. Sci.
Matthew Hennessy, Massimo Merro, Julian Rathke
2004 J jnl
Typed behavioural equivalences for processes in the presence of subtyping.
Math. Struct. Comput. Sci.
Matthew Hennessy, Julian Rathke
2004 B conf
safeDpi: A Language for Controlling Mobile Code.
FoSSaCS
Matthew Hennessy, Julian Rathke, Nobuko Yoshida
2003 B conf
The Security Picalculus and Non-interference (Extended Abstract).
MFPS
Matthew Hennessy
2003 B conf
Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems.
FoSSaCS
Matthew Hennessy, Massimo Merro, Julian Rathke
2003 J jnl
Trust and Partial Typing in Open Systems of Mobile Agents.
J. Autom. Reason.
James Riely, Matthew Hennessy
2002 J jnl
A fully abstract denotational semantics for the pi-calculus.
Theor. Comput. Sci.
Matthew Hennessy
2002 J jnl
Assigning Types to Processes.
Inf. Comput.
Nobuko Yoshida, Matthew Hennessy
2002 A* ed.
Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings
ICALP
Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan J. Eidenbenz, Ricardo Conejo
2002 A* conf
Bisimulation congruences in safe ambients.
POPL
Massimo Merro, Matthew Hennessy
2002 J jnl
Information flow vs. resource access in the asynchronous pi-calculus.
ACM Trans. Program. Lang. Syst.
Matthew Hennessy, James Riely
2002 J jnl
Resource Access Control in Systems of Mobile Agents.
Inf. Comput.
Matthew Hennessy, James Riely
2002 — conf
Typed behavioural equivalences for processes in the presence of subtyping.
CATS
Matthew Hennessy, Julian Rathke
2001 J jnl
Distributed processes and location failures.
Theor. Comput. Sci.
James Riely, Matthew Hennessy
2001 J jnl
Unique fixpoint induction for message-passing process calculi.
Sci. Comput. Program.
Matthew Hennessy, Huimin Lin, Julian Rathke
2000 A* conf
Assigning Types to Processes.
LICS
Nobuko Yoshida, Matthew Hennessy
2000 — conf
Combining the typed lambda-calculus with CCS.
Proof, Language, and Interaction
William Ferreira, Matthew Hennessy, Alan Jeffrey
2000 A* conf
Information Flow vs. Resource Access in the Asynchronous Pi-Calculus.
ICALP
Matthew Hennessy, James Riely
1999 J jnl
A Behavioural Theory of First-Order CML.
Theor. Comput. Sci.
William Ferreira, Matthew Hennessy
1999 B conf
Axiomatising Asynchronous Process Calculi (abstract).
FCT
Matthew Hennessy
1999 B conf
Proof Systems for Message-Passing Process Calculi.
IFM
Matthew Hennessy
1999 B conf
Suptyping and Locality in Distributed Higher Order Processes (extended abstract).
CONCUR
Nobuko Yoshida, Matthew Hennessy
1999 A* conf
Trust and Partial Typing in Open Systems of Mobile Agents.
POPL
James Riely, Matthew Hennessy
1999 — conf
Type-Safe Execution of Mobile Agents in Anonymous Networks.
Secure Internet Programming
Matthew Hennessy, James Riely
1998 J jnl
A Theory of Weak Bisimulation for Core CML.
J. Funct. Program.
William Ferreira, Matthew Hennessy, Alan Jeffrey
1998 A* conf
A Typed Language for Distributed Mobile Processes (Extended Abstract).
POPL
James Riely, Matthew Hennessy
1998 — conf
A survey of location calculi.
EXPRESS
Matthew Hennessy
1998 J jnl
Bisimulations for a Calculus of Broadcasting Systems.
Theor. Comput. Sci.
Matthew Hennessy, Julian Rathke
1998 J jnl
Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing.
Inf. Comput.
Chrysafis Hartonas, Matthew Hennessy
1998 J jnl
Preface.
J. Comput. Sci. Technol.
Pierre-Louis Curien, Matthew Hennessy, Huimin Lin
1998 J jnl
Process Calculi for describing distributed systems.
J. Comput. Sci. Technol.
Matthew Hennessy
1998 — conf
Resource Access Control in Systems of Mobile Agents.
HLCL
Matthew Hennessy, James Riely
1998 — conf
Testing Theories for Asynchronous Languages.
FSTTCS
Ilaria Castellani, Matthew Hennessy
1998 — conf
Type-Safe Execution of Mobile Agents in Anonymous Networks.
ECOOP Workshops
Matthew Hennessy, James Riely
1997 A* conf
Distributed Processes and Location Failures (Extended Abstract).
ICALP
James Riely, Matthew Hennessy
1997 B conf
Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract).
CSL
Chrysafis Hartonas, Matthew Hennessy
1997 — conf
Local Model Checking for Value-Passing Processes (Extended Abstract).
TACS
Julian Rathke, Matthew Hennessy
1997 J jnl
On the Decidability of Non-Interleaving Process Equivalences.
Fundam. Informaticae
Astrid Kiehn, Matthew Hennessy
1996 A conf
A Theory of Weak Bisimulation for Core CML.
ICFP
William Ferreira, Matthew Hennessy, Alan Jeffrey
1996 J jnl
Proof Systems for Message-Passing Process Algebras.
Formal Aspects Comput.
Matthew Hennessy, Huimin Lin
1995 J jnl
A Modal Logic for Message Passing Processes.
Acta Informatica
Matthew Hennessy, Xinxin Liu
1995 J jnl
A Process Algebra for Timed Systems
Inf. Comput.
Matthew Hennessy, Tim Regan
1995 B conf
Bisimulations for a Calculus of Broadcasting Systems.
CONCUR
Matthew Hennessy, Julian Rathke
1995 J jnl
Concurrent Testing of Processes.
Acta Informatica
Matthew Hennessy
1995 J jnl
Symbolic Bisimulations.
Theor. Comput. Sci.
Matthew Hennessy, Huimin Lin
1995 B conf
Towards a Semantic Theory of CML (Extended Abstract).
MFCS
William Ferreira, Matthew Hennessy
1994 J jnl
A Fully Abstract Denotational Model for Higher-Order Processes
Inf. Comput.
Matthew Hennessy
1994 J jnl
A Theory of Processes with Localities.
Formal Aspects Comput.
Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
1994 J jnl
Adding Action Refinement to a Finite Process Algebra
Inf. Comput.
Luca Aceto, Matthew Hennessy
1994 A* conf
Higher-Order Process and Their Models.
ICALP
Matthew Hennessy
1993 A* conf
A Fully Abstract Denotational Model for Higher-Order Processes (Extended Abstract)
LICS
Matthew Hennessy
1993 A* conf
A Modal Logic for Message passing Processes (Extended Abstract).
CAV
Matthew Hennessy, Xinxin Liu
1993 J jnl
A Theory of Communicating Processes with Value Passing
Inf. Comput.
Matthew Hennessy, Anna Ingólfsdóttir
1993 J jnl
Communicating Processes with Value-passing and Assignments.
Formal Aspects Comput.
Matthew Hennessy, Anna Ingólfsdóttir
1993 J jnl
Observing Localities.
Theor. Comput. Sci.
Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
1993 B conf
Proof Systems for Message-Passing Process Algebras.
CONCUR
Matthew Hennessy, Huimin Lin
1993 B conf
Symbolic Bisimulations (Abstract).
MFCS
Matthew Hennessy
1993 J jnl
Testing Equivalence as a Bisimulation Equivalence.
Formal Aspects Comput.
Rance Cleaveland, Matthew Hennessy
1993 J jnl
Towards Action-Refinement in Process Algebras
Inf. Comput.
Luca Aceto, Matthew Hennessy
1992 B conf
A Theory of Process with Localities (Extended Abstract).
CONCUR
Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
1992 J jnl
An Efficiency Preorder for Processes.
Acta Informatica
S. Arun-Kumar, Matthew Hennessy
1992 B conf
Concurrent Testing of Processes (Extended Abstract).
CONCUR
Matthew Hennessy
1992 J jnl
Termination, Deadlock, and Divergence.
J. ACM
Luca Aceto, Matthew Hennessy
1992 — conf
Timed Process Algebras: A Tutorial.
NATO ASI PDC
Matthew Hennessy
1991 J jnl
A Proof Sustem for Communicating Processes with Value-Passing.
Formal Aspects Comput.
Matthew Hennessy
1991 A* conf
Adding Action Refinement to a Finite Process Algebra.
ICALP
Luca Aceto, Matthew Hennessy
1991 — conf
An Efficiency Preorder for Processes.
TACS
S. Arun-Kumar, Matthew Hennessy
1991 B conf
Observing Localities (Extended Abstract).
MFCS
Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
1990 C conf
A Temporal Process Algebra.
FORTE
Matthew Hennessy, Tim Regan
1990 A* conf
A Theory of Communicating Processes with Value-Passing.
ICALP
Matthew Hennessy, Anna Ingólfsdóttir
1990 J jnl
Priorities in Process Algebras
Inf. Comput.
Rance Cleaveland, Matthew Hennessy
1990 — book
Semantics of programming languages - an elementary introduction using structural operational semantics.
Matthew Hennessy
1990 B conf
Value-Passing in Process Algebras (Abstract).
CONCUR
Matthew Hennessy
1989 — conf
A Proof System for Communicating Processes with Value-passing (Extended Abstract).
FSTTCS
Matthew Hennessy
1989 J jnl
Distributed bisimulations.
J. ACM
Ilaria Castellani, Matthew Hennessy
1989 B conf
Termination, Deadlock and Divergence.
Mathematical Foundations of Programming Semantics
Luca Aceto, Matthew Hennessy
1989 — conf
Testing Equivalence as a Bisimulation Equivalence.
Automatic Verification Methods for Finite State Systems
Rance Cleaveland, Matthew Hennessy
1989 A* conf
Towards Action-Refinement in Process Algebras
LICS
Luca Aceto, Matthew Hennessy
1988 — book
Algebraic theory of processes.
Matthew Hennessy
1988 J jnl
Axiomatising Finite Concurrent Processes.
SIAM J. Comput.
Matthew Hennessy
1988 — conf
Observing processes.
REX Workshop
Matthew Hennessy
1988 A* conf
Priorities in Process Algebras
LICS
Rance Cleaveland, Matthew Hennessy
1987 J jnl
An Algebraic Theory of Fair Synchronous Communicating Processes.
Theor. Comput. Sci.
Matthew Hennessy
1987 — conf
CCS without tau's.
TAPSOFT, Vol.1
Rocco De Nicola, Matthew Hennessy
1986 — conf
Communication Primitives in Programming and Specification Languages.
Networking in Open Systems
Matthew Hennessy
1986 J jnl
Proving Systolic Systems Correct.
ACM Trans. Program. Lang. Syst.
Matthew Hennessy
1985 J jnl
Acceptance Trees
J. ACM
Matthew Hennessy
1985 J jnl
Algebraic Laws for Nondeterminism and Concurrency
J. ACM
Matthew Hennessy, Robin Milner
1985 A* conf
An Algebraic Theory of Fair Asynchronous Communicating Processes.
ICALP
Matthew Hennessy
1985 J jnl
The Power of the Future Perfect in Program Logics
Inf. Control.
Matthew Hennessy, Colin Stirling
1984 J jnl
Axiomatising Finite Delay Operators.
Acta Informatica
Matthew Hennessy
1984 A* conf
Modelling Fair Processes
STOC
Matthew Hennessy
1984 J jnl
Testing Equivalences for Processes.
Theor. Comput. Sci.
Rocco De Nicola, Matthew Hennessy
1984 B conf
The Power of the Future Perfect in Program Logics.
MFCS
Matthew Hennessy, Colin Stirling
1983 J jnl
Synchronous and Asynchronous Experiments on Processes
Inf. Control.
Matthew Hennessy
1983 — conf
Synchronous and Asynchronous Experiments on Processes.
IFIP Congress
Matthew Hennessy
1983 A* conf
Testing Equivalence for Processes.
ICALP
Rocco De Nicola, Matthew Hennessy
1982 — conf
Powerdomains and nondeterministic recursive definitions.
Symposium on Programming
Matthew Hennessy
1981 A conf
A First Attempt at Translating CSP into CCS.
ICDCS
Matthew Hennessy, Wei Li, Gordon D. Plotkin
1981 J jnl
A Term Model for Synchronous Processes
Inf. Control.
Matthew Hennessy
1980 J jnl
A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus.
Theor. Comput. Sci.
Matthew Hennessy, Edward A. Ashcroft
1980 J jnl
A Proof System for the First-Order Relational Calculus.
J. Comput. Syst. Sci.
Matthew Hennessy
1980 B conf
A Term Model for CCS.
MFCS
Matthew Hennessy, Gordon D. Plotkin
1980 A* conf
On Observing Nondeterminism and Concurrency.
ICALP
Matthew Hennessy, Robin Milner
1980 J jnl
The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment.
SIAM J. Comput.
Matthew Hennessy
1979 B conf
Full Abstraction for a Simple Parallel Programming Language.
MFCS
Matthew Hennessy, Gordon D. Plotkin
1977 A* conf
Parameter-Passing Mechanisms and Nondeterminism
STOC
Matthew Hennessy, Edward A. Ashcroft
1976 A* conf
The Semantics of Nondeterminism.
ICALP
Matthew Hennessy, Edward A. Ashcroft