Members
Overall Objectives
Research Program
Application Domains
Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


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, pp. 213–224.
http://doi.acm.org/10.1145/1411204.1411235
[2]
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.
http://dx.doi.org/10.1007/978-3-642-14203-1_12
[3]
J. 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, pp. 361–372.
http://dx.doi.org/10.1145/2103656.2103699
[4]
D. Le Botlan, D. Rémy.
Recasting MLF, in: Information and Computation, 2009, vol. 207, no 6, pp. 726–785.
http://dx.doi.org/10.1016/j.ic.2008.12.006
[5]
X. Leroy.
A formally verified compiler back-end, in: Journal of Automated Reasoning, 2009, vol. 43, no 4, pp. 363–446.
http://dx.doi.org/10.1007/s10817-009-9155-4
[6]
X. Leroy.
Formal verification of a realistic compiler, in: Communications of the ACM, 2009, vol. 52, no 7, pp. 107–115.
http://doi.acm.org/10.1145/1538788.1538814
[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, pp. 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, pp. 389–489.
[9]
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.
http://dx.doi.org/10.1017/S0956796812000251
[10]
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, pp. 83–92.
http://doi.acm.org/10.1145/1706299.1706311
Publications of the year

Doctoral Dissertations and Habilitation Theses

[11]
J. Cretin.
Coercions effaçables : une approche unifiée des systèmes de types, Université Paris-Diderot - Paris VII, January 2014.
http://hal.inria.fr/tel-00940511

Articles in International Peer-Reviewed Journals

[12]
F. Pottier.
Syntactic soundness proof of a type-and-capability system with hidden state, in: Journal of Functional Programming, January 2013, vol. 23, no 1, pp. 38-144. [ DOI : 10.1017/S0956796812000366 ]
http://hal.inria.fr/hal-00877589
[13]
J. 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, no 1, pp. 1–54.
http://hal.inria.fr/hal-00772757

International Conferences with Proceedings

[14]
T. Balabonski.
Weak Optimality, and the Meaning of Sharing, in: International Conference on Functional Programming (ICFP), Boston, United States, September 2013, pp. 263-274. [ DOI : 10.1145/2500365.2500606 ]
http://hal.inria.fr/hal-00907056
[15]
S. Boldo, J.-H. Jourdan, X. Leroy, G. Melquiond.
A Formally-Verified C Compiler Supporting Floating-Point Arithmetic, in: Arith - 21st IEEE Symposium on Computer Arithmetic, Austin, United States, A. Nannarelli, P.-M. Seidel, P. T. P. Tang (editors), IEEE, 2013, pp. 107-115.
http://hal.inria.fr/hal-00743090
[16]
T. Braibant, A. Chlipala.
Formal Verification of Hardware Synthesis, in: Computer Aided Verification - 25th International Conference, Saint Petersburg, Russian Federation, N. Sharygina, H. Veith (editors), Lecture notes in computer science, Springer, 2013, vol. 8044, pp. 213-228. [ DOI : 10.1007/978-3-642-39799-8_14 ]
http://hal.inria.fr/hal-00776876
[17]
T. Braibant, J.-H. Jourdan, D. Monniaux.
Implementing hash-consed structures in Coq, in: Interactive Theorem Proving, 4th international conference, Rennes, France, S. Blazy, C. Paulin-Mohring, D. Pichardie (editors), Lecture notes in computer science, Springer, July 2013, vol. 7998, pp. 477-483. [ DOI : 10.1007/978-3-642-39634-2_36 ]
http://hal.inria.fr/hal-00816672
[18]
D. Delahaye, D. Doligez, F. Gilbert, P. Halmagrand, O. Hermant.
Proof Certification in Zenon Modulo: When Achilles Uses Deduction Modulo to Outrun the Tortoise with Shorter Steps, in: IWIL - 10th International Workshop on the Implementation of Logics - 2013, Stellenbosch, South Africa, S. Schulz, G. Sutcliffe, B. Konev (editors), EasyChair, December 2013.
http://hal.inria.fr/hal-00909688
[19]
D. Delahaye, D. Doligez, F. Gilbert, P. Halmagrand, O. Hermant.
Zenon Modulo: When Achilles Outruns the Tortoise using Deduction Modulo, in: LPAR - Logic for Programming Artificial Intelligence and Reasoning - 2013, Stellenbosch, South Africa, K. McMillan, A. Middeldorp, A. Voronkov (editors), LNCS, Springer, December 2013, vol. 8312, pp. 274-290. [ DOI : 10.1007/978-3-642-45221-5_20 ]
http://hal.inria.fr/hal-00909784
[20]
J. Garrigue, D. Rémy.
Ambivalent Types for Principal Type Inference with GADTs, in: APLAS 2013 - 11th Asian Symposium on Programming Languages and Systems, Melbourne, Australia, Chung-Chieh. Shan (editor), Lecture Notes in Computer Science, December 2013, vol. 8301, pp. 257-272. [ DOI : 10.1007/978-3-319-03542-0_19 ]
http://hal.inria.fr/hal-00914560
[21]
F. Pottier, J. Protzenko.
Programming with permissions in Mezzo, in: ICFP - The 18th ACM SIGPLAN International Conference on Functional Programming - 2013, Boston, United States, September 2013, pp. 173-184. [ DOI : 10.1145/2500365.2500598 ]
http://hal.inria.fr/hal-00877590
[22]
G. Scherer, J. Hoffmann.
Tracking Data-Flow with Open Closure Types, in: LPAR- 19th International Conference Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa, K. McMillan, A. Middeldorp, A. Voronkov (editors), Lecture Notes in Computer Science, Springer Verlag, October 2013, vol. 8312, pp. 710-726.
http://hal.inria.fr/hal-00911656
[23]
G. Scherer, D. Rémy.
GADTs meet subtyping, in: ESOP 2013 - 22nd European Symposium on Programming, Rome, Italy, M. Felleisen, P. Gardner (editors), Lecture Notes in Computer Science, Springer, January 2013, vol. 7792, pp. 554-573. [ DOI : 10.1007/978-3-642-37036-6 ]
http://hal.inria.fr/hal-00772993

Scientific Books (or Scientific Book chapters)

[24]
X. Leroy, A. W. Appel, S. Blazy, G. Stewart.
The CompCert memory model, in: Program Logics for Certified Compilers, A. W. Appel (editor), Cambridge University Press, April 2014.
http://hal.inria.fr/hal-00905435

Internal Reports

[25]
U. Acar, A. Charguéraud, S. Muller, M. Rainey.
Atomic Read-Modify-Write Operations are Unnecessary for Shared-Memory Work Stealing, September 2013.
http://hal.inria.fr/hal-00910130
[26]
J. Cretin, D. Rémy.
System F with Coercion Constraints, Inria, January 2014, no RR-8456, 36 p.
http://hal.inria.fr/hal-00934408
[27]
X. Leroy, D. Doligez, A. Frisch, J. Garrigue, D. Rémy, J. Vouillon.
The OCaml system release 4.01: Documentation and user's manual, September 2013.
http://hal.inria.fr/hal-00930213
[28]
G. Scherer, J. Hoffmann.
Tracking Data-Flow with Open Closure Types, Inria, August 2013, no RR-8345, 24 p.
http://hal.inria.fr/hal-00851658

Other Publications

[29]
S. Boldo, J.-H. Jourdan, X. Leroy, G. Melquiond.
A Formally-Verified C Compiler Supporting Floating-Point Arithmetic, 2013.
http://hal.inria.fr/hal-00862689
[30]
T. Braibant, J.-H. Jourdan, D. Monniaux.
Implementing and reasoning about hash-consed data structures in Coq, November 2013.
http://hal.inria.fr/hal-00881085
[31]
P.-E. Dagand, C. Mcbride.
Transporting Functions across Ornaments, December 2013, Under submission to "Journal of Functional Programming".
http://hal.inria.fr/hal-00922581
[32]
J. Garrigue, D. Rémy.
Ambivalent Types for Principal Type Inference with GADTs (extended version), 2013.
http://hal.inria.fr/hal-00914493
[33]
A. Guéneau, F. Pottier, J. Protzenko.
The ins and outs of iteration in Mezzo, 2013.
http://hal.inria.fr/hal-00912381
[34]
J. Protzenko.
Illustrating the Mezzo programming language, 2013.
http://hal.inria.fr/hal-00910402
References in notes
[35]
V. Benzaken, G. Castagna, A. Frisch.
CDuce: an XML-centric general-purpose language, in: Int. Conf. on Functional programming (ICFP'03), ACM Press, 2003, pp. 51–63.
[36]
S. Blazy, V. Laporte, A. Maroneze, D. Pichardie.
Formal Verification of a C Value Analysis Based on Abstract Interpretation, in: Static Analysis - 20th International Symposium, SAS 2013, Lecture Notes in Computer Science, Springer, 2013, vol. 7935, pp. 324-344.
[37]
P. Brauner, C. Houtmann, C. Kirchner.
Principles of Superdeduction, in: 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), IEEE Computer Society Press, 2007, pp. 41-50.
http://hal.inria.fr/inria-00133557
[38]
D. 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, pp. 147-154.
http://dx.doi.org/10.1007/978-3-642-32759-9_14
[39]
A. Frisch.
OCaml + XDuce, in: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming, ACM Press, September 2006, pp. 192–200.
http://doi.acm.org/10.1145/1159803.1159829
[40]
T. Granlund, P. L. Montgomery.
Division by Invariant Integers using Multiplication, in: Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation (PLDI), ACM, 1994, pp. 61-72.
[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, pp. 117–148.
[42]
C. B. Jay, D. Kesner.
First-class patterns, in: J. Functional Programming, 2009, vol. 19, no 2, pp. 191-225.
[43]
L. Lamport.
How to write a 21st century proof, in: Journal of Fixed Point Theory and Applications, 2012, vol. 11, pp. 43-63.
http://dx.doi.org/10.1007/s11784-012-0071-6
[44]
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, pp. 27–38.
http://gallium.inria.fr/~remy/work/mlf/icfp.pdf
[45]
X. Leroy.
Java bytecode verification: algorithms and formalizations, in: Journal of Automated Reasoning, 2003, vol. 30, no 3–4, pp. 235–269.
http://gallium.inria.fr/~xleroy/publi/bytecode-verification-JAR.pdf
[46]
S. Mador-Haim, L. Maranget, S. Sarkar, K. Memarian, J. Alglave, S. Owens, R. Alur, M. Martin, P. Sewell, D. Williams.
An Axiomatic Memory Model for Power Multiprocessors, in: Computer Aided Verification - 24th International Conference, CAV 2012, Lecture Notes in Computer Science, Springer, 2012, vol. 7358, pp. 495-512.
[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, pp. 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, pp. 117–158.
http://gallium.inria.fr/~fpottier/publis/fpottier-simonet-toplas.ps.gz
[50]
S. Rideau, X. Leroy.
Validating register allocation and spilling, in: Compiler Construction (CC 2010), Lecture Notes in Computer Science, Springer, 2010, vol. 6011, pp. 224–243.
http://dx.doi.org/10.1007/978-3-642-11970-5_13
[51]
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.
[52]
S. Sarkar, P. Sewell, J. Alglave, L. Maranget, D. Williams.
Understanding Power multiprocessors, in: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2011, ACM, 2011, pp. 175-186.