Projet Para

previous up next contents
Précédent : Diffusion des résultats Remonter : Projet PARA, Parallélisme


Références

Articles
1
T. HARDIN, L. MARANGET, B. PAGANO,
« Functional Back-Ends within the Lambda-Sigma Calculus »,
Journal of Functional Programming ,
Accepté pour publication.
Communications à des manifestations scientifiques
2
B. BLANCHET,
« Escape analysis: correctness proof, implementation and experimental results »,
in: 25th Annual ACM Symp. on Principles of Programming Languages , ACM Press,
janvier 1998.
3
A. DEUTSCH,
« On The Complexity of Escape Analysis »,
in: 24th Annual ACM Symp. on Principles of Programming Languages , ACM Press, p. 358-371,
janvier 1997.
4
C. FOURNET, C. LANEVE, L. MARANGET, D. RÉMY,
« Implicit Typing à la ML for the join-calculus »,
in: CONCUR '97: Concurrency Theory (8th International Conference, Warsaw, Poland, July 1997) , A. Mazurkiewicz, J. Winkowski (réd.), LNCS , 1243 , Springer, p. 196-212,
1997.
5
J.-J. LÉVY,
« Some results in the join-calculus »,
in: TACS '97: Theoretical Aspects of Computer Software , M. Abadi, T. Ito (réd.), LNCS , 1281 , Springer, p. 233-249,
1997,
http://pauillac.inria.fr/~levy/ .
6
U. NESTMANN, B. C. PIERCE,
« Decoding Choice Encodings »,
in: CONCUR '96: Concurrency Theory (7th International Conference, Pisa, Italy, August 1996) , U. Montanari, V. Sassone (réd.), LNCS , 1119 , Springer, p. 179-194,
1996. Revised full version as report ERCIM-10/97-R051, European Research Consortium for Informatics and Mathematics, 1997.,
http://www-ercim.inria.fr/publication/technical_reports/051-abstract.html .
7
U. NESTMANN, M. STEFFEN,
« Typing Confluence »,
in: Second International ERCIM Workshop on Formal Methods in Industrial Critical Systems (Cesena, Italy, July 4-5, 1997) , S. Gnesi, D. Latella (réd.), Consiglio Nazionale Ricerche di Pisa, p. 77-101,
1997. Also available as report ERCIM-10/97-R052, European Research Consortium for Informatics and Mathematics, 1997.,
http://www-ercim.inria.fr/publication/technical_reports/052-abstract.html .
8
U. NESTMANN,
« What Is a `Good' Encoding of Guarded Choice? »,
in: EXPRESS '97: Expressiveness in Concurrency (Santa Margherita Ligure, Italy, September 8-12, 1997) , C. Palamidessi, J. Parrow (réd.), ENTCS , 7 , Elesevier Science Publishers,
1997,
http://www.elsevier.nl/cas/tree/store/tcs/free/noncas/pc/volume7.htm .
Cours polycopiés
9
R. CORI, J.-J. LÉVY,
Algorithmes et Programmation ,
Ecole polytechnique, octobre 1997,
http://www.polytechnique.fr/poly/~levy/poly/.
10
J.-J. LÉVY,
Systèmes et Réseaux ,
Ecole polytechnique, mars 1997,
http://www.polytechnique.fr/poly/~levy/poly/majifa-syst-96/.
Divers
11
M. ABADI, C. FOURNET, G. GONTHIER,
« Secure Implementation of Channel Abstractions »,
Soumis à une conférence, November 1997.
12
M. BOREALE, C. FOURNET, C. LANEVE,
« Bisimulations in the Join-Calculus »,
Soumis à une conférence, September 1997.
13
C. FOURNET, L. MARANGET,
« The Join-Calculus language »,
Available electronically
(http://pauillac.inria.fr/join. ), June 1997.
14
C. FOURNET,
« Security within a Calculus of Mobile Agents? »,
avril 1997,
http://www.cs.nps.navy.mil/research/languages/statements/fournet.ps.
15
G. GONTHIER,
« On Asynchronous Barbs, Simulations, and Fair Testing »,
Soumis à une conférence, Octobre 1997.
Bibliographie générale
CC79
P. COUSOT AND R. COUSOT, Systematic design of program analysis frameworks, in 6th Annual ACM Symposium on Principles of Programming Languages, 1979, pp. 269-282.
FG96
C. FOURNET AND G. GONTHIER, The reflexive chemical abstract machine and the join-calculus, in Proceedings of the 23rd Annual Symposium on Principles of Programming Languages (POPL) (St. Petersburg Beach, Florida), ACM, Jan. 1996, pp. 372-385.
FGL+96
C. FOURNET, G. GONTHIER, J.-J. LÉVY, L. MARANGET, AND D. RéMY, A calculus of mobile agents, in CONCUR '96: Concurrency Theory (7th International Conference, Pisa, Italy, August 1996), U. Montanari and V. Sassone, eds., vol. 1119 of LNCS, Springer, 1996, pp. 406-421.
Mil89
R. MILNER, Communication and Concurrency, Prentice Hall, 1989.
MPW92
R. MILNER, J. PARROW, AND D. WALKER, A calculus of mobile processes, Parts I and II, Journal of Information and Computation, 100 (1992), pp. 1-77.
PT97
B. C. PIERCE AND D. N. TURNER, Pict: User manual.
Available electronically, 1997.
Rob91
ROBIN MILNER, The polyadic $\pi$-calculus: a tutorial, Tech. Report ECS-LFCS-91-180, LFCS, University of Edinburgh, Oct. 1991.
Also in Logic and Algebra of Specification, ed. F. L. Bauer, W. Brauer and H. Schwichtenberg, Springer, 1993.
TLK96
B. THOMSEN, L. LETH, AND T.-M. KUO, A Facile tutorial, in CONCUR '96: Concurrency Theory (7th International Conference, Pisa, Italy, August 1996), U. Montanari and V. Sassone, eds., vol. 1119 of LNCS, Springer, 1996, pp. 278-298.