## A fully abstract may testing semantics for concurrent objects (2002)

### Cached

### Download Links

- [cm.bell-labs.com]
- [ect.bell-labs.com]
- [fpl.cs.depaul.edu]
- [www.asaj.org]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proceedings of LICS ’02. IEEE, Computer |

Citations: | 38 - 4 self |

### BibTeX

@INPROCEEDINGS{Jeffrey02afully,

author = {Alan Jeffrey},

title = {A fully abstract may testing semantics for concurrent objects},

booktitle = {In Proceedings of LICS ’02. IEEE, Computer},

year = {2002},

pages = {101--112},

publisher = {Society Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper provides a fully abstract semantics for a variant of the concurrent object calculus. We define may testing for concurrent object components and then characterise it using a trace semantics inspired by UML interaction diagrams. The main result of this paper is to show that the trace semantics is fully abstract for may testing. This is the first such result for a concurrent object language. 1.

### Citations

2010 |
I.: The Unified Modeling Language User Guide
- Booch, Rumbaugh, et al.
- 1999
(Show Context)
Citation Context ...ion of the labelled transitions and traces but we anticipate that the proof techniques used here are robust enough to cater for subtyping also. This semantics was inspired by UML interaction diagrams =-=[4]-=-, which are a common tool for visualising interactions with object systems. 1.1. Interaction diagrams Interaction diagrams (in particular sequence diagrams) were developed by Jacobson, and are now par... |

393 |
Algebraic Theory of Processes
- HENNESSY
- 1988
(Show Context)
Citation Context ...as first introduced by Milner [17], and investigated in depth by Plotkin [24]. Full abstraction was first proposed for variants of the λ-calculus, but has since been investigated for process algebras =-=[9]-=-, the π-calculus [6, 10], the ν-calculus [23, 14], Concurrent ML [5, 15], and the immutable object calculus [8]. One way to define a semantics for a programming language is to define: � A language of ... |

221 | Barbed bisimulation
- Milner, Sangiorgi
- 1992
(Show Context)
Citation Context ...t calculus. We will do this by defining a notion of barb for a component, and let a successful component be one which communicates on that barb. This is similar to the use of barbs in process algebra =-=[20]-=-. Let the type ��£���� be defined: ��£���� ¦s����¡¤¡ : ��� � ������� ¡ for some fresh method name ����¡�¡ . We say that a component strongly barbs on b : ��£���� written Csb if and only if: C � ν ��� ... |

198 |
On full abstraction for PCF
- Hyland, Ong
(Show Context)
Citation Context ...ntics with some reasonably sized examples to demonstrate that the calculation of traces is tractable. There are a number of issues left open: � Our semantics has much of the flavour of game semantics =-=[2, 13]-=-, and this connection should be investigated. � The trace semantics characterise may testing, rather than the more common must testing or bisimulation equivalence. � The object calculus presented here... |

193 | Full abstraction for PCF
- Abramsky, Jagadeesan, et al.
(Show Context)
Citation Context ...ntics with some reasonably sized examples to demonstrate that the calculation of traces is tractable. There are a number of issues left open: � Our semantics has much of the flavour of game semantics =-=[2, 13]-=-, and this connection should be investigated. � The trace semantics characterise may testing, rather than the more common must testing or bisimulation equivalence. � The object calculus presented here... |

98 |
Towards fully abstract semantics for local variables: Preliminary report
- Meyer, Sieber
- 1988
(Show Context)
Citation Context ...d so b as required. ¢ � � C2sC0 � C© � �sCase 0 b . Similar to £ the above. 3.4. Example We can use the trace semantics now to show a simple equivalence, derived from one of the Meyer-Sieber examples =-=[16]-=- for idealised Algol. The following two components are may testing equivalent if ¡ ¡ t£ x C:s�¥ ��� C n x ¦ �����sO¡ ��� t � andsC nst ��� To show this we use a meta-property of reduction that traces ... |

79 | A Concurrent Object Calculus: Reduction and Typing
- Gordon, Hankin
- 1998
(Show Context)
Citation Context ...Introduction Abadi and Cardelli’s [1] object calculus is a minimal language for investigating features of object languages such as encapsulated state, subtyping, and self variables. Gordon and Hankin =-=[7]-=- added concurrent features to the object calculus, to produce the concurrent object calculus. Prior work on the object calculus has concentrated on the operational behaviour of object systems, and typ... |

66 | On Asynchronous Communication Semantics
- Honda, Tokoro
- 1992
(Show Context)
Citation Context ...he labelled transition system, to demonstrate definability, we found it necessary to define an ¢ informations��� £�¡�� order Δ r s : Θ for typed traces which incorporates prefixing, input receptivity =-=[12]-=-, and commutativity of certain actions. Details of this may be found in the full version of the paper. ¢ Lemma 4.1 (Trace Duality) If Δ s : ���©£�¡�� ��� ¢ £�¡�� Θ then Θ ¯s : Δ Proposition 4.2 (Trace... |

43 | Bisimilarity for first-order calculus of objects with subtyping
- Gordon, Rees
- 1996
(Show Context)
Citation Context ...rior work on the object calculus has concentrated on the operational behaviour of object systems, and type systems which provide type safety guarantees. The closest paper to ours is Gordon and Rees’s =-=[8]-=- fully abstract semantics for the immutable single-threaded object calculus. There has been no work on providing fully abstract semantics for concurrent mutable objects. In this paper, we present the ... |

42 | A calculus for concurrent objects
- Blasio, Fisher
- 1996
(Show Context)
Citation Context ...t cloning and object locking. This is just for simplicity, we do not see any technical problems with incorporating these features into our language. In another strand of research Di Blasio and Fisher =-=[3]-=- also designed a calculus for modelling imperative, concurrent object-based systems. As with Abadi and Cardelli’s object calculus and its various extensions, the emphasis in Di Blasio and Fisher’s wor... |

39 | A theory of weak bisimulation for core CML
- Ferreira, Hennessy, et al.
- 1998
(Show Context)
Citation Context ...tkin [24]. Full abstraction was first proposed for variants of the λ-calculus, but has since been investigated for process algebras [9], the π-calculus [6, 10], the ν-calculus [23, 14], Concurrent ML =-=[5, 15]-=-, and the immutable object calculus [8]. One way to define a semantics for a programming language is to define: � A language of typed components C which can be composedsC1 C2. (In this paper, componen... |

30 | Typed behavioural equivalences for processes in the presence of subtyping
- Hennessy, Rathke
- 2002
(Show Context)
Citation Context ...ible at this stage. The re-introduction of these features into the type system would affect the behavioural theory in what we expect to be a predictable way and anticipate that techniques employed in =-=[11]-=- and those presented here can be combined to give a similar treatment for a concurrent object language with subtyping.sWe provide the calculus with an operational semantics, and a trace semantics, and... |

19 | A theory of bisimulation for a fragment of concurrent ML with local names, Theoret
- Jeffrey, Rathke
(Show Context)
Citation Context ...tkin [24]. Full abstraction was first proposed for variants of the λ-calculus, but has since been investigated for process algebras [9], the π-calculus [6, 10], the ν-calculus [23, 14], Concurrent ML =-=[5, 15]-=-, and the immutable object calculus [8]. One way to define a semantics for a programming language is to define: � A language of typed components C which can be composedsC1 C2. (In this paper, componen... |

17 |
A fully-abstract model for the π-calculus
- Fiore, Moggi, et al.
- 1996
(Show Context)
Citation Context ...by Milner [17], and investigated in depth by Plotkin [24]. Full abstraction was first proposed for variants of the λ-calculus, but has since been investigated for process algebras [9], the π-calculus =-=[6, 10]-=-, the ν-calculus [23, 14], Concurrent ML [5, 15], and the immutable object calculus [8]. One way to define a semantics for a programming language is to define: � A language of typed components C which... |

11 |
A fully abstract denotational semantics for the π-calculus
- Hennessy
(Show Context)
Citation Context ...by Milner [17], and investigated in depth by Plotkin [24]. Full abstraction was first proposed for variants of the λ-calculus, but has since been investigated for process algebras [9], the π-calculus =-=[6, 10]-=-, the ν-calculus [23, 14], Concurrent ML [5, 15], and the immutable object calculus [8]. One way to define a semantics for a programming language is to define: � A language of typed components C which... |

11 |
Communicating and Mobile Systems
- Milner
- 1999
(Show Context)
Citation Context ...the system to generate new names on outgoing messages, we allow the environment to generate new names on incoming messages. This style of dealing with fresh names comes originally from the π-calculus =-=[19, 18]-=-, and has since been used in other languages, notably the ν-calculus [23]. We have now presented informally all of the machinery required by our semantics for objects: � The semantics of a system is g... |

8 |
A calculus of mobile proceses
- Milner, Parrow, et al.
- 1992
(Show Context)
Citation Context ...the system to generate new names on outgoing messages, we allow the environment to generate new names on incoming messages. This style of dealing with fresh names comes originally from the π-calculus =-=[19, 18]-=-, and has since been used in other languages, notably the ν-calculus [23]. We have now presented informally all of the machinery required by our semantics for objects: � The semantics of a system is g... |

4 |
Fully abstract semantics of typed λ-calculi
- MILNER
- 1977
(Show Context)
Citation Context ...s extensions, the emphasis in Di Blasio and Fisher’s work is again on type systems and safety properties for them. 1.3. Full abstraction The problem of full abstraction was first introduced by Milner =-=[17]-=-, and investigated in depth by Plotkin [24]. Full abstraction was first proposed for variants of the λ-calculus, but has since been investigated for process algebras [9], the π-calculus [6, 10], the ν... |

2 |
A Theory Of Objcets
- Abadi, Cardelli
- 1996
(Show Context)
Citation Context ...e main result of this paper is to show that the trace semantics is fully abstract for may testing. This is the first such result for a concurrent object language. 1. Introduction Abadi and Cardelli’s =-=[1]-=- object calculus is a minimal language for investigating features of object languages such as encapsulated state, subtyping, and self variables. Gordon and Hankin [7] added concurrent features to the ... |

1 |
Towards a theory of weak bisimulation for local names
- Jeffrey, Rathke
- 1999
(Show Context)
Citation Context ...stigated in depth by Plotkin [24]. Full abstraction was first proposed for variants of the λ-calculus, but has since been investigated for process algebras [9], the π-calculus [6, 10], the ν-calculus =-=[23, 14]-=-, Concurrent ML [5, 15], and the immutable object calculus [8]. One way to define a semantics for a programming language is to define: � A language of typed components C which can be composedsC1 C2. (... |