Major publications by the team in recent years
  • 1K. 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, pp. 142–148.

  • 2J. 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, pp. 361–372.

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

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

  • 4X. Leroy.

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

  • 5X. Leroy.

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

  • 6F. 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, pp. 331-340.

  • 7F. Pottier, J. Protzenko.

    Programming with permissions in Mezzo, in: Proceedings of the 18th International Conference on Functional Programming (ICFP 2013), ACM Press, 2013, pp. 173–184.

  • 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, pp. 389–489.
  • 9N. Pouillard, F. Pottier.

    A unified treatment of syntax with binders, in: Journal of Functional Programming, 2012, vol. 22, no 4–5, pp. 614–704.

  • 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, pp. 83–92.

Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 13J. Alglave, L. Maranget, M. Tautschnig.

    Herding Cats: Modelling, Simulation, Testing, and Data Mining for Weak Memory, in: ACM Trans. On Programming Languages and Systems (TOPLAS), June 2014, vol. 36, no 2, pp. 7:1–7:74. [ DOI : 10.1145/2627752 ]

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

    Verified Compilation of Floating-Point Computations, in: Journal of Automated Reasoning, February 2015, vol. 54, no 2, pp. 135-163. [ DOI : 10.1007/s10817-014-9317-x ]

  • 15T. Braibant, J.-H. Jourdan, D. Monniaux.

    Implementing and reasoning about hash-consed data structures in Coq, in: Journal of Automated Reasoning, 2014, vol. 53, no 3, pp. 271-304. [ DOI : 10.1007/s10817-014-9306-0 ]

  • 16Y. Chen, J. Dunfield, A. Hammer, U. A. Acar.

    Implicit self-adjusting computation for purely functional programs, in: Journal of Functional Programming, January 2014, vol. 24, no 1, pp. 56-112.

  • 17P.-É. Dagand, C. McBride.

    Transporting functions across ornaments, in: Journal of Functional Programming, May 2014, vol. 24, no 2-3, 67 p. [ DOI : 10.1017/S0956796814000069 ]


Invited Conferences

  • 18X. Leroy.

    Compiler verification for fun and profit, in: FMCAD 2014 - Formal Methods in Computer-Aided Design, Lausanne, Switzerland, K. Claessen, V. Kuncak (editors), FMCAD Inc, October 2014, 9 p.

  • 19X. Leroy.

    Formal proofs of code generation and verification tools, in: SEFM 2014 - 12th International Conference Software Engineering and Formal Methods, Grenoble, France, D. Giannakopoulou, G. Salaün (editors), Lecture Notes in Computer Science, Springer, September 2014, vol. 8702, pp. 1-4. [ DOI : 10.1007/978-3-319-10431-7_1 ]

  • 20X. Leroy.

    Formal verification of a static analyzer: abstract interpretation in type theory, in: Types - The 2014 Types Meeting, Paris, France, May 2014.

  • 21X. Leroy.

    Proof assistants in computer science research, in: IHP thematic trimester on Semantics of proofs and certified mathematics, Paris, France, Institut Henri Poincaré, April 2014.


International Conferences with Proceedings

  • 22U. A. Acar, A. Charguéraud, M. Rainey.

    Theory and Practice of Chunked Sequences, in: European Symposium on Algorithms, Wrocław, Poland, A. Schulz, D. Wagner (editors), Lecture Notes in Computer Science, Springer Berlin Heidelberg, September 2014, no 8737, pp. 25 - 36. [ DOI : 10.1007/978-3-662-44777-2_3 ]

  • 23J. Alglave, L. Maranget, M. Tautschnig.

    Herding cats: Modelling, simulation, testing, and data-mining for weak memory, in: PLDI '14: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, Edinburg, United Kingdom, ACM, June 2014, 40 p. [ DOI : 10.1145/2594291.2594347 ]

  • 24T. Balabonski, F. Pottier, J. Protzenko.

    Type Soundness and Race Freedom for Mezzo, in: FLOPS 2014: 12th International Symposium on Functional and Logic Programming, Kanazawa, Japan, LNCS, Springer, June 2014, vol. 8475, pp. 253 - 269. [ DOI : 10.1007/978-3-319-07151-0_16 ]

  • 25P. Bhatotia, U. A. Acar, P. Junqueira, R. Rodrigues.

    Slider: Incremental Sliding Window Analytics, in: Middleware 2014: Proceedings of the 15th International Middleware Conference, Bordeaux, France, December 2014. [ DOI : 10.1145/2663165.2663334 ]

  • 26Y. Chen, U. A. Acar, K. Tangwongsan.

    Functional Programming for Dynamic and Large Data with Self-Adjusting Computation, in: ICFP 2014: 19th ACM SIGPLAN International Conference on Functional Programming, Gothenburg, Sweden, September 2014. [ DOI : 10.1145/2628136.2628150 ]

  • 27J. Cheney, A. Amal, U. A. Acar.

    Database Queries that Explain their Work, in: PPDP 2014: 16th International Symposium on Principles and Practice of Declarative Programming, Canterbury, United Kingdom, September 2014. [ DOI : 10.1145/2643135.2643143 ]

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

    System F with Coercion Constraints, in: CSL-LICS 2014: Joint Meeting of the Annual Conference on Computer Science Logic and the Annual Symposium on Logic in Computer Science, Vienna, Austria, T. A. Henzinger, D. Miller (editors), ACM, July 2014, 34 p. [ DOI : 10.1145/2603088.2603128 ]

  • 29J.-H. Jourdan, V. Laporte, S. Blazy, X. Leroy, D. Pichardie.

    A formally-verified C static analyzer, in: POPL 2015: 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Mumbai, India, ACM, January 2015, pp. 247-259. [ DOI : 10.1145/2676726.2676966 ]

  • 30R. Krebbers, X. Leroy, F. Wiedijk.

    Formal C semantics: CompCert and the C standard, in: ITP 2014: Fifth conference on Interactive Theorem Proving, Vienna, Austria, Lecture Notes in Computer Science, Springer, July 2014, vol. 8558, pp. 543-548. [ DOI : 10.1007/978-3-319-08970-6_36 ]

  • 31F. Pottier.

    Hindley-Milner Elaboration in Applicative Style, in: ICFP 2014: 19th ACM SIGPLAN International Conference on Functional Programming, Goteborg, Sweden, ACM, September 2014. [ DOI : 10.1145/2628136.2628145 ]

  • 32G. Scherer, D. Rémy.

    Full reduction in the face of absurdity, in: ESOP'2015: European Conference on Programming Languages and Systems, London, United Kingdom, April 2015.

  • 33T. Williams, P.-É. Dagand, D. Rémy.

    Ornaments in practice, in: WGP 2014: ACM workshop on Generic programming, Gothenburg, Sweden, August 2014. [ DOI : 10.1145/2633628.2633631 ]


National Conferences with Proceedings

  • 34S. Conchon, L. Maranget, A. Mebsout, D. Declerck.

    Vérification de programmes C concurrents avec Cubicle : Enfoncer les barrières, in: JFLA, Fréjus, France, January 2014.

  • 35P.-É. Dagand, G. Scherer.

    Normalization by realizability also evaluates, in: Vingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015), Le Val d'Ajol, France, D. Baelde, J. Alglave (editors), January 2015.

  • 36F. Pottier.

    Depth-First Search and Strong Connectivity in Coq, in: Vingt-sixièmes journées francophones des langages applicatifs (JFLA 2015), Le Val d'Ajol, France, D. Baelde, J. Alglave (editors), January 2015.


Conferences without Proceedings

  • 37P. Abate, R. Di Cosmo, L. Gesbert, F. Le Fessant, S. Zacchiroli.

    Using Preferences to Tame your Package Manager, in: OCaml 2014, Goteborg, Sweden, September 2014.

  • 38T. Braibant, J. Protzenko, G. Scherer.

    Well-typed generic smart-fuzzing for APIs, in: ML'14 - ACM SIGPLAN ML Family Workshop, Göteborg, Sweden, August 2014.

  • 39P. Couderc, B. Canou, P. Chambart, F. Le Fessant.

    A Proposal for Non-Intrusive Namespaces in OCaml, in: OCaml 2014, Goteborg, Sweden, September 2014.

  • 40D. Doligez, J. Kriener, L. Lamport, T. Libal, S. Merz.

    Coalescing: Syntactic Abstraction for Reasoning in First-Order Modal Logics, in: ARQNL 2014 - Automated Reasoning in Quantified Non-Classical Logics, Vienna, Austria, July 2014.

  • 41F. Le Fessant.

    A Case for Multi-Switch Constraints in OPAM, in: OCaml 2014, goteborg, Sweden, September 2014.

  • 42G. Scherer, D. Rémy.

    Deciding unique inhabitants with sums (work in progress), in: TYPES, Paris, France, May 2014.


Scientific Books (or Scientific Book chapters)

  • 43X. Leroy, A. Tiu.

    CPP '15: Proceedings of the 2015 Conference on Certified Programs and Proofs, ACM, January 2015, 184 p.

  • 44X. Leroy, A. W. Appel, S. Blazy, G. Stewart.

    The CompCert memory model, in: Program Logics for Certified Compilers, A. W. Appel (editor), Cambridge University Press, April 2014, pp. 237-271.

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

    From Amber to Coercion Constraints, in: Essays for the Luca Cardelli Fest, M. Abadi, P. Gardner, A. D. Gordon, R. Mardare (editors), TechReport, Microsoft Research, September 2014, no MSR-TR-2014-104.


Internal Reports

Other Publications

References in notes
  • 53V. Benzaken, G. Castagna, A. Frisch.

    CDuce: an XML-centric general-purpose language, in: ICFP'03: International Conference on Functional Programming, ACM Press, 2003, pp. 51–63.
  • 54K. Chaudhuri, D. Miller, A. Saurin.

    Canonical Sequent Proofs via Multi-Focusing, in: TCS 2008 – Fifth IFIP International Conference On Theoretical Computer Science, G. Ausiello, J. Karhumäki, G. Mauri, C. L. Ong (editors), IFIP, Springer, 2008, vol. 273, pp. 383–396.

  • 55D. 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, pp. 147-154.

  • 56P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, X. Rival.

    Combination of Abstractions in the Astrée Static Analyzer, in: ASIAN 2006: 11th Asian Computing Science Conference, Lecture Notes in Computer Science, Springer, 2006, vol. 4435, pp. 272-300.
  • 57J. 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, pp. 361–372.

  • 58M. Herlihy, N. Shavit.

    The Art of Multiprocessor Programming, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2008.
  • 59H. Hosoya, B. C. Pierce.

    XDuce: A Statically Typed XML Processing Language, in: ACM Transactions on Internet Technology, May 2003, vol. 3, no 2, pp. 117–148.
  • 60J.-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, pp. 397–416.

  • 61L. Lamport.

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

  • 62X. Leroy.

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

  • 63S. Lindley.

    Extensional Rewriting with Sums, in: TLCA 2007 – Typed Lambda Calculi and Applications, 8th International Conference, Springer, 2007, pp. 255–271.

  • 64S. Mador-Haim, L. Maranget, S. Sarkar, K. Memarian, J. Alglave, S. Owens, R. Alur, M. Martin, P. Sewell, D. Williams.

    An Axiomatic Memory Model for Power Multiprocessors, in: CAV 2012: Computer Aided Verification, 24th International Conference, Lecture Notes in Computer Science, Springer, 2012, vol. 7358, pp. 495-512.
  • 65B. C. Pierce.

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

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

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

  • 68V. 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, pp. 11-26.

  • 69D. 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, pp. 40–53.
  • 70S. Sarkar, P. Sewell, J. Alglave, L. Maranget, D. Williams.

    Understanding Power multiprocessors, in: PLDI 2011: 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2011, pp. 175-186.