Matthew Hennessy

According to our database1, Matthew Hennessy authored at least 167 papers between 1976 and 2018.

Collaborative distances :
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Distinguishing between communicating transactions.
Inf. Comput., 2018

2017
Distinguishing between Communicating Transactions.
CoRR, 2017

A Coinductive Equational Characterisation of Trace Inclusion for Regular Processes.
Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016
Modelling session types using contracts.
Mathematical Structures in Computer Science, 2016

Using higher-order contracts to model session types.
Logical Methods in Computer Science, 2016

2015
Modelling MAC-Layer Communications in Wireless Systems.
Logical Methods in Computer Science, 2015

Mutually Testing Processes.
Logical Methods in Computer Science, 2015

Behavioural Equivalences for Co-operating Transactions (Invited Paper).
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Real-reward testing for probabilistic processes.
Theor. Comput. Sci., 2014

Uniqueness typing for resource management in message-passing concurrency.
J. Log. Comput., 2014

Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency.
Logical Methods in Computer Science, 2014

Characterising Testing Preorders for Broadcasting Distributed Systems.
Proceedings of the Trustworthy Global Computing - 9th International Symposium, 2014

Bisimulations for Communicating Transactions - (Extended Abstract).
Proceedings of the Foundations of Software Science and Computation Structures, 2014

Using Higher-Order Contracts to Model Session Types (Extended Abstract).
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013
Compositional reasoning for weighted Markov decision processes.
Sci. Comput. Program., 2013

On the semantics of Markov automata.
Inf. Comput., 2013

Modelling Probabilistic Wireless Networks.
Logical Methods in Computer Science, 2013

Compliance and Testing Preorders Differ.
Proceedings of the Software Engineering and Formal Methods, 2013

Modelling MAC-Layer Communications in Wireless Systems.
Proceedings of the Coordination Models and Languages, 15th International Conference, 2013

Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract).
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

Mutually Testing Processes - (Extended Abstract).
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012
Exploring probabilistic bisimulations, part I.
Formal Asp. Comput., 2012

First-order reasoning for higher-order concurrency.
Computer Languages, Systems & Structures, 2012

Modelling session types using contracts.
Proceedings of the ACM Symposium on Applied Computing, 2012

Modelling Probabilistic Wireless Networks - (Extended Abstract).
Proceedings of the Formal Techniques for Distributed Systems, 2012

2011
Real-Reward Testing for Probabilistic Processes (Extended Abstract)
Proceedings of the Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages, 2011

A calculus for costed computations
Logical Methods in Computer Science, 2011

On the Semantics of Markov Automata.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Compositional Reasoning for Markov Decision Processes - (Extended Abstract).
Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract).
Proceedings of the Programming Languages and Systems, 2011

2010
Process Behaviour: Formulae vs. Tests (Extended Abstract)
Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

Communicating Transactions - (Extended Abstract).
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Liveness of Communicating Transactions (Extended Abstract).
Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

2009
Preface.
Electr. Notes Theor. Comput. Sci., 2009

Counting the Cost in the Picalculus (Extended Abstract).
Electr. Notes Theor. Comput. Sci., 2009

Uniqueness Typing for Resource Management in Message-Passing Concurrency
Proceedings of the Proceedings First International Workshop on Linearity, 2009

Distributed Systems and Their Environments.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Testing Finitary Probabilistic Processes.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Characterising Testing Preorders for Finite Probabilistic Processes.
Logical Methods in Computer Science, 2008

A theory of system behaviour in the presence of node and link failure.
Inf. Comput., 2008

Characterising Testing Preorders for Finite Probabilistic Processes
CoRR, 2008

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra.
Proceedings of the Concurrency, 2008

2007
Adding recursion to Dpi.
Theor. Comput. Sci., 2007

A theory for observational fault tolerance.
J. Log. Algebr. Program., 2007

Preface.
Electr. Notes Theor. Comput. Sci., 2007

Remarks on Testing Probabilistic Processes.
Electr. Notes Theor. Comput. Sci., 2007

Characterising Testing Preorders for Finite Probabilistic Processes.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract).
Proceedings of the Programming Languages and Systems, 2007

A distributed Pi-calculus.
Cambridge University Press, 2007

2006
A bisimulation-based semantic theory of Safe Ambients.
ACM Trans. Program. Lang. Syst., 2006

Adding Recursion to Dpi: (Extended Abstract).
Electr. Notes Theor. Comput. Sci., 2006

Inferring dynamic credentials for rôle-based trust management.
Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2006

A Theory for Observational Fault Tolerance.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005
Security Policies as Membranes in Systems for Global Computing.
Logical Methods in Computer Science, 2005

The security pi-calculus and non-interference.
J. Log. Algebr. Program., 2005

Security Policies as Membranes in Systems for Global Computing.
Electr. Notes Theor. Comput. Sci., 2005

Security Policies as Membranes in Systems for Global Computing
CoRR, 2005

safeDpi: a language for controlling mobile code.
Acta Inf., 2005

Proof Methodologies for Behavioural Equivalence in DPI.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

A Theory of System Behaviour in the Presence of Node and Link Failures.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
Towards a behavioural theory of access and mobility control in distributed systems.
Theor. Comput. Sci., 2004

Preface.
Theor. Comput. Sci., 2004

Typed behavioural equivalences for processes in the presence of subtyping.
Mathematical Structures in Computer Science, 2004

safeDpi: A Language for Controlling Mobile Code.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003
Trust and Partial Typing in Open Systems of Mobile Agents.
J. Autom. Reasoning, 2003

Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002
Information flow vs. resource access in the asynchronous pi-calculus.
ACM Trans. Program. Lang. Syst., 2002

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

Assigning Types to Processes.
Inf. Comput., 2002

Resource Access Control in Systems of Mobile Agents.
Inf. Comput., 2002

Typed behavioural equivalences for processes in the presence of subtyping.
Electr. Notes Theor. Comput. Sci., 2002

Bisimulation congruences in safe ambients.
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.
Theor. Comput. Sci., 2001

Unique fixpoint induction for message-passing process calculi.
Sci. Comput. Program., 2001

2000
Assigning Types to Processes.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

Information Flow vs. Resource Access in the Asynchronous Pi-Calculus.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Combining the typed lambda-calculus with CCS.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999
A Behavioural Theory of First-Order CML.
Theor. Comput. Sci., 1999

Trust and Partial Typing in Open Systems of Mobile Agents.
Proceedings of the POPL '99, 1999

Proof Systems for Message-Passing Process Calculi.
Proceedings of the Integrated Formal Methods, 1999

Axiomatising Asynchronous Process Calculi (abstract).
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Type-Safe Execution of Mobile Agents in Anonymous Networks.
Proceedings of the Secure Internet Programming, 1999

Suptyping and Locality in Distributed Higher Order Processes (extended abstract).
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
Bisimulations for a Calculus of Broadcasting Systems.
Theor. Comput. Sci., 1998

A Theory of Weak Bisimulation for Core CML.
J. Funct. Program., 1998

Process Calculi for describing distributed systems.
J. Comput. Sci. Technol., 1998

Preface.
J. Comput. Sci. Technol., 1998

Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing.
Inf. Comput., 1998

Resource Access Control in Systems of Mobile Agents.
Electr. Notes Theor. Comput. Sci., 1998

A survey of location calculi.
Electr. Notes Theor. Comput. Sci., 1998

A Typed Language for Distributed Mobile Processes (Extended Abstract).
Proceedings of the POPL '98, 1998

Testing Theories for Asynchronous Languages.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

Type-Safe Execution of Mobile Agents in Anonymous Networks.
Proceedings of the Object-Oriented Technology, ECOOP'98 Workshop Reader, 1998

1997
On the Decidability of Non-Interleaving Process Equivalences.
Fundam. Inform., 1997

Local Model Checking for Value-Passing Processes (Extended Abstract).
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

Distributed Processes and Location Failures (Extended Abstract).
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).
Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1996
Proof Systems for Message-Passing Process Algebras.
Formal Asp. Comput., 1996

A Theory of Weak Bisimulation for Core CML.
Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, 1996

1995
A Process Algebra for Timed Systems
Inf. Comput., March, 1995

Symbolic Bisimulations.
Theor. Comput. Sci., 1995

A Modal Logic for Message Passing Processes.
Acta Inf., 1995

Concurrent Testing of Processes.
Acta Inf., 1995

Towards a Semantic Theory of CML (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Bisimulations for a Calculus of Broadcasting Systems.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

1994
Adding Action Refinement to a Finite Process Algebra
Inf. Comput., December, 1994

A Fully Abstract Denotational Model for Higher-Order Processes
Inf. Comput., July, 1994

A Theory of Processes with Localities.
Formal Asp. Comput., 1994

Higher-Order Process and Their Models.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
A Theory of Communicating Processes with Value Passing
Inf. Comput., December, 1993

Towards Action-Refinement in Process Algebras
Inf. Comput., April, 1993

Observing Localities.
Theor. Comput. Sci., 1993

Communicating Processes with Value-passing and Assignments.
Formal Asp. Comput., 1993

Testing Equivalence as a Bisimulation Equivalence.
Formal Asp. Comput., 1993

Symbolic Bisimulations (Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

A Fully Abstract Denotational Model for Higher-Order Processes (Extended Abstract)
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

Proof Systems for Message-Passing Process Algebras.
Proceedings of the CONCUR '93, 1993

A Modal Logic for Message passing Processes (Extended Abstract).
Proceedings of the Computer Aided Verification, 5th International Conference, 1993

1992
Termination, Deadlock, and Divergence.
J. ACM, 1992

An Efficiency Preorder for Processes.
Acta Inf., 1992

Timed Process Algebras: A Tutorial.
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).
Proceedings of the CONCUR '92, 1992

A Theory of Process with Localities (Extended Abstract).
Proceedings of the CONCUR '92, 1992

1991
A Proof Sustem for Communicating Processes with Value-Passing.
Formal Asp. Comput., 1991

An Efficiency Preorder for Processes.
Proceedings of the Theoretical Aspects of Computer Software, 1991

Observing Localities (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Adding Action Refinement to a Finite Process Algebra.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Priorities in Process Algebras
Inf. Comput., 1990

A Theory of Communicating Processes with Value-Passing.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

A Temporal Process Algebra.
Proceedings of the Formal Description Techniques, 1990

Value-Passing in Process Algebras (Abstract).
Proceedings of the CONCUR '90, 1990

Semantics of programming languages - an elementary introduction using structural operational semantics.
Wiley, ISBN: 978-0-471-92772-3, 1990

1989
Distributed bisimulations.
J. ACM, 1989

Termination, Deadlock and Divergence.
Proceedings of the Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29, 1989

Towards Action-Refinement in Process Algebras
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

A Proof System for Communicating Processes with Value-passing (Extended Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

Testing Equivalence as a Bisimulation Equivalence.
Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

1988
Axiomatising Finite Concurrent Processes.
SIAM J. Comput., 1988

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

Priorities in Process Algebras
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

Algebraic theory of processes.
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.
Theor. Comput. Sci., 1987

CCS without tau's.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

1986
Proving Systolic Systems Correct.
ACM Trans. Program. Lang. Syst., 1986

Communication Primitives in Programming and Specification Languages.
Proceedings of the Networking in Open Systems, 1986

1985
Acceptance Trees
J. ACM, October, 1985

Algebraic Laws for Nondeterminism and Concurrency
J. ACM, January, 1985

The Power of the Future Perfect in Program Logics
Information and Control, 1985

An Algebraic Theory of Fair Asynchronous Communicating Processes.
Proceedings of the Automata, 1985

1984
Testing Equivalences for Processes.
Theor. Comput. Sci., 1984

Axiomatising Finite Delay Operators.
Acta Inf., 1984

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

The Power of the Future Perfect in Program Logics.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983
Synchronous and Asynchronous Experiments on Processes
Information and Control, 1983

Synchronous and Asynchronous Experiments on Processes.
IFIP Congress, 1983

Testing Equivalence for Processes.
Proceedings of the Automata, 1983

1982
Powerdomains and nondeterministic recursive definitions.
Proceedings of the International Symposium on Programming, 1982

1981
A Term Model for Synchronous Processes
Information and Control, October, 1981

A First Attempt at Translating CSP into CCS.
Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981

1980
A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus.
Theor. Comput. Sci., 1980

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

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

A Term Model for CCS.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

On Observing Nondeterminism and Concurrency.
Proceedings of the Automata, 1980

1979
Full Abstraction for a Simple Parallel Programming Language.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1977
Parameter-Passing Mechanisms and Nondeterminism
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

1976
The Semantics of Nondeterminism.
ICALP, 1976


  Loading...