# Feasible reactivity in a synchronous pi-calculus

2 MIMOSA - Migration and mobility : semantics and applications
CRISAM - Inria Sophia Antipolis - Méditerranée , Université de Provence - Aix-Marseille 1, MINES ParisTech - École nationale supérieure des mines de Paris
Abstract : 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.
Keywords :
Document type :
Conference papers
Andreas Podelski. ACM SIGPLAN Principles and Practice of Declarative Programming, Jul 2007, Wroclaw, Poland. ACM, pp.221-231, 2007

https://hal.archives-ouvertes.fr/hal-00130322
Submitted on : Sunday, February 11, 2007 - 3:29:04 PM
Last modification on : Wednesday, September 28, 2016 - 2:09:57 PM
Document(s) archivé(s) le : Tuesday, April 6, 2010 - 10:16:00 PM

### Files

fr-short.pdf
Files produced by the author(s)

### Citation

Roberto M. Amadio, Frederic Dabrowski. Feasible reactivity in a synchronous pi-calculus. Andreas Podelski. ACM SIGPLAN Principles and Practice of Declarative Programming, Jul 2007, Wroclaw, Poland. ACM, pp.221-231, 2007. <hal-00130322>

Record views