J.-G. Schneider and M. Lumpe. Synchronizing Concurrent Objects in the Pi-Calculus. In R. Ducournau and S. Garlatti, editors, Proceedings of Langages et Modeles a Objets '97, pages 61--76, Rosco#, Oct. 1997. Hermes.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....in such models. 1. Introduction With the ability to directly model dynamic reference structures, process algebras such as the calculus ( Milner92, Milner99] and its variations have been used to model concurrent objects ( Walker95, Jones93, Sangi96, H uttel96, Zhang97] Some researchers ( Schne97, Zhang98a, Zhang98b] have also applied it to model compositional concurrent objects in the aspect oriented programming style ( Aksit92, Holmes97] attempting to avoid the inheritance anomaly [McHale94] One of the important issues with such models is to identify the similarity between composed ....

Jean-guy Schneider and Markus Lumpe. (1997). "Synchronizing Concurrent Objects in the Pi-Calculus", Proceedings of Langages et Modeles a Objets '97, Roland Ducournau and Serge Garlatti (Ed.), pp.61--76, Hermes, Roscoff.

No context found.

J.-G. Schneider and M. Lumpe. Synchronizing Concurrent Objects in the Pi-Calculus. In R. Ducournau and S. Garlatti, editors, Proceedings of Langages et Modeles a Objets '97, pages 61--76, Rosco#, Oct. 1997. Hermes.

....a common, unifying framework. The simplest foundation that seems appropriate is that of communicating, concurrent agents. For this reason we have extensively explored the asynchronous polyadic # calculus [Mil90, HT91] as a tool for modelling objects, components, and software composition [LSN96, SL97] The tuple based communication of the # calculus, however, turns out to restrict extensibility and reuse. These observations have led us to explore communication of forms a special notion of extensible records instead of tuples. In the rest of this section, we illustrate briefly the nature ....

.... schemes can be used to simplify the modelling of numerous object oriented and component based abstractions [Sch99] For example, it is much easier to model generic synchronization policies (such as a readers writers mutual exclusion policy) in the #L calculus than in the polyadic # calculus [SL97] Although the #L calculus makes a fundamental modification to the # calculus, it is possible to translate #L agents to # processes and back, preserving behavioural equivalence both ways. Furthermore, the concept of expressing computation by means of exchanging messages is computationally ....

[Article contains additional citation context not shown here]

Jean-Guy Schneider and Markus Lumpe. Synchronizing Concurrent Objects in the Pi-Calculus. In Roland Ducournau and Serge Garlatti, editors, Proceedings of Langages et Mod eles a Objets '97, pages 61--76, Roscoff, October 1997. Hermes.

....to add newly defined higher level abstractions and composition mechanisms. Finally, we are also able to reason about composition and check valid compositions. We have previously used the # calculus to model object composition and generic synchronization policies as an example for wrapping [LSN96, SL97, Var96]. The inherent problem, however, is the limited reusability and extensibility due to position dependent parameters. We propose #L as a variant of the # calculus that is inherently extensible. In the polyadic # calculus [Mil91] sender and receiver processes need to agree on the number of ....

....that a storage cell can store only a single value. Now we are ready to define a class abstraction. This abstraction implements a simple metaobject protocol that allows us to create objects. Basically, the definition of a class abstraction follows the scheme similar to those found in [AC96] and [SL97]. Furthermore, the class abstraction can be solely implemented in Piccola. There is no need to extend the language . The object model defined by the abstraction Class that supports single inheritance and private and protected features. This abstraction provides three functions: newInstance, ....

[Article contains additional citation context not shown here]

Schneider, J.-G. and Lumpe, M. Synchronizing Concurrent Objects in the Pi-Calculus. In Ducournau, R. and Garlatti, S., editors, Proceedings of Langages et Modeles a Objets '97, pages 61--76, Rosco#, October 1997. Hermes.

.... defined a record based object model in the polyadic # calculus [MIL 91] that incorporates known languages features of object oriented programming languages such as encapsulation, object identity, instantiation, synchronization, dynamic binding, inheritance, overriding, and class variables [LUM 96, SCH 97] In this model, classes are represented as runtime entities (i.e. as class metaobjects) which turned out to be useful for (i) the declaration, initialization, and access control of class variables, ii) the implementation of class methods, iii) the creation and initialization of instances, and ....

....and extensibility of abstractions are limited due to position dependent parameters. For example, the specification of generic readers writers synchronization policies cannot be directly coded without wrapping method arguments in order to treat an arbitrary number of arguments as a single value [SCH 97] A Metamodel for Concurrent, Object based Programming 3 In order to address these problems, we have defined the FORM calculus, an inherently polymorphic variant of the # calculus, in which agents communicate by passing forms (a special notion of extensible records) rather than tuples. Besides ....

[Article contains additional citation context not shown here]

SCHNEIDER J.-G., LUMPE M., "Synchronizing Concurrent Objects in the PiCalculus ", DUCOURNAU R., GARLATTI S., Eds., Proceedings of Langages et Modles Objets '97, Roscoff, 1997, Hermes, p. 61--76.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC