loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th Annual IEEE Symposium on Logic in Computer Science (LICS'02)
A Fully Abstract May Testing Semantics for Concurrent Objects
Copenhagen, Denmark
July 22-July 25
ISBN: 0-7695-1483-9
ASCII Text
x 
 
Alan Jeffrey, Julian Rathke, "A Fully Abstract May Testing Semantics for Concurrent Objects," Logic in Computer Science, Symposium on, pp. 101, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2002.1029820,
author = {Alan Jeffrey and Julian Rathke},
title = {A Fully Abstract May Testing Semantics for Concurrent Objects},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2002},
issn = {1043-6871},
pages = {101},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2002.1029820},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - A Fully Abstract May Testing Semantics for Concurrent Objects
SN - 1043-6871
SP
EP
A1 - Alan Jeffrey,
A1 - Julian Rathke,
PY - 2002
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Alan Jeffrey, DePaul University
Julian Rathke, University of Sussex
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.
Citation:
Alan Jeffrey, Julian Rathke, "A Fully Abstract May Testing Semantics for Concurrent Objects," lics, pp.101, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.