Resource Control for Synchronous Cooperative Threads
| dc.creator | Amadio, Roberto | |
| dc.creator | Zilio, Silvano Dal | |
| dc.date | 2005-12-14 | |
| dc.date.accessioned | 2026-07-07T08:05:51Z | |
| dc.date.available | 2026-07-07T08:05:51Z | |
| dc.description | 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 \emph{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 formulte the static analyses for resource control at byte code level. | |
| dc.identifier | https://arxiv.org/abs/cs/0512057 | |
| dc.identifier | http://arxiv.org/abs/cs/0512057 | |
| dc.identifier | Journal of Theoretical Computer Science (TCS) 358 (15/08/2006) 229-254 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/130409 | |
| dc.subject | Programming Languages | |
| dc.title | Resource Control for Synchronous Cooperative Threads | |
| dc.type | text |