A theory of bisimulation for a fragment of concurrent ML with local names
Theoretical Computer Science
A game semantics of the asynchronous π-calculus
CONCUR 2005 - Concurrency Theory
Type checking a multithreaded functional language with session types
Theoretical Computer Science
A concurrent lambda calculus with futures
Theoretical Computer Science - Applied semantics
Full abstraction for polymorphic π-calculus
Theoretical Computer Science
Validating Behavioral Component Interfaces in Rewriting Logic
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Game semantics for higher-order concurrency
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Heap-Abstraction for an object-oriented calculus with thread classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
A typed semantics of higher-order store and subtyping
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Object connectivity and full abstraction for a concurrent calculus of classes
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
A fully abstract semantics for UML components
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Observability, connectivity, and replay in a sequential calculus of classes
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Executable interface specifications for testing asynchronous creol components
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Java JR: fully abstract trace semantics for a core java language
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Full abstraction for polymorphic pi-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Abstract interface behavior of object-oriented languages with monitors
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Validating Behavioral Component Interfaces in Rewriting Logic
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
| Hi-index | 0.00 |
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.