Resource Control for Synchronous Cooperative Threads

Abstract

We develop new methods to statically bound the resources needed for the execution of systems of concurrent, interactive threads. Our study is concerned with a synchronous model of interaction based on cooperative threads whose execution proceeds in synchronous rounds called instants. Our contribution is a system of compositional static analyses to guarantee that each instant terminates and to bound the size of the values computed by the system as a function of the size of its parameters at the beginning of the instant. Our method generalises an approach designed for first-order functional languages that relies on a combination of standard termination techniques for term rewriting systems and an analysis of the size of the computed values based on the notion of quasi-interpretation. We show that these two methods can be combined to obtain an explicit polynomial bound on the resources needed for the execution of the system during an instant. As a second contribution, we introduce a virtual machine and a related bytecode thus producing a precise description of the resources needed for the execution of a system. In this context, we present a suitable control flow analysis that allows to formulate the static analyses for resource control at byte code level.

The Omniscient Garbage Collector: A Resource Analysis Framework

“…One approach is to enrich the semantics, as e.g. in [5] where a resource bound analysis is proposed for a reactive synchronous variant of the π-calculus. For more classical (and abstract) variants, related studies address decidability issues often in connection with Petri nets, such as e.g.…”

The SL synchronous language, revisited

“…Of course, many other determinacy theorems occur in the literature on synchronous programming (cf., e.g., [12]). The static analysis technique for ensuring reactivity is inspired by previous work by the author [3,4] where, roughly, the reactivity of a (tail recursive) SL model with data types is studied. The tail recursive SL model and the related CPS translation appear to be original.…”

“…Definition 30 (strong labelled bisimulation) A symmetric relation R on programs is a strong labelled bisimulation if whenever P R Q the following holds: 3 We denote with ≡ L the largest strong labelled bisimulation.…”

Complexity Information Flow in a Multi-threaded Imperative Language

“…Only a few studies based on ICC methods are related to resource control of concurrent computational models. In [2], a bound on the resource needed by synchronous cooperative threads in a functional framework is computed. The paper [1] provides a static analysis for ensuring feasible reactivity in a synchronous π-calculus.…”