7 citations · 7 across the 3 of their papers we have counts for
6 papers
A decompilation of the pi-calculus and its application to termination
Roberto Amadio
We study the correspondence between a concurrent lambda-calculus in administrative, continuation passing style and a pi-calculus and we derive a termination result for the latter.
Elementary affine -calculus with multithreading and side effects
Antoine Madet, Roberto M. Amadio
Linear logic provides a framework to control the complexity of higher-order functional programs. We present an extension of this framework to programs with multithreading and side…
Certifying cost annotations in compilers
Roberto M. Amadio, Nicolas Ayache, Yann Régis-Gianas +1
We discuss the problem of building a compiler which can lift in a provably correct way pieces of information on the execution cost of the object code to cost annotations on the sou…
Reactive concurrent programming revisited
Roberto Amadio, Gerard Boudol, Ilaria Castellani +1
In this note we revisit the so-called reactive programming style, which evolves from the synchronous programming model of the Esterel language by weakening the assumption that the…
Resource Control for Synchronous Cooperative Threads
Roberto Amadio, Silvano Dal Zilio
We develop new methods to statically bound the resources needed for the execution of systems of concurrent, interactive threads. Our study is concerned with a \emph{synchronous} mo…
The SL synchronous language, revisited
Roberto Amadio
We revisit the SL synchronous programming model introduced by Boussinot and De Simone (IEEE, Trans. on Soft. Eng., 1996). We discuss an alternative design of the model including th…