Matthew Hennessy

According to our database, Matthew Hennessy authored at least 140 papers between 1976 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2019

An Equational Characterisation of the Must Testing Pre-order for Regular Processes.

Matthew Hennessy

Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

2018

Distinguishing between communicating transactions.

Vasileios Koutavas, Maciej Gazda, Matthew Hennessy

Inf. Comput., 2018

2017

A Coinductive Equational Characterisation of Trace Inclusion for Regular Processes.

Matthew Hennessy

Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016

Modelling session types using contracts.

Giovanni Tito Bernardi, Matthew Hennessy

Math. Struct. Comput. Sci., 2016

Using higher-order contracts to model session types.

Giovanni Bernardi, Matthew Hennessy

Log. Methods Comput. Sci., 2016

2015

Modelling MAC-Layer Communications in Wireless Systems.

Andrea Cerone, Matthew Hennessy, Massimo Merro

Log. Methods Comput. Sci., 2015

Mutually Testing Processes.

Giovanni Bernardi, Matthew Hennessy

Log. Methods Comput. Sci., 2015

Behavioural Equivalences for Co-operating Transactions (Invited Paper).

Matthew Hennessy

Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014

Real-reward testing for probabilistic processes.

Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan

Theor. Comput. Sci., 2014

Uniqueness typing for resource management in message-passing concurrency.

Edsko de Vries, Adrian Francalanza, Matthew Hennessy

J. Log. Comput., 2014

Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency.

Adrian Francalanza, Edsko de Vries, Matthew Hennessy

Log. Methods Comput. Sci., 2014

Characterising Testing Preorders for Broadcasting Distributed Systems.

Andrea Cerone, Matthew Hennessy

Proceedings of the Trustworthy Global Computing - 9th International Symposium, 2014

Bisimulations for Communicating Transactions - (Extended Abstract).

Vasileios Koutavas, Carlo Spaccasassi, Matthew Hennessy

Proceedings of the Foundations of Software Science and Computation Structures, 2014

Using Higher-Order Contracts to Model Session Types (Extended Abstract).

Giovanni Bernardi, Matthew Hennessy

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013

Compositional reasoning for weighted Markov decision processes.

Yuxin Deng, Matthew Hennessy

Sci. Comput. Program., 2013

On the semantics of Markov automata.

Yuxin Deng, Matthew Hennessy

Inf. Comput., 2013

Modelling Probabilistic Wireless Networks.

Andrea Cerone, Matthew Hennessy

Log. Methods Comput. Sci., 2013

Compliance and Testing Preorders Differ.

Giovanni Bernardi, Matthew Hennessy

Proceedings of the Software Engineering and Formal Methods, 2013

Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract).

Vasileios Koutavas, Matthew Hennessy

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

Mutually Testing Processes - (Extended Abstract).

Giovanni Bernardi, Matthew Hennessy

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012

Exploring probabilistic bisimulations, part I.

Matthew Hennessy

Formal Aspects Comput., 2012

First-order reasoning for higher-order concurrency.

Vasileios Koutavas, Matthew Hennessy

Comput. Lang. Syst. Struct., 2012

Modelling Probabilistic Wireless Networks - (Extended Abstract).

Andrea Cerone, Matthew Hennessy

Proceedings of the Formal Techniques for Distributed Systems, 2012

2011

Real-Reward Testing for Probabilistic Processes (Extended Abstract)

Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan

Proceedings of the Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages, 2011

A calculus for costed computations

Matthew Hennessy

Log. Methods Comput. Sci., 2011

Compositional Reasoning for Markov Decision Processes - (Extended Abstract).

Yuxin Deng, Matthew Hennessy

Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract).

Vasileios Koutavas, Matthew Hennessy

Proceedings of the Programming Languages and Systems, 2011

2010

Process Behaviour: Formulae vs. Tests (Extended Abstract)

Andrea Cerone, Matthew Hennessy

Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

Communicating Transactions - (Extended Abstract).

Edsko de Vries, Vasileios Koutavas, Matthew Hennessy

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Liveness of Communicating Transactions (Extended Abstract).

Edsko de Vries, Vasileios Koutavas, Matthew Hennessy

Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

2009

Distributed Systems and Their Environments.

Matthew Hennessy

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Testing Finitary Probabilistic Processes.

Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008

Characterising Testing Preorders for Finite Probabilistic Processes.

Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan

Log. Methods Comput. Sci., 2008

A theory of system behaviour in the presence of node and link failure.

Adrian Francalanza, Matthew Hennessy

Inf. Comput., 2008

Preface.

Matthew Hennessy, Bartek Klin

Proceedings of the Fifth Workshop on Structural Operational Semantics, 2008

Counting the Cost in the Picalculus (Extended Abstract).

Matthew Hennessy, Manish Gaur

Proceedings of the First Interaction and Concurrency Experiences Workshop, 2008

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

Proceedings of the Concurrency, 2008

2007

Adding recursion to Dpi.

Samuel Hym, Matthew Hennessy

Theor. Comput. Sci., 2007

A theory for observational fault tolerance.

Adrian Francalanza, Matthew Hennessy

J. Log. Algebraic Methods Program., 2007

Preface.

Rob J. van Glabbeek, Matthew Hennessy

Proceedings of the Fourth Workshop on Structural Operational Semantics, 2007

Remarks on Testing Probabilistic Processes.

Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang

Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Characterising Testing Preorders for Finite Probabilistic Processes.

Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract).

Adrian Francalanza, Matthew Hennessy

Proceedings of the Programming Languages and Systems, 2007

A distributed Pi-calculus.

Matthew Hennessy

Cambridge University Press, 2007

2006

A bisimulation-based semantic theory of Safe Ambients.

Massimo Merro, Matthew Hennessy

ACM Trans. Program. Lang. Syst., 2006

Inferring dynamic credentials for rôle-based trust management.

Daniele Gorla, Matthew Hennessy, Vladimiro Sassone

Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2006

2005

The security pi-calculus and non-interference.

Matthew Hennessy

J. Log. Algebraic Methods Program., 2005

Adding Recursion to Dpi: (Extended Abstract).

Samuel Hym, Matthew Hennessy

Proceedings of the Second Workshop on Structural Operational Semantics, 2005

safeDpi: a language for controlling mobile code.

Matthew Hennessy, Julian Rathke, Nobuko Yoshida

Acta Informatica, 2005

Proof Methodologies for Behavioural Equivalence in DPI.

Alberto Ciaffaglione, Matthew Hennessy, Julian Rathke

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

A Theory of System Behaviour in the Presence of Node and Link Failures.

Adrian Francalanza, Matthew Hennessy

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004

Towards a behavioural theory of access and mobility control in distributed systems.

Matthew Hennessy, Massimo Merro, Julian Rathke

Theor. Comput. Sci., 2004

Preface.

Stephan J. Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo

Theor. Comput. Sci., 2004

Security Policies as Membranes in Systems for Global Computing.

Daniele Gorla, Matthew Hennessy, Vladimiro Sassone

Proceedings of the Workshop 3rd on the Foundations of Global Ubiquitous Computing, 2004

2003

Trust and Partial Typing in Open Systems of Mobile Agents.

James Riely, Matthew Hennessy

J. Autom. Reason., 2003

The Security Picalculus and Non-interference (Extended Abstract).

Matthew Hennessy

Proceedings of 19th Conference on the Mathematical Foundations of Programming Semantics, 2003

2002

Information flow vs. resource access in the asynchronous pi-calculus.

Matthew Hennessy, James Riely

ACM Trans. Program. Lang. Syst., 2002

A fully abstract denotational semantics for the pi-calculus.

Matthew Hennessy

Theor. Comput. Sci., 2002

Assigning Types to Processes.

Nobuko Yoshida, Matthew Hennessy

Inf. Comput., 2002

Typed behavioural equivalences for processes in the presence of subtyping.

Matthew Hennessy, Julian Rathke

Proceedings of the Computing: the Australasian Theory Symposium, 2002

Bisimulation congruences in safe ambients.

Massimo Merro, Matthew Hennessy

Proceedings of the Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002

2001

Distributed processes and location failures.

James Riely, Matthew Hennessy

Theor. Comput. Sci., 2001

Unique fixpoint induction for message-passing process calculi.

Matthew Hennessy, Huimin Lin, Julian Rathke

Sci. Comput. Program., 2001

2000

Combining the typed lambda-calculus with CCS.

William Ferreira, Matthew Hennessy, Alan Jeffrey

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999

A Behavioural Theory of First-Order CML.

William Ferreira, Matthew Hennessy

Theor. Comput. Sci., 1999

Proof Systems for Message-Passing Process Calculi.

Matthew Hennessy

Proceedings of the Integrated Formal Methods, 1999

Axiomatising Asynchronous Process Calculi (abstract).

Matthew Hennessy

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Suptyping and Locality in Distributed Higher Order Processes (extended abstract).

Nobuko Yoshida, Matthew Hennessy

Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998

Bisimulations for a Calculus of Broadcasting Systems.

Matthew Hennessy, Julian Rathke

Theor. Comput. Sci., 1998

A Theory of Weak Bisimulation for Core CML.

William Ferreira, Matthew Hennessy, Alan Jeffrey

J. Funct. Program., 1998

Process Calculi for describing distributed systems.

Matthew Hennessy

J. Comput. Sci. Technol., 1998

Preface.

Pierre-Louis Curien, Matthew Hennessy, Huimin Lin

J. Comput. Sci. Technol., 1998

Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing.

Chrysafis Hartonas, Matthew Hennessy

Inf. Comput., 1998

Resource Access Control in Systems of Mobile Agents.

Matthew Hennessy, James Riely

Proceedings of the 3rd International Workshop on High-Level Concurrent Languages, 1998

A survey of location calculi.

Matthew Hennessy

Proceedings of the Fifth International Workshop on Expressiveness in Concurrency, 1998

A Typed Language for Distributed Mobile Processes (Extended Abstract).

James Riely, Matthew Hennessy

Proceedings of the POPL '98, 1998

Testing Theories for Asynchronous Languages.

Ilaria Castellani, Matthew Hennessy

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

Type-Safe Execution of Mobile Agents in Anonymous Networks.

Matthew Hennessy, James Riely

Proceedings of the Object-Oriented Technology, ECOOP'98 Workshop Reader, 1998

1997

On the Decidability of Non-Interleaving Process Equivalences.

Astrid Kiehn, Matthew Hennessy

Fundam. Informaticae, 1997

Local Model Checking for Value-Passing Processes (Extended Abstract).

Julian Rathke, Matthew Hennessy

Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

Distributed Processes and Location Failures (Extended Abstract).

James Riely, Matthew Hennessy

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract).

Chrysafis Hartonas, Matthew Hennessy

Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1996

Proof Systems for Message-Passing Process Algebras.

Matthew Hennessy, Huimin Lin

Formal Aspects Comput., 1996

1995

A Process Algebra for Timed Systems

Matthew Hennessy, Tim Regan

Inf. Comput., March, 1995

Symbolic Bisimulations.

Matthew Hennessy, Huimin Lin

Theor. Comput. Sci., 1995

A Modal Logic for Message Passing Processes.

Matthew Hennessy, Xinxin Liu

Acta Informatica, 1995

Concurrent Testing of Processes.

Matthew Hennessy

Acta Informatica, 1995

Towards a Semantic Theory of CML (Extended Abstract).

William Ferreira, Matthew Hennessy

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994

Adding Action Refinement to a Finite Process Algebra

Luca Aceto, Matthew Hennessy

Inf. Comput., December, 1994

A Fully Abstract Denotational Model for Higher-Order Processes

Matthew Hennessy

Inf. Comput., July, 1994

A Theory of Processes with Localities.

Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn

Formal Aspects Comput., 1994

Higher-Order Process and Their Models.

Matthew Hennessy

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

A Theory of Communicating Processes with Value Passing

Matthew Hennessy, Anna Ingólfsdóttir

Inf. Comput., December, 1993

Towards Action-Refinement in Process Algebras

Luca Aceto, Matthew Hennessy

Inf. Comput., April, 1993

Observing Localities.

Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn

Theor. Comput. Sci., 1993

Communicating Processes with Value-passing and Assignments.

Matthew Hennessy, Anna Ingólfsdóttir

Formal Aspects Comput., 1993

Testing Equivalence as a Bisimulation Equivalence.

Rance Cleaveland, Matthew Hennessy

Formal Aspects Comput., 1993

Symbolic Bisimulations (Abstract).

Matthew Hennessy

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

A Fully Abstract Denotational Model for Higher-Order Processes (Extended Abstract)

Matthew Hennessy

Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

A Modal Logic for Message passing Processes (Extended Abstract).

Matthew Hennessy, Xinxin Liu

Proceedings of the Computer Aided Verification, 5th International Conference, 1993

1992

Termination, Deadlock, and Divergence.

Luca Aceto, Matthew Hennessy

J. ACM, 1992

An Efficiency Preorder for Processes.

S. Arun-Kumar, Matthew Hennessy

Acta Informatica, 1992

Timed Process Algebras: A Tutorial.

Matthew Hennessy

Proceedings of the Program Design Calculi, Proceedings of the NATO Advanced Study Institute on Program Design Calculi, Marktoberdorf, Germany, July 28, 1992

Concurrent Testing of Processes (Extended Abstract).

Matthew Hennessy

Proceedings of the CONCUR '92, 1992

A Theory of Process with Localities (Extended Abstract).

Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn

Proceedings of the CONCUR '92, 1992

1991

A Proof Sustem for Communicating Processes with Value-Passing.

Matthew Hennessy

Formal Aspects Comput., 1991

Observing Localities (Extended Abstract).

Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990

Priorities in Process Algebras

Rance Cleaveland, Matthew Hennessy

Inf. Comput., 1990

A Temporal Process Algebra.

Matthew Hennessy, Tim Regan

Proceedings of the Formal Description Techniques, 1990

Value-Passing in Process Algebras (Abstract).

Matthew Hennessy

Proceedings of the CONCUR '90, 1990

Semantics of programming languages - an elementary introduction using structural operational semantics.

Matthew Hennessy

Wiley, ISBN: 978-0-471-92772-3, 1990

1989

Distributed bisimulations.

Ilaria Castellani, Matthew Hennessy

J. ACM, 1989

A Proof System for Communicating Processes with Value-passing (Extended Abstract).

Matthew Hennessy

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

1988

Axiomatising Finite Concurrent Processes.

Matthew Hennessy

SIAM J. Comput., 1988

Observing processes.

Matthew Hennessy

Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

Algebraic theory of processes.

Matthew Hennessy

MIT Press series in the foundations of computing, MIT Press, ISBN: 978-0-262-08171-9, 1988

1987

An Algebraic Theory of Fair Synchronous Communicating Processes.

Matthew Hennessy

Theor. Comput. Sci., 1987

CCS without tau's.

Rocco De Nicola, Matthew Hennessy

Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

1986

Proving Systolic Systems Correct.

Matthew Hennessy

ACM Trans. Program. Lang. Syst., 1986

Communication Primitives in Programming and Specification Languages.

Matthew Hennessy

Proceedings of the Networking in Open Systems, 1986

1985

Acceptance Trees

Matthew Hennessy

J. ACM, October, 1985

Algebraic Laws for Nondeterminism and Concurrency

Matthew Hennessy, Robin Milner

J. ACM, January, 1985

The Power of the Future Perfect in Program Logics

Matthew Hennessy, Colin Stirling

Inf. Control., 1985

An Algebraic Theory of Fair Asynchronous Communicating Processes.

Matthew Hennessy

Proceedings of the Automata, 1985

1984

Testing Equivalences for Processes.

Rocco De Nicola, Matthew Hennessy

Theor. Comput. Sci., 1984

Axiomatising Finite Delay Operators.

Matthew Hennessy

Acta Informatica, 1984

Modelling Fair Processes

Matthew Hennessy

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

Synchronous and Asynchronous Experiments on Processes

Matthew Hennessy

Inf. Control., 1983

Testing Equivalence for Processes.

Rocco De Nicola, Matthew Hennessy

Proceedings of the Automata, 1983

1982

Powerdomains and nondeterministic recursive definitions.

Matthew Hennessy

Proceedings of the International Symposium on Programming, 1982

1981

A Term Model for Synchronous Processes

Matthew Hennessy

Inf. Control., October, 1981

A First Attempt at Translating CSP into CCS.

Matthew Hennessy, Wei Li, Gordon D. Plotkin

Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981

1980

A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus.

Matthew Hennessy, Edward A. Ashcroft

Theor. Comput. Sci., 1980

The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment.

Matthew Hennessy

SIAM J. Comput., 1980

A Proof System for the First-Order Relational Calculus.

Matthew Hennessy

J. Comput. Syst. Sci., 1980

A Term Model for CCS.

Matthew Hennessy, Gordon D. Plotkin

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

On Observing Nondeterminism and Concurrency.

Matthew Hennessy, Robin Milner

Proceedings of the Automata, 1980

1979

Full Abstraction for a Simple Parallel Programming Language.

Matthew Hennessy, Gordon D. Plotkin

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1977

Parameter-Passing Mechanisms and Nondeterminism

Matthew Hennessy, Edward A. Ashcroft

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

1976

The Semantics of Nondeterminism.

Matthew Hennessy, Edward A. Ashcroft

Proceedings of the Third International Colloquium on Automata, 1976