This paper studies the complexity of π-calculus processes with respect to the quantity of
transitions caused by an incoming message. First we propose a typing system for integrating …

Type and effect systems are a tool to analyse statically the behaviour of programs with
effects. We present a proof based on the so called reducibility candidates that a suitable …

We show that the techniques for resource control that have been developed by the so-called
light logics can be fruitfully applied also to process algebras. In particular, we present a …

We introduce a type system for concurrent programs described as a parallel imperative
language using while-loops and fork/wait instructions, in which processes do not share a …

We show that the techniques for resource control that have been developed by the so-called
light logics can be fruitfully applied also to process algebras. In particular, we present a …

We propose a multicore-ready programming language based on a two-level shared memory
model. Concurrency units are schedulers and threads which are dispatched on available …

Cooperative scheduling enables efficient sequential implementations of concurrency. It is
widely used to provide lightweight threads facilities as libraries or programming constructs in …

In this paper, we propose a type system to analyze the time consumed by multi-threaded
imperative programs with a shared global memory, which delineates a class of safe multi …

Synchronous Reactive Languages are an excellent choice for IoT programming due to their
clear system-environment interaction semantics. However, when it comes to safety-critial or …

The framework of Light Logics has been extensively studied to control the complexity of
higher-order functional programs. We propose an extension of this framework to …