The Semantics of Nondeterminism. - Matthew Hennessy; Edward A. Ashcroft (ICALP, 1976)

Parameter-Passing Mechanisms and Nondeterminism - Matthew Hennessy; Edward A. Ashcroft (STOC, 1977)

Full Abstraction for a Simple Parallel Programming Language. - Matthew Hennessy; Gordon D. Plotkin (MFCS, 1979)

On Observing Nondeterminism and Concurrency. - Matthew Hennessy; Robin Milner (ICALP, 1980)

A Term Model for CCS. - Matthew Hennessy; Gordon D. Plotkin (MFCS, 1980)

A Proof System for the First-Order Relational Calculus. - Matthew Hennessy (J. Comput. Syst. Sci., 1980)

The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment. - Matthew Hennessy (SIAM J. Comput., 1980)

A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus. - Matthew Hennessy; Edward A. Ashcroft (Theor. Comput. Sci., 1980)

A First Attempt at Translating CSP into CCS. - Matthew Hennessy; Wei Li 022; Gordon D. Plotkin (ICDCS, 1981)

A Term Model for Synchronous Processes - Matthew Hennessy (Inf. Control., 1981)

Powerdomains and nondeterministic recursive definitions. - Matthew Hennessy (Symposium on Programming, 1982)

Testing Equivalence for Processes. - Rocco De Nicola; Matthew Hennessy (ICALP, 1983)

Synchronous and Asynchronous Experiments on Processes - Matthew Hennessy (Inf. Control., 1983)

Modelling Fair Processes - Matthew Hennessy (STOC, 1984)

Axiomatising Finite Delay Operators. - Matthew Hennessy (Acta Informatica, 1984)

Testing Equivalences for Processes. - Rocco De Nicola; Matthew Hennessy (Theor. Comput. Sci., 1984)

An Algebraic Theory of Fair Asynchronous Communicating Processes. - Matthew Hennessy (ICALP, 1985)

The Power of the Future Perfect in Program Logics - Matthew Hennessy; Colin Stirling (Inf. Control., 1985)

Algebraic Laws for Nondeterminism and Concurrency - Matthew Hennessy; Robin Milner (J. ACM, 1985)

Acceptance Trees - Matthew Hennessy (J. ACM, 1985)

Communication Primitives in Programming and Specification Languages. - Matthew Hennessy (Networking in Open Systems, 1986)

Proving Systolic Systems Correct. - Matthew Hennessy (ACM Trans. Program. Lang. Syst., 1986)

CCS without tau's. - Rocco De Nicola; Matthew Hennessy (TAPSOFT, Vol.1, 1987)

An Algebraic Theory of Fair Synchronous Communicating Processes. - Matthew Hennessy (Theor. Comput. Sci., 1987)

Algebraic theory of processes. - Matthew Hennessy (MIT Press, 1988)

Observing processes. - Matthew Hennessy (REX Workshop, 1988)

Axiomatising Finite Concurrent Processes. - Matthew Hennessy (SIAM J. Comput., 1988)

A Proof System for Communicating Processes with Value-passing (Extended Abstract). - Matthew Hennessy (FSTTCS, 1989)

Distributed bisimulations. - Ilaria Castellani; Matthew Hennessy (J. ACM, 1989)

Semantics of programming languages - an elementary introduction using structural operational semantics. - Matthew Hennessy (Wiley, 1990)

Value-Passing in Process Algebras (Abstract). - Matthew Hennessy (CONCUR, 1990)

A Temporal Process Algebra. - Matthew Hennessy; Tim Regan (FORTE, 1990)

Priorities in Process Algebras - Rance Cleaveland; Matthew Hennessy (Inf. Comput., 1990)

Observing Localities (Extended Abstract). - Gérard Boudol; Ilaria Castellani; Matthew Hennessy; Astrid Kiehn (MFCS, 1991)

A Proof Sustem for Communicating Processes with Value-Passing. - Matthew Hennessy (Formal Aspects Comput., 1991)

A Theory of Process with Localities (Extended Abstract). - Gérard Boudol; Ilaria Castellani; Matthew Hennessy; Astrid Kiehn (CONCUR, 1992)

Concurrent Testing of Processes (Extended Abstract). - Matthew Hennessy (CONCUR, 1992)

Timed Process Algebras: A Tutorial. - Matthew Hennessy (NATO ASI PDC, 1992)

An Efficiency Preorder for Processes. - S. Arun-Kumar; Matthew Hennessy (Acta Informatica, 1992)

Termination, Deadlock, and Divergence. - Luca Aceto; Matthew Hennessy (J. ACM, 1992)

A Modal Logic for Message passing Processes (Extended Abstract). - Matthew Hennessy; Xinxin Liu (CAV, 1993)

A Fully Abstract Denotational Model for Higher-Order Processes (Extended Abstract) - Matthew Hennessy (LICS, 1993)

Symbolic Bisimulations (Abstract). - Matthew Hennessy (MFCS, 1993)

Testing Equivalence as a Bisimulation Equivalence. - Rance Cleaveland; Matthew Hennessy (Formal Aspects Comput., 1993)

Communicating Processes with Value-passing and Assignments. - Matthew Hennessy; Anna Ingólfsdóttir (Formal Aspects Comput., 1993)

Observing Localities. - Gérard Boudol; Ilaria Castellani; Matthew Hennessy; Astrid Kiehn (Theor. Comput. Sci., 1993)

Towards Action-Refinement in Process Algebras - Luca Aceto; Matthew Hennessy (Inf. Comput., 1993)

A Theory of Communicating Processes with Value Passing - Matthew Hennessy; Anna Ingólfsdóttir (Inf. Comput., 1993)

Higher-Order Process and Their Models. - Matthew Hennessy (ICALP, 1994)

A Theory of Processes with Localities. - Gérard Boudol; Ilaria Castellani; Matthew Hennessy; Astrid Kiehn (Formal Aspects Comput., 1994)

A Fully Abstract Denotational Model for Higher-Order Processes - Matthew Hennessy (Inf. Comput., 1994)

Adding Action Refinement to a Finite Process Algebra - Luca Aceto; Matthew Hennessy (Inf. Comput., 1994)

Towards a Semantic Theory of CML (Extended Abstract). - William Ferreira 001; Matthew Hennessy (MFCS, 1995)

Concurrent Testing of Processes. - Matthew Hennessy (Acta Informatica, 1995)

A Modal Logic for Message Passing Processes. - Matthew Hennessy; Xinxin Liu (Acta Informatica, 1995)

Symbolic Bisimulations. - Matthew Hennessy; Huimin Lin (Theor. Comput. Sci., 1995)

A Process Algebra for Timed Systems - Matthew Hennessy; Tim Regan (Inf. Comput., 1995)

Proof Systems for Message-Passing Process Algebras. - Matthew Hennessy; Huimin Lin (Formal Aspects Comput., 1996)

Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract). - Chrysafis Hartonas; Matthew Hennessy (CSL, 1997)

Distributed Processes and Location Failures (Extended Abstract). - James Riely; Matthew Hennessy (ICALP, 1997)

Local Model Checking for Value-Passing Processes (Extended Abstract). - Julian Rathke; Matthew Hennessy (TACS, 1997)

On the Decidability of Non-Interleaving Process Equivalences. - Astrid Kiehn; Matthew Hennessy (Fundam. Informaticae, 1997)

Type-Safe Execution of Mobile Agents in Anonymous Networks. - Matthew Hennessy; James Riely (ECOOP Workshops, 1998)

Testing Theories for Asynchronous Languages. - Ilaria Castellani; Matthew Hennessy (FSTTCS, 1998)

A Typed Language for Distributed Mobile Processes (Extended Abstract). - James Riely; Matthew Hennessy (POPL, 1998)

A survey of location calculi. - Matthew Hennessy (EXPRESS, 1998)

Resource Access Control in Systems of Mobile Agents. - Matthew Hennessy; James Riely (HLCL, 1998)

Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing. - Chrysafis Hartonas; Matthew Hennessy (Inf. Comput., 1998)

Preface. - Pierre-Louis Curien; Matthew Hennessy; Huimin Lin (J. Comput. Sci. Technol., 1998)

Process Calculi for describing distributed systems. - Matthew Hennessy (J. Comput. Sci. Technol., 1998)

A Theory of Weak Bisimulation for Core CML. - William Ferreira 001; Matthew Hennessy; Alan Jeffrey (J. Funct. Program., 1998)

Bisimulations for a Calculus of Broadcasting Systems. - Matthew Hennessy; Julian Rathke (Theor. Comput. Sci., 1998)

Suptyping and Locality in Distributed Higher Order Processes (extended abstract). - Nobuko Yoshida; Matthew Hennessy (CONCUR, 1999)

Axiomatising Asynchronous Process Calculi (abstract). - Matthew Hennessy (FCT, 1999)

Proof Systems for Message-Passing Process Calculi. - Matthew Hennessy (IFM, 1999)

A Behavioural Theory of First-Order CML. - William Ferreira 001; Matthew Hennessy (Theor. Comput. Sci., 1999)

Combining the typed lambda-calculus with CCS. - William Ferreira 001; Matthew Hennessy; Alan Jeffrey (Proof, Language, and Interaction, 2000)

Unique fixpoint induction for message-passing process calculi. - Matthew Hennessy; Huimin Lin; Julian Rathke (Sci. Comput. Program., 2001)

Distributed processes and location failures. - James Riely; Matthew Hennessy (Theor. Comput. Sci., 2001)

Bisimulation congruences in safe ambients. - Massimo Merro; Matthew Hennessy (POPL, 2002)

Typed behavioural equivalences for processes in the presence of subtyping. - Matthew Hennessy; Julian Rathke (CATS, 2002)

Assigning Types to Processes. - Nobuko Yoshida; Matthew Hennessy (Inf. Comput., 2002)

A fully abstract denotational semantics for the pi-calculus. - Matthew Hennessy (Theor. Comput. Sci., 2002)

Information flow vs. resource access in the asynchronous pi-calculus. - Matthew Hennessy; James Riely (ACM Trans. Program. Lang. Syst., 2002)

The Security Picalculus and Non-interference (Extended Abstract). - Matthew Hennessy (MFPS, 2003)

Trust and Partial Typing in Open Systems of Mobile Agents. - James Riely; Matthew Hennessy (J. Autom. Reason., 2003)

Security Policies as Membranes in Systems for Global Computing. - Daniele Gorla; Matthew Hennessy; Vladimiro Sassone (FGUC, 2004)

Preface. - Stephan J. Eidenbenz; Matthew Hennessy; Rafael Morales Bueno; Francisco Triguero Ruiz; Peter Widmayer; Ricardo Conejo (Theor. Comput. Sci., 2004)

Towards a behavioural theory of access and mobility control in distributed systems. - Matthew Hennessy; Massimo Merro; Julian Rathke (Theor. Comput. Sci., 2004)

A Theory of System Behaviour in the Presence of Node and Link Failures. - Adrian Francalanza; Matthew Hennessy (CONCUR, 2005)

Proof Methodologies for Behavioural Equivalence in DPI. - Alberto Ciaffaglione; Matthew Hennessy; Julian Rathke (FORTE, 2005)

safeDpi: a language for controlling mobile code. - Matthew Hennessy; Julian Rathke; Nobuko Yoshida (Acta Informatica, 2005)

Adding Recursion to Dpi: (Extended Abstract). - Samuel Hym; Matthew Hennessy (SOS@ICALP, 2005)

The security pi-calculus and non-interference. - Matthew Hennessy (J. Log. Algebraic Methods Program., 2005)

Inferring dynamic credentials for rôle-based trust management. - Daniele Gorla; Matthew Hennessy; Vladimiro Sassone (PPDP, 2006)

A bisimulation-based semantic theory of Safe Ambients. - Massimo Merro; Matthew Hennessy (ACM Trans. Program. Lang. Syst., 2006)

A distributed Pi-calculus. - Matthew Hennessy (Cambridge University Press, 2007)

A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract). - Adrian Francalanza; Matthew Hennessy (ESOP, 2007)

Characterising Testing Preorders for Finite Probabilistic Processes. - Yuxin Deng; Rob J. van Glabbeek; Matthew Hennessy; Carroll Morgan; Chenyi Zhang 001 (LICS, 2007)

Remarks on Testing Probabilistic Processes. - Yuxin Deng; Rob J. van Glabbeek; Matthew Hennessy; Carroll Morgan; Chenyi Zhang 001 (Computation, Meaning, and Logic, 2007)

Preface. - Rob J. van Glabbeek; Matthew Hennessy (SOS@LICS/ICALP, 2007)

A theory for observational fault tolerance. - Adrian Francalanza; Matthew Hennessy (J. Log. Algebraic Methods Program., 2007)

Adding recursion to Dpi. - Samuel Hym; Matthew Hennessy (Theor. Comput. Sci., 2007)

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra. - Gérard Boudol; Ilaria Castellani; Matthew Hennessy; Mogens Nielsen; Glynn Winskel (Concurrency, Graphs and Models, 2008)

Counting the Cost in the Picalculus (Extended Abstract). - Matthew Hennessy; Manish Gaur (ICE@ICALP, 2008)

Preface. - Matthew Hennessy; Bartek Klin (SOS@ICALP, 2008)

A theory of system behaviour in the presence of node and link failure. - Adrian Francalanza; Matthew Hennessy (Inf. Comput., 2008)

Characterising Testing Preorders for Finite Probabilistic Processes. - Yuxin Deng; Rob J. van Glabbeek; Matthew Hennessy; Carroll Morgan (Log. Methods Comput. Sci., 2008)

Testing Finitary Probabilistic Processes. - Yuxin Deng; Rob J. van Glabbeek; Matthew Hennessy; Carroll Morgan (CONCUR, 2009)

Distributed Systems and Their Environments. - Matthew Hennessy (TAMC, 2009)

Liveness of Communicating Transactions (Extended Abstract). - Edsko de Vries; Vasileios Koutavas; Matthew Hennessy (APLAS, 2010)

Communicating Transactions - (Extended Abstract). - Edsko de Vries; Vasileios Koutavas; Matthew Hennessy (CONCUR, 2010)

Process Behaviour: Formulae vs. Tests (Extended Abstract) - Andrea Cerone; Matthew Hennessy (EXPRESS, 2010)

A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract). - Vasileios Koutavas; Matthew Hennessy (ESOP, 2011)

Compositional Reasoning for Markov Decision Processes - (Extended Abstract). - Yuxin Deng; Matthew Hennessy (FSEN, 2011)

A calculus for costed computations - Matthew Hennessy (Log. Methods Comput. Sci., 2011)

Real-Reward Testing for Probabilistic Processes (Extended Abstract) - Yuxin Deng; Rob J. van Glabbeek; Matthew Hennessy; Carroll Morgan (QAPL, 2011)

Modelling Probabilistic Wireless Networks - (Extended Abstract). - Andrea Cerone; Matthew Hennessy (FMOODS/FORTE, 2012)

First-order reasoning for higher-order concurrency. - Vasileios Koutavas; Matthew Hennessy (Comput. Lang. Syst. Struct., 2012)

Exploring probabilistic bisimulations, part I. - Matthew Hennessy (Formal Aspects Comput., 2012)

Mutually Testing Processes - (Extended Abstract). - Giovanni Bernardi 001; Matthew Hennessy (CONCUR, 2013)

Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract). - Vasileios Koutavas; Matthew Hennessy (CONCUR, 2013)

Compliance and Testing Preorders Differ. - Giovanni Bernardi 001; Matthew Hennessy (SEFM Workshops, 2013)

Modelling Probabilistic Wireless Networks. - Andrea Cerone; Matthew Hennessy (Log. Methods Comput. Sci., 2013)

On the semantics of Markov automata. - Yuxin Deng; Matthew Hennessy (Inf. Comput., 2013)

Compositional reasoning for weighted Markov decision processes. - Yuxin Deng; Matthew Hennessy (Sci. Comput. Program., 2013)

Using Higher-Order Contracts to Model Session Types (Extended Abstract). - Giovanni Bernardi 001; Matthew Hennessy (CONCUR, 2014)

Bisimulations for Communicating Transactions - (Extended Abstract). - Vasileios Koutavas; Carlo Spaccasassi; Matthew Hennessy (FoSSaCS, 2014)

Characterising Testing Preorders for Broadcasting Distributed Systems. - Andrea Cerone; Matthew Hennessy (TGC, 2014)

Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency. - Adrian Francalanza; Edsko de Vries; Matthew Hennessy (Log. Methods Comput. Sci., 2014)

Uniqueness typing for resource management in message-passing concurrency. - Edsko de Vries; Adrian Francalanza; Matthew Hennessy (J. Log. Comput., 2014)

Real-reward testing for probabilistic processes. - Yuxin Deng; Rob J. van Glabbeek; Matthew Hennessy; Carroll Morgan (Theor. Comput. Sci., 2014)

Behavioural Equivalences for Co-operating Transactions (Invited Paper). - Matthew Hennessy (CONCUR, 2015)

Mutually Testing Processes. - Giovanni Bernardi 001; Matthew Hennessy (Log. Methods Comput. Sci., 2015)

Modelling MAC-Layer Communications in Wireless Systems. - Andrea Cerone; Matthew Hennessy; Massimo Merro (Log. Methods Comput. Sci., 2015)

Using higher-order contracts to model session types. - Giovanni Bernardi 001; Matthew Hennessy (Log. Methods Comput. Sci., 2016)

Modelling session types using contracts. - Giovanni Tito Bernardi; Matthew Hennessy (Math. Struct. Comput. Sci., 2016)

A Coinductive Equational Characterisation of Trace Inclusion for Regular Processes. - Matthew Hennessy (Models, Algorithms, Logics and Tools, 2017)

Distinguishing between communicating transactions. - Vasileios Koutavas; Maciej Gazda; Matthew Hennessy (Inf. Comput., 2018)

An Equational Characterisation of the Must Testing Pre-order for Regular Processes. - Matthew Hennessy (Models, Languages, and Tools for Concurrent and Distributed Programming, 2019)