Matthew Hennessy

From MaRDI portal
(Redirected from Person:456465)
Person:1138390

Available identifiers

zbMath Open hennessy.matthew-c-bDBLPh/MatthewHennessyWikidataQ6790660 ScholiaQ6790660MaRDI QIDQ1138390

List of research outcomes





PublicationDate of PublicationType
Termination, deadlock and divergence2023-04-12Paper
An efficiency preorder for processes2022-08-16Paper
A coinductive equational characterisation of trace inclusion for regular processes2020-02-24Paper
Higher-order processes and their models2019-04-29Paper
Distributed processes and location failures2018-07-04Paper
Distinguishing between communicating transactions2018-03-21Paper
A theory of weak bisimulation for core CML2016-09-01Paper
Modelling session types using contracts2016-07-28Paper
Using higher-order contracts to model session types2016-07-06Paper
Characterising testing preorders for broadcasting distributed systems2016-06-09Paper
The security picalculus and non-interference (extended abstract)2016-05-03Paper
Modelling MAC-layer communications in wireless systems2015-04-22Paper
Mutually testing processes2015-04-22Paper
Bisimulation congruences in safe ambients2015-03-17Paper
Uniqueness typing for resource management in message-passing concurrency2015-01-12Paper
Using higher-order contracts to model session types (extended abstract)2014-09-15Paper
Compositional reasoning for explicit resource management in channel-based concurrency2014-07-31Paper
Counting the cost in the picalculus (extended abstract)2014-06-27Paper
Real-reward testing for probabilistic processes2014-06-06Paper
Bisimulations for communicating transactions (extended abstract)2014-04-16Paper
Remarks on testing probabilistic processes2013-12-06Paper
Adding recursion to \textsc{Dpi} (extended abstract)2013-10-07Paper
Security policies as membranes in systems for global computing2013-09-26Paper
Modelling probabilistic wireless networks2013-09-26Paper
Symbolic bisimulation for a higher-order distributed language with passivation (extended abstract)2013-08-12Paper
Mutually testing processes (extended abstract)2013-08-12Paper
Typed behavioural equivalences for processes in the presence of subtyping2013-07-24Paper
On the semantics of Markov automata2013-06-06Paper
Exploring probabilistic bisimulations. I2013-03-22Paper
First-order reasoning for higher-order concurrency2012-10-25Paper
Compositional reasoning for Markov decision processes (extended abstract)2012-06-29Paper
On the semantics of Markov automata2011-07-07Paper
A calculus for costed computations2011-05-26Paper
A Testing Theory for a Higher-Order Cryptographic Language2011-05-19Paper
Communicating transactions (extended abstract)2010-08-31Paper
Towards a semantic theory of CML2010-06-17Paper
Testing Finitary Probabilistic Processes2009-10-22Paper
Characterising Testing Preorders for Finite Probabilistic Processes2009-04-29Paper
A theory of system behaviour in the presence of node and link failure2008-08-22Paper
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra2008-06-19Paper
Security Policies as Membranes in Systems for Global Computing2007-10-11Paper
Foundations of Software Science and Computation Structures2007-09-28Paper
A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)2007-09-04Paper
A theory for observational fault tolerance2007-08-23Paper
A Distributed Pi-Calculus2007-05-21Paper
Foundations of Software Science and Computation Structures2007-05-02Paper
Adding recursion to Dpi2007-04-19Paper
CONCUR 2005 – Concurrency Theory2006-11-01Paper
Formal Techniques for Networked and Distributed Systems - FORTE 20052006-07-07Paper
safeDpi: a language for controlling mobile code2006-01-10Paper
The security pi-calculus and non-interference2005-04-18Paper
Typed behavioural equivalences for processes in the presence of subtyping2005-02-28Paper
Towards a behavioural theory of access and mobility control in distributed systems2004-10-04Paper
Trust and partial typing in open systems of mobile agents2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44178652003-07-30Paper
Assigning types to processes2003-01-14Paper
Resource access control in systems of mobile agents2003-01-14Paper
A fully abstract denotational semantics for the \(\pi\)-calculus2002-07-15Paper
Testing equivalences for processes2002-05-13Paper
Distributed processes and location failures2002-03-03Paper
Unique fixpoint induction for message-passing process calculi2002-02-05Paper
https://portal.mardi4nfdi.de/entity/Q27541612001-12-09Paper
https://portal.mardi4nfdi.de/entity/Q44942362000-08-10Paper
https://portal.mardi4nfdi.de/entity/Q42700811999-11-10Paper
Bisimulations for a calculus of broadcasting systems1999-06-22Paper
A behavioural theory of first-order CML1999-04-28Paper
A theory of weak bisimulation for Core CML1999-03-28Paper
https://portal.mardi4nfdi.de/entity/Q42189351999-02-14Paper
https://portal.mardi4nfdi.de/entity/Q42230181999-01-10Paper
https://portal.mardi4nfdi.de/entity/Q42230081999-01-07Paper
Full abstractness for a functional/concurrent language with higher-order value-passing1998-11-10Paper
https://portal.mardi4nfdi.de/entity/Q43495771998-02-26Paper
https://portal.mardi4nfdi.de/entity/Q43643911997-11-17Paper
Concurrent testing of processes1995-11-20Paper
A modal logic for message passing processes1995-07-24Paper
A process algebra for timed systems1995-07-10Paper
Adding action refinement to a finite process algebra1995-02-16Paper
A fully abstract denotational model for higher-order processes1995-01-22Paper
Termination, deadlock, and divergence1994-08-21Paper
An efficiency preorder for processes1994-06-30Paper
A theory of processes with localities1994-06-29Paper
A theory of communicating processes with value passing1994-03-24Paper
Communicating processes with value-passing and assignments1993-12-06Paper
Observing localities1993-10-17Paper
Testing equivalence as a bisimulation equivalence1993-06-29Paper
Towards action-refinement in process algebras1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40365891993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40352301993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40386931993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q39982661993-01-23Paper
https://portal.mardi4nfdi.de/entity/Q39975011992-09-17Paper
A proof system for communicating processes with value-passing1992-06-27Paper
Priorities in process algebras1990-01-01Paper
Distributed bisimulations1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32040331989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33552281989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47333911989-01-01Paper
Axiomatising Finite Concurrent Processes1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37941541987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47216411987-01-01Paper
An algebraic theory of fair asynchronous communicating processes1987-01-01Paper
Proving systolic systems correct1986-01-01Paper
Algebraic laws for nondeterminism and concurrency1985-01-01Paper
Acceptance trees1985-01-01Paper
The power of the future perfect in program logics1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36819131985-01-01Paper
Axiomatising finite delay operators1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32213981984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36574141983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36626101983-01-01Paper
Synchronous and asynchronous experiments on processes1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39470961982-01-01Paper
A term model for synchronous processes1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38834671980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39384621980-01-01Paper
The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment1980-01-01Paper
A mathematical semantics for a nondeterministic typed lambda-calculus1980-01-01Paper
A proof system for the first-order relational calculus1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39070391979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41593651976-01-01Paper

Research outcomes over time

This page was built for person: Matthew Hennessy