A fully abstract may testing semantics for concurrent objects (Q557787)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fully abstract may testing semantics for concurrent objects |
scientific article; zbMATH DE number 2184034
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully abstract may testing semantics for concurrent objects |
scientific article; zbMATH DE number 2184034 |
Statements
A fully abstract may testing semantics for concurrent objects (English)
0 references
30 June 2005
0 references
Object calculus is a minimal language for modelling object-based programming. Concurrent object calculus is a version of it dealing with concurrent objects. On this base the authors define a may testing preorder for concurrent object components. It is characterised by a trace semantics inspired by UML interaction diagrams and some of its properties are studied. It is shown that the trace semantics is fully abstract for may testing. This is the first result of this kind for a concurrent object language. In addition, the paper contains interesting directions for future research.
0 references
Object calculus
0 references
Full abstraction
0 references
Concurrency
0 references