Roberto M. Amadio

Publication Activity (10 Years)

Years Active: 1986-2013
Publications (10 Years): 0

Top Topics

Reasoning Systems

Computer Programs

Top Venues

Publications

Roberto M. Amadio, Nicholas Ayache, François Bobot, Jaap Boender, Brian Campbell, Ilias Garnier, Antoine Madet, James McKinna, Dominic P. Mulligan, Mauro Piccolo, Randy Pollack, Yann Régis-Gianas, Claudio Sacerdoti Coen, Ian Stark, Paolo Tranquilli
Certified Complexity (CerCo). FOPARA (2013)
Nicholas Ayache, Roberto M. Amadio, Yann Régis-Gianas
Certifying and Reasoning on Cost Annotations in C Programs. FMICS (2012)
Roberto M. Amadio
A decompilation of the pi-calculus and its application to termination CoRR (2011)
Roberto M. Amadio, Yann Régis-Gianas
Certifying and Reasoning on Cost Annotations of Functional Programs. FOPARA (2011)
Antoine Madet, Roberto M. Amadio
Elementary affine λ-calculus with multithreading and side effects CoRR (2011)
Roberto M. Amadio, Yann Régis-Gianas
Certifying and reasoning on cost annotations of functional programs CoRR (2011)
Antoine Madet, Roberto M. Amadio
-Calculus with Multithreading and Side Effects. TLCA (2011)
Roberto M. Amadio, Nicholas Ayache, Yann Régis-Gianas, Ronan Saillard
Certifying cost annotations in compilers CoRR (2010)
Roberto M. Amadio, Patrick Baillot, Antoine Madet
An affine-intuitionistic system of types and effects: confluence and termination CoRR (2010)
Roberto M. Amadio, Patrick Baillot, Antoine Madet
An affine-intuitionistic system of types and effects: confluence and termination CoRR (2009)
Roberto M. Amadio
On stratified regions CoRR (2009)
Roberto M. Amadio
On Stratified Regions. APLAS (2009)
Roberto M. Amadio, Giuseppe Castagna, Andrea Asperti
Preface. Inf. Comput. 207 (5) (2009)
Roberto M. Amadio, Mehdi Dogguy
On affine usages in signal-based communication CoRR (2008)
Roberto M. Amadio, Mehdi Dogguy
On Affine Usages in Signal-Based Communication. APLAS (2008)
Roberto M. Amadio
On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS. EXPRESS (2008)
Roberto M. Amadio
On convergence-sensitive bisimulation and the embedding of CCS in timed CCS CoRR (2008)
Roberto M. Amadio, Frédéric Dabrowski
Feasible reactivity in a synchronous Pi-calculus. PPDP (2007)
Roberto M. Amadio
A synchronous pi-calculus. Inf. Comput. 205 (9) (2007)
Roberto M. Amadio
The SL synchronous language, revisited. J. Log. Algebraic Methods Program. 70 (2) (2007)
Roberto M. Amadio, Mehdi Dogguy
Determinacy in a synchronous pi-calculus CoRR (2007)
Roberto M. Amadio, Frédéric Dabrowski
Feasible reactivity in a synchronous pi-calculus CoRR (2007)
Roberto M. Amadio, Thomas T. Hildebrandt
Preface. EXPRESS (2007)
Roberto M. Amadio
A synchronous pi-calculus CoRR (2006)
Roberto M. Amadio, Gérard Boudol, Frédéric Boussinot, Ilaria Castellani
Reactive Concurrent Programming Revisited. Electron. Notes Theor. Comput. Sci. 162 (2006)
Roberto M. Amadio, Iain Phillips
Preface. EXPRESS (2006)
Roberto M. Amadio, Silvano Dal-Zilio
Resource control for synchronous cooperative threads. Theor. Comput. Sci. 358 (2-3) (2006)
Roberto M. Amadio
The SL synchronous language, revisited CoRR (2005)
Roberto M. Amadio, Frédéric Dabrowski
Feasible Reactivity for Synchronous Cooperative Threads. EXPRESS (2005)
Roberto M. Amadio
Synthesis of max-plus quasi-interpretations. Fundam. Informaticae 65 (1-2) (2005)
Roberto M. Amadio, Gérard Boudol, Ilaria Castellani, Frédéric Boussinot
Reactive concurrent programming revisited CoRR (2005)
Roberto M. Amadio
Guest editor's introduction: Special issue on Modelling and Verification of Cryptographic Protocols. J. Log. Algebraic Methods Program. 64 (2) (2005)
Roberto M. Amadio, Silvano Dal-Zilio
Resource Control for Synchronous Cooperative Threads CoRR (2005)
Roberto M. Amadio, Solange Coupet-Grimal, Silvano Dal-Zilio, Line Jakubiec
A Functional Scenario for Bytecode Verification of Resource Bounds. CSL (2004)
Roberto M. Amadio, Silvano Dal-Zilio
Resource Control for Synchronous Cooperative Threads. CONCUR (2004)
Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine
The receptive distributed pi-calculus. ACM Trans. Program. Lang. Syst. 25 (5) (2003)
Roberto M. Amadio, Denis Lugiez, Vincent Vanackère
On the symbolic reduction of processes with cryptographic functions. Theor. Comput. Sci. 290 (1) (2003)
Roberto M. Amadio
Max-Plus Quasi-interpretations. TLCA (2003)
Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine
On message deliverability and non-uniform receptivity. Fundam. Informaticae 53 (2) (2002)
Roberto M. Amadio, Charles Meyssonnier
On Decidability of the Control Reachability Problem in the Asynchronous pi-Calculus. Nord. J. Comput. 9 (1) (2002)
Roberto M. Amadio, Witold Charatonik
On Name Generation and Set-Based Analysis in the Dolev-Yao Model. CONCUR (2002)
Roberto M. Amadio
On the symbolic reduction of processes with cryptographic functions. Electron. Notes Theor. Comput. Sci. 55 (1) (2001)
Roberto M. Amadio, Charles Meyssonnier
On the Decidability of Fragments of the Asynchronous pi-Calculus. EXPRESS (2001)
Roberto M. Amadio, Sanjiva Prasad
Modelling IP Mobility. Formal Methods Syst. Des. 17 (1) (2000)
Roberto M. Amadio
On modelling mobility. Theor. Comput. Sci. 240 (1) (2000)
Roberto M. Amadio, Denis Lugiez
On the Reachability Problem in Cryptographic Protocols. CONCUR (2000)
Roberto M. Amadio, Sanjiva Prasad
The Game of the Name in Cryptographic Tables. ASIAN (1999)
Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine
The Receptive Distributed pi-Calculus (Extended Abstract). FSTTCS (1999)
Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi
On Bisimulations for the Asynchronous pi-Calculus. Theor. Comput. Sci. 195 (2) (1998)
Roberto M. Amadio, Solange Coupet-Grimal
Analysis of a Guard Condition in Type Theory (Extended Abstract). FoSSaCS (1998)
Roberto M. Amadio, Sanjiva Prasad
Modelling IP Mobility. CONCUR (1998)
Roberto M. Amadio
An Asynchronous Model of Locality, Failurem and Process Mobility. COORDINATION (1997)
Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi
On Bisimulations for the Asynchronous pi-Calculus. CONCUR (1996)
Roberto M. Amadio, Mads Dam
Toward a Modal Theory of Types for the pi-Calculus. FTRTFT (1996)
Roberto M. Amadio, Lone Leth Thomsen, Bent Thomsen
From a Concurrent Lambda-Calculus to the Pi-Calculus. FCT (1995)
Roberto M. Amadio
A Quick Construction of a Retraction of All Retractions for Stable Bifinites Inf. Comput. 116 (2) (1995)
Roberto M. Amadio, Mads Dam
Reasoning about Higher-Order Processes. TAPSOFT (1995)
Roberto M. Amadio, Sanjiva Prasad
Localities and Failures (Extended Abstract). FSTTCS (1994)
Roberto M. Amadio
On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation. CONCUR (1993)
Roberto M. Amadio
On the Adequacy of Per Models. MFCS (1993)
Roberto M. Amadio, Luca Cardelli
Subtyping Recursive Types. ACM Trans. Program. Lang. Syst. 15 (4) (1993)
Roberto M. Amadio
Bifinite Domains: Stable Case. Category Theory and Computer Science (1991)
Roberto M. Amadio
Recursion over Realizability Structures Inf. Comput. 91 (1) (1991)
Roberto M. Amadio, Luca Cardelli
Subtyping Recursive Types. POPL (1991)
Roberto M. Amadio
Domains in a Realizability Framework. TAPSOFT, Vol.1 (1991)
Roberto M. Amadio
Typed Equivalence, Type Assignment, and Type Containment. CTRS (1990)
Roberto M. Amadio
A fixed point extension of the second order lambda-calculus: observable equivalences and models LICS (1988)
Roberto M. Amadio, Giuseppe Longo
Type-free compiling of parametric types. Formal Description of Programming Concepts (1987)
Roberto M. Amadio, Kim B. Bruce, Giuseppe Longo
The Finitary Projection Model for Second Order Lambda Calculus and Solutions to Higher Order Domain Equations LICS (1986)