The University of Southampton
University of Southampton Institutional Repository

A fully abstract may testing semantics for concurrent objects

Jeffrey, Alan and Rathke, Julian, Pierce, B(ed.) (2005) A fully abstract may testing semantics for concurrent objects Theoretical Computer Science, 338, (1-3), pp. 17-63.

Record type: Article


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.

PDF cobj.pdf - Other
Restricted to Registered users only
Download (1MB)

More information

Published date: 2005
Additional Information: Commentary On:
Organisations: Electronic & Software Systems


Local EPrints ID: 263596
ISSN: 0304-3975
PURE UUID: 95d9448a-adb5-49f3-8758-04b81461f2fe

Catalogue record

Date deposited: 23 Feb 2007
Last modified: 18 Jul 2017 07:43

Export record


Author: Alan Jeffrey
Author: Julian Rathke
Editor: B Pierce

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.