| 2009 |
|---|
| 56 | EE | Roberto M. Amadio,
Giuseppe Castagna,
Andrea Asperti:
Preface.
Inf. Comput. 207(5): 543-544 (2009) |
| 2008 |
|---|
| 55 | | 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
Springer 2008 |
| 54 | EE | Roberto M. Amadio,
Mehdi Dogguy:
On Affine Usages in Signal-Based Communication.
APLAS 2008: 221-236 |
| 53 | EE | Roberto M. Amadio,
Mehdi Dogguy:
On affine usages in signal-based communication
CoRR abs/0804.1729: (2008) |
| 52 | EE | Roberto M. Amadio,
Thomas T. Hildebrandt:
Preface.
Electr. Notes Theor. Comput. Sci. 194(2): 1 (2008) |
| 2007 |
|---|
| 51 | EE | Roberto M. Amadio,
Frédéric Dabrowski:
Feasible reactivity in a synchronous Pi-calculus.
PPDP 2007: 221-230 |
| 50 | EE | Roberto M. Amadio,
Mehdi Dogguy:
Determinacy in a synchronous pi-calculus
CoRR abs/0707.0556: (2007) |
| 49 | EE | Roberto M. Amadio,
Frederique Dabrowski:
Feasible reactivity in a synchronous pi-calculus
CoRR abs/cs/0702069: (2007) |
| 48 | EE | Roberto M. Amadio,
Iain Phillips:
Preface.
Electr. Notes Theor. Comput. Sci. 175(3): 1-2 (2007) |
| 47 | EE | Roberto M. Amadio:
A synchronous pi-calculus.
Inf. Comput. 205(9): 1470-1490 (2007) |
| 46 | EE | Roberto M. Amadio:
The SL synchronous language, revisited.
J. Log. Algebr. Program. 70(2): 121-150 (2007) |
| 2006 |
|---|
| 45 | EE | Roberto M. Amadio:
A synchronous pi-calculus
CoRR abs/cs/0606019: (2006) |
| 44 | EE | Roberto M. Amadio,
Frédéric Dabrowski:
Feasible Reactivity for Synchronous Cooperative Threads.
Electr. Notes Theor. Comput. Sci. 154(3): 33-43 (2006) |
| 43 | EE | Roberto M. Amadio,
Gérard Boudol,
Frédéric Boussinot,
Ilaria Castellani:
Reactive Concurrent Programming Revisited.
Electr. Notes Theor. Comput. Sci. 162: 49-60 (2006) |
| 42 | EE | Roberto M. Amadio,
Silvano Dal-Zilio:
Resource control for synchronous cooperative threads.
Theor. Comput. Sci. 358(2-3): 229-254 (2006) |
| 2005 |
|---|
| 41 | EE | Roberto M. Amadio:
The SL synchronous language, revisited
CoRR abs/cs/0511092: (2005) |
| 40 | EE | Roberto M. Amadio,
Silvano Dal-Zilio:
Resource Control for Synchronous Cooperative Threads
CoRR abs/cs/0512057: (2005) |
| 39 | EE | Roberto M. Amadio,
Gérard Boudol,
Ilaria Castellani,
Frédéric Boussinot:
Reactive concurrent programming revisited
CoRR abs/cs/0512058: (2005) |
| 38 | EE | Roberto M. Amadio:
Synthesis of max-plus quasi-interpretations.
Fundam. Inform. 65(1-2): 29-60 (2005) |
| 37 | EE | Roberto M. Amadio:
Guest editor's introduction: Special issue on Modelling and Verification of Cryptographic Protocols.
J. Log. Algebr. Program. 64(2): 155 (2005) |
| 2004 |
|---|
| 36 | EE | Roberto M. Amadio,
Silvano Dal-Zilio:
Resource Control for Synchronous Cooperative Threads.
CONCUR 2004: 68-82 |
| 35 | EE | Roberto M. Amadio,
Solange Coupet-Grimal,
Silvano Dal-Zilio,
Line Jakubiec:
A Functional Scenario for Bytecode Verification of Resource Bounds.
CSL 2004: 265-279 |
| 2003 |
|---|
| 34 | | Roberto M. Amadio,
Denis Lugiez:
CONCUR 2003 - Concurrency Theory, 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings
Springer 2003 |
| 33 | EE | Roberto M. Amadio:
Max-Plus Quasi-interpretations.
TLCA 2003: 31-45 |
| 32 | EE | Roberto M. Amadio,
Gérard Boudol,
Cédric Lhoussaine:
The receptive distributed pi-calculus.
ACM Trans. Program. Lang. Syst. 25(5): 549-577 (2003) |
| 31 | | 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) |
| 2002 |
|---|
| 30 | EE | Roberto M. Amadio,
Witold Charatonik:
On Name Generation and Set-Based Analysis in the Dolev-Yao Model.
CONCUR 2002: 499-514 |
| 29 | EE | Roberto M. Amadio,
Gérard Boudol,
Cédric Lhoussaine:
On message deliverability and non-uniform receptivity.
Fundam. Inform. 53(2): 105-129 (2002) |
| 28 | | 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) |
| 2001 |
|---|
| 27 | EE | Roberto M. Amadio,
Charles Meyssonnier:
On the Decidability of Fragments of the Asynchronous pi-Calculus.
Electr. Notes Theor. Comput. Sci. 52(1): (2001) |
| 26 | EE | Roberto M. Amadio:
On the symbolic reduction of processes with cryptographic functions.
Electr. Notes Theor. Comput. Sci. 55(1): (2001) |
| 2000 |
|---|
| 25 | EE | Roberto M. Amadio,
Denis Lugiez:
On the Reachability Problem in Cryptographic Protocols.
CONCUR 2000: 380-394 |
| 24 | | Roberto M. Amadio,
Sanjiva Prasad:
Modelling IP Mobility.
Formal Methods in System Design 17(1): 61-99 (2000) |
| 23 | EE | Roberto M. Amadio:
On modelling mobility.
Theor. Comput. Sci. 240(1): 147-176 (2000) |
| 1999 |
|---|
| 22 | EE | Roberto M. Amadio,
Sanjiva Prasad:
The Game of the Name in Cryptographic Tables.
ASIAN 1999: 15-26 |
| 21 | EE | Roberto M. Amadio,
Gérard Boudol,
Cédric Lhoussaine:
The Receptive Distributed pi-Calculus (Extended Abstract).
FSTTCS 1999: 304-315 |
| 1998 |
|---|
| 20 | EE | Roberto M. Amadio,
Sanjiva Prasad:
Modelling IP Mobility.
CONCUR 1998: 301-316 |
| 19 | EE | Roberto M. Amadio,
Solange Coupet-Grimal:
Analysis of a Guard Condition in Type Theory (Extended Abstract).
FoSSaCS 1998: 48-62 |
| 18 | EE | Roberto M. Amadio,
Ilaria Castellani,
Davide Sangiorgi:
On Bisimulations for the Asynchronous pi-Calculus.
Theor. Comput. Sci. 195(2): 291-324 (1998) |
| 1997 |
|---|
| 17 | | Roberto M. Amadio:
An Asynchronous Model of Locality, Failurem and Process Mobility.
COORDINATION 1997: 374-391 |
| 1996 |
|---|
| 16 | | Roberto M. Amadio,
Ilaria Castellani,
Davide Sangiorgi:
On Bisimulations for the Asynchronous pi-Calculus.
CONCUR 1996: 147-162 |
| 15 | | Roberto M. Amadio,
Mads Dam:
Toward a Modal Theory of Types for the pi-Calculus.
FTRTFT 1996: 347-365 |
| 1995 |
|---|
| 14 | | Roberto M. Amadio,
Lone Leth,
Bent Thomsen:
From a Concurrent Lambda-Calculus to the Pi-Calculus.
FCT 1995: 106-115 |
| 13 | | Roberto M. Amadio,
Mads Dam:
Reasoning about Higher-Order Processes.
TAPSOFT 1995: 202-216 |
| 12 | | Roberto M. Amadio:
A Quick Construction of a Retraction of All Retractions for Stable Bifinites
Inf. Comput. 116(2): 272-274 (1995) |
| 1994 |
|---|
| 11 | | Roberto M. Amadio,
Sanjiva Prasad:
Localities and Failures (Extended Abstract).
FSTTCS 1994: 205-216 |
| 1993 |
|---|
| 10 | | Roberto M. Amadio:
On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation.
CONCUR 1993: 112-126 |
| 9 | | Roberto M. Amadio:
On the Adequacy of Per Models.
MFCS 1993: 222-231 |
| 8 | EE | Roberto M. Amadio,
Luca Cardelli:
Subtyping Recursive Types.
ACM Trans. Program. Lang. Syst. 15(4): 575-631 (1993) |
| 1991 |
|---|
| 7 | | Roberto M. Amadio:
Bifinite Domains: Stable Case.
Category Theory and Computer Science 1991: 16-33 |
| 6 | | Roberto M. Amadio,
Luca Cardelli:
Subtyping Recursive Types.
POPL 1991: 104-118 |
| 5 | | Roberto M. Amadio:
Domains in a Realizability Framework.
TAPSOFT, Vol.1 1991: 241-263 |
| 4 | | Roberto M. Amadio:
Recursion over Realizability Structures
Inf. Comput. 91(1): 55-85 (1991) |
| 1990 |
|---|
| 3 | | Roberto M. Amadio:
Typed Equivalence, Type Assignment, and Type Containment.
CTRS 1990: 372-382 |
| 1988 |
|---|
| 2 | | Roberto M. Amadio:
A fixed point extension of the second order lambda-calculus: observable equivalences and models
LICS 1988: 51-60 |
| 1986 |
|---|
| 1 | | 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 |
