Feasible reactivity in a synchronous pi-calculus - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

Feasible reactivity in a synchronous pi-calculus


Reactivity is an essential property of a synchronous program. Informally, it guarantees that at each instant the program fed with an input will `react' producing an output. In the present work, we consider a refined property that we call ` feasible reactivity'. Beyond reactivity, this property guarantees that at each instant both the size of the program and its reaction time are bounded by a polynomial in the size of the parameters at the beginning of the computation and the size of the largest input. We propose a method to annotate programs and we develop related static analysis techniques that guarantee feasible reactivity for programs expressed in the S-pi-calculus. The latter is a synchronous version of the pi-calculus based on the SL synchronous programming model.
Fichier principal
Vignette du fichier
fr-short.pdf (325.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00130322 , version 1 (11-02-2007)



Roberto M. Amadio, Frederic Dabrowski. Feasible reactivity in a synchronous pi-calculus. ACM SIGPLAN Principles and Practice of Declarative Programming, Jul 2007, Wroclaw, Poland. pp.221-231. ⟨hal-00130322⟩
282 View
164 Download



Gmail Facebook X LinkedIn More