DocumentCode
2194940
Title
A fully abstract may testing semantics for concurrent objects
Author
Jeffrey, Alan ; Rathke, Julian
Author_Institution
CTI, DePaul Univ., Chicago, IL, USA
fYear
2002
fDate
2002
Firstpage
101
Lastpage
112
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.
Keywords
formal logic; object-oriented programming; semantic networks; UML interaction diagrams; concurrent object calculus; concurrent object language; fully abstract semantics; may testing; trace semantics; Calculus; Jacobian matrices; Production facilities; Robustness; Safety; Standards development; Testing; Unified modeling language; Visualization; Yarn;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 2002. Proceedings. 17th Annual IEEE Symposium on
ISSN
1043-6871
Print_ISBN
0-7695-1483-9
Type
conf
DOI
10.1109/LICS.2002.1029820
Filename
1029820
Link To Document