A fully abstract may testing semantics for concurrent objects

Authors:
Alan Jeffrey;Julian Rathke
Affiliations:
School of CTI, DePaul University, 243 S. Wabash Ave., Chicago, IL and Bell Labs, Lucent Technologies, 2701 Lucent Lane, Lisle, IL and Department of Telecommunications and IS, School of Computer Sc ...;School of Informatics, University of Sussex, Brighton, UK
Venue:
Theoretical Computer Science
Year:
2005

Citing 22
Cited 7

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
Hierarchical correctness proofs for distributed algorithms

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Algebraic theory of processes

Algebraic theory of processes
A calculus of mobile processes, I

Information and Computation
Bisimilarity for a first-order calculus of objects with subtyping

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Unified Modeling Language user guide

The Unified Modeling Language user guide
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
On full abstraction for PCF: I, II, and III

Information and Computation
Full abstraction for PCF

Information and Computation
Trace and testing equivalence on asynchronous processes

Information and Computation
A Theory of Objects

A Theory of Objects
A fully abstract denotational semantics for the π-calculus

Theoretical Computer Science
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Domains for Denotational Semantics

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Barbed Bisimulation

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
First-Order Axioms for Asynchrony

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
A Calculus for Concurrent Objects

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On Asynchronous Communication Semantics

ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
A Fully-Abstract Model for the p-calculus

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Towards a Theory of Bisimulation for Local Names

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A theory of weak bisimulation for Core CML

Journal of Functional Programming

A Chart Semantics for the Pi-Calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
On Validity of Program Transformations in the Java Memory Model

ECOOP '08 Proceedings of the 22nd European conference on Object-Oriented Programming
A model of cooperative threads

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Security Monitor Inlining for Multithreaded Java

Genoa Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming
Abstraction for concurrent objects

Theoretical Computer Science
Quarantining weakness: compositional reasoning under relaxed memory models

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Game semantics for interface middleweight Java

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	5.23

Visualization

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.