Major publications by the team in recent years
  • 1A. Charguéraud, F. Pottier.

    Functional Translation of a Calculus of Capabilities, in: Proceedings of the 13th International Conference on Functional Programming (ICFP'08), ACM Press, September 2008, p. 213–224.

  • 2K. Chaudhuri, D. Doligez, L. Lamport, S. Merz.

    Verifying Safety Properties With the TLA+ Proof System, in: Automated Reasoning, 5th International Joint Conference, IJCAR 2010, Lecture Notes in Computer Science, Springer, 2010, vol. 6173, p. 142–148.

  • 3D. Le Botlan, D. Rémy.

    Recasting MLF, in: Information and Computation, 2009, vol. 207, no 6, p. 726–785.

  • 4X. Leroy.

    A formally verified compiler back-end, in: Journal of Automated Reasoning, 2009, vol. 43, no 4, p. 363–446.

  • 5X. Leroy.

    Formal verification of a realistic compiler, in: Communications of the ACM, 2009, vol. 52, no 7, p. 107–115.

  • 6B. Montagu, D. Rémy.

    Modeling Abstract Types in Modules with Open Existential Types, in: Proceedings of the 36th ACM Symposium on Principles of Programming Languages (POPL'09), ACM Press, January 2009, p. 354-365.

  • 7F. Pottier.

    Hiding local state in direct style: a higher-order anti-frame rule, in: Proceedings of the 23rd Annual IEEE Symposium on Logic In Computer Science (LICS'08), IEEE Computer Society Press, June 2008, p. 331-340.

  • 8F. Pottier, D. Rémy.

    The Essence of ML Type Inference, in: Advanced Topics in Types and Programming Languages, B. C. Pierce (editor), MIT Press, 2005, chap. 10, p. 389–489.
  • 9N. Pouillard, F. Pottier.

    A fresh look at programming with names and binders, in: Proceedings of the 15th International Conference on Functional Programming (ICFP 2010), ACM Press, 2010, p. 217–228.

  • 10J.-B. Tristan, X. Leroy.

    A simple, verified validator for software pipelining, in: Proceedings of the 37th ACM Symposium on Principles of Programming Languages (POPL'10), ACM Press, 2010, p. 83–92.

Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 11N. Pouillard.

    Une approche unifiante pour programmer sûrement avec de la syntaxe du premier ordre contenant des lieurs / Namely, Painless: A unifying approach to safe programming with first-order syntax with binders, Université Paris Diderot (Paris 7), January 2012.

  • 12T. Ramananandro.

    Machine-checked Formal Semantics and Verified Compilation for C++ Objects, Université Paris Diderot (Paris 7), January 2012.


Articles in International Peer-Reviewed Journals

Invited Conferences

  • 19X. Leroy.

    Mechanized Semantics for Compiler Verification, in: Programming Languages and Systems, 10th Asian Symposium, APLAS 2012, R. Jhala, A. Igarashi (editors), Lecture Notes in Computer Science, Springer, 2012, vol. 7705, p. 386–388, Abstract of invited talk.


International Conferences with Proceedings

  • 20S. Boldo, J.-H. Jourdan, X. Leroy, G. Melquiond.

    A Formally-Verified C Compiler Supporting Floating-Point Arithmetic, in: IEEE Symposium on Computer Arithmetic, ARITH 2013, IEEE Computer Society Press, 2013, to appear.

  • 21D. Cousineau, D. Doligez, L. Lamport, S. Merz, D. Ricketts, H. Vanzetto.

    TLA + Proofs, in: FM 2012: Formal Methods - 18th International Symposium, D. Giannakopoulou, D. Méry (editors), Lecture Notes in Computer Science, Springer, 2012, vol. 7436, p. 147-154.

  • 22J. Cretin, D. Rémy.

    On the Power of Coercion Abstraction, in: Proceedings of the 39th ACM Symposium on Principles of Programming Languages (POPL'12), ACM Press, 2012, p. 361–372.

  • 23D. Doligez, M. Jaume, R. Rioboo.

    Development of secured systems by mixing programs, specifications and proofs in an object-oriented programming environment: a case study within the FoCaLiZe environment, in: Proceedings of the 7th Workshop on Programming Languages and Analysis for Security (PLAS'12), ACM Press, 2012, p. 9:1–9:12.

  • 24J.-H. Jourdan, F. Pottier, X. Leroy.

    Validating LR(1) Parsers, in: Programming Languages and Systems – 21st European Symposium on Programming, ESOP 2012, H. Seidl (editor), Lecture Notes in Computer Science, Springer, 2012, vol. 7211, p. 397–416.

  • 25T. Ramananandro, G. Dos Reis, X. Leroy.

    A Mechanized Semantics for C++ Object Construction and Destruction, with Applications to Resource Management, in: Proceedings of the 39th ACM Symposium on Principles of Programming Languages (POPL'12), ACM Press, 2012, p. 521–532.

  • 26V. Robert, X. Leroy.

    A Formally-Verified Alias Analysis, in: Certified Programs and Proofs – Second International Conference, CPP 2012, C. Hawblitzel, D. Miller (editors), Lecture Notes in Computer Science, Springer, 2012, vol. 7679, p. 11-26.

  • 27D. N. Xu.

    Hybrid contract checking via symbolic simplification, in: Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM'12), ACM Press, 2012, p. 107–116.

  • 28B. Yorgey, S. Weirich, J. Cretin, José Pedro. Magalhães, S. Peyton Jones, D. Vytiniotis.

    Giving Haskell a Promotion, in: The Seventh ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'12), ACM Press, 2012, p. 67–78.


Conferences without Proceedings

Internal Reports

Other Publications

References in notes
  • 41L. O. Andersen.

    Program Analysis and Specialization for the C Programming Language, DIKU, University of Copenhagen, 1994.
  • 42V. Benzaken, G. Castagna, A. Frisch.

    CDuce: an XML-centric general-purpose language, in: Int. Conf. on Functional programming (ICFP'03), ACM Press, 2003, p. 51–63.
  • 43P. Brauner, C. Houtmann, C. Kirchner.

    Principles of Superdeduction, in: 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), IEEE Computer Society Press, 2007, p. 41-50.

  • 44A. Frisch.

    OCaml + XDuce, in: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming, ACM Press, September 2006, p. 192–200.

  • 45J. Garrigue, J. Le Normand.

    Adding GADTs to OCaml: the direct approach, in: ACM SIGPLAN Workshop on ML, ACM Press, 2011.
  • 46H. Hosoya, B. C. Pierce.

    XDuce: A Statically Typed XML Processing Language, in: ACM Transactions on Internet Technology, May 2003, vol. 3, no 2, p. 117–148.
  • 47L. Lamport.

    How to write a 21st century proof, in: Journal of Fixed Point Theory and Applications, 2012, vol. 11, p. 43-63.

  • 48X. Leroy.

    Java bytecode verification: algorithms and formalizations, in: Journal of Automated Reasoning, 2003, vol. 30, no 3–4, p. 235–269.

  • 49B. C. Pierce.

    Types and Programming Languages, MIT Press, 2002.
  • 50F. Pottier.

    Simplifying subtyping constraints: a theory, in: Information and Computation, 2001, vol. 170, no 2, p. 153–183.
  • 51F. Pottier, V. Simonet.

    Information Flow Inference for ML, in: ACM Transactions on Programming Languages and Systems, January 2003, vol. 25, no 1, p. 117–158.

  • 52V. Prevosto, D. Doligez.

    Algorithms and Proofs Inheritance in the FOC Language, in: Journal of Automated Reasoning, 2002, vol. 29, no 3–4, p. 337-363.
  • 53D. Rémy, J. Vouillon.

    Objective ML: A simple object-oriented extension to ML, in: 24th ACM Conference on Principles of Programming Languages, ACM Press, 1997, p. 40–53.
  • 54V. Simonet, F. Pottier.

    A Constraint-Based Approach to Guarded Algebraic Data Types, in: ACM Transactions on Programming Languages and Systems, January 2007, vol. 29, no 1, article no. 1 p.