A fully abstract may testing semantics for concurrent objects

Theoretical Computer Science

Volumn 338, Issue 1-3, 2005, Pages 17-63

  Jeffrey, Alan ^a,b   Rathke, Julian ^c  

^a DEPAUL UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

Concurrency; Full abstraction; Object calculus

Indexed keywords

ABSTRACTING; CALCULATIONS; OBJECT ORIENTED PROGRAMMING; SEMANTICS; SET THEORY;

CONCURRENT OBJECTS; FULL ABSTRACTION; OBJECT CALCULUS; TESTING SEMANTICS;

CONCURRENCY CONTROL;

EID: 18544370559     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.10.012     Document Type: Article

References (29)

1. S. Abramsky The lazy lambda calculus D. Turner Declarative Programming 1989 Addison-Wesley Reading, MA
2. S. Abramsky Domain theory in logical form Ann. Pure Appl. Logic 51 1991 1 77
3. S. Abramsky, R. Jagadeesan, and P. Malacaria Full abstraction for PCF Inform. Comput. 163 2000 409 470
4. M. Boreale, R. de Nicola, and R. Pugliese Trace and testing equivalences on asynchronous processes Inform. Comput. 172 2002 139 164
5. S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe A theory of communicating sequential processes J. Assoc. Comput. Mach. 31 3 1984 560 599
6. L. Cardelli, and M. Abadi A Theory of Objects 1996 Springer Berlin
7. P. Di Blasio, and K. Fisher A calculus for concurrent objects Proc. CONCUR 1996 655 670
8. W. Ferreira, M. Hennessy, and A.S.A. Jeffrey A theory of weak bisimulation for core CML J. Funct. Programming 8 5 1998 447 491
9. M. Fiore, E. Moggi, and D. Sangiorgi A fully-abstract model for the π -calculus Proc. IEEE Conf. Logic in Computer Science 1996 IEEE Press New York 43 54
10. A.D. Gordon, P.D. Hankin, A concurrent object calculus: reduction and typing, in: Proc. Internat. Workshop on High-Level Concurrent Languages, Electronic Notes in Theoretical Computer Science, Vol. 16(3), Elsevier, Amsterdam, 1998.
11. A.D. Gordon, and G.D. Rees Bisimilarity for a first-order calculus of objects with subtyping Proc. ACM Symp. Principles of Programming Languages 1996 ACM Press New York 386 395
12. M. Hennessy Algebraic Theory of Processes 1988 MIT Press Cambridge, MA
13. M. Hennessy A fully abstract denotational semantics for the π -calculus Theoret. Comput. Sci. 278 1 2002 53 89
14. M. Hennessy, J. Rathke, Typed behavioural equivalences for processes in the presence of subtyping, in: Proc. Comput.: Australasian Theory Symp. Electronic Notes in Theoretical Computer Science, Vol. 61, Elsevier, Amsterdam, 2002.
15. K. Honda, M. Tokoro, On asynchronous communication semantics, in: Proc. ECOOP Workshop on Object-Based Concurrent Computing, Lecture Notes in Computer Science, Vol. 612, Springer, Berlin, 1992, pp. 21-51.
16. J.M.E. Hyland, and C.-H.L. Ong On full abstraction for PCF I, II, and III Inform. Comput. 163 2000 285 408
17. A.S.A. Jeffrey, and J. Rathke Towards a theory of weak bisimulation for local names Proc. IEEE Logic in Computer Science 1999 IEEE Press New York 56 66
18. A.S.A. Jeffrey, and J. Rathke A theory of bisimulation for a fragment of Concurrent ML with local names Proc. IEEE Logic in Computer Science 2000 IEEE Press New York 311 321
19. N.A. Lynch, and M.R. Tuttle Hierarchical correctness proofs for distributed algorithms Proc. ACM Symp. Principles of Distributed Computing 1987 ACM Press New York 137 151
20. R. Milner Fully abstract semantics of typed λ -calculi Theoret. Comput. Sci. 4 1977 1 22
21. R. Milner Communicating and Mobile Systems 1999 Cambridge University Press Cambridge
22. R. Milner, J. Parrow, and D. Walker A calculus of mobile processes Inform. Comput. 100 1 1992 1 77
23. R. Milner, D. Sangiorgi, Barbed bisimulation, in: Proc. Internat. Colloq. Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 623, Springer, Berlin, 1992, pp. 685-695.
24. J.-H. Morris, Lambda calculus models of programming languages, Dissertation, MIT, 1968.
25. A.M. Pitts, I.D.B. Stark, Observable properties of higher order functions that dynamically create local names, or: what's new? in: Proc. Internat. Symp. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 711, Springer, Berlin, 1993, pp. 122-141.
26. G. Plotkin LCF considered as a programming language Theoret. Comput. Sci. 5 1977 223 256
27. G.B.J. Rumbaugh, and I. Jacobson The Unified Modeling Language User Guide 1999 Addison-Wesley Reading, MA
28. D.S. Scott, Domains for denotational semantics, in: M. Neilsen, E.M. Schmidt (Eds.), Proc. ICALP 82, Lecture Notes in Computer Science, Vol. 140, Springer, Berlin, 1982, pp. 577-613.
29. P. Selinger, First-order axioms for asynchrony, in: Proc. CONCUR, Lecture Notes in Computer Science, Vol. 1243, Springer, Berlin, 1997, pp. 376-390.