#### Filter Results:

#### Publication Year

2005

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We present a reconstruction of session types in a conventional pi calculus where types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times. We equip types with a constructor that denotes the two ends of a same communication channel. In order to assess the… (More)

We present a reconstruction of session types in a conventional pi calculus. Our session types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times; afterwards they evolve to unrestricted channels. We equip types with a constructor that describes the two ends of… (More)

The challenges hidden in the implementation of high-level process calculi into low-level environments are well understood [3]. This paper develops a secure implementation of a typed pi calculus, in which capability types are employed to realize the policies for the access to communication channels. Our implementation compiles high-level processes of the… (More)

- Marco Giunti
- WWV
- 2011

We present a type checking algorithm for establishing a session-based discipline in the pi calculus of Milner, Parrow and Walker. Our session types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times; afterwards they evolve as unrestricted channels. Session… (More)

Introduction. In [7] we have introduced an extension of the first session typing system [10] that allows higher-order session communication. In the new system, the reduction rule for session passing

We present a type checking algorithm for establishing a session-based discipline in a π-calculus with name matching. We account for analyzing processes exhibiting different behaviours in the branches of the if-then-else by imposing an affine discipline for session types. This permits to obtain type-safety or absence of communication errors while accepting… (More)

In this paper, we enrich the π-calculus with an operator for confidentiality (hide), whose main effect is to restrict the access to the object of the communication, thus representing confidentiality in a natural way. The hide operator is meant for local communication, and it differs from new in that it forbids the extrusion of the name and hence has a… (More)

- Marco Giunti
- 2006

— The ability to prevent and to detect intrusions in computer systems is often heavily conditioned by having some knowledge of the security flaws of the system under analysis. Discover intrusions is particularly hard in concurrent systems, which contain several interactions among their components; suspicious interactions are usually studied manually by… (More)

Dynamical systems are mathematical structures whose aim is to describe the evolution of an arbitrary deterministic system through time, which is typically modeled as (a subset of) the integers or the real numbers. We show that it is possible to generalize the standard notion of a dynamical system, so that its time dimension is only required to possess the… (More)