#### Filter Results:

- Full text PDF available (110)

#### Publication Year

1976

2017

- This year (2)
- Last 5 years (24)
- Last 10 years (51)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Matthew Hennessy, Robin Milner
- J. ACM
- 1985

Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input/output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth. First, a definition is given of what it is for two programs or program… (More)

- Rocco De Nicola, Matthew Hennessy
- Theor. Comput. Sci.
- 1984

Given a set of processes and a set of tests on these processes we show how to define in a natural way three different eyuitalences on processes. ThesP equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models have a simple representation in terms of trees.

- Matthew Hennessy
- MIT Press series in the foundations of computing
- 1988

- Matthew Hennessy, James Riely
- Electr. Notes Theor. Comput. Sci.
- 1998

We describe a typing system for a distributed π-calculus which guarantees that distributed agents cannot access the resources of a system without first being granted the capability to do so. The language studied allows agents to move between distributed locations and to augment their set of capabilities via communication with other agents. The type system… (More)

- Matthew Hennessy, Huimin Lin
- Theor. Comput. Sci.
- 1995

- Matthew Hennessy, Tim Regan
- Inf. Comput.
- 1995

- Matthew Hennessy, Robin Milner
- ICALP
- 1980

- Massimo Merro, Matthew Hennessy
- POPL
- 2002

We study a variant of Levi and Sangiorgi's Safe Ambients (SA) enriched with <i>passwords</i> (SAP). In SAP by managing passwords, for example generating new ones and distributing them selectively, an ambient may now program who may migrate into its computation space, and when. Moreover in SAP an ambient may provide different services depending on the… (More)

- Matthew Hennessy, Gordon D. Plotkin
- MFCS
- 1979

In [Plol] a powerdomain was defined which was intended as a kind of analogue of the powerset construction, but for (certain kinds) of cpos. For example the powerdomain~(S±) of the flat cpo Si, formed from a set S, is the set {X ! S~I(X#~) and ((±cX) or X is finite)} with the Egli-Milner ordering : X ~ Y ~ (~x ~ X.~ y ~ Y. x C y) A (~y c Y.3 x e X. x ~ y).… (More)

- Yuxin Deng, Matthew Hennessy, Rob J. van Glabbeek, Carroll Morgan
- 22nd Annual IEEE Symposium on Logic in Computer…
- 2007

In 1992 Wang & Larsen extended the may- and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems that have remained open throughout the years, namely to find complete axiomatisations and alternative characterisations for these preorders. This paper solves both… (More)