33872 articles – 26722 Notices  [english version]
.:. Consultation > Par auteur > Amadio .:.
21 documents classés par :
1 - 2 - 3 Page Suivante Page Finale
fulltext access Certifying cost annotations in compilers
Amadio R. M., Ayache N., Régis-Gianas Y., Saillard R.
[hal-00524715 - version 1]
An affine-intuitionistic system of types and effects: confluence and termination
Amadio R. M., Baillot P., Madet A.
In Workshop LOLA "Syntax and Semantics of Low Level Languages" (2010) [hal-00625760 - version 1]
fulltext access Feasible reactivity in a synchronous pi-calculus
Amadio R. M., Dabrowski F.
In ACM SIGPLAN Principles and Practice of Declarative Programming (2007) 221-231 [hal-00130322 - version 1]
fulltext access Reactive concurrent programming revisited
Amadio R. M., Boudol G., Castellani I., Boussinot F.
In Express 162 (2006) 49-60 [hal-00015838 - version 1]
Feasible Reactivity for Synchronous Cooperative Threads.
Amadio R. M., Dabrowski F.
In Process Algebra (2006) 33-43 [hal-00147244 - version 1]
fulltext access On name generation and set-based analysis in Dolev-Yao model
Amadio R. M., Charatonik W.
N° RR-4379 (2002) [inria-00072209 - version 1]
fulltext access On the Decidability of Fragments of the Asynchronous Pi-Calculus
Amadio R. M., Meyssonnier C.
N° RR-4241 (2001) [inria-00072346 - version 1]
fulltext access On the Symbolic Reduction of Processes with Cryptographic Functions
Amadio R. M., Lugiez D., Vanackère V.
N° RR-4147 (2001) [inria-00072478 - version 1]
fulltext access The Receptive Distributed $\pi$-Calculus
Amadio R. M., Boudol G., Lhoussaine C.
N° RR-4080 (2000) [inria-00072553 - version 1]
fulltext access On the Reachability Problem in Cryptographic Protocols
Amadio R. M., Lugiez D.
N° RR-3915 (2000) [inria-00072738 - version 1]