Regular Types for Active Objects

ACM SIGPLAN Notices

Volumn 28, Issue 10, 1993, Pages 1-15

  Nierstrasz, Oscar ^a,b  

^a UNIVERSITY OF GENEVA   (Switzerland)

^b Centre Universitaire d'Inforrnatique ^*  (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976708136     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/167962.167976     Document Type: Article

References (30)

1. Samson Abramsky, “Observation Equivalence as a Testing Equivalence,” Theoretical Computer Science, vol. 53, North-Holland, 1987, pp. 225-241.
2. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley, 1974.
3. J.C.M. Baeten and Peter Weijland, Process Algebra, Cambridge University Press, 1990.
4. Franco Barbanera and Mariangiola Dezani-Ciancaglini, “Intersection and Union Types,” in Proceedings Theoretical Aspects of Computer Science (TACS ‘91), ed. T. Ito and A.R. Meyer, LNCS 526, Springer-Verlag, Sendai, Japan, Sept. 1991, pp. 651-674.
5. J.A. Bergstra and J.W. Klop, “The Algebra of Recursively Defined Processes and the Algebra of Regular Processes,” in Proceedings ICALP ‘84, ed. J. Paredaens, LNCS 172, Springer-Verlag, Antwerpen, pp. 82-95.
6. S.D. Brookes, C.A.R. Hoare and A.W. Roscoe, “A Theory of Communicating Sequential Processes,” Journal of the ACM, vol. 31, no. 3, July 1984, pp. 560-599.
7. Peter S. Canning, William Cook, Walter L. Hill, John C. Mitchell and Walter G. Olthoff, “F-Bounded Quantification for Object-Oriented Programming,” Proceedings of the ACM Conference on Functional Programming and Computer Architecture, Sept. 11-13, 1989, pp. 273-280.
8. Luca Cardelli and Peter Wegner, “On Understanding Types, Data Abstraction, and Polymorphism,” ACM Computing Surveys, vol. 17, no. 4, Dec 1985, pp. 471-522.
9. E.M. Clarke, E.A. Emerson and A.P. Sistla, “Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications,” ACM TOPLAS, vol. 8, no. 2, April 1986, pp. 244-263.
10. Rance Cleaveland, Joachim Parrow and Bernhard Steffen, “The Concurrency Workbench,” in Automatic Verification Methods for Finite State Systems: Proceedings, ed. Joseph Sifakis, LNCS 407, Springer-Verlag, 1989, pp. 24-37.
11. Rocco De Nicola, “Extensional Equivalences for Transition Systems,” Acta Informatica, vol. 24, 1987, pp. 211-237.
12. S. Graf and J. Sifakis, “A Logic for the Specification and Proof of Regular Controllable Processes of CCS,” Acta Informatica, vol. 23, no. 5, 1986, pp. 507-528.
13. Matthew Hennessy, “Acceptance Trees,” Journal of the ACM, vol. 32, no. 4, Jan 1985, pp. 896-928.
14. Matthew Hennessy, Algebraic Theory of Processes, MIT Press, Cambridge, Massachusetts, 1988.
15. Hans Hüttel, “Decidability, Behavioural Equivalences and Infinite Transition Graphs,” Ph.D. thesis, ECS-LFCS-91-181, Computer Science Dept., University of Edinburgh, Dec. 1991.
16. Paola Inverardi and Corrado Priami, “Evaluation of Tools for the Analysis of Communicating Systems,” Bulletin of EATCS, vol. 45, October 1991, pp. 158-185.
17. Dennis G. Kafura and Keung Hae Lee, “Inheritance in Actor Based Concurrent Object-Oriented Languages,” in Proceedings ECOOP ‘89, ed. S. Cook, Cambridge University Press, Nottingham, July 10-14, 1989, pp. 131-145.
18. Kim G. Larsen, “Proof Systems for Hennessy-Milner Logic with Recursion,” in Proceedings CAAP ‘88, ed. M. Dauchet, M. Nivat, LNCS 299, Springer-Verlag, Nancy, March 1988, pp. 215-230.
19. Robin Milner, “A Complete Inference System for a Class of Regular Behaviours,” Journal of Computer and System Sciences, vol. 28, Academic Press, 1984, pp. 439-466.
20. Robin Milner, Communication and Concurrency, Prentice-Hall, 1989.
21. Robin Milner, “The Polyadic p Calculus,” ECSLFCS-91-180, Computer Science Dept., University of Edinburgh, Oct. 1991.
22. Oscar Nierstrasz and Michael Papathomas, “Viewing Objects as Patterns of Communicating Agents,” Proceedings OOPSLA/ECOOP ‘90, ACM SIGPLAN Notices, vol. 25, no. 10, Oct 1990, pp. 38-43.
23. Oscar Nierstrasz and Michael Papathomas, “Towards a Type Theory for Active Objects,” ACM OOPS Messenger, Proceedings OOPSLA/ECOOP 90 Workshop on Object-Based Concurrent Systems, vol. 2, no. 2, April 1991, pp. 89-93.
24. Oscar Nierstrasz, “Towards an Object Calculus,” in Proceedings of the ECOOP ‘91 Workshop on Object-Based Concurrent Computing, ed. M. Tokoro, O. Nierstrasz, P. Wegner, LNCS 612, Springer-Verlag, 1992, pp. 1-20.
25. Oscar Nierstrasz, “Composing Active Objects - The Next 700 Concurrent Object-Oriented Languages,” in Research Directions in Concurrent Object Oriented Programming, ed. G. Agha, P. Wegner and A. Yonezawa, MIT Press, 1993, to appear.
26. Michael Papathomas, “A Unifying Framework for Process Calculus Semantics of Concurrent Object-Oriented Languages,” in Proceedings of the ECOOP ‘91 Workshop on Object-Based Concurrent Computing, ed. M. Tokoro, O. Nierstrasz, P. Wegner, LNCS 612, Springer-Verlag, 1992, pp. 53-79.
27. Benjamin C. Pierce, “Intersection Types and Bounded Polymorphism,” ECS-LFCS-92-200, Computer Science Dept., University of Edinburgh, March, 1992.
28. Simon Thompson, Type Theory and Functional Programming, International Computer Science Series, Addison-Wesley, 1991.
29. Peter Wegner and Stanley B. Zdonik, “Inheritance as an Incremental Modification Mechanism or What Like Is and Isn't Like,” in Proceedings ECOOP ‘88, ed. S. Gjessing and K. Nygaard, LNCS 322, Springer Verlag, Oslo, August 15-17, 1988, pp. 55-77.
30. Barbara Liskov and Jeannette Wing, “A New Definition of the Subtype Relation,” in Proceedings ECOOP ‘93, ed. O. Nierstrasz, LNCS, Springer-Verlag, Kaiserslautern, Germany, July 1993, to appear.