G. Boudol. Asynchrony and the #-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Bisimulation Proof Methods for Mobile Ambients - Merro, Nardelli (2003) (10 citations) (Correct)
....on processes P . Finally, notice that, in the definition of bisimilarity, actions n are treated apart asking for weaker matching requirements. This is because both actions are not observable. Somehow, this is very similar to what happens with input actions in the asynchronous # calculus [15, 3]. 3.1 Soundness Late and early bisimilarity represent two proof techniques for reduction barbed congruence. More precisely we prove that they are both contextual and contained in reduction barbed congruence. The following lemma is crucial for proving that is contextual. This lemma will be ....
G. Boudol. Asynchrony and the #-calculus. Technical Report RR-1702, INRIA-Sophia Antipolis, 1992.
Fine Grained Multithreading with Process Calculi - Lopes, Silva, Vasconcelos (2001) (Correct)
....1. Introduction In recent years researchers have devoted a great effort in providing semantics for pure concurrent parallel programming languages within the realm of process calculi. Milner, Parrow and Walker s calculus or a asynchronous formulation due to Honda and Tokoro [11, 20] and Boudol [6] has been the starting point for most of these attempts. Several forms and extensions of the asynchronous calculus have since been proposed to provide for more direct programming styles, and to improve efficiency and expressiveness [7, 9, 32] Dataflow and von Neumann architectures represent ....
G. Boudol. Asynchrony and the -calculus (Note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992.
Lambda and pi calculi, CAM and SECD machines - Vasconcelos (2001) (Correct)
....the notion of reduction machines we set up five concrete machines: the usual # calculus with the call by value reduction strategy [11] the CAM machine [4] the SECD machine [11] and two pi calculus based machines. For the first pi based machine, we pick processes of the asynchronous pi calculus [3, 5] typable under the input output type system, together with deterministic reduction, and strong barbed congruence [9] For the second # based machine, we pick contexts for states. A notion of reduction and of equivalence for # calculus contexts is then defined. A (typed) context performs a ....
Gerard Boudol. Asynchrony and the #-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
Bisimulations for Asynchronous Mobile Processes - Martin Hansen Hans (1995) (17 citations) (Correct)
....with simple data values and conditional expression and for the 7r calculus. In this paper we consider Plain LAL, a mobile process calculus which differs from the 7r calculus in the sense that the communication of data values hap pens asynchronously. Previously, Honda and Tokoro [4] and Boudol [2] have described so called asynchronous 7r calculi. However, they have not studied the notion of equivalence within this setting. The surprising result is that in the presence of asynchrony, the open, late and early bisimulation equivalences coincide. As the equivalences are one and the same, this ....
Grad Boudol. Asynchrony and the x-calculus. Technical report, INRIA Sophia-Antipolis, 1992.
Decoding Choice Encodings - Nestmann, Pierce (1999) (52 citations) (Correct)
.... to the distributed implementation of synchronization and selective communication [Mit86, PS92, Kna93, BG95] Our interest in the study of choice encodings originates from the design and implementation of the high level concurrent language Pict [PT95, PT99] an asynchronous choice free # calculus [HT91, Bou92] enriched with several layers of encoded syntactic sugar. The abstract machine of Pict does not provide instructions for selective communication; instead, choice is provided as a library module by a straightforward encoding. Surprisingly, however, this encoding turns out not to be valid with ....
....with asynchronous messages (or equivalently, with non blocking output prefix) This setting has received increasing attention in recent years. In the # calculus, asynchrony was treated using a non standard labeled semantics [HT91, HT92, Hon92] the mini # calculus used a chemical semantics [Bou92]; it has also been investigated using reduction semantics [HY95] concurrent combinators [HY94a, HY94b] and output only barbed congruences [Ode95a, FG96] Only recently, it has been extended with an input guarded choice operator, equipped with a standard labeled semantics, and studied with ....
[Article contains additional citation context not shown here]
G. Boudol. Asynchrony and the #-calculus (Note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
Mobile Objects as Mobile Processes - Merro, Kleist, Nestmann (2001) (Correct)
....in that rather ad hoc setting. 1.2. Contribution In the current paper, we present a # calculus semantics for jeblik corresponding to the semantics proposed in [23] More precisely, our semantics uses an extension of Localised # [19, 18] in short L#, a variant of the asynchronous # calculus [10, 3], where, similar to the Join calculus [6] the recipients of a channel are local to the process that created the channel. The choice of L# as the target language is not by accident: one of its fundamental laws is the forwarder law (cf. Lemma 2) ab = #c) ac c(x) bx) 3) where represents ....
....safe surrogation, and in Section 7 we prove the main result of the paper. Section 8 contains conclusions. Finally, Appendix A contains proofs omitted from the main part of the paper. 2. THE TYPED LOCALISED # CALCULUS Localised # [19, 18] in short L#, is a variant of the asynchronous # calculus [10, 3] where, similar to the Join calculus [6] the recipients of a channel are local to the process that has created the channel. This is achieved by imposing the syntactic constraint that only the output capability of channels may be transmitted, i.e. the recipient of a channel may only use it in ....
Gerard Boudol. Asynchrony and the #-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992. 58
Towards program development, specification and.. - Bednarczyk.. (1995) (Correct)
....of specifications. The logic of specifications is responsible for manipulation of specifications. At the level of pLSD we are talking about the logic of program development. This feature can also be found in Abramsky s approach to programming logics, see [3] and its specialisations, see e.g. [2, 13, 25]. But, for obvious reasons, pLSD cannot be seen as a specialisation of Abramsky s framework: the later was formulated for propositional logics and it does not allow linear theories on any level. 3 Towards an implementation of pLSD in Isabelle Why Isabelle As a general purpose theorem prover ....
Boudol, G. -calculi for (strict) parallel functions. Technical Report 1387, INRIA SophiaAntipolis, 1991.
Solo Diagrams - Laneve, Parrow, Victor (2001) (2 citations) (Correct)
....successful in modelling diverse computational phenomena, and it is natural to ask how much of it is really necessary in order to attain the expressive power. This has led to several interesting and expressive subcalculi. For example, in the more easily implemented asynchronous subcalculus [2, 8] the output pre x u v : P is replaced by the output particle u v. In the fusion calculus [19] the reduction of an input and output results in a fusion of names rather than a substitution. In that calculus both input and output pre x can be replaced by their corresponding particles, in other ....
G. Boudol. Asynchrony and the -calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
The Security Picalculus and Non-interference - Hennessy (2000) (4 citations) Self-citation (Report) (Correct)
No context found.
G. Boudol. Asynchrony and the -calculus. Technical Report 1702, INRIA-Sophia Antipolis, 1992.
Typing Non-uniform Concurrent Objects - Ravara (1999) (10 citations) Self-citation (Erard) (Correct)
.... objects Chapter 3 Typed concurrent objects T yCO Typed Concurrent Objects is a name passing calculus featuring asynchronous communication between concurrent objects via labelled messages carrying names [VT93] The calculus is an object based extension of the asynchronous calculus [Bou92, HT91] synchronous communication and the returning of results are implemented by means of reply messages . T yCO is reminiscent of the calculus [AC96] the Object Calculus of Abadi and Cardelli, in the sense that objects are sums of labelled methods (the variable self being interpreted as the ....
Gerard Boudol. Asynchrony and the -calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992.
Objects as Mobile Processes - Hüttel, Kleist (1996) (5 citations) Self-citation (Report) (Correct)
....extended version of the cal culus with a special case construct, which basically amounts to an extended matching operator. As the target calculus for our translation we instead go for as simple a version of the calculus as possible. The version that we shall use is the asynchronous calculus [CS96, Bou92, HT91, HK95]. The syntax of asynchronous calculus is in the present paper given by: P : a b j P jP j ( a)P j G j G G : 0 j a( b) P j :P j G G We let a; b; 2 Names range over an infinite c ountable set of names, b denote tuples of names, a tuple of the names a, b and c will be written ....
G'erard Boudol. Asynchrony and the -calculus. Technical report, INRIA Sophia-Antipolis, 1992.
Bisimulations for Asynchronous Mobile Processes - Hansen, Hüttel, Kleist (1996) (17 citations) Self-citation (Report) (Correct)
....both for a process calculus with simple data values and conditional expression and for the calculus. In this paper we consider Plain LAL, a mobile process calculus which differs from the calculus in the sense that the communication of data values happens asynchronously. Previously, HT91] and [Bou92] have described so called asynchronous calculi. In [Ode95] it is shown how familiar programming constructs can be encoded in a straightforward fashion within an asynchronous calculus, thus confirming the naturalness of the combination of asynchrony and mobility. The main result of the present ....
....of the operational semantics provided. It turns out that 15 these notions of bisimulation coincide here. We give a sound and complete axiomatization of the common notion of bisimulation equivalence for finite Plain LAL agents. Plain LAL looks somewhat different from the calcui of [HT91] and [Bou92] but it is in fact quite easy to come up with compositional encodings of these calculi in Plain LAL. Although we have not persued this subject very further, this leeds us to belive that our results will indeed also hold for asynchronous versions of the calculus. An interesting question is: How ....
G'erard Boudol. Asynchrony and the -calculus. Technical report, INRIA Sophia-Antipolis, 1992. 16
Linear Forwarders - Gardner, Laneve, Wischik (2003) (Correct)
No context found.
G. Boudol. Asynchrony and the #-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, 1992.
Information Flow vs. Resource Access in the Asynchronous.. - Hennessy, Riely (2000) (8 citations) (Correct)
No context found.
G. Boudol. Asynchrony and the -calculus. Technical Report 1702, INRIA-Sophia Antipolis, 1992.
MIKADO Global Computing Project IST-2001-32222 - Mobile Calculi Based (Correct)
No context found.
G. Boudol. Asynchrony and the p-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
What is a `Good' Encoding of Guarded Choice? - Nestmann (1997) (Correct)
No context found.
G. Boudol. Asynchrony and the -calculus (Note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
Bisimulations in the Join-Calculus - Fournet, Laneve (2001) (1 citation) (Correct)
No context found.
G. Boudol. Asynchrony and the -calculus (note). Rapport de recherche 1702, INRIA Sophia-Antipolis, May 1992.
A Hierarchy of Equivalences for Asynchronous Calculi - Fournet, Gonthier (2003) (16 citations) (Correct)
No context found.
Gerard Boudol. Asynchrony and the -calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
Can Actors and π-Agents Live Together? - Montanari, Talcott (Correct)
No context found.
G. Boudol, Asynchrony and the -calculus (note), Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
Decoding Choice Encodings - Nestmann, Pierce (1996) (52 citations) (Correct)
No context found.
G#rard Boudol. Asynchrony and the -calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
Communication Errors in the π-Calculus are Undecidable - Vasconcelos, Ravara (Correct)
No context found.
Gerard Boudol. Asynchrony and the #-calculus (note). Rapport de Recherche RR--1702, INRIA Sophia-Antipolis, 1992.
Bisimulation Proof Methods for Mobile Ambients - Universita (2003) (10 citations) (Correct)
No context found.
G. Boudol. Asynchrony and the #-calculus. Technical Report RR-1702, INRIA-Sophia Antipolis, 1992.
On Asynchrony in Name-Passing Calculi - Merro, Sangiorgi (2002) (47 citations) (Correct)
No context found.
G. Boudol. Asynchrony and the #-calculus. Technical Report RR-1702, INRIA-Sophia Antipolis, 1992.
Nomadic π-Calculi: Expressing and Verifying Communication.. - Unyapoth (2001) (Correct)
No context found.
Gerard Boudol. Asynchrony and the -calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
Typing Non-uniform Concurrent Objects - Antonio Ravara And (1999) (10 citations) (Correct)
No context found.
Gerard Boudol. Asynchrony and the #-calculus (note). Rapport de Recherche RR-1702, INRIA Sophia-Antipolis, 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