| 2015 | CONCUR | Behavioural Equivalences for Co-operating Transactions (Invited Paper). | Matthew Hennessy |
| 2014 | CONCUR | Using Higher-Order Contracts to Model Session Types (Extended Abstract). | Giovanni Bernardi, Matthew Hennessy |
| 2014 | FOSSACS | Bisimulations for Communicating Transactions - (Extended Abstract). | Vasileios Koutavas, Carlo Spaccasassi, Matthew Hennessy |
| 2013 | CONCUR | Mutually Testing Processes - (Extended Abstract). | Giovanni Bernardi, Matthew Hennessy |
| 2013 | CONCUR | Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract). | Vasileios Koutavas, Matthew Hennessy |
| 2013 | Coordination | Modelling MAC-Layer Communications in Wireless Systems. | Andrea Cerone, Matthew Hennessy, Massimo Merro |
| 2013 | SEFM | Compliance and Testing Preorders Differ. | Giovanni Bernardi, Matthew Hennessy |
| 2012 | FORTE | Modelling Probabilistic Wireless Networks - (Extended Abstract). | Andrea Cerone, Matthew Hennessy |
| 2012 | SAC | Modelling session types using contracts. | Giovanni Bernardi, Matthew Hennessy |
| 2011 | ESOP | A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract). | Vasileios Koutavas, Matthew Hennessy |
| 2011 | ICALP | On the Semantics of Markov Automata. | Yuxin Deng, Matthew Hennessy |
| 2010 | APLAS | Liveness of Communicating Transactions (Extended Abstract). | Edsko de Vries, Vasileios Koutavas, Matthew Hennessy |
| 2010 | CONCUR | Communicating Transactions - (Extended Abstract). | Edsko de Vries, Vasileios Koutavas, Matthew Hennessy |
| 2009 | CONCUR | Testing Finitary Probabilistic Processes. | Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan |
| 2009 | TAMC | Distributed Systems and Their Environments. | Matthew Hennessy |
| 2007 | ESOP | A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract). | Adrian Francalanza, Matthew Hennessy |
| 2007 | LICS | Characterising Testing Preorders for Finite Probabilistic Processes. | Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang |
| 2006 | FOSSACS | A Theory for Observational Fault Tolerance. | Adrian Francalanza, Matthew Hennessy |
| 2006 | PPDP | Inferring dynamic credentials for rle-based trust management. | Daniele Gorla, Matthew Hennessy, Vladimiro Sassone |
| 2005 | CONCUR | A Theory of System Behaviour in the Presence of Node and Link Failures. | Adrian Francalanza, Matthew Hennessy |
| 2005 | FORTE | Proof Methodologies for Behavioural Equivalence in DPI. | Alberto Ciaffaglione, Matthew Hennessy, Julian Rathke |
| 2004 | FOSSACS | safeDpi: A Language for Controlling Mobile Code. | Matthew Hennessy, Julian Rathke, Nobuko Yoshida |
| 2003 | FOSSACS | Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. | Matthew Hennessy, Massimo Merro, Julian Rathke |
| 2003 | MFPS | The Security Picalculus and Non-interference (Extended Abstract). | Matthew Hennessy |
| 2002 | POPL | Bisimulation congruences in safe ambients. | Massimo Merro, Matthew Hennessy |
| 2000 | ICALP | Information Flow vs. Resource Access in the Asynchronous Pi-Calculus. | Matthew Hennessy, James Riely |
| 2000 | LICS | Assigning Types to Processes. | Nobuko Yoshida, Matthew Hennessy |
| 1999 | CONCUR | Suptyping and Locality in Distributed Higher Order Processes (extended abstract). | Nobuko Yoshida, Matthew Hennessy |
| 1999 | FCT | Axiomatising Asynchronous Process Calculi (abstract). | Matthew Hennessy |
| 1999 | IFM | Proof Systems for Message-Passing Process Calculi. | Matthew Hennessy |
| 1999 | POPL | Trust and Partial Typing in Open Systems of Mobile Agents. | James Riely, Matthew Hennessy |
| 1998 | POPL | A Typed Language for Distributed Mobile Processes (Extended Abstract). | James Riely, Matthew Hennessy |
| 1997 | CSL | Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract). | Chrysafis Hartonas, Matthew Hennessy |
| 1997 | ICALP | Distributed Processes and Location Failures (Extended Abstract). | James Riely, Matthew Hennessy |
| 1996 | ICFP | A Theory of Weak Bisimulation for Core CML. | William Ferreira, Matthew Hennessy, Alan Jeffrey |
| 1995 | CONCUR | Bisimulations for a Calculus of Broadcasting Systems. | Matthew Hennessy, Julian Rathke |
| 1995 | MFCS | Towards a Semantic Theory of CML (Extended Abstract). | William Ferreira, Matthew Hennessy |
| 1994 | ICALP | Higher-Order Process and Their Models. | Matthew Hennessy |
| 1993 | CAV | A Modal Logic for Message passing Processes (Extended Abstract). | Matthew Hennessy, Xinxin Liu |
| 1993 | CONCUR | Proof Systems for Message-Passing Process Algebras. | Matthew Hennessy, Huimin Lin |
| 1993 | LICS | A Fully Abstract Denotational Model for Higher-Order Processes (Extended Abstract) | Matthew Hennessy |
| 1993 | MFCS | Symbolic Bisimulations (Abstract). | Matthew Hennessy |
| 1992 | CONCUR | A Theory of Process with Localities (Extended Abstract). | Grard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn |
| 1992 | CONCUR | Concurrent Testing of Processes (Extended Abstract). | Matthew Hennessy |
| 1991 | ICALP | Adding Action Refinement to a Finite Process Algebra. | Luca Aceto, Matthew Hennessy |
| 1991 | MFCS | Observing Localities (Extended Abstract). | Grard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn |
| 1990 | CONCUR | Value-Passing in Process Algebras (Abstract). | Matthew Hennessy |
| 1990 | FORTE | A Temporal Process Algebra. | Matthew Hennessy, Tim Regan |
| 1990 | ICALP | A Theory of Communicating Processes with Value-Passing. | Matthew Hennessy, Anna Inglfsdttir |
| 1989 | LICS | Towards Action-Refinement in Process Algebras | Luca Aceto, Matthew Hennessy |
| 1989 | MFPS | Termination, Deadlock and Divergence. | Luca Aceto, Matthew Hennessy |
| 1988 | LICS | Priorities in Process Algebras | Rance Cleaveland, Matthew Hennessy |
| 1985 | ICALP | An Algebraic Theory of Fair Asynchronous Communicating Processes. | Matthew Hennessy |
| 1984 | MFCS | The Power of the Future Perfect in Program Logics. | Matthew Hennessy, Colin Stirling |
| 1984 | STOC | Modelling Fair Processes | Matthew Hennessy |
| 1983 | ICALP | Testing Equivalence for Processes. | Rocco De Nicola, Matthew Hennessy |
| 1981 | ICDCS | A First Attempt at Translating CSP into CCS. | Matthew Hennessy, Wei Li, Gordon D. Plotkin |
| 1980 | ICALP | On Observing Nondeterminism and Concurrency. | Matthew Hennessy, Robin Milner |
| 1980 | MFCS | A Term Model for CCS. | Matthew Hennessy, Gordon D. Plotkin |
| 1979 | MFCS | Full Abstraction for a Simple Parallel Programming Language. | Matthew Hennessy, Gordon D. Plotkin |
| 1977 | STOC | Parameter-Passing Mechanisms and Nondeterminism | Matthew Hennessy, Edward A. Ashcroft |
| 1976 | ICALP | The Semantics of Nondeterminism. | Matthew Hennessy, Edward A. Ashcroft |