Formal verification of compilers

[1]	Xavier Leroy and Sandrine Blazy. Formal verification of a C-like memory model and its uses for verifying program transformations. Journal of Automated Reasoning, 2008. Accepted for publication, to appear.
[2]	Laurence Rideau, Bernard P. Serpette, and Xavier Leroy. Tilting at windmills with Coq: formal verification of a compilation algorithm for parallel moves. Journal of Automated Reasoning, 2008. Accepted for publication, to appear.
[3]	Jean-Baptiste Tristan and Xavier Leroy. Formal verification of translation validators: A case study on instruction scheduling optimizations. In 35th symposium Principles of Programming Languages, pages 17-27. ACM Press, January 2008.
[4]	Xavier Leroy. The Compcert verified compiler, commented Coq development. Available at http://gallium.inria.fr/ xleroy/compcert/, September 2007.
[5]	Xavier Leroy and Hervé Grall. Coinductive big-step operational semantics. Information and Computation, 2007. Accepted for publication in the special issue on Structured Operational Semantics, to appear.
[6]	Zaynah Dargaye and Xavier Leroy. Mechanized verification of CPS transformations. In Logic for Programming, Artificial Intelligence and Reasoning, 14th Int. Conf. LPAR 2007, volume 4790 of Lecture Notes in Artificial Intelligence, pages 211-225. Springer, 2007.
[7]	Andrew W. Appel and Xavier Leroy. A list-machine benchmark for mechanized metatheory (extended abstract). In Proc. Int. Workshop on Logical Frameworks and Meta-Languages (LFMTP'06), volume 174/5 of Electronic Notes in Theoretical Computer Science, pages 95-108, 2007.
[8]	Sandrine Blazy, Zaynah Dargaye, and Xavier Leroy. Formal verification of a C compiler front-end. In FM 2006: Int. Symp. on Formal Methods, volume 4085 of Lecture Notes in Computer Science, pages 460-475. Springer, 2006.
[9]	Andrew W. Appel and Xavier Leroy. A list-machine benchmark for mechanized metatheory. Research report 5914, INRIA, 2006.
[10]	Xavier Leroy. Coinductive big-step operational semantics. In European Symposium on Programming (ESOP 2006), volume 3924 of Lecture Notes in Computer Science, pages 54-68. Springer, 2006.
[11]	Xavier Leroy. Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. In 33rd symposium Principles of Programming Languages, pages 42-54. ACM Press, 2006.
[12]	Yves Bertot, Benjamin Grégoire, and Xavier Leroy. A structured approach to proving compiler optimizations based on dataflow analysis. In Types for Proofs and Programs, Workshop TYPES 2004, volume 3839 of Lecture Notes in Computer Science, pages 66-81. Springer, 2006.
[13]	Sandrine Blazy and Xavier Leroy. Formal verification of a memory model for C-like imperative languages. In International Conference on Formal Engineering Methods (ICFEM 2005), volume 3785 of Lecture Notes in Computer Science, pages 280-299. Springer, 2005.

Modules and mixins

[1]	Tom Hirschowitz and Xavier Leroy. Mixin modules in a call-by-value setting. ACM Transactions on Programming Languages and Systems, 27(5):857-881, 2005.
[2]	Tom Hirschowitz, Xavier Leroy, and J. B. Wells. Call-by-value mixin modules: Reduction semantics, side effects, types. In European Symposium on Programming, volume 2986 of Lecture Notes in Computer Science, pages 64-78. Springer, 2004.
[3]	Tom Hirschowitz, Xavier Leroy, and J. B. Wells. Compilation of extended recursion in call-by-value functional languages. In International Conference on Principles and Practice of Declarative Programming, pages 160-171. ACM Press, 2003.
[4]	Tom Hirschowitz, Xavier Leroy, and J. B. Wells. A reduction semantics for call-by-value mixin modules. Research report 4682, INRIA, 2003.
[5]	Tom Hirschowitz, Xavier Leroy, and J. B. Wells. On the implementation of recursion in call-by-value functional languages. Research report 4728, INRIA, 2003.
[6]	Tom Hirschowitz and Xavier Leroy. Mixin modules in a call-by-value setting. In D. Le Métayer, editor, Programming Languages and Systems, ESOP'2002, volume 2305 of Lecture Notes in Computer Science, pages 6-20. Springer, 2002.
[7]	Xavier Leroy. A modular module system. Journal of Functional Programming, 10(3):269-303, 2000.
[8]	Xavier Leroy. A syntactic theory of type generativity and sharing. Journal of Functional Programming, 6(5):667-698, 1996.
[9]	Xavier Leroy. Applicative functors and fully transparent higher-order modules. In 22nd symposium Principles of Programming Languages, pages 142-153. ACM Press, 1995.
[10]	Xavier Leroy. Manifest types, modules, and separate compilation. In 21st symposium Principles of Programming Languages, pages 109-122. ACM Press, 1994.

Language-based security

[1]	Xavier Leroy. Computer security from a programming language and static analysis perspective. In P. Degano, editor, Programming Languages and Systems: 12th European Symposium on Programming, ESOP 2003, volume 2618 of Lecture Notes in Computer Science, pages 1-9. Springer, 2003. Abstract of invited lecture.
[2]	Xavier Leroy. Java bytecode verification: algorithms and formalizations. Journal of Automated Reasoning, 30(3-4):235-269, 2003.
[3]	Xavier Leroy. Bytecode verification for Java smart card. Software - Practice & Experience, 32(4):319-340, 2002.
[4]	Xavier Leroy. Java bytecode verification: an overview. In G. Berry, H. Comon, and A. Finkel, editors, Computer Aided Verification, CAV 2001, volume 2102 of Lecture Notes in Computer Science, pages 265-285. Springer, 2001.
[5]	Xavier Leroy. On-card bytecode verification for Java card. In I. Attali and T. Jensen, editors, Smart card programming and security, proceedings E-Smart 2001, volume 2140 of Lecture Notes in Computer Science, pages 150-164. Springer, 2001.
[6]	Xavier Leroy and François Rouaix. Security properties of typed applets. In J. Vitek and C. Jensen, editors, Secure Internet Programming - Security issues for Mobile and Distributed Objects, volume 1603 of Lecture Notes in Computer Science, pages 147-182. Springer, 1999.
[7]	Xavier Leroy and François Rouaix. Security properties of typed applets. In 25th symposium Principles of Programming Languages, pages 391-403. ACM Press, 1998.

Types in compilation and static analysis

[1]	François Pessaux and Xavier Leroy. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340-377, 2000.
[2]	François Pessaux and Xavier Leroy. Type-based analysis of uncaught exceptions. In 26th symposium Principles of Programming Languages, pages 276-290. ACM Press, 1999.
[3]	Xavier Leroy. Introduction to types in compilation. In Proceedings of the 1998 Types in Compilation workshop, volume 1473 of Lecture Notes in Computer Science, pages 1-8. Springer, March 1998.
[4]	Xavier Leroy. The effectiveness of type-based unboxing. In Workshop Types in Compilation '97. Technical report BCCS-97-03, Boston College, Computer Science Department, June 1997.
[5]	Xavier Leroy. Unboxed objects and polymorphic typing. In 19th symposium Principles of Programming Languages, pages 177-188. ACM Press, 1992.
[6]	Xavier Leroy. Efficient data representation in polymorphic languages. Research report 1264, INRIA, 1990.
[7]	Xavier Leroy. Efficient data representation in polymorphic languages. In P. Deransart and J. Maluszynski, editors, Programming Language Implementation and Logic Programming 90, volume 456 of Lecture Notes in Computer Science. Springer, 1990.

Type systems

[1]	Xavier Leroy. A locally nameless solution to the POPLmark challenge. Research report 6098, INRIA, January 2007.
[2]	Xavier Leroy and Michel Mauny. Dynamics in ML. Journal of Functional Programming, 3(4):431-463, 1993.
[3]	Xavier Leroy. Polymorphism by name for references and continuations. In 20th symposium Principles of Programming Languages, pages 220-231. ACM Press, 1993.
[4]	Xavier Leroy. Typage polymorphe d'un langage algorithmique. Phd thesis (in french), Université Paris 7, 1992.
[5]	Xavier Leroy. Polymorphic typing of an algorithmic language. Research report 1778, INRIA, 1992.
[6]	Xavier Leroy and Michel Mauny. Dynamics in ML. In John Hughes, editor, Functional Programming Languages and Computer Architecture 1991, volume 523 of Lecture Notes in Computer Science, pages 406-426. Springer, 1991.
[7]	Xavier Leroy and Pierre Weis. Polymorphic type inference and assignment. In 18th symposium Principles of Programming Languages, pages 291-302. ACM Press, 1991.
[8]	Luca Cardelli and Xavier Leroy. Abstract types and the dot notation. Research report 56, Digital Equipment Corporation, Systems Research Center, 1990.
[9]	Luca Cardelli and Xavier Leroy. Abstract types and the dot notation. In M. Broy and C. B. Jones, editors, Proceedings IFIP TC2 working conference on programming concepts and methods, pages 479-504. North-Holland, 1990.

Caml and functional programming

[1]	Benjamin Grégoire and Xavier Leroy. A compiled implementation of strong reduction. In International Conference on Functional Programming 2002, pages 235-246. ACM Press, 2002.
[2]	Pierre Weis and Xavier Leroy. Le langage Caml. Dunod, 1999.
[3]	Marco Danelutto, Roberto DiCosmo, Xavier Leroy, and Susanna Pelagatti. Parallel functional programming with skeletons: the OCamlP3L experiment. In Proceedings ACM workshop on ML and its applications. Cornell University, 1998.
[4]	P. H. Hartel, M. Feeley, M. Alt, L. Augustsson, P. Baumann, M. Beemster, E. Chailloux, C. H. Flood, W. Grieskamp, J. H. G.van Groningen, K. Hammond, B. Hausman, M. Y. Ivory, R. E. Jones, J. Kamperman, P. Lee, X. Leroy, R. D. Lins, S. Loosemore, N. Röjemo, M. Serrano, J.-P. Talpin, J. Thackray, S. Thomas, P. Walters, P. Weis, and P. Wentworth. Benchmarking implementations of functional languages with “Pseudoknot”, a float-intensive benchmark. Journal of Functional Programming, 6(4):621-655, 1996.
[5]	Xavier Leroy. Le système Caml Special Light: modules et compilation efficace en Caml. Research report 2721, INRIA, November 1995.
[6]	Damien Doligez and Xavier Leroy. A concurrent, generational garbage collector for a multithreaded implementation of ML. In 20th symposium Principles of Programming Languages, pages 113-123. ACM Press, 1993.
[7]	Xavier Leroy and Pierre Weis. Manuel de référence du langage Caml. InterÉditions, 1993.
[8]	Xavier Leroy. Programmation du système Unix en Caml Light. Technical report 147, INRIA, 1992.
[9]	Xavier Leroy. The ZINC experiment: an economical implementation of the ML language. Technical report 117, INRIA, 1990.

Formal management of package dependencies

[1]	Fabio Mancinelli, Roberto Di Cosmo, Jérôme Vouillon, Jaap Boender, Berke Durak, Xavier Leroy, and Ralf Treinen. Managing the complexity of large free and open source package-based software distributions. In 21st IEEE Int. Conf. on Automated Software Engineering (ASE 2006), pages 199-208. IEEE Computer Society Press, 2006.
[2]	Roberto Di Cosmo, Berke Durak, Xavier Leroy, Fabio Mancinelli, and Jérôme Vouillon. Maintaining large software distributions: new challenges from the FOSS era. In Proceedings of the FRCSS 2006 workshop, volume 12 of EASST Newsletter, pages 7-20, 2006.
[3]	Serge Abiteboul, Ciarán Bryce, Roberto Di Cosmo, Klaus R. Dittrich, Stéfane Fermigier, Stéphane Laurière, Frédéric Lepied, Xavier Leroy, Tova Milo, Eleonora Panto, Radu Pop, Assaf Sagi, Yotam Shtossel, Florent Villard, and Boris Vrdoljak. EDOS: Environment for the Development and Distribution of Open Source Software. In First International Conference on Open Source Systems (OSS 2005), 2005.

Others

[1]	Cristiano Calcagno, Walid Taha, Liwen Huang, and Xavier Leroy. Implementing multi-stage languages using ASTs, gensym, and reflection. In Generative Programming and Component Engineering, 2nd Int. Conf. GPCE 2003, volume 2830 of Lecture Notes in Computer Science, pages 57-76. Springer, 2003.
[2]	Xavier Leroy. Lessons learned from the translation of documentation from LATEX to HTML. In ERCIM/W4G Int. Workshop on WWW Authoring and Integration Tools, February 1995.
[3]	María-Virginia Aponte and Xavier Leroy. Llamado de procedimientos a distancia y abstracción de tipos. In Proc. 20th CLEI PANEL latino-american computer science conference, pages 1281-1292, 1994.