Results 1  10
of
45,160
Linearity and Persistence in the PiCalculus
"... Abstract Processes can be seen as resources; if they can be consumed, we say that they are linear, else we say that they are persistent. In this paper we present a study of linear and persistent processes wrt to the kind of system they can model. We choose πcalculus, perhaps the main representative ..."
Abstract
 Add to MetaCart
Abstract Processes can be seen as resources; if they can be consumed, we say that they are linear, else we say that they are persistent. In this paper we present a study of linear and persistent processes wrt to the kind of system they can model. We choose πcalculus, perhaps the main
The Polymorphic Picalculus: Theory and Implementation
, 1995
"... We investigate whether the πcalculus is able to serve as a good foundation for the design and implementation of a stronglytyped concurrent programming language. The first half of the dissertation examines whether the πcalculus supports a simple type system which is flexible enough to provide a su ..."
Abstract

Cited by 112 (0 self)
 Add to MetaCart
We investigate whether the πcalculus is able to serve as a good foundation for the design and implementation of a stronglytyped concurrent programming language. The first half of the dissertation examines whether the πcalculus supports a simple type system which is flexible enough to provide a
Presheaf Models for the piCalculus
, 1997
"... Recent work has shown that presheaf categories provide a general model of concurrency, with an inbuilt notion of bisimulation based on open maps. Here it is shown how this approach can also handle systems where the language of actions may change dynamically as a process evolves. The example is the p ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
is the picalculus, a calculus for `mobile processes' whose communication topology varies as channels are created and discarded. A denotational semantics is described for the picalculus within an indexed category of profunctors; the model is fully abstract for bisimilarity, in the sense
Action Structures for the piCalculus
, 1993
"... In a previous paper, action structures were proposed as a variety of algebra to underlie concrete models of concurrent computation and interaction. That work is summarised here, to make the paper selfcontained. In particular, the uniform construction of a process calculus upon an arbitrary action s ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In a previous paper, action structures were proposed as a variety of algebra to underlie concrete models of concurrent computation and interaction. That work is summarised here, to make the paper selfcontained. In particular, the uniform construction of a process calculus upon an arbitrary action
Behavioral Equivalence in the Polymorphic PiCalculus
 JOURNAL OF THE ACM
, 1997
"... We investigate parametric polymorphism in messagebased concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacalculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manip ..."
Abstract

Cited by 65 (8 self)
 Add to MetaCart
of polymorphic processes. We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic picalculus and ML.
Symbolic bisimulation for the applied picalculus
 In Proc. 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’07), volume 4855 of Lecture Notes in Computer Science
, 2007
"... We propose a symbolic semantics for the finite applied pi calculus. The applied pi calculus is a variant of the pi calculus with extensions for modelling cryptographic protocols. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs fro ..."
Abstract

Cited by 27 (8 self)
 Add to MetaCart
We propose a symbolic semantics for the finite applied pi calculus. The applied pi calculus is a variant of the pi calculus with extensions for modelling cryptographic protocols. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs
A Generic Type System for the PiCalculus
 Theoretical Computer Science
, 2003
"... 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 nontrivial properties like deadlockfreedom and racefreedom. A key idea is to express types and type environments as abstract processe ..."
Abstract

Cited by 106 (9 self)
 Add to MetaCart
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 nontrivial properties like deadlockfreedom and racefreedom. A key idea is to express types and type environments as abstract
Results 1  10
of
45,160