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]
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, no 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, no 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, no 7, p. 107–115.
http://doi.acm.org/10.1145/1538788.1538814
[5]
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
[6]
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
[7]
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
[8]
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.
[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://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]
A. Charguéraud.
Characteristic Formulae for Mechanized Program Verification, Université Paris Diderot (Paris 7), December 2010.
http://arthur.chargueraud.org/research/2010/thesis/
[12]
B. Montagu.
Programmer avec des modules de première classe dans un langage noyau pourvu de sous-typage, sortes singletons et types existentiels ouverts, École Polytechnique, December 2010, English title: Programming with first-class modules in a core language with subtyping, singleton kinds and open existential types.

Articles in International Peer-Reviewed Journal

[13]
M. Dezani-Ciancaglini, R. Di Cosmo, E. Giovannetti, M. Tatsuta.
On isomorphisms of intersection types, in: ACM Transactions on Computational Logic, 2010, vol. 11, no 4, Article No. 25 p.
http://doi.acm.org/10.1145/1805950.1805955

International Peer-Reviewed Conference/Proceedings

[14]
D. M. J. Barbosa, J. Cretin, N. Foster, M. Greenberg, B. C. Pierce.
Matching Lenses: Alignment and View Update, in: Proceedings of the 15th International Conference on Functional Programming (ICFP 2010), ACM Press, 2010, p. 193–204.
http://doi.acm.org/10.1145/1863543.1863572
[15]
R. Bedin França, D. Favre-Felix, X. Leroy, M. Pantel, J. Souyris.
Towards Optimizing Certified Compilation in Flight Control Software, in: Workshop on Predictability and Performance in Embedded Systems (PPES 2011), OpenAccess Series in Informatics, Dagstuhl Publishing, 2011, To appear.
[16]
A. Charguéraud.
Program Verification Through Characteristic Formulae, in: Proceedings of the 15th International Conference on Functional Programming (ICFP 2010), ACM Press, 2010, p. 321–332.
http://doi.acm.org/10.1145/1863543.1863590
[17]
A. Charguéraud.
The Optimal Fixed Point Combinator, in: Interactive Theorem Proving (ITP 2010), Lecture Notes in Computer Science, Springer, 2010, vol. 6172, p. 195-210.
http://dx.doi.org/10.1007/978-3-642-14052-5_15
[18]
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, p. 142–148.
http://dx.doi.org/10.1007/978-3-642-14203-1_12
[19]
R. Di Cosmo, J. Boender.
Using strong conflicts to detect quality issues in component-based complex systems, in: ISEC '10: Proceedings of the 3rd India software engineering conference, ACM Press, 2010, p. 163–172.
http://doi.acm.org/10.1145/1730874.1730905
[20]
R. Di Cosmo, S. Zacchiroli.
Feature Diagrams as Package Dependencies, in: Software Product Lines: Going Beyond - 14th International Conference, SPLC 2010, Lecture Notes in Computer Science, Springer, 2010, vol. 6287, p. 476-480.
http://dx.doi.org/10.1007/978-3-642-15579-6_40
[21]
A. Pilkiewicz, F. Pottier.
The essence of monotonic state, in: 6th Workshop on Types in Language Design and Implementation (TLDI 2011), ACM Press, 2011, To appear.
http://gallium.inria.fr/~fpottier/publis/pilkiewicz-pottier-monotonicity.pdf
[22]
F. Pottier.
A typed store-passing translation for general references, in: Proceedings of the 38th ACM Symposium on Principles of Programming Languages (POPL'11), ACM Press, 2011, To appear.
http://gallium.inria.fr/~fpottier/publis/fpottier-fork.pdf
[23]
N. 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
[24]
T. Ramananandro, G. Dos Reis, X. Leroy.
Formal verification of object layout for C++ multiple inheritance, in: Proceedings of the 38th ACM Symposium on Principles of Programming Languages (POPL'11), ACM Press, 2011, To appear.
http://gallium.inria.fr/~xleroy/publi/cpp-object-layout.pdf
[25]
S. Rideau, X. Leroy.
Validating register allocation and spilling, in: Compiler Construction (CC 2010), Lecture Notes in Computer Science, Springer, 2010, vol. 6011, p. 224-243.
http://dx.doi.org/10.1007/978-3-642-11970-5_13
[26]
D. Rémy, B. Yakobowski.
A Church-Style Intermediate Language for MLF, in: Functional and Logic Programming, 10th International Symposium, FLOPS 2010, Lecture Notes in Computer Science, Springer, 2010, vol. 6009, p. 24–39.
http://dx.doi.org/10.1007/978-3-642-12251-4_4
[27]
J. Schwinghammer, H. Yang, L. Birkedal, F. Pottier, B. Reus.
A Semantic Foundation for Hidden State, in: Foundations of Software Science and Computation Structures (FoSSaCS 2010), Lecture Notes in Computer Science, Springer, 2010, vol. 6014, p. 2–17.
http://dx.doi.org/10.1007/978-3-642-12032-9_2
[28]
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, p. 83–92.
http://doi.acm.org/10.1145/1706299.1706311
[29]
D. N. Xu, G. Gössler, A. Girault.
Probabilistic Contracts for Component-based Design, in: Automated Technology for Verification and Analysis (ATVA 2010), Lecture Notes in Computer Science, Springer, 2010, vol. 6252, p. 325–340.
http://dx.doi.org/10.1007/978-3-642-15643-4_24

National Peer-Reviewed Conference/Proceedings

[30]
B. Montagu, D. Rémy.
Types abstraits et types existentiels ouverts, in: Actes des deuxièmes journées nationales du Groupement De Recherche CNRS du Génie de la Programmation et du Logiciel, Université de Pau, É. Cariou, L. Duchien, Y. Ledru (editors), March 2010, p. 147–148.
http://gdr-gpl.imag.fr/

Workshops without Proceedings

[31]
B. Montagu.
Experience report: Mechanizing Core F-zip using the locally nameless approach (extended abstract), in: 5th ACM SIGPLAN Workshop on Mechanizing Metatheory, 2010.
http://www.cis.upenn.edu/~bcpierce/wmm/wmm10/montagu.pdf

Scientific Books (or Scientific Book chapters)

[32]
X. Leroy.
Mechanized semantics, in: Logics and languages for reliability and security, NATO Science for Peace and Security Series D: Information and Communication Security, IOS Press, 2010, vol. 25, p. 195–224.
http://dx.doi.org/10.3233/978-1-60750-100-8-195

Internal Reports

[33]
X. Leroy, D. Doligez, J. Garrigue, D. Rémy, J. Vouillon.
The Objective Caml system, documentation and user's manual – release 3.12, INRIA, August 2010.
http://caml.inria.fr/pub/docs/manual-ocaml/
[34]
D. N. Xu, G. Gössler, A. Girault.
Probabilistic Contracts for Component-based Design, INRIA, 07 2010, no RR-7328.
http://hal.inria.fr/inria-00507785/en/

Scientific Popularization

[35]
X. Leroy.
Comment faire confiance à un compilateur?, in: La Recherche, April 2010, vol. 440, Les cahiers de l'INRIA.
http://www.lescahiersinria.com/sites/default/files/inria-n440-avril10.pdf

Other Publications

[36]
J. Cretin.
A generalization of F-eta with abstraction over retyping functions, École Polytechnique, December 2010.
http://gallium.inria.fr/~jcretin/papers/master_thesis.pdf
[37]
G. Scherer.
Extending MLF with Higher-Order Types, École Normale Supérieure, Paris, August 2010.
http://gallium.inria.fr/~remy/mlf/scherer@master2010:mlfomega.pdf

References in notes

[38]
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.
[39]
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
[40]
S. Gulwani, G. Necula.
A polynomial-time algorithm for global value numbering, in: Science of Computer Programming, 2007, vol. 64, no 1, p. 97–114.
[41]
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.
[42]
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
[43]
S. Lerner, D. Grove, C. Chambers.
Composing dataflow analyses and transformations, in: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '02, ACM Press, 2002, p. 270–282.
[44]
X. Leroy.
Java bytecode verification: algorithms and formalizations, in: Journal of Automated Reasoning, 2003, vol. 30, no 3–4, p. 235–269.
http://gallium.inria.fr/~xleroy/publi/bytecode-verification-JAR.pdf
[45]
Z. Manna, A. Shamir.
The optimal fixedpoint of recursive programs, in: Proceedings of the 7th Annual ACM Symposium on Theory of Computing, STOC'75, ACM Press, 1975, p. 194–206.
[46]
J. Matthews.
Recursive Function Definition over Coinductive Types, in: Theorem Proving in Higher Order Logics, 12th International Conference, TPHOLs'99, Lecture Notes in Computer Science, Springer, 1999, vol. 1690, p. 73–90.
[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]
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
[50]
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.
[51]
N. Ramsey, J. Dias, S. Peyton Jones.
Hoopl: Dataflow optimization made simple, in: ACM SIGPLAN Haskell Symposium, ACM Press, 2010.
[52]
C. V. Russo.
First-Class Structures for Standard ML, in: Nordic Journal of Computing, 2000, vol. 7, no 4, p. 348-374.
[53]
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.
[54]
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/

previous
next