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), 17-63.

Record type: Article

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.

Text

cobj.pdf - Other

Restricted to Registered users only

Download (1MB)

Request a copy

More information

Published date: 2005

Additional Information: Commentary On: http://authors.elsevier.com/sd/article/S0304397504006991

Organisations: Electronic & Software Systems

Learn more about Cyber Physical Systems research

Identifiers

Local EPrints ID: 263596

URI: http://eprints.soton.ac.uk/id/eprint/263596

ISSN: 0304-3975

PURE UUID: 95d9448a-adb5-49f3-8758-04b81461f2fe

Catalogue record

Date deposited: 23 Feb 2007

Last modified: 14 Mar 2024 07:35

Export record

Share this record

Share this on Facebook Share this on Twitter Share this on Weibo

Contributors

Author: Alan Jeffrey

Author: Julian Rathke

Editor: B Pierce

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

Library staff additional information