B. Thomsen. Plain CHOCS. Acta Informatica, 30:1--59,  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Names, Equations, Relations: Practical Ways to Reason about `new' - Stark (1997) (Correct)
....abstract names to keep track of scope or privacy; it seems likely that the relational logic will adapt to reasoning about some of these. In fact the standard calculus has no function types, so equational reasoning is appropriate and sufficient [25] but second and higher order calculi like CHOCS [38] and HO [34] might benefit from a relational treatment. Other possibilities are the spi calculus [1] and the ambient calculus [4] both of which rely explicitly on the detailed behaviour of names. Consider for example the spi calculus, which uses names as a foundation for reasoning about security ....
B. Thomsen. Plain CHOCS. Acta Informatica, 30:1--59,
Bisimulation for Higher-Order Process Calculi - Sangiorgi (1996) (30 citations) (Correct)
.... We illustrate the kind of problems which arise using the simple process passing calculus described by the following grammar (roughly, the language we shall use in the paper) P : a: hP 1 iP 2 j a: X) P j P 1 j P 2 j a P j X j P j 0 This calculus is similar to Thomsen s Plain CHOCS [Tho93], and is a second order fragment of the Higher Order calculus [San92] Informally, process a: hP 1 iP 2 can perform an output action at a emitting P 1 and then continues as P 2 . Process a: X)P can receive a process at a, say Q, and then continues as PfQ=Xg. Symbol X represents a process ....
....second order calculi. Acknowledgements. I am most grateful to Robin Milner, for encouragement and many technical discussions, and to Egidio Astesiano, for comments on an early draft of the paper. 2 The language and its transition semantics The calculus we use is similar to Thomsen s Plain CHOCS [Tho93]; hence, processes can be passed around. The main differences from Plain CHOCS are: The use of abstractions and concretions to represent input and output prefixes; the presence of first order names, i.e. names which carry nothing. These are opposed to higher order names, i.e. names used to ....
B. Thomsen. Plain CHOCS. Acta Informatica, 30:1--59, 1993.
Towards a Semantic-Based Verification Environment for the .. - Ferrari, Modoni, Quaglia (1995) (2 citations) (Correct)
....calculi, namely calculi in which the communication topology among processes can dynamically evolve when computation progresses. In the calculus mobility is achieved via the communication of names rather than communication of processes as happens in so called higher order process calculi (e.g. [Tho93]) Many issues of concurrent programming languages (e.g. the encoding of complex data structures as processes [MPW92] higher order processes [San92] can be profitably analyzed by considering them in the abstract setting provided by the calculus. Moreover, the calculus has been adopted as a ....
B. Thomsen. Plain Chocs. Acta Informatica, 30, 1993.
On Modelling Mobility - Amadio (1999) (Correct)
....that the answer to this question should be positive (as in [21,22,15] for the same reason that, say, a model of functional computation should take for granted ff renaming and substitution. On these assumptions, it is natural to consider the calculus [18,34] or related formalisms such as Chocs [39], as the backbone of a model of mobile computation. In first approximation, the calculus models systems of asynchronous processes which interact by message passing. The calculus models dynamic process creation, dynamic channel creation, transmission of channel names, and a static scoping ....
B. Thomsen. Plain Chocs. Acta Informatica, 30:1--59, 1993.
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