Bibliography

Major publications by the team in recent years

[1]

P. Ning, P. F. Syverson, S. Jha (editors)
Proceedings of the 2008 ACM Conference on Computer and Communications Security, CCS 2008, Alexandria, Virginia, USA, October 27-31, 2008, ACM, 2008.

[2]

F. Besson, T. Blanc, C. Fournet, A. D. Gordon.
From Stack Inspction to Access Control: A Security Analysis for Libraries, in: 17th IEEE Computer Security Foundations Workshop, June 2004, p. 61–75.

[3]

R. Corin, P.-M. Deniélou, C. Fournet, K. Bhargavan, J. J. Leifer.
Secure Implementations for Typed Session Abstractions, in: 20th IEEE Computer Security Foundations Symposium (CSF'07), Venice, Italy, IEEE, July 2007, p. 170–186
http://www.msr-inria.inria.fr/projects/sec/sessions/.

[4]

C. Fournet, 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, January 1996, p. 372–385.

[5]

C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, D. Rémy.
A Calculus of Mobile Agents, in: CONCUR '96: Concurrency Theory (7th International Conference, Pisa, Italy, August 1996), U. Montanari, V. Sassone (editors), LNCS, Springer, 1996, vol. 1119, p. 406–421.

[6]

C. Fournet, C. Laneve, L. Maranget, D. Rémy.
Inheritance in the join calculus, in: Journal of Logics and Algebraic Programming, September 2003, vol. 57, n^o 1–2, p. 23–29.

[7]

A. Hobor, A. Appel, F. Zappa Nardelli.
Oracle Semantics for Concurrent Separation Logic, in: 17th European Symposium on Programming (ESOP'08), April 2007.

[8]

J. J. Leifer, G. Peskine, P. Sewell, K. Wansbrough.
Global abstraction-safe marshalling with hash types, in: Proc. 8th ICFP, 2003
http://hal.inria.fr/inria-00071732/fr/, Extended Abstract of INRIA Research Report 4851.

[9]

M. Merro, F. Zappa Nardelli.
Behavioural theory for Mobile Ambients, in: Journal of ACM, November 2005, vol. 52, n^o 6, p. 961–1023.

[10]

M. Qin, L. Maranget.
Expressive Synchronization Types for Inheritance in the Join Calculus, in: Proceedings of APLAS'03, Beijing China, LNCS, Springer, November 2003.

Publications of the year

Articles in International Peer-Reviewed Journal

[11]

C. Berline, G. Manzonetto, A. Salibra.
Effective Lambda Models Versus Recursively Enumerable Lambda Theories, in: Mathematical Structures in Computer Science, October 2009, vol. 19, n^o 5, p. 897-942.

International Peer-Reviewed Conference/Proceedings

[12]

K. Bhargavan, R. Corin, P.-M. Deniélou, C. Fournet, J. J. Leifer.
Cryptographic Protocol Synthesis and Verification for Multiparty Sessions, in: CSF, IEEE Computer Society, 2009, p. 124-140
http://doi.ieeecomputersociety.org/10.1109/CSF.2009.26.

[13]

A. Bucciarelli, T. Ehrhard, G. Manzonetto.
A relational model of a parallel and non-deterministic lambda-calculus, in: Lecture Notes in Computer Science, 2009, vol. 5407, p. 107-121.

[14]

G. Manzonetto.
A general class of models of , in: Mathematical Foundations of Computer Science (MFCS'09), Lecture Notes in Computer Science, Springer, 2009, vol. 5734, p. 574-586.

[15]

G. Manzonetto, A. Salibra.
Lattices of Equational Theories as Church Algebras, in: Proc. 7th Panhellenic Logic Symposium, C. Drossos, P. Peppas, C. Tsinakis (editors), Patras University Press, 2009, p. 117-121.

[16]

T. Wrigstad, F. Zappa Nardelli, S. Lebresne, J. Ostlund, J. Vitek.
Integrating Typed and Untyped Code in a Scripting Language, in: Proc. POPL 2010, 2010, to appear.

[17]

F. Zappa Nardelli, P. Sewell, J. Ševčík, S. Sarkar, S. Owens, L. Maranget, M. Batty, J. Alglave.
Relaxed memory models must be rigorous, in: Proceedings of Exploiting Concurrency Efficiently and Correctly – (EC)2. CAV 2009 Workshop. Grenoble, France, June 2009, 4pp p.

Scientific Books (or Scientific Book chapters)

[18]

Y. Bertot, G. Huet, J.-J. Lévy, G. Plotkin.
From Semantics to Computer Science: Essays in Honour of Gilles Kahn, Cambridge University Press, New York, NY, USA, 2009.

Other Publications

[19]

P. Sewell, F. Zappa Nardelli, S. Owens, G. Peskine, T. Ridge, S. Sarkar, R. Strniša.
Ott: Effective Tool Support for the Working Semanticist, 2010, To appear in the Journal of Functional Programming.

References in notes

[20]

K. Bhargavan, C. Fournet, R. Corin, E. Zalinescu.
Cryptographically verified implementations for TLS, in: ACM Conference on Computer and Communications Security, 2008, p. 459-468
http://doi.acm.org/10.1145/1455770.1455828.

[21]

K. Bhargavan, C. Fournet, R. Corin, E. Zalinescu.
Cryptographically verified implementations for TLS, in: Formal and Computational Cryptography Workshop, 2008.

[22]

R. Corin, P.-M. Deniélou, C. Fournet, K. Bhargavan, J. J. Leifer.
Secure Implementations for Typed Session Abstractions, in: 20th IEEE Computer Security Foundations Symposium (CSF'07), Venice, Italy, IEEE, July 2007, p. 170–186
http://www.msr-inria.inria.fr/projects/sec/sessions/.

[23]

R. Corin, P.-M. Deniélou.
A Protocol Compiler for Secure Sessions in ML, in: TGC, G. Barthe, C. Fournet (editors), Lecture Notes in Computer Science, Springer, 2007, vol. 4912, p. 276-293.

[24]

R. Corin, P.-M. Deniélou, C. Fournet, K. Bhargavan, J. J. Leifer.
A secure compiler for session abstractions, in: Journal of Computer Security, 2008, vol. 16, n^o 5, p. 573-636
http://dx.doi.org/10.3233/JCS-2008-0334.

[25]

R. Milner.
Communication and Concurrency, International Series on Computer Science, Prentice Hall, 1989.

[26]

R. Milner, J. Parrow, D. Walker.
A Calculus of Mobile Processes, Parts I and II, in: Journal of Information and Computation, September 1992, vol. 100, p. 1–77.

[27]

B. C. Pierce.
Types and Programming Languages, The MIT Press, 2002.

[28]

B. C. Pierce, D. N. Turner.
Pict: User Manual, 1997, Available electronically.

[29]

B. Thomsen, L. Leth, T.-M. Kuo.
A Facile Tutorial, in: CONCUR '96: Concurrency Theory (7th International Conference, Pisa, Italy, August 1996), U. Montanari, V. Sassone (editors), LNCS, Springer, 1996, vol. 1119, p. 278–298.