Results 1  10
of
74,127
Process Creation and Full Sequential Composition in a NamePassing Calculus
, 1997
"... . This paper presents a first attempt to formulate a process calculus featuring process creation and sequential composition, instead of the more usual parallel composition and action prefixing, in a setting where mobility is achieved by communicating channel names. We discuss the questions of scope ..."
Abstract
 Add to MetaCart
of scope and name binding, raised by the interaction of mobility and sequential composition. Substitution of names is integrated as a syntactic operator in the calculus. Although many aspects necessary to model the combination of process creation, sequential composition and namepassing are taken
Process Creation and Full Sequential Composition in a NamePassing Calculus
 Hildesheimer InformatikBericht HIB 7/97, Institut fur Informatik, Universitat
, 1997
"... This paper presents the underlying theory for a process calculus featuring process creation and sequential composition, instead of the more usual parallel composition and action pre xing, in a setting where mobility isachieved by communicating channel names. We discuss the questions of scope and nam ..."
Abstract
 Add to MetaCart
This paper presents the underlying theory for a process calculus featuring process creation and sequential composition, instead of the more usual parallel composition and action pre xing, in a setting where mobility isachieved by communicating channel names. We discuss the questions of scope
On Asynchrony in NamePassing Calculi
 In
, 1998
"... The asynchronous picalculus is considered the basis of experimental programming languages (or proposal of programming languages) like Pict, Join, and Blue calculus. However, at a closer inspection, these languages are based on an even simpler calculus, called Local (L), where: (a) only the output c ..."
Abstract

Cited by 98 (15 self)
 Add to MetaCart
characterisations of barbed congruence in Lpi, and some basic algebraic laws. We then show applications of this theory, including: the derivability of delayed input; the correctness of an optimisation of the encoding of callbyname lambdacalculus; the validity of some laws for Join.
On the expressiveness of internal mobility in namepassing calculi
, 1998
"... We consider the language rI, a namepassing calculus introduced by Sangiorgi, where only private names can be exchanged among processes (internal mobility). The calculus 7cI has simple mathematical theory, very close to that of CCS. We provide an encoding from (an asynchronous variant of) the ~rca ..."
Abstract

Cited by 41 (0 self)
 Add to MetaCart
We consider the language rI, a namepassing calculus introduced by Sangiorgi, where only private names can be exchanged among processes (internal mobility). The calculus 7cI has simple mathematical theory, very close to that of CCS. We provide an encoding from (an asynchronous variant of) the ~rcalculus
Behavioural Types for a Calculus of Concurrent Objects
, 1997
"... We present a new type system for TyCO, a namepassing calculus of concurrent objects. The system captures dynamic aspects of the behaviour of objects, namely nonuniform service availability. The notion of processes without errors is loosened, demanding only weak fairness in the treatment of mess ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
We present a new type system for TyCO, a namepassing calculus of concurrent objects. The system captures dynamic aspects of the behaviour of objects, namely nonuniform service availability. The notion of processes without errors is loosened, demanding only weak fairness in the treatment
Algebraic Theories for NamePassing Calculi
, 1996
"... In a theory of processes the names are atomic data items which can be exchanged and tested for identity. A wellknown example of a calculus for namepassing is the πcalculus, where names additionally are used as communication ports. We provide complete axiomatisations of late and early bisimulation ..."
Abstract

Cited by 52 (10 self)
 Add to MetaCart
In a theory of processes the names are atomic data items which can be exchanged and tested for identity. A wellknown example of a calculus for namepassing is the πcalculus, where names additionally are used as communication ports. We provide complete axiomatisations of late and early
Type abstractions of namepassing processes
 In Proceedings of IPM International Symposium on Fundamentals of Software Engineering (FSEN
, 2007
"... Abstract. We study methods to statically approximate “firstorder ” process calculi (Pi, Join) by “propositional” models (CCS, BPP, Petri nets). We consider both open and closed behaviors of processes. In the case of open behavior, we propose a type system to associate picalculus processes with res ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We study methods to statically approximate “firstorder ” process calculi (Pi, Join) by “propositional” models (CCS, BPP, Petri nets). We consider both open and closed behaviors of processes. In the case of open behavior, we propose a type system to associate picalculus processes
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise
On reductionbased process semantics
 in Proceedings of FSTTCS ’93, LNCS 761
, 1995
"... Abstract. A formulation of semantic theories for processes which is based on reduction relation and equational reasoning is studied. The new construction can induce meaningful theories for processes, both in strong and weak settings. The resulting theories in many cases coincide with, and sometimes ..."
Abstract

Cited by 162 (26 self)
 Add to MetaCart
generalise, observationbased formulation of behavioural equivalence. The basic construction of reductionbased theories is studied, taking a simple name passing calculus called $\nu$calculus as an example. Results on other calculi are also briefly discussed. 1
Results 1  10
of
74,127