Roberto M. Amadio

According to our database, Roberto M. Amadio authored at least 56 papers between 1986 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2013

Certified Complexity (CerCo).

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

Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2013

2012

Certifying and Reasoning on Cost Annotations in C Programs.

Nicholas Ayache, Roberto M. Amadio, Yann Régis-Gianas

Proceedings of the Formal Methods for Industrial Critical Systems, 2012

2011

Elementary affine λ-calculus with multithreading and side effects

Antoine Madet, Roberto M. Amadio

CoRR, 2011

A decompilation of the pi-calculus and its application to termination

Roberto M. Amadio

CoRR, 2011

An Elementary Affine <i>λ</i>-Calculus with Multithreading and Side Effects.

Antoine Madet, Roberto M. Amadio

Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

Certifying and Reasoning on Cost Annotations of Functional Programs.

Roberto M. Amadio, Yann Régis-Gianas

Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2011

2010

Certifying cost annotations in compilers

Roberto M. Amadio, Nicholas Ayache, Yann Régis-Gianas, Ronan Saillard

CoRR, 2010

2009

Preface.

Roberto M. Amadio, Giuseppe Castagna, Andrea Asperti

Inf. Comput., 2009

An affine-intuitionistic system of types and effects: confluence and termination

Roberto M. Amadio, Patrick Baillot, Antoine Madet

CoRR, 2009

On Stratified Regions.

Roberto M. Amadio

Proceedings of the Programming Languages and Systems, 7th Asian Symposium, 2009

2008

On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS.

Roberto M. Amadio

Proceedings of the 15th Workshop on Expressiveness in Concurrency, 2008

On Affine Usages in Signal-Based Communication.

Roberto M. Amadio, Mehdi Dogguy

Proceedings of the Programming Languages and Systems, 6th Asian Symposium, 2008

2007

The SL synchronous language, revisited.

Roberto M. Amadio

J. Log. Algebraic Methods Program., 2007

A synchronous pi-calculus.

Roberto M. Amadio

Inf. Comput., 2007

Preface.

Roberto M. Amadio, Thomas T. Hildebrandt

Proceedings of the 14th International Workshop on Expressiveness in Concurrency, 2007

Determinacy in a synchronous pi-calculus

Roberto M. Amadio, Mehdi Dogguy

CoRR, 2007

Feasible reactivity in a synchronous Pi-calculus.

Roberto M. Amadio, Frédéric Dabrowski

Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2007

2006

Resource control for synchronous cooperative threads.

Roberto M. Amadio, Silvano Dal-Zilio

Theor. Comput. Sci., 2006

Preface.

Roberto M. Amadio, Iain Phillips

Proceedings of the 13th International Workshop on Expressiveness in Concurrency, 2006

2005

Guest editor's introduction: Special issue on Modelling and Verification of Cryptographic Protocols.

Roberto M. Amadio

J. Log. Algebraic Methods Program., 2005

Synthesis of max-plus quasi-interpretations.

Roberto M. Amadio

Fundam. Informaticae, 2005

Feasible Reactivity for Synchronous Cooperative Threads.

Roberto M. Amadio, Frédéric Dabrowski

Proceedings of the 12th Workshop on Expressiveness on Concurrency, 2005

Reactive Concurrent Programming Revisited.

Roberto M. Amadio, Gérard Boudol, Frédéric Boussinot, Ilaria Castellani

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

2004

A Functional Scenario for Bytecode Verification of Resource Bounds.

Roberto M. Amadio, Solange Coupet-Grimal, Silvano Dal-Zilio, Line Jakubiec

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003

The receptive distributed pi-calculus.

Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine

ACM Trans. Program. Lang. Syst., 2003

On the symbolic reduction of processes with cryptographic functions.

Roberto M. Amadio, Denis Lugiez, Vincent Vanackère

Theor. Comput. Sci., 2003

Max-Plus Quasi-interpretations.

Roberto M. Amadio

Proceedings of the Typed Lambda Calculi and Applications, 6th International Conference, 2003

2002

On Decidability of the Control Reachability Problem in the Asynchronous pi-Calculus.

Roberto M. Amadio, Charles Meyssonnier

Nord. J. Comput., 2002

On message deliverability and non-uniform receptivity.

Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine

Fundam. Informaticae, 2002

On Name Generation and Set-Based Analysis in the Dolev-Yao Model.

Roberto M. Amadio, Witold Charatonik

Proceedings of the CONCUR 2002, 2002

2001

On the Decidability of Fragments of the Asynchronous pi-Calculus.

Roberto M. Amadio, Charles Meyssonnier

Proceedings of the 8th International Workshop on Expressiveness in Concurrency, 2001

On the symbolic reduction of processes with cryptographic functions.

Roberto M. Amadio

Proceedings of the Logical Aspects of Cryptographic Protocol Verification, 2001

2000

On modelling mobility.

Roberto M. Amadio

Theor. Comput. Sci., 2000

Modelling IP Mobility.

Roberto M. Amadio, Sanjiva Prasad

Formal Methods Syst. Des., 2000

On the Reachability Problem in Cryptographic Protocols.

Roberto M. Amadio, Denis Lugiez

Proceedings of the CONCUR 2000, 2000

1999

The Receptive Distributed pi-Calculus (Extended Abstract).

Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

The Game of the Name in Cryptographic Tables.

Roberto M. Amadio, Sanjiva Prasad

Proceedings of the Advances in Computing Science, 1999

1998

On Bisimulations for the Asynchronous pi-Calculus.

Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi

Theor. Comput. Sci., 1998

Analysis of a Guard Condition in Type Theory (Extended Abstract).

Roberto M. Amadio, Solange Coupet-Grimal

Proceedings of the Foundations of Software Science and Computation Structure, 1998

Domains and lambda-calculi.

Roberto M. Amadio, Pierre-Louis Curien

Cambridge tracts in theoretical computer science 46, Cambridge University Press, ISBN: 978-0-521-62277-6, 1998

1997

An Asynchronous Model of Locality, Failure and Process Mobility.

Roberto M. Amadio

Proceedings of the Coordination Languages and Models, Second International Conference, 1997

1996

Toward a Modal Theory of Types for the pi-Calculus.

Roberto M. Amadio, Mads Dam

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

1995

A Quick Construction of a Retraction of All Retractions for Stable Bifinites

Roberto M. Amadio

Inf. Comput., February, 1995

Reasoning about Higher-Order Processes.

Roberto M. Amadio, Mads Dam

Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

From a Concurrent Lambda-Calculus to the Pi-Calculus.

Roberto M. Amadio, Lone Leth Thomsen, Bent Thomsen

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

Localities and Failures (Extended Abstract).

Roberto M. Amadio, Sanjiva Prasad

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993

Subtyping Recursive Types.

Roberto M. Amadio, Luca Cardelli

ACM Trans. Program. Lang. Syst., 1993

On the Adequacy of Per Models.

Roberto M. Amadio

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation.

Roberto M. Amadio

Proceedings of the CONCUR '93, 1993

1991

Recursion over Realizability Structures

Roberto M. Amadio

Inf. Comput., March, 1991

Domains in a Realizability Framework.

Roberto M. Amadio

Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

Bifinite Domains: Stable Case.

Roberto M. Amadio

Proceedings of the Category Theory and Computer Science, 1991

1990

Typed Equivalence, Type Assignment, and Type Containment.

Roberto M. Amadio

Proceedings of the Conditional and Typed Rewriting Systems, 1990

1988

A fixed point extension of the second order lambda-calculus: observable equivalences and models

Roberto M. Amadio

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987

Type-free compiling of parametric types.

Roberto M. Amadio, Giuseppe Longo

Proceedings of the Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2/WG 2.2 Working Conference on Formal Description of Programming Concepts, 1987

1986

The Finitary Projection Model for Second Order Lambda Calculus and Solutions to Higher Order Domain Equations

Roberto M. Amadio, Kim B. Bruce, Giuseppe Longo

Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986