Linearity and the pi-calculus
N Kobayashi, BC Pierce, DN Turner - ACM Transactions on …, 1999 - dl.acm.org
The economy and flexibility of the pi-calculus make it an attractive object of theoretical study
and a clean basis for concurrent language design and implementation. However, such …
and a clean basis for concurrent language design and implementation. However, such …
Pict: A programming language based on the pi-calculus
BC Pierce, DN Turner - 2000 - direct.mit.edu
Milner, Parrow, and Walker's π-calculus [MPW92, Mil91] generalizes the channel-based
communication of CCS and its relatives by allowing channels to be passed as data along …
communication of CCS and its relatives by allowing channels to be passed as data along …
On reduction-based process semantics
K Honda, N Yoshida - Theoretical Computer Science, 1995 - Elsevier
A formulation of semantic theories for processes which does not rely on the notion of
observables or convergence is studied. The new construction is based solely on a reduction …
observables or convergence is studied. The new construction is based solely on a reduction …
π-calculus, internal mobility, and agent-passing calculi
D Sangiorgi - Theoretical computer science, 1996 - Elsevier
The π-calculus is a process algebra which originates from CCS and permits a natural
modelling of mobility (ie, dynamic reconfigurations of the process linkage) using …
modelling of mobility (ie, dynamic reconfigurations of the process linkage) using …
[ΒΙΒΛΙΟ][B] A Theory of Distributed Objects: Asynchrony—Mobility—Groups—Components
D Caromel, L Henrio - 2005 - Springer
FG h S h UWU i SU¥ § © h SI h SQ i'w Q\ac 4 aY w UYU f KY o TQQU a U jcao Q hh UQV\ac
4 h A n 5 5 E h T ««Q h VQ f V a T h V w Q jahh W r W [WV k V af Q ª UQV w Q 5©¤ jcaj Q c …
4 h A n 5 5 E h T ««Q h VQ f V a T h V w Q jahh W r W [WV k V af Q ª UQV w Q 5©¤ jcaj Q c …
A generic type system for the pi-calculus
A Igarashi, N Kobayashi - Theoretical Computer Science, 2004 - Elsevier
We propose a general, powerful framework of type systems for the π-calculus, and show that
we can obtain as its instances a variety of type systems guaranteeing non-trivial properties …
we can obtain as its instances a variety of type systems guaranteeing non-trivial properties …
A generic type system for the pi-calculus
A Igarashi, N Kobayashi - Proceedings of the 28th ACM SIGPLAN …, 2001 - dl.acm.org
We propose a general, powerful framework of type systems for the π-calculus, and show that
we can obtain as its instances a variety of type systems guaranteeing non-trivial properties …
we can obtain as its instances a variety of type systems guaranteeing non-trivial properties …
Concurrent objects in a process calculus
BC Pierce, DN Turner - International Workshop on Theory and Practice of …, 1994 - Springer
A programming style based on concurrent objects arises almost inevitably in languages
where processes communicate by exchanging data on channels. Using the pict language as …
where processes communicate by exchanging data on channels. Using the pict language as …
An automata-theoretic approach to interprocedural data-flow analysis
J Esparza, J Knoop - Foundations of Software Science and Computation …, 1999 - Springer
1 Introduction An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis Page
1 Javier Esparza1 and Jens Knoop2 1 Technische Universit at M unchen, Arcisstr. 21, D-80290 …
1 Javier Esparza1 and Jens Knoop2 1 Technische Universit at M unchen, Arcisstr. 21, D-80290 …
Decoding choice encodings
U Nestmann, BC Pierce - Information and Computation, 2000 - Elsevier
We study two encodings of the asynchronous π-calculus with input-guarded choice into its
choice-free fragment. One encoding is divergence-free, but refines the atomic commitment of …
choice-free fragment. One encoding is divergence-free, but refines the atomic commitment of …