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.
This is the latest version of this item.
Restricted to Registered users only
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.
|Additional Information:||Commentary On: http://authors.elsevier.com/sd/article/S0304397504006991|
|Organisations:||Electronic & Software Systems|
|Date Deposited:||23 Feb 2007|
|Last Modified:||17 Apr 2017 19:50|
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Available Versions of this Item
- A fully abstract may testing semantics for concurrent objects (deposited 23 Feb 2007) [Currently Displayed]
Actions (login required)