Changeable interfaces and promised messages for concurrent components

Statically checked process types ensure that a server understands all messages sent by (concurrent) clients. although the acceptability of messages may change dynamically. But. as proposed so far, process types do not ensure that ser\‘ers return appropriate answers. In this paper an extension is proposed: Servers must send promised messages (to return results), possibly after receiving further messages. -4 type checker statically ensures that promised messages cannot be involved in deadlocks and lifelocks. The proposed type concept supports subtyping as well as separate compilation.

[1]  Marc Pantel,et al.  A set-constraint-based analysis of actors , 1997 .

[2]  Franz Puntigam,et al.  Coordination Requirements Expressed in Types for Active Objects , 1997, ECOOP.

[3]  Naoki Kobayashi.  A partially deadlock-free typed process calculus , 1998, TOPL.

[4]  Jeannette M. Wing,et al.  A behavioral notion of subtyping , 1994, TOPL.

[5]  HanneRiisNielson ComputerScienceDepartment.  From Cml to Process Algebras , 1993 .

[6]  Franz Puntigam.  Types for Active Objects Based on Trace Semantics , 1997 .

[7]  Benjamin C. Pierce,et al.  Linearity and the pi-calculus , 1999, TOPL.

[8]  António Ravara,et al.  Behavioural Types for a Calculus of Concurrent Objects , 1997, Euro-Par.

[9]  Howard Bowman,et al.  On behavioural subtyping in LOTOS , 1997 .

[10]  Flemming Nielson,et al.  From CML to Process Algebras (Extended Abstract) , 1993, CONCUR.

[11]  Oscar Nierstrasz,et al.  Regular types for active objects , 1993, OOPSLA '93.

[12]  Luca Cardelli,et al.  Subtyping recursive types , 1991, POPL '91.

[13]  Elie Najm,et al.  A calculus of object bindings , 1997 .

[14]  Davide Sangiorgi,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[15]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[16]  Vasco Thudichum Vasconcelos,et al.  Principal Typing Schemes in a Polyadic pi-Calculus , 1993, CONCUR.

[17]  Simon J. Gay,et al.  A sort inference algorithm for the polyadic π-calculus , 1993, POPL '93.

[18]  Vasco Thudichum Vasconcelos,et al.  Typed Concurrent Objects , 1994, ECOOP.

[19]  Franz Puntigam.  Dynamic type Information in Process Types , 1998, Euro-Par.