A fully abstract may testing semantics for concurrent objects

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2002, Pages 101-112

  Jeffrey, Alan ^a   Rathke, Julian ^a  

^a DEPAUL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONCURRENT ENGINEERING; OBJECT ORIENTED PROGRAMMING; SEMANTICS;

CONCURRENT OBJECTS; MAY TESTING;

COMPUTER SCIENCE;

EID: 0036053148     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Full abstraction for PCF
2. A calculus for concurrent objects
3. A theory of weak bisimulation for core CML
4. A fully-abstract model for the π-calculus
5. A concurrent object calculus: Reduction and typing
6. Bisimilarity for a first-order calculus of objects with subtyping
7. Typed behavioural equivalences for processes in the presence of subtyping
8. On asynchronous communication semantics
9. On full abstraction for PCF: I, II, and III
10. Towards a theory of weak bisimulation for local names
11. A theory of bisimulation for a fragment of Concurrent ML with local names
12. Towards a fully abstract semantics for local variables
13. Fully abstract semantics of typed λ-calculi
14. A calculus of mobile processes
15. Barbed bisimulation
16. Typing and subtyping for mobile processes
17. Observable properties of higher order functions that dynamically create local names, or: What's new?
18. LCF considered as a programming language