Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
XML PDF e-pub
PDF e-Pub


Major publications by the team in recent years
J. Alglave, L. Maranget, M. Tautschnig.
Herding cats: modelling, simulation, testing, and data-mining for weak memory, in: ACM Transactions on Programming Languages and Systems, 2014, vol. 36, no 2, article no 7.
T. Balabonski, F. Pottier, J. Protzenko.
The design and formalization of Mezzo, a permission-based programming language, in: ACM Transactions on Programming Languages and Systems, 2016, vol. 38, no 4, pp. 14:1–14:94.
A. Charguéraud, F. Pottier.
Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits, in: Journal of Automated Reasoning, September 2017. [ DOI : 10.1007/s10817-017-9431-7 ]
K. 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.
J. Cretin, D. Rémy.
System F with Coercion Constraints, in: CSL-LICS 2014: Computer Science Logic / Logic In Computer Science, ACM, 2014, article no 34.
J.-H. Jourdan, V. Laporte, S. Blazy, X. Leroy, D. Pichardie.
A Formally-Verified C Static Analyzer, in: POPL'15: 42nd ACM Symposium on Principles of Programming Languages, ACM Press, January 2015, pp. 247-259.
D. Le Botlan, D. Rémy.
Recasting MLF, in: Information and Computation, 2009, vol. 207, no 6, pp. 726–785.
X. Leroy.
A formally verified compiler back-end, in: Journal of Automated Reasoning, 2009, vol. 43, no 4, pp. 363–446.
X. Leroy.
Formal verification of a realistic compiler, in: Communications of the ACM, 2009, vol. 52, no 7, pp. 107–115.
N. Pouillard, F. Pottier.
A unified treatment of syntax with binders, in: Journal of Functional Programming, 2012, vol. 22, no 4–5, pp. 614–704.
Publications of the year

Doctoral Dissertations and Habilitation Theses

V. Aksenov.
Synchronization Costs in Parallel Programs and Concurrent Data Structures, ITMO University ; Paris Diderot University, September 2018.

Articles in International Peer-Reviewed Journals

T. Williams, D. Rémy.
A Principled Approach to Ornamentation in ML, in: Proceedings of the ACM on Programming Languages, January 2018, pp. 1-30. [ DOI : 10.1145/3158109 ]

International Conferences with Proceedings

U. A. Acar, V. Aksenov, A. Charguéraud, M. Rainey.
Provably and Practically Efficient Granularity Control, in: PPoPP 2019 - Principles and Practice of Parallel Programming, Washington DC, United States, February 2019. [ DOI : 10.1145/3293883.3295725 ]
U. A. Acar, A. Charguéraud, A. Guatto, M. Rainey, F. Sieczkowski.
Heartbeat scheduling: provable efficiency for nested parallelism, in: PLDI’18 - 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, Philadelphia, United States, ACM Press, June 2018. [ DOI : 10.1145/3192366.3192391 ]
V. Aksenov, U. A. Acar, A. Charguéraud, M. Rainey.
Poster: Performance challenges in modular parallel programs, in: PPoPP 2018 - 23rd ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, Vienna, Austria, February 2018, vol. 18. [ DOI : 10.1145/3178487.3178516 ]
V. Aksenov, D. Alistarh, P. Kuznetsov.
Brief Announcement: Performance Prediction for Coarse-Grained Locking, in: PODC 2018 - ACM Symposium on Principles of Distributed Computing, Egham, United Kingdom, July 2018. [ DOI : 10.1145/3212734.3212785 ]
V. Aksenov, P. Kuznetsov, A. Shalyto.
On Helping and Stacks, in: The International Conference on Networked Systems, Essaouira, Morocco, May 2018.
J. Alglave, L. Maranget, P. McKenney, A. Parri, A. Stern.
Frightening Small Children and Disconcerting Grown-ups: Concurrency in the Linux Kernel, in: ASPLOS2018 - 23rd ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Williamsburg, VA, United States, March 2018. [ DOI : 10.1145/3173162.3177156 ]
G. Barany.
Finding Missed Compiler Optimizations by Differential Testing, in: CC'18 - 27th International Conference on Compiler Construction, Vienna, Austria, February 2018. [ DOI : 10.1145/3178372.3179521 ]
C. Bozman, B. Canou, R. Di Cosmo, P. Couderc, L. Gesbert, G. Henry, F. le Fessant, M. Mauny, C. Morel, L. Peyrot.
Learn-OCaml : un assistant à l'enseignement d'OCaml, in: Journées Francophones des Langages Applicatifs (JFLA), Les Rousses, France, January 2019.
A. Guéneau, A. Charguéraud, F. Pottier.
A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification, in: ESOP 2018 - 27th European Symposium on Programming, Thessaloniki, Greece, A. Ahmed (editor), LNCS - Lecture Notes in Computer Science, Springer, April 2018, vol. 10801, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018. [ DOI : 10.1007/978-3-319-89884-1_19 ]
D. Kästner, J. Barrho, U. Wünsche, M. Schlickling, B. Schommer, M. Schmidt, C. Ferdinand, X. Leroy, S. Blazy.
CompCert: Practical Experience on Integrating and Qualifying a Formally Verified Optimizing Compiler, in: ERTS2 2018 - 9th European Congress Embedded Real-Time Software and Systems, Toulouse, France, 3AF, SEE, SIE, January 2018, pp. 1-9.
B. Schommer, C. Cullmann, G. Gebhard, X. Leroy, M. Schmidt, S. Wegener.
Embedded Program Annotations for WCET Analysis, in: WCET 2018: 18th International Workshop on Worst-Case Execution Time Analysis, Barcelona, Spain, Dagstuhl Publishing, July 2018, vol. 63. [ DOI : 10.4230/OASIcs.WCET.2018.8 ]

National Conferences with Proceedings

G. Barany, G. Scherer.
Génération aléatoire de programmes guidée par la vivacité, in: JFLA 2018 - Journées Francophones des Langages Applicatifs, Banyuls-sur-Mer, France, January 2018.

Conferences without Proceedings

G. Barany.
A more precise, more correct stack and register model for CompCert, in: LOLA 2018 - Syntax and Semantics of Low-Level Languages 2018, Oxford, United Kingdom, July 2018.

Internal Reports

X. Leroy, D. Doligez, A. Frisch, J. Garrigue, D. Rémy, J. Vouillon.
The OCaml system release 4.07: Documentation and user's manual, Inria, July 2018, pp. 1-752.
X. Leroy.
The CompCert C verified compiler: Documentation and user’s manual: Version 3.4, Inria, September 2018, pp. 1-77.
F. Pessaux, D. Doligez.
Compiling Programs and Proofs: FoCaLiZe Internals, Ensta ParisTech, May 2018.

Other Publications

A. Guéneau.
Procrastination: A proof engineering technique, July 2018, Coq Workshop 2018, The Coq Workshop 2018 is a part of FLoC 2018.
X. Leroy.
À la recherche du logiciel parfait, November 2018, Post on the "Binaire" popular science blog of Le Monde.
References in notes
C. Bastoul.
Code Generation in the Polyhedral Model Is Easier Than You Think, in: PACT'04: Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques, IEEE Computer Society, 2004, pp. 7–16.
V. Benzaken, G. Castagna, A. Frisch.
CDuce: an XML-centric general-purpose language, in: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, C. Runciman, O. Shivers (editors), ACM, 2003, pp. 51–63.
S. Conchon, A. Coquereau, M. Iguernelala, A. Mebsout.
Alt-Ergo 2.2, in: Proceedings of the 16th International Workshop on Satisfiability Modulo Theories, SMT 2018, Oxford, UK, 2018.
P. Couderc.
Vérification des résultats de l’inférence de types du langage OCaml, Université Paris-Saclay, 2018.
H. Hosoya, B. C. Pierce.
XDuce: A Statically Typed XML Processing Language, in: ACM Transactions on Internet Technology, 2003, vol. 3, no 2, pp. 117–148.
L. Lamport.
How to write a 21st century proof, in: Journal of Fixed Point Theory and Applications, 2012, vol. 11, pp. 43–63.
X. Leroy, D. Doligez, A. Frisch, J. Garrigue, D. Rémy, J. Vouillon.
The Objective Caml system, documentation and user's manual – release 4.07, Inria, July 2018.
X. Leroy.
Java bytecode verification: algorithms and formalizations, in: Journal of Automated Reasoning, 2003, vol. 30, no 3–4, pp. 235–269.
B. C. Pierce.
Types and Programming Languages, MIT Press, 2002.
F. Pottier.
Simplifying subtyping constraints: a theory, in: Information and Computation, 2001, vol. 170, no 2, pp. 153–183.
F. 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.
D. 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.!popl97.pdf
T. Williams, D. Rémy.
A Principled Approach to Ornamentation in ML, Inria, November 2017, no RR-9117. [ DOI : 10.1145/nnnnnnn.nnnnnnn ]