Inria / Raweb 2009
Presentation of the Project Gallium

Bibliography

Major publications by the team in recent years

[1]: 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.
[2]: D. 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.
[3]: X. 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.
[4]: X. 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.
[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://dx.doi.org/10.1109/LICS.2007.44.
[6]: 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://dx.doi.org/10.1109/LICS.2008.16.
[7]: 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.
[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
http://gallium.inria.fr/~remy/cours/appsem/.
[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, n^o 1, article no. 1 p
http://doi.acm.org/10.1145/1180475.1180476.
[10]: 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.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[11]: Z. Dargaye.
Vérification formelle d'un compilateur optimisant pour langages fonctionnels, University Paris Diderot (Paris 7), July 2009, Ph. D. Thesis.
[12]: J.-B. Tristan.
Formal verification of translation validators, University Paris Diderot (Paris 7), November 2009
http://tel.archives-ouvertes.fr/tel-00437582/, Ph. D. Thesis.

Articles in International Peer-Reviewed Journal

[13]: S. Blazy, X. Leroy.
Mechanized semantics for the Clight subset of the C language, in: Journal of Automated Reasoning, 2009, vol. 43, n^o 3, p. 263-288
http://dx.doi.org/10.1007/s10817-009-9148-3.
[14]: D. 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.
[15]: X. Leroy, H. Grall.
Coinductive big-step operational semantics, in: Information and Computation, 2009, vol. 207, n^o 2, p. 284–304
http://dx.doi.org/10.1016/j.ic.2007.12.004.
[16]: X. 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.
[17]: X. 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.

International Peer-Reviewed Conference/Proceedings

[18]: P. Abate, J. Boender, R. Di Cosmo, S. Zacchiroli.
Strong Dependencies between Software Components, in: 3rd International Symposium on Empirical Sofware Engineering and Measurement, ESEM 2009, IEEE Computer Society Press, October 2009, p. 89-99
http://dx.doi.org/10.1109/ESEM.2009.5316017.
[19]: S. Blazy, B. Robillard.
Live-range Unsplitting for Faster Optimal Coalescing, in: Proceedings of the ACM SIGPLAN/SIGBED 2009 conference on Languages, Compilers, and Tools for Embedded Systems (LCTES 2009), ACM Press, 2009, p. 70–79
http://doi.acm.org/10.1145/1542452.1542462.
[20]: 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), ACM Press, January 2009, p. 114-126
http://doi.acm.org/10.1145/1480881.1480897.
[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), ACM Press, January 2009, p. 354-365
http://doi.acm.org/10.1145/1480881.1480926.
[22]: S. Rideau, X. Leroy.
Validating register allocation and spilling, in: International Conference on Compiler Construction (CC 2010), Lecture Notes in Computer Science, Springer, 2010
http://gallium.inria.fr/~xleroy/publi/validation-regalloc.pdf, Accepted for publication, to appear.
[23]: J. Schwinghammer, H. Yang, L. Birkedal, F. Pottier, B. Reus.
A Semantic Foundation for Hidden State, in: 13th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2010), Lecture Notes in Computer Science, Springer, 2010
http://gallium.inria.fr/~fpottier/publis/sfhs.pdf, Accepted for publication, to appear.
[24]: J.-B. Tristan, X. Leroy.
Verified Validation of Lazy Code Motion, in: Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'09), ACM Press, 2009, p. 316–326
http://doi.acm.org/10.1145/1542476.1542512.
[25]: J.-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
http://gallium.inria.fr/~xleroy/publi/validation-softpipe.pdf, Accepted for publication, to appear.

Scientific Popularization

[26]: R. Di Cosmo.
La science du logiciel libre, in: La Recherche, December 2009, vol. 436, Les cahiers de l'INRIA.
[27]: R. Di Cosmo.
Offrons aux jeunes les clés du pouvoir et de la liberté, in: Science et Avenir, September 2009, vol. 751, p. 42-45
http://sciencesetavenirmensuel.nouvelobs.com/hebdo/sea/p751/articles/a407123-.html.

Other Publications

[28]: A. W. Appel, R. Dockins, X. Leroy.
A list-machine benchmark for mechanized metatheory, July 2009
http://gallium.inria.fr/~xleroy/publi/listmachine-journal.pdf, Submitted.
[29]: A. Charguéraud.
Formal Software Verification Through Characteristic Formulae, October 2009
http://arthur.chargueraud.org/research/2009/cfg/cfg.pdf, Submitted.
[30]: Z. Dargaye, X. Leroy.
A verified framework for higher-order uncurrying optimizations, March 2009
http://gallium.inria.fr/~xleroy/publi/higher-order-uncurrying.pdf, Submitted.
[31]: P. Herms.
Partial Type Inference with Higher-Order Types, University of Pisa, July 2009
http://gallium.inria.fr/~remy/mlf/herms@master2009.pdf, Master's thesis.
[32]: A. Pilkiewicz, F. Pottier.
The essence of monotonic state, October 2009
http://gallium.inria.fr/~fpottier/publis/pilkiewicz-pottier-monotonicity-2009.pdf, Submitted.
[33]: D. Rémy, B. Yakobowski.
A Church-Style Intermediate Language for MLF, October 2009
http://gallium.inria.fr/~remy/mlf/xmlf.pdf, Submitted.

References in notes

[34]: 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.
[35]: 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.
[36]: 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://www.ensiie.fr/~blazy/JFLABRS08.pdf.
[37]: A. Charguéraud.
Interactive Verification of Call-by-Value Functional Programs, November 2008
http://arthur.chargueraud.org/research/2009/deep/deep.pdf, Submitted.
[38]: A. 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.
[39]: H. 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.
[40]: L. Lamport.
How to write a proof, in: American Mathematical Monthly, August 1993, vol. 102, n^o 7, p. 600–608
http://research.microsoft.com/users/lamport/pubs/lamport-how-to-write.pdf.
[41]: 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/.
[42]: X. 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.
[43]: B. C. Pierce.
Types and Programming Languages, MIT Press, 2002.
[44]: F. Pottier.
Simplifying subtyping constraints: a theory, in: Information and Computation, 2001, vol. 170, n^o 2, p. 153–183.
[45]: F. 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.
[46]: V. 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.
[47]: 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.
[48]: C. V. Russo.
First-Class Structures for Standard ML, in: Nordic Journal of Computing, 2000, vol. 7, n^o 4, p. 348-374.
[49]: B. Yakobowski.
Graphical types and constraints: second-order polymorphism and inference, University Paris Diderot (Paris 7), December 2008
http://tel.archives-ouvertes.fr/tel-00357708/, Ph. D. Thesis.

Logo Inria