Feasible Reactivity for Synchronous Cooperative Threads

We are concerned with programs composed of cooperative threads whose execution proceeds in synchronous rounds called instants. We develop static analysis methods to guarantee that each instant terminates in time polynomial in the size of the parameters of the program at the beginning of the computation. Key words: Synchronous and cooperative programming, Resource bounds, Quasi-interpretations, Termination, Polynomial time.

• Type: Journal
• Year: 2006
• Where: ENTCS
• Authors: Roberto M. Amadio, Frédéric Dabrowski
• Keywords: Cooperative Threads, ENTCS 2006, Execution Proceeds, Synchronous Rounds