A fully abstract may testing semantics for concurrent objects (Q557787): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.tcs.2004.10.012 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.TCS.2004.10.012 / rank | |||
Normal rank |
Revision as of 04:19, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A fully abstract may testing semantics for concurrent objects |
scientific article |
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