Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
New Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

[1]
D. Rouhling.
Formalisation Tools for Classical Analysis − A Case Study in Control Theory, Université Côte d'Azur, September 2019.
https://hal.inria.fr/tel-02333396

Articles in International Peer-Reviewed Journals

[2]
F. Guidi, C. Sacerdoti Coen, E. Tassi.
Implementing Type Theory in Higher Order Constraint Logic Programming, in: Mathematical Structures in Computer Science, March 2019, vol. 29, no 8, pp. 1125-1150.
https://hal.inria.fr/hal-01410567

International Conferences with Proceedings

[3]
J. B. Almeida, M. Barbosa, G. Barthe, M. Campagna, E. Cohen, B. Grégoire, V. Pereira, B. Portela, P.-Y. Strub, S. Tasiran.
A Machine-Checked Proof of Security for AWS Key Management Service, in: ACM CCS 2019 - 26th ACM Conference on Computer and Communications Security, London, United Kingdom, ACM Press, November 2019, vol. 16, pp. 63-78. [ DOI : 10.1145/3319535.3354228 ]
https://hal.archives-ouvertes.fr/hal-02404540
[4]
J. B. Almeida, C. Baritel-Ruet, M. Barbosa, G. Barthe, F. Dupressoir, B. Grégoire, V. Laporte, T. Oliveira, A. Stoughton, P.-Y. Strub.
Machine-Checked Proofs for Cryptographic Standards: Indifferentiability of Sponge and Secure High-Assurance Implementations of SHA-3, in: CCS 2019 - 26th ACM Conference on Computer and Communications Security, London, United Kingdom, ACM Press, November 2019, pp. 1607-1622. [ DOI : 10.1145/3319535.3363211 ]
https://hal.archives-ouvertes.fr/hal-02404581
[5]
G. Barthe, S. Belaïd, G. Cassiers, P.-A. Fouque, B. Grégoire, F.-X. Standaert.
Automated Verification of Higher-Order Masking in Presence of Physical Defaults, in: ESORICS 2019 - 24th European Symposium on Research in Computer Security, Luxembourg, Luxembourg, September 2019, pp. 300-318. [ DOI : 10.1007/978-3-030-29959-0_15 ]
https://hal.archives-ouvertes.fr/hal-02404662
[6]
G. Barthe, B. Grégoire, C. Jacomme, S. Kremer, P.-Y. Strub.
Symbolic Methods in Computational Cryptography Proofs, in: CSF2019 - 32nd IEEE Computer Security Foundations Symposium, Hoboken, United States, IEEE, June 2019, pp. 136-13615. [ DOI : 10.1109/CSF.2019.00017 ]
https://hal.archives-ouvertes.fr/hal-02404701
[7]
S. Cauligi, G. Soeller, B. Johannesmeyer, F. Brown, R. S. Wahby, J. Renner, B. Grégoire, G. Barthe, R. Jhala, D. Stefan.
FaCT: A DSL for Timing-Sensitive Computation, in: PLDI 2019 - 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Phoenix, United States, June 2019. [ DOI : 10.1145/3314221.3314605 ]
https://hal.archives-ouvertes.fr/hal-02404755
[8]
R. Chen, C. Cohen, J.-J. Levy, S. Merz, L. Théry.
Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle, in: ITP 2019 - 10th International Conference on Interactive Theorem Proving, Portland, United States, J. Harrison, J. O'Leary, A. Tolmach (editors), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2019, vol. 141, pp. 13:1 - 13:19. [ DOI : 10.4230/LIPIcs.ITP.2019.13 ]
https://hal.inria.fr/hal-02303987
[9]
F. Steinberg, H. Thies, L. Théry.
Quantitative continuity and Computable Analysis in Coq, in: ITP 2019 - Tenth International Conference on Interactive Theorem Proving, Portland, United States, 2019, The version accepted to the conference can be accessed at https://drops.dagstuhl.de/opus/volltexte/2019/11083/. [ DOI : 10.4230/LIPIcs.ITP.2019.28 ]
https://hal.archives-ouvertes.fr/hal-02426470
[10]
E. Tassi.
Deriving proved equality tests in Coq-elpi: Stronger induction principles for containers in Coq, in: ITP 2019 - 10th International Conference on Interactive Theorem Proving, Portland, United States, September 2019. [ DOI : 10.4230/LIPIcs.CVIT.2016.23 ]
https://hal.inria.fr/hal-01897468

Conferences without Proceedings

[11]
C. Doczkal, D. Pous.
Completeness of an Axiomatization of Graph Isomorphism via Graph Rewriting in Coq, in: CPP 2020 - 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, New Orleans, LA, United States, Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’20), January 2020. [ DOI : 10.1145/3372885.3373831 ]
https://hal.archives-ouvertes.fr/hal-02333553

Other Publications

[12]
B. M. Kapron, F. Steinberg.
Type-two polynomial-time and restricted lookahead, February 2019, https://arxiv.org/abs/1801.07485 - working paper or preprint.
https://hal.inria.fr/hal-02018934
[13]
F. Steinberg, L. Théry, H. Thies.
Quantitative continuity and computable analysis in Coq, April 2019, working paper or preprint.
https://hal.inria.fr/hal-02088293
References in notes
[14]
R. Affeldt, C. Cohen, D. Rouhling.
Formalization Techniques for Asymptotic Reasoning in Classical Analysis, in: Journal of Formalized Reasoning, October 2018.
https://hal.inria.fr/hal-01719918
[15]
C. Doczkal, D. Pous.
Graph Theory in Coq: Minors, Treewidth, and Isomorphisms, May 2019, working paper or preprint.
https://hal.archives-ouvertes.fr/hal-02127698
[16]
M. M. Joldes, J.-M. Muller, V. Popescu.
Tight and rigourous error bounds for basic building blocks of double-word arithmetic, in: ACM Transactions on Mathematical Software, 2017, vol. 44, no 2, pp. 1 - 27. [ DOI : 10.1145/3121432 ]
https://hal.archives-ouvertes.fr/hal-01351529
[17]
N. Tabareau, É. Tanter, M. Sozeau.
Equivalences for Free, in: Proceedings of the ACM on Programming Languages, September 2018, vol. 2, no ICFP, pp. 1-29. [ DOI : 10.1145/3234615 ]
https://hal.inria.fr/hal-01559073