7 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.PL2011★ 7 cited
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.
cs.PL2011
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…
cs.PL2010
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…