Computer Science – Logic in Computer Science
Scientific paper
2007-02-11
Proceedings ACM SIGPLAN Principles and Practice of Declarative Programming (16/07/2007) 221-231
Computer Science
Logic in Computer Science
Scientific paper
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.
Amadio Roberto
Dabrowski Frederique
No associations
LandOfFree
Feasible reactivity in a synchronous pi-calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Feasible reactivity in a synchronous pi-calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Feasible reactivity in a synchronous pi-calculus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-538523