A fully abstract may testing semantics for concurrent objects

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.

[1]  Mario Tokoro,et al.  On Asynchronous Communication Semantics , 1991, Object-Based Concurrent Computing.

[2]  Andrew D. Gordon,et al.  A Concurrent Object Calculus: Reduction and Typing , 1998, HLCL.

[3]  Bent Thomsen,et al.  A fully abstract denotational semantics for the calculus of higher-order communicating systems , 2001, Theor. Comput. Sci..

[4]  Davide Sangiorgi,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[5]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[6]  Julian Rathke,et al.  Towards a theory of bisimulation for local names , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[7]  Andrew M. Pitts,et al.  Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new? , 1993, MFCS.

[8]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[9]  강문설.  [서평]「The Unified Modeling Language User Guide」 , 1999 .

[10]  Andrew D. Gordon,et al.  Bisimilarity for a first-order calculus of objects with subtyping , 1996, POPL '96.

[11]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[12]  Matthew Hennessy,et al.  A theory of weak bisimulation for core CML , 1996, ICFP '96.

[13]  James H. Morris,et al.  Lambda-calculus models of programming languages. , 1969 .

[14]  E. Moggi,et al.  A fully-abstract model for the /spl pi/-calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[15]  Julian Rathke,et al.  A theory of bisimulation for a fragment of concurrent ML with local names , 2004, Theor. Comput. Sci..

[16]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[17]  Albert R. Meyer,et al.  Towards fully abstract semantics for local variables , 1988, POPL '88.

[18]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[19]  Julian Rathke,et al.  Typed behavioural equivalences for processes in the presence of subtyping , 2004, Math. Struct. Comput. Sci..

[20]  Kathleen Fisher,et al.  A Calculus for Concurrent Objects , 1996, CONCUR.