Bibliography

Major publications by the team in recent years

[1]

Y. Bertot, P. Castéran.
Interactive Theorem Proving and Program Development, Coq'Art:the Calculus of Inductive Constructions, Springer-Verlag, 2004.

[2]

G. Gonthier, A. Mahboubi, L. Rideau, E. Tassi, L. Théry.
A Modular Formalisation of Finite Group Theory, in: Proceedings of the 20th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2007), K. Schneider, J. Brandt (editors), LNCS, Springer-Verlag, September 2007, vol. 4732, p. 86-101
http://hal.inria.fr/inria-00139131.

[3]

L. Théry.
A Machine-Checked Implementation of Buchberger's Algorithm, in: Journal of Automated Reasoning, 2001, vol. 26, p. 107–137.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[4]

C. Hurlin.
Specification and Verification of Multithreaded Object-Oriented Programs with Separation Logic, Université Nice - Sophia Antipolis, September 2009
http://www-sop.inria.fr/everest/Clement.Hurlin/publis/these.pdf, Ph. D. Thesis.

Articles in International Peer-Reviewed Journal

[5]

C. Haack, C. Hurlin.
Resource Usage Protocols for Iterators, in: Journal of Object Technology, 2009, vol. 8, n^o 4
http://www.jot.fm/issues/issue_2009_06/article3/index.html, This is an extended version of a paper that appeared in the IWACO'08 workshop.

International Peer-Reviewed Conference/Proceedings

[6]

B. Barras, P. Corbineau, B. Grégoire, H. Herbelin, J. L. Sacchini.
A New Elimination Rule for the Calculus of Inductive Constructions, in: Types for proofs and programs 2008, S. Berardi, F. Damiani, U. de'Liguoro (editors), Lecture Notes in Computer Science, Springer, 2009, vol. 5497, p. 32-48.

[7]

G. Barthe, B. Grégoire, S. Heraud, C. Kunz, A. Pacalet.
Implementing a direct method for certificate translation, in: International Conference on Formal Engineering Methods, ICFEM 2009, Lectures Notes in Computer Science, 2009, To appear.

[8]

G. Barthe, B. Grégoire, F. Olmedo, S. Zanella Béguelin.
Formally Certifying the Security of Digital Signature Schemes, in: 30th IEEE Symposium on Security and Privacy, S&P 2009, IEEE, 2009.

[9]

G. Barthe, B. Grégoire, S. Zanella Béguelin.
Formal Certification of Code-Based Cryptographic Proofs, in: 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, ACM, 2009, p. 90–101
http://dx.doi.org/10.1145/1480881.1480894.

[10]

Y. Bertot.
Structural abstract interpretation, A formal study in Coq, in: Language Engineering and Rigorous Software Development, International LerNet ALFA Summer School 2008, revised tutorial lectures, A. Bove, L. S. Barbosa, A. Pardo, J. S. Pinto (editors), Lecture Notes in Computer Science, Springer, 2009, vol. 5520, p. 153-194
http://hal.inria.fr/inria-00329572/.

[11]

Y. Bertot, E. Komendantskaya.
Using Structural Recursion for Corecursion, in: Types for proofs and programs 2008, S. Berardi, F. Damiani, U. de'Liguoro (editors), Lecture Notes in Computer Science, Springer, 2009, vol. 5497, p. 220-236
http://hal.inria.fr/inria-00322331.

[12]

J. O. Blech, B. Grégoire.
Using Checker Predicates in Certifying Code Generation, in: Proceedings of the Workshop Compiler Optimization meets Compiler Verification (COCV 2009), ENTCS, 2009, To appear.

[13]

F. Garillot, G. Gonthier, A. Mahboubi, L. Rideau.
Packaging Mathematical Structures, in: Theorem Proving in Higher Order Logics, Munich Allemagne, T. Nipkow, C. Urban (editors), Lecture Notes in Computer Science, Springer, 2009, vol. 5674
http://hal.inria.fr/inria-00368403/en/, G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE, I.: Computing Methodologies/I.1: SYMBOLIC AND ALGEBRAIC MANIPULATION/I.1.0: General.

[14]

C. Hurlin, F. Bobot, A. J. Summers.
Size Does Matter : Two Certified Abstractions to Disprove Entailment in Intuitionistic and Classical Separation Logic, in: International Workshop on Aliasing, Confinement and Ownership in object-oriented programming (IWACO'09), July 2009
http://www-sop.inria.fr/everest/Clement.Hurlin/publis/iwaco09.pdf, Coq proofs: disprove.tgz.

[15]

C. Hurlin.
Automatic Parallelization and Optimization of Programs by Proof Rewriting (or Automatic Parallelization with Separation Logic!), in: Static Analysis Symposium (SAS'09), Lecture Notes in Computer Science, Springer-Verlag, August 2009, vol. 5673, p. 52–68
http://www-sop.inria.fr/everest/Clement.Hurlin/publis/eterlou.pdf, A longer version appeared as technical report 6806 from INRIA. The implementation is available..

[16]

C. Hurlin.
Specifying and Checking Protocols of Multithreaded Classes, in: ACM Symposium on Applied Computing (SAC'09), ACM, March 2009, p. 587–592
http://www-sop.inria.fr/everest/Clement.Hurlin/publis/sac09.pdf, Additional material (examples, detailed statistics, and implementation) is available: pyrolobus..

[17]

N. Julien, I. Pasca.
Formal Verification of Exact Computations Using Newton's Method, in: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2009), LNCS, Springer, August 2009, vol. 5674, p. 408-423
http://hal.inria.fr/inria-00369511/en/.

[18]

S. Ould Biha.
Finite groups representation theory with Coq, in: Mathematical Knowledge Management, LNAI, Springer, July 2009, vol. 5625, p. 438-452
http://hal.inria.fr/inria-00377431.

Scientific Books (or Scientific Book chapters)

[19]

Y. Bertot.
Theorem proving support in programming language semantics, in: From Semantics to Computer Science, essays in Honour of Gilles Kahn, Y. Bertot, G. Huet, J.-J. Lévy, G. Plotkin (editors), Cambridge University Press, 2009, p. 337–361
http://hal.inria.fr/inria-00160309/.

Books or Proceedings Editing

[20]

Y. Bertot, G. Huet, J.-J. Lévy, G. Plotkin (editors)
From Semantics to Computer Science, essays in Honour of Gilles Kahn, Cambridge University Press, 2009.

Internal Reports

[21]

C. Hurlin.
Automatic Parallelization and Optimization of Programs by Proof Rewriting (or Automatic Parallelization with Separation Logic!), INRIA Sophia-Antipolis – Méditerrannée, June 2009, n^o 6806, Technical report.