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)
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)
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)
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)
— 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)