Personnel
Overall Objectives
New Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Major publications by the team in recent years
[1]
G. Barthe, D. Demange, D. Pichardie.
Formal Verification of an SSA-based Middle-end for CompCert, in: ACM Transactions on Programming Languages and Systems (TOPLAS), 2014, 35 p.
https://hal.inria.fr/hal-01097677
[2]
F. Besson, N. Bielova, T. Jensen.
Hybrid Information Flow Monitoring Against Web Tracking, in: CSF - 2013 IEEE 26th Computer Security Foundations Symposium, New Orleans, United States, 2013. [ DOI : 10.1109/CSF.2013.23 ]
http://hal.inria.fr/hal-00924138
[3]
F. Besson, T. Jensen, D. Pichardie.
Proof-Carrying Code from Certified Abstract Interpretation to Fixpoint Compression, in: Theoretical Computer Science, 2006, vol. 364, no 3, pp. 273–291.
[4]
M. Bodin, A. Charguéraud, D. Filaretti, P. Gardner, S. Maffeis, D. Naudziuniene, A. Schmitt, G. Smith.
A Trusted Mechanised JavaScript Specification, in: POPL 2014 - 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, United States, November 2013.
http://hal.inria.fr/hal-00910135
[5]
B. Boyer, T. Genet, T. Jensen.
Certifying a Tree Automata Completion Checker, in: 4th International Joint Conference, IJCAR 2008, Lectures Notes in Computer Science, Springer-Verlag, 2008, vol. 5195, pp. 347–362.
[6]
D. Cachera, T. Jensen, A. Jobin, F. Kirchner.
Inference of polynomial invariants for imperative programs: a farewell to Gröbner bases, in: Science of Computer Programming, 2014, vol. 93, 21 p. [ DOI : 10.1016/j.scico.2014.02.028 ]
https://hal.inria.fr/hal-00932351
[7]
D. Cachera, T. Jensen, D. Pichardie, V. Rusu.
Extracting a Data Flow Analyser in Constructive Logic, in: Theoretical Computer Science, 2005, vol. 342, no 1, pp. 56–78.
[8]
D. Demange, V. Laporte, L. Zhao, D. Pichardie, S. Jagannathan, J. Vitek.
Plan B: A Buffered Memory Model for Java, in: Proc. of the 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, Rome, Italy, ACM, 2013.
http://hal.inria.fr/hal-00924716
[9]
T. Genet, V. Rusu.
Equational Approximations for Tree Automata Completion, in: Journal of Symbolic Computation, 2010, vol. 45(5):574-597, May 2010, no 5, pp. 574-597.
[10]
L. Hubert, T. Jensen, V. Monfort, D. Pichardie.
Enforcing Secure Object Initialization in Java, in: 15th European Symposium on Research in Computer Security (ESORICS), Lecture Notes in Computer Science, Springer, 2010, vol. 6345, pp. 101-115.
[11]
J.-H. Jourdan, V. Laporte, S. Blazy, X. Leroy, D. Pichardie.
A formally-verified C static analyzer, in: POPL 2015: 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Mumbai, India, ACM, January 2015, pp. 247-259. [ DOI : 10.1145/2676726.2676966 ]
https://hal.inria.fr/hal-01078386
Publications of the year

Doctoral Dissertations and Habilitation Theses

[12]
O. F. Andreescu.
Static Analysis of Functional Programs with an Application to the Frame Problem in Deductive Verification, Rennes 1, May 2017.
https://hal.inria.fr/tel-01677897
[13]
O. F. Andreescu.
Static analysis of functional programs with an application to the frame problem in deductive verification, Université Rennes 1, May 2017.
https://tel.archives-ouvertes.fr/tel-01682503
[14]
P. Bolignano.
Formal models and verification of memory management in a hypervisor, Université Rennes 1, May 2017.
https://tel.archives-ouvertes.fr/tel-01637937
[15]
D. Bühler.
Structuring an Abstract Interpreter through Value and State Abstractions:EVA, an Evolved Value Analysis for Frama-C, Université de Rennes 1, March 2017.
https://hal.archives-ouvertes.fr/tel-01664726
[16]
Y. Zakowski.
Verification of a Concurrent Garbage Collector, École Normale Supérieur de Rennes, December 2017.
https://hal.inria.fr/tel-01680213

Articles in International Peer-Reviewed Journals

[17]
F. Besson, S. Blazy, P. Wilke.
A Verified CompCert Front-End for a Memory Model Supporting Pointer Arithmetic and Uninitialised Data, in: Journal of Automated Reasoning, 2017, pp. 1-48. [ DOI : 10.1007/s10817-017-9439-z ]
https://hal.inria.fr/hal-01656895
[18]
H. Cirstea, S. Lenglet, P.-E. Moreau.
Faithful (Meta-)Encodings Of Programmable Strategies Into Term Rewriting Systems, in: Logical Methods in Computer Science, November 2017, vol. 13, no 4, pp. 1-54, Long version of the corresponding RTA-TLCA 15 paper. [ DOI : 10.23638/LMCS-13(4:16)2017 ]
https://hal.inria.fr/hal-01479030
[19]
T. Genet, Y. Salmon.
Reachability Analysis of Innermost Rewriting - extended version, in: Logical Methods in Computer Science, 2017.
https://hal.inria.fr/hal-01532090
[20]
F. Honsell, L. Liquori, P. Maksimovic, I. Scagnetto.
LLFP : A Logical Framework for modeling External Evidence, Side Conditions, and Proof Irrelevance using Monads, in: Logical Methods in Computer Science, February 2017, https://arxiv.org/abs/1702.07214.
https://hal.inria.fr/hal-01146059

Invited Conferences

[21]
T. Jensen.
Formal methods for software security (invited talk), in: FMF 2017 - Forum "Méthodes Formelles", Toulouse, France, January 2017, pp. 1-61.
https://hal.inria.fr/hal-01658549
[22]
T. Jensen.
Formal methods for software security (invited talk), in: Journées Nationales 2017 Pré-GDR Sécurité Informatique, Paris, France, June 2017, pp. 1-31.
https://hal.inria.fr/hal-01658835
[23]
T. Jensen.
Hybrid information flow analysis against web tracking (invited talk), in: CRiSIS 2017 - 12th International Conference on Risks and Security of Internet and Systems, Dinard, France, September 2017, pp. 1-33.
https://hal.inria.fr/hal-01658896

International Conferences with Proceedings

[24]
G. Barthe, S. Blazy, V. Laporte, D. Pichardie, A. Trieu.
Verified Translation Validation of Static Analyses, in: Computer Security Foundations Symposium, Santa-Barbara, United States, 30th IEEE Computer Security Foundations Symposium, August 2017.
https://hal.inria.fr/hal-01588422
[25]
F. Besson, S. Blazy, P. Wilke.
CompCertS: A Memory-Aware Verified C Compiler using Pointer as Integer Semantics, in: ITP 2017 - 8th International Conference on Interactive Theorem Proving, Brasilia, Brazil, ITP 2017: Interactive Theorem Proving, Springer, September 2017, vol. 10499, pp. 81-97. [ DOI : 10.1007/978-3-319-66107-0_6 ]
https://hal.inria.fr/hal-01656875
[26]
M. Biernacka, D. Biernacki, S. Lenglet, P. Polesiuk, D. Pous, A. Schmitt.
Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines, in: LICS 2017, Reykjavik, Iceland, Proceedings of LICS 2017, June 2017, To appear.
https://hal.inria.fr/hal-01479035
[27]
S. Blazy, D. Pichardie, A. Trieu.
Verifying Constant-Time Implementations by Abstract Interpretation, in: European Symposium on Research in Computer Security, Oslo, Norway, 22nd European Symposium on Research in Computer Security, September 2017.
https://hal.inria.fr/hal-01588444
[28]
D. Kästner, J. Barrho, U. Wünsche, M. Schlickling, B. Schommer, M. Schmidt, C. Ferdinand, X. Leroy, S. Blazy.
CompCert: Practical Experience on Integrating and Qualifying a Formally Verified Optimizing Compiler, in: ERTS2 2018 - Embedded Real Time Software and Systems, Toulouse, France, 3AF, SEE, SIE, January 2018.
https://hal.inria.fr/hal-01643290
[29]
D. Kästner, X. Leroy, S. Blazy, B. Schommer, M. Schmidt, C. Ferdinand.
Closing the Gap – The Formally Verified Optimizing Compiler CompCert, in: SSS'17: Safety-critical Systems Symposium 2017, Bristol, United Kingdom, Developments in System Safety Engineering: Proceedings of the Twenty-fifth Safety-critical Systems Symposium, CreateSpace, February 2017, pp. 163-180.
https://hal.inria.fr/hal-01399482
[30]
S. Lenglet, A. Schmitt.
HOπ in Coq, in: CPP 2018 - The 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, Los Angeles, United States, January 2018, 14 p. [ DOI : 10.1145/3167083 ]
https://hal.inria.fr/hal-01614987
[31]
M. Leslous, V. Viet Triem Tong, J.-F. Lalande, T. Genet.
GPFinder: Tracking the Invisible in Android Malware, in: 12th International Conference on Malicious and Unwanted Software, Fajardo, Puerto Rico, IEEE Conputer Society, October 2017.
https://hal-centralesupelec.archives-ouvertes.fr/hal-01584989
[32]
Y. Zakowski, D. Cachera, D. Demange, G. Petri, D. Pichardie, S. Jagannathan, J. Vitek.
Verifying a Concurrent Garbage Collector using a Rely-Guarantee Methodology, in: ITP 2017 - 8th International Conference on Interactive Theorem Proving, Brasília, Brazil, Lecture Notes in Computer Science, Springer, September 2017, vol. 10499, pp. 496-513. [ DOI : 10.1007/978-3-319-66107-0_31 ]
https://hal.inria.fr/hal-01613389
[33]
Y. Zakowski, D. Cachera, D. Demange, D. Pichardie.
Verified Compilation of Linearizable Data Structures: Mechanizing Rely Guarantee for Semantic Refinement, in: SAC 2018 - The 33rd ACM/SIGAPP Symposium On Applied Computing, Pau, France, April 2018, pp. 1-10.
https://hal.archives-ouvertes.fr/hal-01653620

National Conferences with Proceedings

[34]
G. Cabon, A. Schmitt.
Non-Interference through Annotated Multisemantics, in: 28ièmes Journées Francophones des Langages Applicatifs, Gourette, France, January 2017.
https://hal.archives-ouvertes.fr/hal-01503094

Conferences without Proceedings

[35]
G. Cabon, A. Schmitt.
Annotated multisemantics to prove Non-Interference analyses, in: PLAS 2017 - ACM SIGSAC Workshop on Programming Languages and Analysis for Security, Dallas, United States, PLAS '17 Proceedings of the 2017 Workshop on Programming Languages and Analysis for Security, ACM, October 2017, pp. 49-62. [ DOI : 10.1145/3139337.3139344 ]
https://hal.archives-ouvertes.fr/hal-01656404
[36]
F. Saudel, S. Blazy, F. Besson.
Confusion de Type en C++: État de l'Art et Difficultés de Détection, in: RESSI 2017 - Rendez-vous de la Recherche et de l'Enseignement de la Sécurité des Systèmes d'Information, Grenoble/Autrans, France, May 2017, pp. 1-5.
https://hal.inria.fr/hal-01656979

Internal Reports

[37]
M. Biernacka, D. Biernacki, S. Lenglet, P. Polesiuk, D. Pous, A. Schmitt.
Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines, Inria, April 2017, no RR-9052.
https://hal.inria.fr/hal-01507625
[38]
T. Genet.
A Short Isabelle/HOL Tutorial for the Functional Programmer, IRISA, 2017.
https://hal.inria.fr/hal-01208577
[39]
T. Genet.
Automata Completion and Regularity Preservation, IRISA, Inria Rennes, April 2017.
https://hal.archives-ouvertes.fr/hal-01501744
[40]
T. Genet, T. HAUDEBOURG, T. Jensen.
Verifying Higher-Order Functions with Tree Automata: Extended Version, Irisa, October 2017, pp. 1-20.
https://hal.inria.fr/hal-01614380
[41]
Y. Zakowski, D. Cachera, D. Demange, D. Pichardie.
Compilation of Linearizable Data Structures: A Mechanised RG Logic for Semantic Refinement, ENS Rennes ; IRISA, Inria Rennes ; Université Rennes 1, June 2017.
https://hal.archives-ouvertes.fr/hal-01538128

Other Publications

[42]
T. Genet.
SPAN+AVISPA for Verifying Cryptographic Protocols, 2017, This is a video tutorial to learn how to use SPAN+AVISPA to automatically check security properties on cryptographic protocols.
https://hal.inria.fr/hal-01532086