Logic in Computer Science (LICS 2002)

Paper: A fully abstract may testing semantics for concurrent objects (at LICS 2002)

Authors: Alan Jeffrey Julian Rathke

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.

BibTeX

  @InProceedings{JeffreyRathke-Afullyabstractmayte,
    author = 	 {Alan Jeffrey and Julian Rathke},
    title = 	 {A fully abstract may testing semantics for concurrent
    objects},
    booktitle =  {Proceedings of the Seventeenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 2002},
    year =	 2002,
    editor =	 {Gordon Plotkin},
    month =	 {July}, 
    location =   {Copenhagen, Denmark}, 
    publisher =	 {IEEE Computer Society Press}
  }