Matthew Hennessy

Publication Activity (10 Years)

Years Active: 1976-2019
Publications (10 Years): 9

Top Venues

Log. Methods Comput. Sci.

CONCUR

Inf. Comput.

FoSSaCS

Publications

Matthew Hennessy
An Equational Characterisation of the Must Testing Pre-order for Regular Processes. Models, Languages, and Tools for Concurrent and Distributed Programming (2019)
Vasileios Koutavas, Maciej Gazda, Matthew Hennessy
Distinguishing between communicating transactions. Inf. Comput. 259 (1) (2018)
Matthew Hennessy
A Coinductive Equational Characterisation of Trace Inclusion for Regular Processes. Models, Algorithms, Logics and Tools (2017)
Vasileios Koutavas, Maciej Gazda, Matthew Hennessy
Distinguishing between Communicating Transactions. CoRR (2017)
Giovanni Bernardi, Matthew Hennessy
Using higher-order contracts to model session types. Log. Methods Comput. Sci. 12 (2) (2016)
Giovanni Tito Bernardi, Matthew Hennessy
Modelling session types using contracts. Math. Struct. Comput. Sci. 26 (3) (2016)
Andrea Cerone, Matthew Hennessy, Massimo Merro
Modelling MAC-Layer Communications in Wireless Systems. Log. Methods Comput. Sci. 11 (1) (2015)
Giovanni Bernardi, Matthew Hennessy
Mutually Testing Processes. Log. Methods Comput. Sci. 11 (2) (2015)
Matthew Hennessy
Behavioural Equivalences for Co-operating Transactions (Invited Paper). CONCUR (2015)
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan
Real-reward testing for probabilistic processes. Theor. Comput. Sci. 538 (2014)
Vasileios Koutavas, Carlo Spaccasassi, Matthew Hennessy
Bisimulations for Communicating Transactions - (Extended Abstract). FoSSaCS (2014)
Giovanni Bernardi, Matthew Hennessy
Using Higher-Order Contracts to Model Session Types (Extended Abstract). CONCUR (2014)
Adrian Francalanza, Edsko de Vries, Matthew Hennessy
Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency. Log. Methods Comput. Sci. 10 (2) (2014)
Andrea Cerone, Matthew Hennessy
Characterising Testing Preorders for Broadcasting Distributed Systems. TGC (2014)
Edsko de Vries, Adrian Francalanza, Matthew Hennessy
Uniqueness typing for resource management in message-passing concurrency. J. Log. Comput. 24 (3) (2014)
Andrea Cerone, Matthew Hennessy
Modelling Probabilistic Wireless Networks. Log. Methods Comput. Sci. 9 (3) (2013)
Giovanni Bernardi, Matthew Hennessy
Mutually Testing Processes - (Extended Abstract). CONCUR (2013)
Yuxin Deng, Matthew Hennessy
Compositional reasoning for weighted Markov decision processes. Sci. Comput. Program. 78 (12) (2013)
Vasileios Koutavas, Matthew Hennessy
Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract). CONCUR (2013)
Andrea Cerone, Matthew Hennessy, Massimo Merro
Modelling MAC-Layer Communications in Wireless Systems. COORDINATION (2013)
Giovanni Bernardi, Matthew Hennessy
Compliance and Testing Preorders Differ. SEFM Workshops (2013)
Yuxin Deng, Matthew Hennessy
On the semantics of Markov automata. Inf. Comput. 222 (2013)
Giovanni Bernardi, Matthew Hennessy
Modelling session types using contracts. SAC (2012)
Vasileios Koutavas, Matthew Hennessy
First-order reasoning for higher-order concurrency. Comput. Lang. Syst. Struct. 38 (3) (2012)
Andrea Cerone, Matthew Hennessy
Modelling Probabilistic Wireless Networks - (Extended Abstract). FMOODS/FORTE (2012)
Matthew Hennessy
Exploring probabilistic bisimulations, part I. Formal Aspects Comput. 24 (4-6) (2012)
Matthew Hennessy
A calculus for costed computations Log. Methods Comput. Sci. 7 (1) (2011)
Yuxin Deng, Matthew Hennessy
On the Semantics of Markov Automata. ICALP (2) (2011)
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan
Real-Reward Testing for Probabilistic Processes (Extended Abstract) QAPL (2011)
Yuxin Deng, Matthew Hennessy
Compositional Reasoning for Markov Decision Processes - (Extended Abstract). FSEN (2011)
Vasileios Koutavas, Matthew Hennessy
A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract). ESOP (2011)
Andrea Cerone, Matthew Hennessy
Process Behaviour: Formulae vs. Tests (Extended Abstract) EXPRESS (2010)
Edsko de Vries, Vasileios Koutavas, Matthew Hennessy
Communicating Transactions - (Extended Abstract). CONCUR (2010)
Edsko de Vries, Vasileios Koutavas, Matthew Hennessy
Liveness of Communicating Transactions (Extended Abstract). APLAS (2010)
Matthew Hennessy, Bartek Klin
Preface. Electron. Notes Theor. Comput. Sci. 229 (4) (2009)
Matthew Hennessy
Distributed Systems and Their Environments. TAMC (2009)
Edsko de Vries, Adrian Francalanza, Matthew Hennessy
Uniqueness Typing for Resource Management in Message-Passing Concurrency LINEARITY (2009)
Matthew Hennessy, Manish Gaur
Counting the Cost in the Picalculus (Extended Abstract). Electron. Notes Theor. Comput. Sci. 229 (3) (2009)
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan
Testing Finitary Probabilistic Processes. CONCUR (2009)
Yuxin Deng, Matthew Hennessy, Rob J. van Glabbeek, Carroll Morgan
Characterising Testing Preorders for Finite Probabilistic Processes CoRR (2008)
Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Mogens Nielsen, Glynn Winskel
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra. Concurrency, Graphs and Models (2008)
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan
Characterising Testing Preorders for Finite Probabilistic Processes. Log. Methods Comput. Sci. 4 (4) (2008)
Adrian Francalanza, Matthew Hennessy
A theory of system behaviour in the presence of node and link failure. Inf. Comput. 206 (6) (2008)
Samuel Hym, Matthew Hennessy
Adding recursion to Dpi. Theor. Comput. Sci. 373 (3) (2007)
Adrian Francalanza, Matthew Hennessy
A theory for observational fault tolerance. J. Log. Algebraic Methods Program. 73 (1-2) (2007)
Rob J. van Glabbeek, Matthew Hennessy
Preface. Electron. Notes Theor. Comput. Sci. 192 (1) (2007)
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
Remarks on Testing Probabilistic Processes. Electron. Notes Theor. Comput. Sci. 172 (2007)
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
Characterising Testing Preorders for Finite Probabilistic Processes. LICS (2007)
Adrian Francalanza, Matthew Hennessy
A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract). ESOP (2007)
Adrian Francalanza, Matthew Hennessy
A Theory for Observational Fault Tolerance. FoSSaCS (2006)
Daniele Gorla, Matthew Hennessy, Vladimiro Sassone
Inferring dynamic credentials for rôle-based trust management. PPDP (2006)
Samuel Hym, Matthew Hennessy
Adding Recursion to Dpi: (Extended Abstract). Electron. Notes Theor. Comput. Sci. 156 (1) (2006)
Massimo Merro, Matthew Hennessy
A bisimulation-based semantic theory of Safe Ambients. ACM Trans. Program. Lang. Syst. 28 (2) (2006)
Alberto Ciaffaglione, Matthew Hennessy, Julian Rathke
Proof Methodologies for Behavioural Equivalence in DPI. FORTE (2005)
Daniele Gorla, Matthew Hennessy, Vladimiro Sassone
Security Policies as Membranes in Systems for Global Computing. Electron. Notes Theor. Comput. Sci. 138 (1) (2005)
Daniele Gorla, Matthew Hennessy, Vladimiro Sassone
Security Policies as Membranes in Systems for Global Computing. Log. Methods Comput. Sci. 1 (3) (2005)
Matthew Hennessy, Julian Rathke, Nobuko Yoshida
safeDpi: a language for controlling mobile code. Acta Informatica 42 (4-5) (2005)
Matthew Hennessy
The security pi-calculus and non-interference. J. Log. Algebraic Methods Program. 63 (1) (2005)
Daniele Gorla, Matthew Hennessy, Vladimiro Sassone
Security Policies as Membranes in Systems for Global Computing CoRR (2005)
Adrian Francalanza, Matthew Hennessy
A Theory of System Behaviour in the Presence of Node and Link Failures. CONCUR (2005)
Stephan J. Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo
Preface. Theor. Comput. Sci. 312 (1) (2004)
Matthew Hennessy, Julian Rathke
Typed behavioural equivalences for processes in the presence of subtyping. Math. Struct. Comput. Sci. 14 (5) (2004)
Matthew Hennessy, Massimo Merro, Julian Rathke
Towards a behavioural theory of access and mobility control in distributed systems. Theor. Comput. Sci. 322 (3) (2004)
Matthew Hennessy, Julian Rathke, Nobuko Yoshida
safeDpi: A Language for Controlling Mobile Code. FoSSaCS (2004)
James Riely, Matthew Hennessy
Trust and Partial Typing in Open Systems of Mobile Agents. J. Autom. Reason. 31 (3-4) (2003)
Matthew Hennessy, Massimo Merro, Julian Rathke
Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. FoSSaCS (2003)
Matthew Hennessy
The Security Picalculus and Non-interference (Extended Abstract). MFPS (2003)
Matthew Hennessy
A fully abstract denotational semantics for the pi-calculus. Theor. Comput. Sci. 278 (1-2) (2002)
Nobuko Yoshida, Matthew Hennessy
Assigning Types to Processes. Inf. Comput. 174 (2) (2002)
Massimo Merro, Matthew Hennessy
Bisimulation congruences in safe ambients. POPL (2002)
Matthew Hennessy, Julian Rathke
Typed behavioural equivalences for processes in the presence of subtyping. Electron. Notes Theor. Comput. Sci. 61 (2002)
Matthew Hennessy, James Riely
Information flow vs. resource access in the asynchronous pi-calculus. ACM Trans. Program. Lang. Syst. 24 (5) (2002)
Matthew Hennessy, James Riely
Resource Access Control in Systems of Mobile Agents. Inf. Comput. 173 (1) (2002)
Matthew Hennessy, Huimin Lin, Julian Rathke
Unique fixpoint induction for message-passing process calculi. Sci. Comput. Program. 41 (3) (2001)
James Riely, Matthew Hennessy
Distributed processes and location failures. Theor. Comput. Sci. 266 (1-2) (2001)
Matthew Hennessy, James Riely
Information Flow vs. Resource Access in the Asynchronous Pi-Calculus. ICALP (2000)
Nobuko Yoshida, Matthew Hennessy
Assigning Types to Processes. LICS (2000)
William Ferreira, Matthew Hennessy, Alan Jeffrey
Combining the typed lambda-calculus with CCS. Proof, Language, and Interaction (2000)
Matthew Hennessy
Proof Systems for Message-Passing Process Calculi. IFM (1999)
Nobuko Yoshida, Matthew Hennessy
Suptyping and Locality in Distributed Higher Order Processes (extended abstract). CONCUR (1999)
Matthew Hennessy
Axiomatising Asynchronous Process Calculi (abstract). FCT (1999)
Matthew Hennessy, James Riely
Type-Safe Execution of Mobile Agents in Anonymous Networks. Secure Internet Programming (1999)
William Ferreira, Matthew Hennessy
A Behavioural Theory of First-Order CML. Theor. Comput. Sci. 216 (1-2) (1999)
James Riely, Matthew Hennessy
Trust and Partial Typing in Open Systems of Mobile Agents. POPL (1999)
James Riely, Matthew Hennessy
A Typed Language for Distributed Mobile Processes (Extended Abstract). POPL (1998)
Matthew Hennessy, Julian Rathke
Bisimulations for a Calculus of Broadcasting Systems. Theor. Comput. Sci. 200 (1-2) (1998)
William Ferreira, Matthew Hennessy, Alan Jeffrey
A Theory of Weak Bisimulation for Core CML. J. Funct. Program. 8 (5) (1998)
Matthew Hennessy, James Riely
Resource Access Control in Systems of Mobile Agents. Electron. Notes Theor. Comput. Sci. 16 (3) (1998)
Matthew Hennessy
A survey of location calculi. EXPRESS (1998)
Matthew Hennessy
Process Calculi for describing distributed systems. J. Comput. Sci. Technol. 13 (6) (1998)
Matthew Hennessy, James Riely
Type-Safe Execution of Mobile Agents in Anonymous Networks. ECOOP Workshops (1998)
Pierre-Louis Curien, Matthew Hennessy, Huimin Lin
Preface. J. Comput. Sci. Technol. 13 (6) (1998)
Chrysafis Hartonas, Matthew Hennessy
Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing. Inf. Comput. 145 (1) (1998)
Ilaria Castellani, Matthew Hennessy
Testing Theories for Asynchronous Languages. FSTTCS (1998)
Chrysafis Hartonas, Matthew Hennessy
Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract). CSL (1997)
James Riely, Matthew Hennessy
Distributed Processes and Location Failures (Extended Abstract). ICALP (1997)
Julian Rathke, Matthew Hennessy
Local Model Checking for Value-Passing Processes (Extended Abstract). TACS (1997)
Astrid Kiehn, Matthew Hennessy
On the Decidability of Non-Interleaving Process Equivalences. Fundam. Informaticae 30 (1) (1997)
William Ferreira, Matthew Hennessy, Alan Jeffrey
A Theory of Weak Bisimulation for Core CML. ICFP (1996)
Matthew Hennessy, Huimin Lin
Proof Systems for Message-Passing Process Algebras. Formal Aspects Comput. 8 (4) (1996)

Matthew Hennessy.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Matthew Hennessy