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.

This is the latest version of this item.

Download

[img] PDF
Restricted to Registered users only

Download (1673Kb) | Request a copy

Description/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.

Item Type: Article
Additional Information: Commentary On: http://authors.elsevier.com/sd/article/S0304397504006991
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
ePrint ID: 263596
Date Deposited: 23 Feb 2007
Last Modified: 27 Mar 2014 20:07
Publisher: Elsevier
Further Information:Google Scholar
ISI Citation Count:6
URI: http://eprints.soton.ac.uk/id/eprint/263596

Available Versions of this Item

  • A fully abstract may testing semantics for concurrent objects. (deposited 23 Feb 2007) [Currently Displayed]

Actions (login required)

View Item View Item