Team Gallium

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Contracts and Grants with Industry
Other Grants and Activities
Dissemination
Bibliography

Bibliography

Major publications by the team in recent years

[1]
T. Hirschowitz, X. Leroy.
Mixin modules in a call-by-value setting, in: ACM Transactions on Programming Languages and Systems, 2005, vol. 27, no 5, p. 857–881
http://gallium.inria.fr/~xleroy/publi/mixins-cbv-toplas.pdf.
[2]
D. Le Botlan, D. Rémy.
MLF: Raising ML to the power of System F, in: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, ACM Press, August 2003, p. 27–38
http://gallium.inria.fr/~remy/work/mlf/icfp.pdf.
[3]
X. Leroy, H. Grall.
Coinductive big-step operational semantics, in: Information and Computation, accepted for publication, to appear in the special issue on Structural Operational Semantics, 2007
http://gallium.inria.fr/~xleroy/publi/coindsem-journal.pdf.
[4]
X. Leroy.
Formal certification of a compiler back-end, or: programming a compiler with a proof assistant, in: 33rd ACM symposium on Principles of Programming Languages, ACM Press, 2006, p. 42–54
http://gallium.inria.fr/~xleroy/publi/compiler-certif.pdf.
[5]
F. Pottier.
Static Name Control for FreshML, in: Twenty-Second Annual IEEE Symposium on Logic In Computer Science (LICS'07), IEEE Computer Society Press, July 2007, p. 356–365
http://gallium.inria.fr/~fpottier/publis/fpottier-pure-freshml.ps.gz.
[6]
F. 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.
[7]
F. 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
http://gallium.inria.fr/~fpottier/publis/fpottier-simonet-toplas.ps.gz.
[8]
D. Rémy.
Using, Understanding, and Unraveling the OCaml Language, in: Applied Semantics. Advanced Lectures, G. Barthe (editor), Lecture Notes in Computer Science, Springer, 2002, vol. 2395, p. 413–537.
[9]
V. 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
http://gallium.inria.fr/~fpottier/publis/simonet-pottier-hmg-toplas.ps.gz.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[10]
S. Blazy.
Sémantiques formelles, Habilitation à diriger les recherches, Université Évry Val d'Essone, October 2008
http://www.ensiie.fr/~blazy/hdr.html.
[11]
B. Yakobowski.
Graphical types and constraints: second-order polymorphism and inference, Ph. D. Thesis, University of Paris 7, December 2008
http://www.yakobowski.org/phd-dissertation.html.

Articles in International Peer-Reviewed Journal

[12]
B. Doligez, A. Berthouly, D. Doligez, M. Tanner, V. Saladin, D. Bonfils, H. Richner.
Spatial scale of local breeding habitat quality and adjustment of breeding decisions in a wild tit population, in: Ecology, 2008, vol. 89, no 5, p. 1436–1444
http://www.esajournals.org/doi/abs/10.1890/07-0113.1.
[13]
X. Leroy, S. Blazy.
Formal verification of a C-like memory model and its uses for verifying program transformations, in: Journal of Automated Reasoning, 2008, vol. 41, no 1, p. 1–31
http://dx.doi.org/10.1007/s10817-008-9099-0.
[14]
L. Rideau, B. P. Serpette, X. Leroy.
Tilting at windmills with Coq: Formal verification of a compilation algorithm for parallel moves, in: Journal of Automated Reasoning, 2008, vol. 40, no 4, p. 307–326
http://dx.doi.org/10.1007/s10817-007-9096-8.

International Peer-Reviewed Conference/Proceedings

[15]
B. Aydemir, A. Charguéraud, B. C. Pierce, R. Pollack, S. Weirich.
Engineering Formal Metatheory, in: Proceedings of the 35th ACM Symposium on Principles of Programming Languages (POPL'08), ACM Press, January 2008, p. 3–15
http://doi.acm.org/10.1145/1328897.1328443.
[16]
J. Brunel, D. Doligez, R. R. Hansen, J. L. Lawall, G. Muller.
A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking, in: Proceedings of the 36th ACM Symposium on Principles of Programming Languages (POPL'09), To appear, ACM Press, January 2009.
[17]
A. 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.
[18]
K. Chaudhuri, D. Doligez, L. Lamport, S. Merz.
A TLA+ Proof System, in: Proceedings of the LPAR Workshops: Knowledge Exchange: Automated Provers and Proof Assistants, and The 7th International Workshop on the Implementation of Logics, G. Sutcliffe, P. Rudnicki, R. Schmidt, B. Konev, S. Schulz (editors), CEUR Workshop Proceedings, CEUR-WS.org, November 2008, vol. 418
http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-418/paper2.pdf.
[19]
P. Cuoq, D. Doligez.
Hashconsing in an Incrementally Garbage-Collected System: A Story of Weak Pointers and Hashconsing in OCaml 3.10.2, in: 2008 ACM SIGPLAN Workshop on ML, ACM Press, September 2008, p. 13–22
http://doi.acm.org/10.1145/1411304.1411308.
[20]
J. N. Foster, A. Pilkiewicz, B. C. Pierce.
Quotient Lenses, in: Proceedings of the 13th International Conference on Functional Programming (ICFP'08), ACM Press, September 2008, p. 383–396
http://doi.acm.org/10.1145/1411204.1411257.
[21]
B. 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), To appear, ACM Press, January 2009
http://gallium.inria.fr/~remy/modules/Montagu-Remy@popl09:fzip.pdf.
[22]
F. 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://doi.ieeecomputersociety.org/10.1109/LICS.2008.16.
[23]
Y. Régis-Gianas, F. Pottier.
A Hoare logic for call-by-value functional programs, in: Mathematics of Program Construction, 9th International Conference, MPC 2008, Lecture Notes in Computer Science, Springer, July 2008, vol. 5133, p. 305–335
http://dx.doi.org/10.1007/978-3-540-70594-9_17.
[24]
J.-B. Tristan, X. Leroy.
Formal verification of translation validators: A case study on instruction scheduling optimizations, in: Proceedings of the 35th ACM Symposium on Principles of Programming Languages (POPL'08), ACM Press, January 2008, p. 17–27
http://doi.acm.org/10.1145/1328897.1328444.
[25]
B. Yakobowski, D. Rémy.
Graphic Type Constraints and Efficient Type Inference: from ML to MLF, in: Proceedings of the 13th International Conference on Functional Programming (ICFP'08), ACM Press, September 2008, p. 63–74
http://doi.acm.org/10.1145/1411204.1411216.

National Peer-Reviewed Conference/Proceedings

[26]
P. Ayrault, M. Carlier, D. Delahaye, C. Dubois, D. Doligez, L. Habib, T. Hardin, M. Jaume, C. Morisset, F. Pessaux, R. Rioboo, P. Weis.
Trusted Software within Focal, in: Computer & Electronics Security Applications Rendez-vous (C&SAR 2008), P. Chour, Y. Correc, O. Heen, L. (editors), December 2008, p. 142–158
http://www-spi.lip6.fr/~jaume/cesar.pdf.
[27]
S. Blazy, B. Robillard, É. Soutif.
Coloration avec préférences: complexité, inégalités valides et vérification formelle, in: ROADEF'08, 9e congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, February 2008
http://hal.inria.fr/inria-00260712.
[28]
S. Blazy, B. Robillard, É. Soutif.
Vérification formelle d'un algorithme d'allocation de registres par coloration de graphes, in: Journées Francophones des Langages Applicatifs (JFLA'08), Étretat, France, INRIA, January 2008, p. 31–46
http://hal.inria.fr/inria-00202713/.
[29]
B. Yakobowski.
Le caractère “backquote” à la rescousse – Factorisation et réutilisation de code grâce aux variants polymorphes, in: Journées Francophones des Langages Applicatifs (JFLA'08), Étretat, France, INRIA, January 2008, p. 63–78
http://hal.inria.fr/inria-00202817/.

Internal Reports

[30]
X. Leroy, D. Doligez, J. Garrigue, D. Rémy, J. Vouillon.
The Objective Caml system, documentation and user's manual – release 3.11, INRIA, December 2008
http://caml.inria.fr/pub/docs/manual-ocaml/.

Other Publications

[31]
S. Blazy, X. Leroy.
Mechanized semantics for the Clight subset of the C language, Submitted, October 2008
http://gallium.inria.fr/~xleroy/publi/Clight.pdf.
[32]
S. Blazy, B. Robillard.
Live-range unsplitting for faster optimal coalescing, Submitted, October 2008.
[33]
A. Charguéraud.
Interactive Verification of Call-by-Value Functional Programs, Submitted, November 2008
http://arthur.chargueraud.org/research/2009/deep/deep.pdf.
[34]
X. Leroy.
A formally verified compiler back-end, Submitted, July 2008
http://gallium.inria.fr/~xleroy/publi/compcert-backend.pdf.
[35]
K. Nakata.
Lazy mixins and disciplined effects, Submitted, July 2008
http://gallium.inria.fr/~nakata/papers/Lyre08.pdf.
[36]
K. Nakata.
Lazy modules: A lazy evaluation strategy for more recursive initialization patterns, Submitted, September 2008
http://gallium.inria.fr/~nakata/papers/Osan08.pdf.
[37]
A. Pilkiewicz.
Towards a foundational type system for complexity analysis, Master's dissertation (mémoire de stage de Master 2), École Polytechnique, November 2008.
[38]
D. Rémy, B. Yakobowski.
A Church-Style Intermediate Language for MLF, Submitted, September 2008
http://gallium.inria.fr/~remy/mlf/xmlf.pdf.
[39]
J.-B. Tristan, X. Leroy.
Verified Validation of Lazy Code Motion, Submitted, November 2008
http://gallium.inria.fr/~xleroy/publi/validation-LCM.pdf.

References in notes

[40]
A. W. Appel, S. Blazy.
Separation logic for small-step Cminor, in: Theorem Proving in Higher Order Logics, 20th Int. Conf. TPHOLs 2007, Lecture Notes in Computer Science, Springer, 2007, vol. 4732, p. 5–21
http://www.ensiie.fr/~blazy/AppelBlazy07.pdf.
[41]
V. 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.
[42]
S. Blazy, Z. Dargaye, X. Leroy.
Formal Verification of a C Compiler Front-End, in: FM 2006: Int. Symp. on Formal Methods, Lecture Notes in Computer Science, Springer, 2006, vol. 4085, p. 460–475
http://gallium.inria.fr/~xleroy/publi/cfront.pdf.
[43]
H. 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.
[44]
L. Lamport.
How to write a proof, in: American Mathematical Monthly, August 1993, vol. 102, no 7, p. 600–608
http://research.microsoft.com/users/lamport/pubs/lamport-how-to-write.pdf.
[45]
D. Le Botlan, D. Rémy.
Recasting MLF, Research report, INRIA, June 2007, no 6228
http://hal.inria.fr/inria-00156628.
[46]
D. Le Botlan.
MLF: Une extension de ML avec polymorphisme de second ordre et instanciation implicite., Ph. D. Thesis, École Polytechnique, May 2004
http://www.inria.fr/rrrt/tu-1071.html.
[47]
B. C. Pierce.
Types and Programming Languages, MIT Press, 2002.
[48]
F. Pottier.
Simplifying subtyping constraints: a theory, in: Information and Computation, 2001, vol. 170, no 2, p. 153–183.
[49]
V. 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.
[50]
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, p. 40–53.
[51]
D. Rémy, B. Yakobowski.
A graphical presentation of MLF types with a linear-time incremental unification algorithm., in: ACM SIGPLAN Workshop on Types in Language Design and Implementation, ACM Press, January 2007, p. 27–38
http://gallium.inria.fr/~remy/project/mlf/mlf-graphic-types.pdf.

previous
next