default search action
Roberto M. Amadio
Person information
- affiliation: Pierre and Marie Curie University, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [c38]Roberto M. Amadio, Nicholas Ayache, François Bobot
, Jaap Boender, Brian Campbell
Certified Complexity (CerCo). FOPARA 2013: 1-18 - 2012
- [c37]Nicholas Ayache, Roberto M. Amadio, Yann Régis-Gianas:
Certifying and Reasoning on Cost Annotations in C Programs. FMICS 2012: 32-46 - 2011
- [c36]Roberto M. Amadio, Yann Régis-Gianas:
Certifying and Reasoning on Cost Annotations of Functional Programs. FOPARA 2011: 72-89 - [c35]Antoine Madet, Roberto M. Amadio:
An Elementary Affine λ-Calculus with Multithreading and Side Effects. TLCA 2011: 138-152 - [i15]Roberto M. Amadio:
A decompilation of the pi-calculus and its application to termination. CoRR abs/1102.2339 (2011) - [i14]Antoine Madet, Roberto M. Amadio:
Elementary affine λ-calculus with multithreading and side effects. CoRR abs/1102.4971 (2011) - [i13]Roberto M. Amadio, Yann Régis-Gianas:
Certifying and reasoning on cost annotations of functional programs. CoRR abs/1110.2350 (2011) - 2010
- [i12]Roberto M. Amadio, Patrick Baillot, Antoine Madet:
An affine-intuitionistic system of types and effects: confluence and termination. CoRR abs/1005.0835 (2010) - [i11]Roberto M. Amadio, Nicholas Ayache, Yann Régis-Gianas, Ronan Saillard:
Certifying cost annotations in compilers. CoRR abs/1010.1697 (2010)
2000 – 2009
- 2009
- [j16]Roberto M. Amadio, Giuseppe Castagna, Andrea Asperti
Preface. Inf. Comput. 207(5): 543-544 (2009) - [c34]Roberto M. Amadio:
On Stratified Regions. APLAS 2009: 210-225 - [i10]Roberto M. Amadio:
On stratified regions. CoRR abs/0904.2076 (2009) - [i9]Roberto M. Amadio, Patrick Baillot, Antoine Madet:
An affine-intuitionistic system of types and effects: confluence and termination. CoRR abs/0912.0419 (2009) - 2008
- [c33]Roberto M. Amadio, Mehdi Dogguy:
On Affine Usages in Signal-Based Communication. APLAS 2008: 221-236 - [c32]Roberto M. Amadio:
On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS. EXPRESS 2008: 3-17 - [e4]Roberto M. Amadio, Thomas T. Hildebrandt:
Proceedings of the 14th International Workshop on Expressiveness in Concurrency, EXPRESS 2007, Lisbon, Portugal, September 3, 2007. Electronic Notes in Theoretical Computer Science 194(2), Elsevier 2008 [contents] - [e3]Roberto M. Amadio:
Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings. Lecture Notes in Computer Science 4962, Springer 2008, ISBN 978-3-540-78497-5 [contents] - [i8]Roberto M. Amadio, Mehdi Dogguy:
On affine usages in signal-based communication. CoRR abs/0804.1729 (2008) - [i7]Roberto M. Amadio:
On convergence-sensitive bisimulation and the embedding of CCS in timed CCS. CoRR abs/0806.0936 (2008) - 2007
- [j15]Roberto M. Amadio:
A synchronous pi-calculus. Inf. Comput. 205(9): 1470-1490 (2007) - [j14]Roberto M. Amadio:
The SL synchronous language, revisited. J. Log. Algebraic Methods Program. 70(2): 121-150 (2007) - [c31]Roberto M. Amadio, Frédéric Dabrowski:
Feasible reactivity in a synchronous Pi-calculus. PPDP 2007: 221-230 - [c30]Roberto M. Amadio, Thomas T. Hildebrandt:
Preface. EXPRESS 2007: 1 - [e2]Roberto M. Amadio, Iain Phillips:
Proceedings of the 13th International Workshop on Expressiveness in Concurrency, EXPRESS 2006, Bonn, Germany, August 26, 2006. Electronic Notes in Theoretical Computer Science 175(3), Elsevier 2007 [contents] - [i6]Roberto M. Amadio, Mehdi Dogguy:
Determinacy in a synchronous pi-calculus. CoRR abs/0707.0556 (2007) - [i5]Roberto M. Amadio, Frédéric Dabrowski:
Feasible reactivity in a synchronous pi-calculus. CoRR abs/cs/0702069 (2007) - 2006
- [j13]Roberto M. Amadio, Silvano Dal-Zilio
Resource control for synchronous cooperative threads. Theor. Comput. Sci. 358(2-3): 229-254 (2006) - [c29]Roberto M. Amadio, Iain Phillips
Preface. EXPRESS 2006: 1-2 - [i4]Roberto M. Amadio:
A synchronous pi-calculus. CoRR abs/cs/0606019 (2006) - 2005
- [j12]Roberto M. Amadio:
Synthesis of max-plus quasi-interpretations. Fundam. Informaticae 65(1-2): 29-60 (2005) - [j11]Roberto M. Amadio:
Guest editor's introduction: Special issue on Modelling and Verification of Cryptographic Protocols. J. Log. Algebraic Methods Program. 64(2): 155 (2005) - [c28]Roberto M. Amadio, Frédéric Dabrowski:
Feasible Reactivity for Synchronous Cooperative Threads. EXPRESS 2005: 33-43 - [c27]Roberto M. Amadio, Gérard Boudol, Frédéric Boussinot, Ilaria Castellani
Reactive Concurrent Programming Revisited. APC 25 2005: 49-60 - [i3]Roberto M. Amadio:
The SL synchronous language, revisited. CoRR abs/cs/0511092 (2005) - [i2]Roberto M. Amadio, Silvano Dal-Zilio:
Resource Control for Synchronous Cooperative Threads. CoRR abs/cs/0512057 (2005) - [i1]Roberto M. Amadio, Gérard Boudol, Ilaria Castellani, Frédéric Boussinot:
Reactive concurrent programming revisited. CoRR abs/cs/0512058 (2005) - 2004
- [c26]Roberto M. Amadio, Silvano Dal-Zilio
Resource Control for Synchronous Cooperative Threads. CONCUR 2004: 68-82 - [c25]Roberto M. Amadio, Solange Coupet-Grimal, Silvano Dal-Zilio
A Functional Scenario for Bytecode Verification of Resource Bounds. CSL 2004: 265-279 - 2003
- [j10]Roberto M. Amadio, Denis Lugiez, Vincent Vanackère:
On the symbolic reduction of processes with cryptographic functions. Theor. Comput. Sci. 290(1): 695-740 (2003) - [j9]Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine:
The receptive distributed pi-calculus. ACM Trans. Program. Lang. Syst. 25(5): 549-577 (2003) - [c24]Roberto M. Amadio:
Max-Plus Quasi-interpretations. TLCA 2003: 31-45 - [e1]Roberto M. Amadio, Denis Lugiez:
CONCUR 2003 - Concurrency Theory, 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings. Lecture Notes in Computer Science 2761, Springer 2003, ISBN 3-540-40753-7 [contents] - 2002
- [j8]Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine:
On message deliverability and non-uniform receptivity. Fundam. Informaticae 53(2): 105-129 (2002) - [j7]Roberto M. Amadio, Charles Meyssonnier:
On Decidability of the Control Reachability Problem in the Asynchronous pi-Calculus. Nord. J. Comput. 9(1): 70-101 (2002) - [c23]Roberto M. Amadio, Witold Charatonik:
On Name Generation and Set-Based Analysis in the Dolev-Yao Model. CONCUR 2002: 499-514 - 2001
- [c22]Roberto M. Amadio:
On the symbolic reduction of processes with cryptographic functions. LACPV@CAV 2001: 1-2 - [c21]Roberto M. Amadio, Charles Meyssonnier:
On the Decidability of Fragments of the Asynchronous pi-Calculus. EXPRESS 2001: 66-82 - 2000
- [j6]Roberto M. Amadio, Sanjiva Prasad:
Modelling IP Mobility. Formal Methods Syst. Des. 17(1): 61-99 (2000) - [j5]Roberto M. Amadio:
On modelling mobility. Theor. Comput. Sci. 240(1): 147-176 (2000) - [c20]Roberto M. Amadio, Denis Lugiez:
On the Reachability Problem in Cryptographic Protocols. CONCUR 2000: 380-394
1990 – 1999
- 1999
- [c19]Roberto M. Amadio, Sanjiva Prasad:
The Game of the Name in Cryptographic Tables. ASIAN 1999: 15-26 - [c18]Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine:
The Receptive Distributed pi-Calculus (Extended Abstract). FSTTCS 1999: 304-315 - 1998
- [b1]Roberto M. Amadio, Pierre-Louis Curien:
Domains and lambda-calculi. Cambridge tracts in theoretical computer science 46, Cambridge University Press 1998, ISBN 978-0-521-62277-6, pp. I-XIII, 1-484 - [j4]Roberto M. Amadio, Ilaria Castellani
On Bisimulations for the Asynchronous pi-Calculus. Theor. Comput. Sci. 195(2): 291-324 (1998) - [c17]Roberto M. Amadio, Sanjiva Prasad:
Modelling IP Mobility. CONCUR 1998: 301-316 - [c16]Roberto M. Amadio, Solange Coupet-Grimal:
Analysis of a Guard Condition in Type Theory (Extended Abstract). FoSSaCS 1998: 48-62 - 1997
- [c15]Roberto M. Amadio:
An Asynchronous Model of Locality, Failure and Process Mobility. COORDINATION 1997: 374-391 - 1996
- [c14]Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi:
On Bisimulations for the Asynchronous pi-Calculus. CONCUR 1996: 147-162 - [c13]Roberto M. Amadio, Mads Dam:
Toward a Modal Theory of Types for the pi-Calculus. FTRTFT 1996: 347-365 - 1995
- [j3]Roberto M. Amadio:
A Quick Construction of a Retraction of All Retractions for Stable Bifinites. Inf. Comput. 116(2): 272-274 (1995) - [c12]Roberto M. Amadio, Lone Leth Thomsen, Bent Thomsen:
From a Concurrent Lambda-Calculus to the Pi-Calculus. FCT 1995: 106-115 - [c11]Roberto M. Amadio, Mads Dam:
Reasoning about Higher-Order Processes. TAPSOFT 1995: 202-216 - 1994
- [c10]Roberto M. Amadio, Sanjiva Prasad:
Localities and Failures (Extended Abstract). FSTTCS 1994: 205-216 - 1993
- [j2]Roberto M. Amadio, Luca Cardelli
Subtyping Recursive Types. ACM Trans. Program. Lang. Syst. 15(4): 575-631 (1993) - [c9]Roberto M. Amadio:
On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation. CONCUR 1993: 112-126 - [c8]Roberto M. Amadio:
On the Adequacy of Per Models. MFCS 1993: 222-231 - 1991
- [j1]Roberto M. Amadio:
Recursion over Realizability Structures. Inf. Comput. 91(1): 55-85 (1991) - [c7]Roberto M. Amadio:
Bifinite Domains: Stable Case. Category Theory and Computer Science 1991: 16-33 - [c6]Roberto M. Amadio, Luca Cardelli:
Subtyping Recursive Types. POPL 1991: 104-118 - [c5]Roberto M. Amadio:
Domains in a Realizability Framework. TAPSOFT, Vol.1 1991: 241-263 - 1990
- [c4]Roberto M. Amadio:
Typed Equivalence, Type Assignment, and Type Containment. CTRS 1990: 372-382
1980 – 1989
- 1988
- [c3]Roberto M. Amadio:
A fixed point extension of the second order lambda-calculus: observable equivalences and models. LICS 1988: 51-60 - 1987
- [c2]Roberto M. Amadio, Giuseppe Longo:
Type-free compiling of parametric types. Formal Description of Programming Concepts 1987: 377-398 - 1986
- [c1]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: 122-130
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: