HAL : hal-00130322, version 1

arXiv : cs.LO/0702069

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

ACM SIGPLAN Principles and Practice of Declarative Programming, Wroclaw : Pologne (2007)

Feasible reactivity in a synchronous pi-calculus

Roberto M. Amadio 1, Frederic Dabrowski 2

(16/07/2007)

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.

1 :	Preuves, Programmes et Systèmes (PPS)
	CNRS : UMR7126 – Université Paris VII - Paris Diderot
2 :	MIMOSA (INRIA Sophia Antipolis)
	INRIA – Université de Provence - Aix-Marseille I – MINES ParisTech - École nationale supérieure des mines de Paris

Domaine

:

Informatique/Logique en informatique

Mots Clés : Synchronous Programming. Reactivity. Feasible computation.

hal-00130322, version 1

http://hal.archives-ouvertes.fr/hal-00130322

oai:hal.archives-ouvertes.fr:hal-00130322

Contributeur : Roberto Amadio <>

Soumis le : Dimanche 11 Février 2007, 15:29:04

Dernière modification le : Vendredi 16 Avril 2010, 16:38:14