论文信息 - Feasible Reactivity for Synchronous Cooperative Threads

Feasible Reactivity for Synchronous Cooperative Threads

Abstract 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.

Roberto M. Amadio | Frédéric Dabrowski | R. Amadio | Frédéric Dabrowski

[1] Marc Pouzet,et al. ReactiveML: a reactive extension to ML , 2005, PPDP.

[2] Robert de Simone,et al. The SL Synchronous Language , 1996, IEEE Trans. Software Eng..

[3] Neil D. Jones,et al. The size-change principle for program termination , 2001, POPL '01.

[4] Roberto M. Amadio. Synthesis of max-plus quasi-interpretations , 2005, Fundam. Informaticae.

[5] John K. Ousterhout,et al. Why Threads Are A Bad Idea (for most purposes) , 2003 .

[6] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[7] Roberto M. Amadio,et al. Max-Plus Quasi-interpretations , 2003, TLCA.

[8] Silvano Dal-Zilio,et al. Resource control for synchronous cooperative threads , 2006, Theor. Comput. Sci..

[9] Tobias Nipkow,et al. Term rewriting and all that , 1998 .