Matthew Hennessy

Q: What Schools Are Affiliated With Matthew Hennessy

Matthew Hennessy is affiliated with the following schools: University of Sussex, University of Waterloo, Imperial College London, University of Edinburgh, Trinity College Dublin

Matthew Hennessy's AcademicInfluence.com Rankings

Matthew Hennessy

Computer Science

#625

World Rank

#645

Historical Rank

Database

#798

World Rank

#838

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Matthew Hennessy's Degrees

Bachelors Computer Science Trinity College Dublin
PhD Computer Science Trinity College Dublin

Similar Degrees You Can Earn

Why Is Matthew Hennessy Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Matthew Hennessy is an Irish computer scientist who has contributed especially to concurrency, process calculi and programming language semantics. Career During 1976–77, Matthew Hennessy was an assistant professor at the University of Waterloo in Canada. Then during 1977–78, he was a visiting professor at the Universidade Federal de Pernambuco in Brazil. Subsequently, he was a research associate and then lecturer at the University of Edinburgh in Scotland. During 1985, he was a guest lecturer/researcher at the University of Aarhus in Denmark.

(See a Problem?)

Matthew Hennessy's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On Observing Nondeterminism and Concurrency (1980) (4589)
Algebraic laws for nondeterminism and concurrency (1985) (1491)
Testing Equivalences for Processes (1984) (1292)
Algebraic theory of processes (1988) (1051)
Symbolic Bisimulations (1995) (384)
Resource Access Control in Systems of Mobile Agents (2002) (376)
Full Abstraction for a Simple Parallel Programming Language (1979) (310)
A Process Algebra for Timed Systems (1995) (293)
Testing Equivalence for Processes (1983) (288)
Semantics of programming languages - an elementary introduction using structural operational semantics (1990) (191)
Acceptance trees (1985) (160)
A distributed Pi-calculus (2007) (157)
Information flow vs. resource access in the asynchronous pi-calculus (2000) (153)
Priorities in process algebras (1988) (143)
A Typed Language for Distributed Mobile Processes (1998) (134)
The Power of the Future Perfect in Program Logics (1984) (133)
Trust and Partial Typing in Open Systems of Mobile Agents (2004) (128)
Observing Localities (1993) (117)
A Temporal Process Algebra (1990) (117)
Testing equivalence as a bisimulation equivalence (1989) (117)
Adding Action Refinement to a Finite Process Algebra (1991) (115)
Towards action-refinement in process algebras (1989) (112)
Characterising Testing Preorders for Finite Probabilistic Processes (2007) (111)
Bisimulation congruences in safe ambients (2002) (101)
A typed language for distributed mobile processes (extended abstract) (1998) (95)
A Term Model for CCS (1980) (94)
Termination, deadlock, and divergence (1992) (91)
Distributed processes and location failures (2001) (82)
Distributed bisimulations (1989) (79)
On the semantics of Markov automata (2011) (77)
CCS without tau's (1987) (76)
Typed behavioural equivalences for processes in the presence of subtyping (2004) (73)
An efficiency preorder for processes (1991) (72)
safeDpi: a language for controlling mobile code (2004) (70)
Assigning types to processes (2000) (70)
A theory of weak bisimulation for core CML (1996) (69)
A Term Model for Synchronous Processes (1981) (69)
Towards a behavioural theory of access and mobility control in distributed systems (2003) (64)
A fully abstract denotational model for higher-order processes (1993) (63)
Type-Safe Execution of Mobile Agents in Anonymous Networks (1998) (61)
Testing Theories for Asynchronous Languages (1998) (60)
Testing Finitary Probabilistic Processes (2009) (58)
Using Higher-Order Contracts to Model Session Types (Extended Abstract) (2013) (57)
A Theory of Communicating Processes with Value-Passing (1990) (55)
Axiomatising Finite Concurrent Processes (1988) (52)
Synchronous and Asynchronous Experiments on Processes (1984) (47)
Remarks on Testing Probabilistic Processes (2007) (45)
A Theory of Communicating Processes with Value Passing (1993) (44)
The security pi-calculus and non-interference (2005) (43)
Bisimulations for a Calculus of Broadcasting Systems (1995) (43)
Proof systems for message-passing process algebras (1993) (42)
The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment (1980) (42)
A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus (1980) (42)
A theory of processes with localities (1992) (41)
Exploring probabilistic bisimulations, part I (2012) (41)
A fully abstract denotational semantics for the pi-calculus (2002) (39)
A Theory of System Behaviour in the Presence of Node and Link Failures (2005) (38)
Modelling session types using contracts (2012) (38)
A bisimulation-based semantic theory of Safe Ambients (2006) (35)
Proving systolic systems correct (1986) (32)
Suptyping and Locality in Distributed Higher Order Processes (extended abstract) (1999) (32)
Communicating transactions (2010) (31)
An Algebraic Theory of Fair Asynchronous Communicating Processes (1985) (30)
Security Policies as Membranes in Systems for Global Computing (2005) (28)
Timed Process Algebras: A Tutorial (1992) (27)
Powerdomains and nondeterministic recursive definitions (1982) (26)
A proof system for communicating processes with value-passing (1991) (22)
Modelling MAC-Layer Communications in Wireless Systems (2013) (22)
Distributed Processes and Location Failures (Extended Abstract) (1997) (22)
Inferring dynamic credentials for rôle-based trust management (2006) (21)
Communicating Transactions - (Extended Abstract) (2010) (21)
The Semantics of Nondeterminism (1976) (21)
Testing finitary probabilistic processes (extended abstract) (2009) (21)
An Introduction to a Calculus of Communicating Systems (1982) (21)
A theory of system behaviour in the presence of node and link failure (2008) (19)
Parameter-passing mechanisms and nondeterminism (1977) (19)
A First Attempt at Translating CSP into CCS (1981) (19)
Counting the Cost in the Picalculus (Extended Abstract) (2009) (19)
A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract) (2007) (19)
Mutually Testing Processes (2015) (19)
Local Model Checking for Value-Passing Processes (Extended Abstract) (1997) (18)
A Proof System for the First-Order Relational Calculus (1980) (18)
A theory for observational fault tolerance (2006) (17)
Subtyping and locality in distributed higher order processes (1999) (17)
The semantics of programming languages (1990) (17)
On the Decidability of Non-Interleaving Process Equivalences (1994) (16)
Unique fixpoint induction for message-passing process calculi (2001) (16)
A modal logic for message passing processes (1995) (16)
A calculus for costed computations (2010) (16)
Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (1998) (15)
A Model for the -calculus (1991) (15)
Termination, Deadlock and Divergence (1989) (15)
An Algebraic Theory of Fair Synchronous Communicating Processes (1987) (14)
Local Model Checking for a Value-Based Modal µ-Calculus (1996) (13)
Higher-Order Process and Their Models (1994) (13)
Liveness of Communicating Transactions (Extended Abstract) (2010) (13)
Proceedings of the 29th International Colloquium on Automata, Languages and Programming (2002) (13)
Uniqueness typing for resource management in message-passing concurrency (2010) (12)
First-order reasoning for higher-order concurrency (2012) (12)
Modelling Probabilistic Wireless Networks (2013) (12)
Observing processes (1988) (12)
Local model checking for value-passing processes (1997) (12)
Compliance and Testing Preorders Differ (2013) (11)
Bisimulations for Communicating Transactions - (Extended Abstract) (2014) (11)
Observing Localities (Extended Abstract) (1991) (10)
Axiomatising finite delay operators (1984) (10)
Finite conjunctive nondeterminism (1987) (10)
Adding recursion to Dpi (2007) (10)
Proof Methodologies for Behavioural Equivalence in DPI (2005) (9)
Compositional reasoning for weighted Markov decision processes (2013) (9)
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (2008) (9)
Translating a Subset of Ada into CCS (1982) (9)
A Theory of Communicating Processes (1993) (8)
Process Behaviour: Formulae vs. Tests (Extended Abstract) (2010) (8)
Resource control in systems of mobile agents (1998) (8)
Real-reward testing for probabilistic processes (2014) (8)
A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract) (2011) (8)
Liveness of communicating transactions (2010) (8)
safeDpi: A Language for Controlling Mobile Code (Extended Abstract) (2004) (8)
Communicating processes with value-passing and assignments (1993) (8)
Towards a Semantic Theory of CML (Extended Abstract) (1995) (7)
Mutually Testing Processes - (Extended Abstract) (2013) (7)
Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract) (2013) (7)
Location and link failure in a distributed π-calculus (2005) (7)
A Behavioural Theory of First-Order CML (1999) (5)
Modelling Probabilistic Wireless Networks - (Extended Abstract) (2012) (4)
The Security Picalculus and Non-interference (Extended Abstract) (2003) (4)
Concurrent Testing of Processes (Extended Abstract) (1992) (4)
Assigning Types to Pro esses (2000) (4)
A Modal Logic for Message passing Processes (Extended Abstract) (1993) (4)
Bisimulation Congruences in Safe Ambients (extended abstract). (2002) (4)
Assigning Types to Processes (Extended Abstract) (2000) (4)
Real-Reward Testing for Probabilistic Processes (Extended Abstract) (2011) (4)
A Proof System for Communicating Processes with Value-passing (Extended Abstract) (1989) (4)
Concurrent testing of processes (1995) (3)
A Coinductive Equational Characterisation of Trace Inclusion for Regular Processes (2017) (3)
A Distributed Pi-Calculus: Types and behaviour in a P i (2007) (3)
Modelling fair processes (1984) (3)
Modelling MAC-Layer Communications in Wireless Systems (Extended Abstract) (2013) (3)
A formal approach to the study of parameter passing mechanisms and non-determinism. (1976) (2)
A survey of location calculi (1998) (2)
Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract) (1997) (2)
Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency (2014) (2)
Characterising Testing Preorders for Broadcasting Distributed Systems (2014) (2)
Value-Passing in Process Algebras (Abstract) (1990) (2)
Secure Resource Access for Mobile Agents (1998) (2)
A Theory for Observational Fault Tolerance (Extended Abstract) (2006) (2)
Compositional Reasoning for Channel-Based Concurrent Resource Management (2012) (1)
Finite Conjunctive Nondeterminism (Extended Abstract) (1987) (1)
A simple probabilistic broadcast language (2012) (1)
A Theory of Process with Localities (Extended Abstract) (1992) (1)
Combining the typed lambda-calculus with CCS (2000) (1)
Resources , garbage-collection and the π-calculus (2006) (1)
Proof methodologies for behavioural equivalence in distributed pi-calculus (2005) (1)
Process behaviour: Formulae versus tests (2010) (1)
Proof methodologies for behavioural equivalence in D (2005) (1)
Adding Recursion to Dpi: (Extended Abstract) (2006) (0)
Preface (2004) (0)
Compositional Reasoning for Markov Decision Processes - (Extended Abstract) (2011) (0)
Proof Systems for Message-Passing Process Calculi (1999) (0)
Behavioural Equivalences for Co-operating Transactions (Invited Paper) (2015) (0)
Proof methodologies for behavioural equivalence in Distributed (2005) (0)
A Distributed Pi-Calculus: Inductive principles (2007) (0)
A Distributed Pi-Calculus: Behavioural equivalences for a D pi (2007) (0)
A Distributed Pi-Calculus: Bibliography (2007) (0)
Secure Resource Access for Open Systems (2000) (0)
A Distributed Pi-Calculus: Notation (2007) (0)
Axiomatising Asynchronous Process Calculi (abstract) (1999) (0)
An Equational Characterisation of the Must Testing Pre-order for Regular Processes (2019) (0)
CCS without "o's (2005) (0)
Test ing Equiva lence as a (2005) (0)
Symbolic Bisimulations (Abstract) (1993) (0)
Bisimulations for a Calculus of Broadcast ing Systems (0)
Structural Operational Semantics (2007) (0)
Process Calculi for describing distributed systems (1998) (0)
The asynchronous PI-CALCULUS (2007) (0)
A Distributed Pi-Calculus: Types for a P i (2007) (0)
A Distributed Pi-Calculus: A distributed asynchronous PI-CALCULUS (2007) (0)
Exploring probabilistic bisimulations, part I (2012) (0)
Automata, Languages and Programming (2002) (0)
Distributed Systems and Their Environments (2009) (0)
Proving distributed algorithm correctness using fault tolerance bisimulations (2007) (0)
Communication Primitives in Programming and Specification Languages (1986) (0)
Preface, proceedings of the 4th workshop on structural operational semantics (2007) (0)
Distinguishing between communicating transactions (2017) (0)
Language for Distributed Mobile Processes ( Extended abstract ) (1998) (0)

This paper list is powered by the following services:

Other Resources About Matthew Hennessy

What Schools Are Affiliated With Matthew Hennessy?

Matthew Hennessy is affiliated with the following schools:

Matthew Hennessy's Academic­Influence.com Rankings