Strong types for coordinating active objects

Concurrency and Computation: Practice and Experience

Volumn 13, Issue 4, 2001, Pages 293-326

  Puntigam, Franz ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Active objects; Concurrent programming languages; Type systems

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE MAINTENANCE; COMPUTER SOFTWARE REUSABILITY; CONCURRENT ENGINEERING; CONSTRAINT THEORY; OPTIMIZATION; RESOURCE ALLOCATION;

ACTIVE OBJECTS; ASYNCHRONOUS MESAGE PASSING; CONCURRENT PROGRAMMING LANGUAGES;

OBJECT ORIENTED PROGRAMMING;

EID: 0035014474     PISSN: 15320626     EISSN: None     Source Type: Journal    
DOI: 10.1002/cpe.570     Document Type: Article

References (50)

1. Cardelli L, Wegner P. On understanding types, data abstraction, and polymorphism. ACM Computing Surveys 1985; 17(4):471-522.
2. Meyer B. Reusable Software: The Base Object-Oriented Component Libraries. Prentice-Hall, 1994.
3. Meyer B. Eiffel: The Language. Prentice Hall, 1992.
4. Liskov BH, Wing JM. A behavioral notion of subtyping. ACM Transactions on Programming Languages and Systems 1994; 16(6):1811-1841.
5. Matsuoka S, Yonezawa A. Analysis of inheritance anomaly in object-oriented concurrent programming languages. Research Directions in Concurrent Object-Oriented Programming, Agha G (ed.). The MIT Press, 1993.
6. Caromel D. Toward a method of object-oriented concurrent programming. Communications of the ACM 1993; 36(9):90-101.
7. Kobayashi N, Yonezawa A. Type-theoretic foundations for concurrent object-oriented programming. OOPSLA '94 Proceedings. ACM SIGPLAN Notices 1994; 29(10):31-45.
8. Meyer B. Systematic concurrent object-oriented programming. Communications of the ACM 1993; 36(9):56-80.
9. Hopcroft JE, Ullman JD. Formal Languages and their Relation to Automata. Addison-Wesley, 1969.
10. Wegner P, Zdonik SB. Inheritance as an incremental modification mechanism or what like is and isn't like. ECOOP '88 Proceedings (Springer-Verlag Lecture Notes in Computer Science, vol. 322). 1988; 55-77.
11. Agha G. Actors: A Model of Concurrent Computation in Distributed Systems. The MIT Press, 1986.
12. Agha G, Mason IA, Smith S, Talcott C. Towards a theory of actor computation. CONCUR '92 Proceedings (Springer-Verlag Lecture Notes in Computer Science, vol. 630). 1992; 565-579.
13. Hewitt C. Viewing control structures as patterns of passing messages. Journal of Artificial Intelligence 1977; 8(3):323-364.
14. Hoare CAR. Communicating sequential processes. Communications of the ACM 197821(8):666-677.
15. Milner R, Parrow J, Walker D. A calculus of mobile processes (parts I and II). Information and Computation 1992; 100:1-77.
16. Milner R. Communication and Concurrency. Prentice-Hall, 1989.
17. Milner R. The polyadic π -calculus: A tutorial. Logic and Algebra of Specification. Springer-Verlag, 1992; 203-246.
18. Baeten JCM, Weijland WP. Process Algebra. Cambridge University Press, 1990.
19. Hennessy M. Algebraic Theory of Processes. The MIT Press, 1988.
20. Honda K, Tokoro M. An object calculus for asynchronous communication. ECOOP '91 Proceedings (Springer-Verlag Lecture Notes in Computer Science, vol. 512). 1991; 141-162.
21. Abadi M, Cardelli L. On subtyping and matching. ACM Transactions on Programming Languages and Systems 1996; 18(4):401-423.
22. Abadi M, Cardelli L. A Theory of Objects. Springer-Verlag, 1996.
23. Amadio RM, Cardelli L. Subtyping recursive types. POPL '91 Proceedings. ACM, 1991; 104-118.
24. Gunter CA, Mitchell JC (eds.). Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design. The MIT Press, 1994.
25. Mitchell JC. Foundations for programming languages. The MIT Press, 1996.
26. Gay SJ. A sort inference algorithm for the polyadic π-calculus. POPL '93 Proceedings. ACM, 1993.
27. Vasconcelos VT. Typed concurrent objects. ECOOP '94 Proceedings (Springer-Verlag Lecture Notes in Computer Science, vol. 821). 1994; 100-117.
28. Vasconcelos VT, Honda K. Principal typing schemes in a polyadic pi-calculus. CONCUR '93 Proceedings, July 1993.
29. Pierce B, Sangiorgi D. Typing and subtyping for mobile processes. LICS '93 Proceedings, 1993.
30. Kobayashi N, Pierce B, Turner D. Linearity and the pi-calculus. POPL '96 Proceedings. ACM, 1996.
31. Kobayashi N. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems 1998; 20(2):434-182.
32. Sumii E, Kobayashi N. A generalized deadlock-free process calculus. Electronic Notes in Theoretical Computer Science 1998; 16(3).
33. Gordon AD, Hankin PD. A concurrent object calculus: Reduction and typing. HLCL '98 Proceedings, September 1998.
34. Campbell RH, Habermann AN. The specification of process synchronization by path expressions. ISOS '74 Proceedings (Springer-Verlag Lecture Notes in Computer Science, vol. 16). 1974.
35. van den Bos J, Plasmeijer R, Stroet J. Process communication based on input specifications. ACM Transactions on Programming Languages and Systems 1981; 3(3):224-250.
36. Nierstrasz O. Regular types for active objects. OOPSLA '93 Proceedings. ACM SIGPLAN Notices 1993; 28(10): 1-15.
37. Nielson F, Nielson HR. From CML to process algebras. CONCUR '93 Proceedings (Springer-Verlag Lecture Notes in Computer Science, vol. 715). 1993; 493-508.
38. Bowman H, Briscoe-Smith C, Derrick J, Strulo B. On behavioural subtyping in LOTOS. FMOODS '97 Proceedings. Chapman & Hall, 1997.
39. Ravara A, Vasconcelos VT. Behavioural types for a calculus of concurrent objects. EuroPar '97 Proceedings (Springer-Verlag Lecture Notes in Computer Science, vol. 1300). 1997.
40. Colaco JL, Pantel M, Salle P. A set-constraint-based analysis of actors. FMOODS '97 Proceedings. Chapman & Hall, 1997.
41. Puntigam F. Flexible types for a concurrent model. Concurrent object-oriented programming and Petri Nets (Springer-Verlag Lecture Notes in Computer Science, vol. 2001.), Agha G, De Cindio F, Rozenberg G (eds.). 2000.
42. Puntigam F. Type specifications with processes. FORTE '95 Proceedings. Chapman & Hall, 1995.
43. Puntigam F. Types for active objects based on trace semantics. FMOODS '96 Proceedings. Chapman & Hall, 1996.
44. Puntigam F. Coordination requirements expressed in types for active objects. ECOOP '97 Proceedings (Springer-Verlag Lecture Notes in Computer Science, vol. 1241). 1997.
45. Puntigam F. Dynamic type information in process types. EuroPar '98 Proceedings (Springer-Verlag Lecture Notes in Computer Science, vol. 1470). 1998.
46. Najm E, Nimour A. A calculus of object bindings. FMOODS '97 Proceedings. Chapman & Hall, 1997.
47. Hogg J. Islands: Aliasing protection in object-oriented languages. OOPSLA '91 Proceedings. ACM SIGPLAN Notices 1991; 26(10):271-285.
48. Quaglia P, Walker D. On encoding pπ in mπ. Technical Report BRICS RS-98-26, Aarhus University, Denmark, 1998.
49. Yoshida N. Graph types for monadic mobile processes. Foundations of Software Technology and Theoretical Computer Science Proceedings (Springer-Verlag Lecture Notes in Computer Science, vol. 1180). 1996; 371-386.
50. Amadio RM, Dam M. Reasoning about higher-order processes. CAAP '95 Proceedings. (Springer-Verlag Lecture Notes in Computer Science, vol. 915). 1995; 202-217.