Bibliography

Major publications by the team in recent years

1G. 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
2F. 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
3F. Besson, T. Jensen, D. Pichardie.

Proof-Carrying Code from Certified Abstract Interpretation to Fixpoint Compression, in: Theoretical Computer Science, 2006, vol. 364, n^o 3, pp. 273–291.
4M. 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
5B. 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.
6D. Cachera, T. Jensen, A. Jobin, F. Kirchner.

Inference of polynomial invariants for imperative programs: a farewell to Grö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
7D. Cachera, T. Jensen, D. Pichardie, V. Rusu.

Extracting a Data Flow Analyser in Constructive Logic, in: Theoretical Computer Science, 2005, vol. 342, n^o 1, pp. 56–78.
8D. 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
9T. Genet, V. Rusu.

Equational Approximations for Tree Automata Completion, in: Journal of Symbolic Computation, 2010, vol. 45(5):574-597, May 2010, n^o 5, pp. 574-597.
10L. 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.
11J.-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

Articles in International Peer-Reviewed Journals

12A. Azevedo De Amorim, N. Collins, A. DeHon, D. Demange, C. Hriţcu, D. Pichardie, B. C. Pierce, R. Pollack, A. Tolmach.

A Verified Information-Flow Architecture, in: Journal of Computer Security (JCS); Special Issue on Verified Information Flow Security, December 2016, vol. 24, n^o 6, pp. 689–734.

https://hal.archives-ouvertes.fr/hal-01424797
13N. Bielova, F. Besson, T. Jensen.

Using JavaScript Monitoring to Prevent Device Fingerprinting, in: ERCIM News, July 2016.

https://hal.inria.fr/hal-01353997
14S. Blazy, D. Bühler, B. Yakobowski.

Improving static analyses of C programs with conditional predicates, in: Science of Computer Programming, March 2016, vol. 118, Extended version of the FMICS 2014 paper. [ DOI : 10.1145/2854065.2854082 ]

https://hal.inria.fr/hal-01242077
15S. Blazy, V. Laporte, D. Pichardie.

Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code, in: Journal of Automated Reasoning, 2016, vol. 56, n^o 3, 26 p, Version étendue de l'article de la conférence ITP 2014. [ DOI : 10.1007/s10817-015-9359-8 ]

https://hal.inria.fr/hal-01243700
16T. Genet.

Termination criteria for tree automata completion, in: Journal of Logic and Algebraic Methods in Programming, 2016, vol. 85, Issue 1, part 1, pp. 3-33. [ DOI : 10.1016/j.jlamp.2015.05.003 ]

https://hal.inria.fr/hal-01194533
17F. 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 2016.

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

International Conferences with Proceedings

18F. Besson, N. Bielova, T. Jensen.

Hybrid Monitoring of Attacker Knowledge, in: 29th IEEE Computer Security Foundations Symposium, Lisboa, Portugal, 2016.

https://hal.inria.fr/hal-01310572
19S. Blazy, V. Laporte, D. Pichardie.

An Abstract Memory Functor for Verified C Static Analyzers, in: ACM SIGPLAN International Conference on Functional Programming (ICFP 2016), Nara, Japan, ACM, September 2016, 14 p. [ DOI : 10.1145/2951913.2951937 ]

https://hal.inria.fr/hal-01339969
20S. Blazy, A. Trieu.

Formal Verification of Control-flow Graph Flattening, in: Certified Proofs and Programs (CPP 2016), Saint-Petersburg, United States, ACM (editor), Certified Proofs and Programs (CPP 2016), January 2016, 12 p, forthcoming. [ DOI : 10.1145/2854065.2854082 ]

https://hal.inria.fr/hal-01242063
21M. Bodin, T. Jensen, A. Schmitt.

An Abstract Separation Logic for Interlinked Extensible Records, in: Vingt-septièmes Journées Francophones des Langages Applicatifs (JFLA 2016), Saint-Malo, France, J. Signoles (editor), January 2016.

https://hal.archives-ouvertes.fr/hal-01333600
22P. Bolignano, T. Jensen, V. Siles.

Modeling and Abstraction of Memory Management in a Hypervisor, in: Fundamental Approaches to Software Engineering (FASE’16), Eindhoven, Netherlands, Proc. of Fundamental Approaches to Software Engineering (FASE’16), Springer, April 2016, vol. 9633, pp. 214 - 230. [ DOI : 10.1007/978-3-662-49665-7_13 ]

https://hal.inria.fr/hal-01394174
23G. Cabon, D. Cachera, D. Pichardie.

An Extended Buffered Memory Model With Full Reorderings, in: FtFjp - Ecoop workshop, Rome, Italy, July 2016, pp. 1 - 6. [ DOI : 10.1145/2955811.2955816 ]

https://hal.inria.fr/hal-01379514
24D. Demange, Y. Fernandez De Retana.

Mechanizing conventional SSA for a verified destruction with coalescing, in: 25th International Conference on Compiler Construction, Barcelona, Spain, March 2016.

https://hal.archives-ouvertes.fr/hal-01378393
25C. Fournet, C. Keller, V. Laporte.

A Certified Compiler for Verifiable Computing, in: IEEE 29th Computer Security Foundations Symposium, CSF 2016, Lisbonne, Portugal, June 2016.

https://hal.inria.fr/hal-01397680
26D. 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, Proceedings of the Twenty-fifth Safety-Critical Systems Symposium, February 2017.

https://hal.inria.fr/hal-01399482
27A. Oana, T. Jensen, S. Lescuyer.

Correlating Structured Inputs and Outputs in Functional Specifications, in: Software Engineering and Formal Methods, Vienna, Austria, 14th Int. Software Engineering and Formal Methods conference, Springer, July 2016, vol. 9763, 19 p. [ DOI : 10.1007/978-3-319-41591-8_7 ]

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

Conferences without Proceedings

28X. Leroy, S. Blazy, D. Kästner, B. Schommer, M. Pister, C. Ferdinand.

CompCert - A Formally Verified Optimizing Compiler, in: ERTS 2016: Embedded Real Time Software and Systems, 8th European Congress, Toulouse, France, SEE, January 2016.

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

Books or Proceedings Editing

29S. Blazy, M. Chéchia (editors)

Verified Software: Theories, Tools, and Experiments - 8th International Conference, VSTTE 2016, Toronto, Canada, July 17-18, 2016. Proceedings, Lecture Notes in Computer Science, Springer, Toronto, Canada, 2016, vol. 9971.

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

References in notes

30G. 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
31S. Blazy, D. Demange, D. Pichardie.

Validating Dominator Trees for a Fast, Verified Dominance Test, in: Proc. of the 6th International Conference on Interactive Theorem Proving (ITP 2015), LNCS, Springer, 2015.
32M. Bodin, T. Jensen, A. Schmitt.

Certified Abstract Interpretation with Pretty-Big-Step Semantics, in: Certified Programs and Proofs (CPP 2015), Mumbai, India, Proceedings of the 2015 Conference on Certified Programs and Proofs, January 2015. [ DOI : 10.1145/2676724.2693174 ]

https://hal.inria.fr/hal-01111588
33B. Boissinot, A. Darte, F. Rastello, B. Dupont de Dinechin, C. Guillon.

Revisiting Out-of-SSA Translation for Correctness, Code Quality and Efficiency, in: Proc. of CGO'09, IEEE Computer Society, 2009, pp. 114–125.
34G. Boudol, G. Petri, B. P. Serpette.

Relaxed Operational Semantics of Concurrent Programming Languages, in: EXPRESS/SOS, 2012, vol. 89, pp. 19-33.
35D. 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
36D. Demange, L. Stefanesco, D. Pichardie.

Verifying Fast and Sparse SSA-based Optimizations in Coq, in: Proc. of CC'15, LNCS, 2015, vol. 9031, pp. 233-252.
37J.-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
38J. A. Kroll, G. Stewart, A. W. Appel.

Portable Software Fault Isolation, in: CSF 2014, IEEE, 2014, pp. 18–32.

http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6954678
39P. Wilke.

Formally verified compilation of low-level C code, University of Rennes 1, 2016.

Previous |

Home