Bibliography

Major publications by the team in recent years

1J. Alglave, L. Maranget, M. Tautschnig.

Herding cats: modelling, simulation, testing, and data-mining for weak memory, in: ACM Transactions on Programming Languages and Systems, 2014, vol. 36, n^o 2.

http://dx.doi.org/10.1145/2627752
2T. Balabonski, F. Pottier, J. Protzenko.

The design and formalization of Mezzo, a permission-based programming language, in: ACM Transactions on Programming Languages and Systems, 2016, vol. 38, n^o 4, pp. 14:1–14:94.

http://doi.acm.org/10.1145/2837022
3K. 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
4J. Cretin, D. Rémy.

System F with Coercion Constraints, in: CSL-LICS 2014: Computer Science Logic / Logic In Computer Science, ACM, 2014.

http://dx.doi.org/10.1145/2603088.2603128
5A. Guéneau, J.-H. Jourdan, A. Charguéraud, F. Pottier.

Formal Proof and Analysis of an Incremental Cycle Detection Algorithm, in: Interactive Theorem Proving, J. Harrison, J. O'Leary, A. Tolmach (editors), Leibniz International Proceedings in Informatics, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, September 2019, vol. 141.

https://hal.inria.fr/hal-02167236
6J.-H. Jourdan, V. Laporte, S. Blazy, X. Leroy, D. Pichardie.

A Formally-Verified C Static Analyzer, in: POPL'15: 42nd ACM Symposium on Principles of Programming Languages, ACM Press, January 2015, pp. 247-259.

http://dx.doi.org/10.1145/2676726.2676966
7X. Leroy.

A formally verified compiler back-end, in: Journal of Automated Reasoning, 2009, vol. 43, n^o 4, pp. 363–446.

http://dx.doi.org/10.1007/s10817-009-9155-4
8X. Leroy.

Formal verification of a realistic compiler, in: Communications of the ACM, 2009, vol. 52, n^o 7, pp. 107–115.

http://doi.acm.org/10.1145/1538788.1538814
9G. Mével, J.-H. Jourdan, F. Pottier.

Time Credits and Time Receipts in Iris, in: European Symposium on Programming, Lecture Notes in Computer Science, Springer, April 2019, vol. 11423, pp. 3-29. [ DOI : 10.1007/978-3-030-17184-1_1 ]

https://hal.archives-ouvertes.fr/hal-02183311
10N. Pouillard, F. Pottier.

A unified treatment of syntax with binders, in: Journal of Functional Programming, 2012, vol. 22, n^o 4–5, pp. 614–704.

http://dx.doi.org/10.1017/S0956796812000251

Publications of the year

Doctoral Dissertations and Habilitation Theses

11A. Guéneau.

Mechanized Verification of the Correctness and Asymptotic Complexity of Programs, Université de Paris, December 2019.

https://hal.inria.fr/tel-02437532

Articles in International Peer-Reviewed Journals

12A. Charguéraud, F. Pottier.

Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits, in: Journal of Automated Reasoning, March 2019, vol. 62, n^o 3, pp. 331–365. [ DOI : 10.1007/s10817-017-9431-7 ]

https://hal.inria.fr/hal-01652785
13P. E. de Vilhena, F. Pottier, J.-H. Jourdan.

Spy Game: Verifying a Local Generic Solver in Iris, in: Proceedings of the ACM on Programming Languages, January 2020, n^o 4. [ DOI : 10.1145/3371101 ]

https://hal.archives-ouvertes.fr/hal-02351562

Invited Conferences

14X. Leroy.

In Search of Software Perfection : An introduction to deductive software verification, in: BOB Summer 2019 Konferenz, Berlin, Germany, August 2019.

https://hal.inria.fr/hal-02392114

International Conferences with Proceedings

15A. Guéneau, J.-H. Jourdan, A. Charguéraud, F. Pottier.

Formal Proof and Analysis of an Incremental Cycle Detection Algorithm : (extended version), in: Interactive Theorem Proving, Portland, United States, J. Harrison, J. O'Leary, A. Tolmach (editors), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, September 2019, n^o 141.

https://hal.inria.fr/hal-02167236
16G. Mével, J.-H. Jourdan, F. Pottier.

Time Credits and Time Receipts in Iris, in: European Symposium on Programming, Prague, Czech Republic, Lecture Notes in Computer Science, Springer, April 2019, vol. 11423, pp. 3-29. [ DOI : 10.1007/978-3-030-17184-1_1 ]

https://hal.archives-ouvertes.fr/hal-02183311

Scientific Books (or Scientific Book chapters)

17S. Kremer, L. Mé, D. Rémy, V. Roca.

Cybersecurity : Current challenges and Inria's research directions, Inria white book, Inria, January 2019, n^o 3, 172 p.

https://hal.inria.fr/hal-01993308
18S. Kremer, L. Mé, D. Rémy, V. Roca.

Cybersécurité : Défis actuels et axes de recherche à l'Inria, Inria white book, Inria, May 2019, n^o 3, 18 p.

https://hal.inria.fr/hal-02414281
19X. Leroy.

Le logiciel, entre l'esprit et la matière, Leçons inaugurales du Collège de France, Fayard, April 2019, vol. 284.

https://hal.inria.fr/hal-02370113
20X. Leroy.

Le logiciel, entre l’esprit et la matière : Leçon inaugurale prononcée au Collège de France le jeudi 15 novembre 2018, OpenEdition Books, December 2019.

https://hal.inria.fr/hal-02405754
21X. Leroy.

Software, between mind and matter, Inaugural lecture at Collège de France, Collège de France, November 2019.

https://hal.inria.fr/hal-02392159

Internal Reports

22X. Leroy, D. Doligez, A. Frisch, J. Garrigue, D. Rémy, J. Vouillon.

The OCaml system release 4.09: Documentation and user's manual, Inria, September 2019, pp. 1-789.

https://hal.inria.fr/hal-00930213
23X. Leroy.

The CompCert C verified compiler: Documentation and user’s manual : Version 3.6, Inria, September 2019, pp. 1-78.

https://hal.inria.fr/hal-01091802

Other Publications

24C. Morel.

Type inference and modular elaboration with constraints for ML extended with type abbreviations, Université Paris Diderot-Paris 7, September 2019.

https://hal.inria.fr/hal-02361707

References in notes

25L. 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

Previous |

Home