Bibliography

• 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.
  
  http://doi.acm.org/10.1145/1411204.1411235
• 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.
  
  http://dx.doi.org/10.1007/978-3-642-14203-1_12
• 3D. Le Botlan, D. Rémy.
  
  Recasting MLF, in: Information and Computation, 2009, vol. 207, n^o 6, p. 726–785.
  
  http://dx.doi.org/10.1016/j.ic.2008.12.006
• 4X. Leroy.
  
  A formally verified compiler back-end, in: Journal of Automated Reasoning, 2009, vol. 43, n^o 4, p. 363–446.
  
  http://dx.doi.org/10.1007/s10817-009-9155-4
• 5X. Leroy.
  
  Formal verification of a realistic compiler, in: Communications of the ACM, 2009, vol. 52, n^o 7, p. 107–115.
  
  http://doi.acm.org/10.1145/1538788.1538814
• 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.
  
  http://doi.acm.org/10.1145/1480881.1480926
• 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.
  
  http://dx.doi.org/10.1109/LICS.2008.16
• 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.
  
  http://doi.acm.org/10.1145/1863543.1863575
• 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.
  
  http://doi.acm.org/10.1145/1706299.1706311

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.
  
  http://tel.archives-ouvertes.fr/tel-00759059
• 12T. Ramananandro.
  
  Machine-checked Formal Semantics and Verified Compilation for C++ Objects, Université Paris Diderot (Paris 7), January 2012.
  
  http://tel.archives-ouvertes.fr/tel-00769044

Articles in International Peer-Reviewed Journals

• 13A. W. Appel, R. Dockins, X. Leroy.
  
  A list-machine benchmark for mechanized metatheory, in: Journal of Automated Reasoning, 2012, vol. 49, n^o 3, p. 453–491.
  
  http://dx.doi.org/10.1007/s10817-011-9226-1
• 14G. Gössler, D. N. Xu, A. Girault.
  
  Probabilistic contracts for component-based design, in: Formal Methods in System Design, 2012, vol. 41, n^o 2, p. 211–231.
  
  http://dx.doi.org/10.1007/s10703-012-0162-4
• 15F. Pottier.
  
  Syntactic soundness proof of a type-and-capability system with hidden state, in: Journal of Functional Programming, 2013, vol. 23, n^o 1, p. 38–144, to appear.
  
  http://dx.doi.org/10.1017/S0956796812000366
• 16N. Pouillard, F. Pottier.
  
  A unified treatment of syntax with binders, in: Journal of Functional Programming, 2012, vol. 22, n^o 4–5, p. 614–704.
  
  http://dx.doi.org/10.1017/S0956796812000251
• 17D. Rémy, B. Yakobowski.
  
  A Church-Style Intermediate Language for MLF, in: Theoretical Computer Science, 2012, vol. 435, n^o 1, p. 77–105.
  
  http://dx.doi.org/10.1016/j.tcs.2012.02.026
• 18J. Schwinghammer, L. Birkedal, F. Pottier, B. Reus, K. Støvring, H. Yang.
  
  A step-indexed Kripke Model of Hidden State, in: Mathematical Structures in Computer Science, 2013, vol. 23, n^o 1, p. 1–54, to appear.
  
  http://dx.doi.org/10.1017/S0960129512000035

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.
  
  http://dx.doi.org/10.1007/978-3-642-35182-2_27

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.
  
  http://hal.inria.fr/hal-00743090
• 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.
  
  http://dx.doi.org/10.1007/978-3-642-32759-9_14
• 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.
  
  http://dx.doi.org/10.1145/2103656.2103699
• 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.
  
  http://doi.acm.org/10.1145/2336717.2336726
• 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.
  
  http://dx.doi.org/10.1007/978-3-642-28869-2_20
• 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.
  
  http://dx.doi.org/10.1145/2103656.2103718
• 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.
  
  http://dx.doi.org/10.1007/978-3-642-35308-6_5
• 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.
  
  http://dx.doi.org/10.1145/2103746.2103767
• 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.
  
  http://dx.doi.org/10.1145/2103786.2103795

Conferences without Proceedings

• 29R. Bedin França, S. Blazy, D. Favre-Felix, X. Leroy, M. Pantel, J. Souyris.
  
  Formally verified optimizing compilation in ACG-based flight control software, in: Embedded Real Time Software and Systems (ERTS2 2012), AAAF, SEE, 2012.
  
  http://hal.inria.fr/hal-00653367/
• 30T. Braibant, A. Chlipala.
  
  Formal verification of hardware synthesis, in: The Coq Workshop, 2012.
  
  http://gallium.inria.fr/~braibant/data/braibant-talk-coq-workshop-2012.pdf
• 31J. Garrigue, D. Rémy.
  
  Tracing ambiguity in GADT type inference, in: ACM SIGPLAN Workshop on ML, 2012.
  
  http://www.lexifi.com/ml2012/full7.pdf
• 32J. Protzenko, F. Pottier.
  
  Programming with permissions: the Mezzo language, in: ACM SIGPLAN Workshop on ML, 2012.
  
  http://www.lexifi.com/ml2012/full1.pdf
• 33G. Scherer, D. Rémy.
  
  GADTs meet subtyping, in: ACM SIGPLAN Workshop on ML, 2012.
  
  http://www.lexifi.com/ml2012/full14.pdf

Internal Reports

• 34G. Gössler, D. N. Xu, A. Girault.
  
  Probabilistic Contracts for Component-based Design, Inria, July 2012, n^o RR-7328.
  
  http://hal.inria.fr/hal-00715750
• 35X. Leroy, A. W. Appel, S. Blazy, G. Stewart.
  
  The CompCert Memory Model, Version 2, Inria, June 2012, n^o RR-7987.
  
  http://hal.inria.fr/hal-00703441
• 36X. Leroy, D. Doligez, J. Garrigue, D. Rémy, J. Vouillon.
  
  The Objective Caml system, documentation and user's manual – release 4.00, Inria, July 2012.
  
  http://caml.inria.fr/pub/docs/manual-ocaml-4.00/
• 37X. Leroy.
  
  The CompCert C verified compiler, documentation and user's manual, Inria, July 2012.
  
  http://compcert.inria.fr/man/
• 38G. Scherer, D. Rémy.
  
  GADT meet Subtyping, Inria, October 2012, n^o RR-8114.
  
  http://hal.inria.fr/hal-00744292

Other Publications

• 39F. Pottier, J. Protzenko.
  
  An introduction to Mezzo, September 2012, Unpublished draft.
  
  http://gallium.inria.fr/~fpottier/publis/mezzo-tutorial.pdf
• 40F. Pottier, J. Protzenko.
  
  Programming with permissions in Mezzo, October 2012, Submitted for publication.
  
  http://gallium.inria.fr/~fpottier/publis/pottier-protzenko-mezzo.pdf

• 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.
  
  http://hal.inria.fr/inria-00133557
• 44A. Frisch.
  
  OCaml + XDuce, in: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming, ACM Press, September 2006, p. 192–200.
  
  http://doi.acm.org/10.1145/1159803.1159829
• 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, n^o 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.
  
  http://dx.doi.org/10.1007/s11784-012-0071-6
• 48X. Leroy.
  
  Java bytecode verification: algorithms and formalizations, in: Journal of Automated Reasoning, 2003, vol. 30, n^o 3–4, p. 235–269.
  
  http://gallium.inria.fr/~xleroy/publi/bytecode-verification-JAR.pdf
• 49B. C. Pierce.
  
  Types and Programming Languages, MIT Press, 2002.
• 50F. Pottier.
  
  Simplifying subtyping constraints: a theory, in: Information and Computation, 2001, vol. 170, n^o 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, n^o 1, p. 117–158.
  
  http://gallium.inria.fr/~fpottier/publis/fpottier-simonet-toplas.ps.gz
• 52V. Prevosto, D. Doligez.
  
  Algorithms and Proofs Inheritance in the FOC Language, in: Journal of Automated Reasoning, 2002, vol. 29, n^o 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, n^o 1, article no. 1 p.
  
  http://gallium.inria.fr/~fpottier/publis/simonet-pottier-hmg-toplas.ps.gz