127 citations found. Retrieving documents...
D. J. Walker. Bisimulation and divergence. Information and Computation, 85(2):202-241, 1990.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Processes, Functions, and Datatypes - Vasconcelos (1998)   (Correct)

....with a deep layer of syntatic sugar, but the mutual exclusion via locks must be explicitly programmed. Walker showed how to describe a semantics for concurrent object oriented programming languages by a systematic translation of a (subset) of the POOL [3] programming language into the calculus [29]. Each method in an object is assigned a different name; all these names are multiplexed into a single name, making the invocation of a method a two way protocol, against a one way in T yCO. T yCO has the Actor model of computation [2, 9] among its most influential sources. Back in 1977, Hewitt ....

David Walker. Objects in the -calculus. Information and Computation, 116(2):253--271, 1995.


Subtyping and Matching for Mobile Objects - Michele Bugliesi Giuseppe (2001)   (2 citations)  (Correct)

....The first class contains works that provide semantics to objects by encoding them into process calculi. Works in the second class study calculi where primitives for objects and for concurrent processes coexist. Systematic translations of objects into calculus can be found, for instance, in [Wal95,HK96,San98,KS98]. Works that belong to the second approach are much closer to what we do here. Among these it is worth to mention the approaches of [Vas94,PT95,FMLR00] which, given a name passing calculus, build high level constructors distinctive of object oriented languages. A complementary approach is followed ....

....for the self variable is the name of the object rather then the object itself. A distinctive feature of [GH98] is the fact that the syntax of conc includes sequential composition of expressions that return results. This contrasts with what happens in most formalisms based on processes ([Vas94,PT95,Wal95,KS98]) where the operation of returning a result is translated into sending a message on a result channel. Even though we did not explicitly address the problem of returning a result, it is easy to extend our framework by endowing agent interfaces not only with methods, but also with fields whose ....

D.J Walker. Objects in the -calculus. Information and Computation, 116(2):253--


PICCOLA - a Small Composition Language - Achermann, Lumpe, Schneider.. (1999)   (17 citations)  (Correct)

.... research has focused on process algebras (i.e. equational theories of communicating processes) and process calculi (i.e. operational theories of evolving systems of communicating processes) The # calculus has proven to be successful for modeling object oriented concepts [HT91, Jon93, Vas94, BS95, Wal95] and Sangiorgi has demonstrated that Abadi and Cardelli s first order functional Object Calculus [AC96] can be faithfully translated to the # calculus [San96] The design of PICCOLA owes a great deal to the experimental programming language PICT [PT97] PICT s programming constructs are ....

David J. Walker. Objects in the Pi-Calculus. Information and Computation, 116(2):253--271, 1995.


An Approach to Object-Orientation in Action Systems - Bonsangue, Kok, Sere (1997)   (9 citations)  (Correct)

....Furthermore, objects are active and distributed, hence, several objects are executed in parallel. The first model incorporating active objects was the actor model [Hew77, Agh86] Moreover, CCS and the calculus, have been used to give a semantics to POOL type parallel object oriented languages [Jon93, Wal95]. Recently several formalisms and languages have been proposed that offer active objects, e.g. Oblique [Car95] which supports distributed object oriented computation and Oblets [BN96] which are written in Oblique and which have a family of Web browsers capable of running Oblets. We reason about ....

D.J. Walker. Objects in the -calculus. Information and Computation, 116(2):253--271, 1995.


Modal Transition Systems: A Foundation for - Three-Valued Program Analysis   (Correct)

No context found.

D. J. Walker. Bisimulation and divergence. Information and Computation, 85(2):202-241, 1990.


A Study of Objects - Hankin (1999)   (Correct)

No context found.

Walker, D. (1995, February). Objects in the pi-calculus. Information and Computation 116 (2), 253-271.


Universita degli Studi di Pisa - Facolta Di Scienze   (Correct)

No context found.

D. Walker. Objects in the pi-calculus. Information and Computation, 116(2):253--271, 1995.


A Predicative Semantics of Objects and References - Chen   (Correct)

No context found.

D. Walker. Objects in the picalculus. Information and Computation, 116(2):253--271, 1995.


A π-Calculus Semantics of Java: The Full Definition - Jacobs, Piessens   (Correct)

No context found.

D. Walker. Objects in the #-calculus. Information and Computation, 115:253--271,


Unknown -   (Correct)

No context found.

D. Walker. Objects in the #-calculus. Information and Computation, 116(2):253--271, 1995.


On Subsumption and Instance Problem in - General Tboxes Sebastian   (Correct)

No context found.

Robert Givan, David A. McAllester, Carl Witty, and Dexter Kozen. Tarskian set constraints. Information and Computation, 174(2):105--131, 2002.


History Dependent Automata - Montanari, Pistore (2001)   (3 citations)  (Correct)

No context found.

D. Walker. Objects in the -calculus. Information and Computation, 116(2):253--271, 1995.


Actors: A Model for Reasoning about Open Distributed Systems - Agha, Thati, Ziaei (2001)   (Correct)

No context found.

D. Walker. Objects in the Pi-Calculus. Information and Computation, 116(2):253--271, 1995.


On Subsumption and Instance Problem in - General Tboxes Sebastian   (Correct)

No context found.

Robert Givan, David A. McAllester, Carl Witty, and Dexter Kozen. Tarskian set constraints. Information and Computation, 174(2):105--131, 2002.


Ordered SOS Process Languages for Branching and Eager.. - Ulidowski, Phillips (2002)   (2 citations)  (Correct)

No context found.

D. Walker. Bisimulation and divergence. Information and Computation, 85(2):202-241, 1990.


Some of My Favourite Results in Classic Process Algebra - Aceto (2003)   (Correct)

No context found.

D. Walker, Bisimulation and divergence, Information and Computation, 85 (1990), pp. 202--241. 18


Nominal Calculi for Security and Mobility - Andrew Gordon University (1997)   (4 citations)  (Correct)

No context found.

D. Walker. Objects in the pi-calculus. Information and Computation, 116(2):253--271, 1 Feb. 1995. 7


Finite Axiom Systems for Testing Preorder and De Simone Process.. - Ulidowski (1996)   (1 citation)  (Correct)

No context found.

D. Walker. Bisimulation and divergence. Information and Computation, 85(2):202-- 241, 1990. 38


Decidability and Complexity Issues for Infinite-State Processes - Srba (2003)   (Correct)

No context found.

D. Walker. Bisimulation and divergence. Information and Computation, 85(2):202--241, 1990.


Linearity and the Pi-Calculus - Naoki Kobayashi University (1996)   (85 citations)  (Correct)

No context found.

David Walker. Objects in the -calculus. Information and Computation, 116:253--271, 1995.


Inheritance in the Join Calculus - Fournet, Laneve, Maranget.. (2001)   (8 citations)  (Correct)

No context found.

D. J. Walker. Objects in the pi-calculus. Information and Computation, 116(2):253-271, 1995.


A Calculus for Modeling Software Components - Nierstrasz, Achermann (2002)   (Correct)

No context found.

David Walker. Objects in the #-calculus. Information and Computation, 116(2):253--271, February 1995.


Unknown - Communicating And Mobile   (Correct)

No context found.

D. Walker. Objects in the -calculus. Information and Computation, 115:253--271, 1995. 2


Mathematical Modelling of Generalization - Martin Anthony Department   (Correct)

No context found.

David Haussler: Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1): 78-- 150, 1992.


Uniform Glivenko-Cantelli Theorems and - Concentration Of Measure (2002)   (Correct)

No context found.

David Haussler: Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1): 78-- 150, 1992.

First 50 documents  Next 50

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