Bibliography

Major publications by the team in recent years

[1]

S. Boldo, J.-C. Filliâtre.
Formal Verification of Floating-Point Programs, in: 18th IEEE International Symposium on Computer Arithmetic, Montpellier, France, June 2007, p. 187-194
http://www.lri.fr/~filliatr/ftp/publis/caduceus-floats.pdf.

[2]

J.-L. Colaço, B. Pagano, M. Pouzet.
A Conservative Extension of Synchronous Data-flow with State Machines, in: ACM International Conference on Embedded Software (EMSOFT'05), Jersey city, New Jersey, USA, September 2005.

[3]

É. Contejean, P. Courtieu, J. Forest, O. Pons, X. Urbain.
Certification of automated termination proofs, in: 6th International Symposium on Frontiers of Combining Systems (FroCos 07), Liverpool,UK, B. Konev, F. Wolter (editors), Lecture Notes in Artificial Intelligence, Springer, September 2007, vol. 4720, p. 148–162.

[4]

É. Contejean, C. Marché, A. P. Tomás, X. Urbain.
Mechanically proving termination using polynomial interpretations, in: Journal of Automated Reasoning, 2005, vol. 34, n^o 4, p. 325–363
http://dx.doi.org/10.1007/s10817-005-9022-x.

[5]

J.-C. Filliâtre.
Verification of Non-Functional Programs using Interpretations in Type Theory, in: Journal of Functional Programming, July 2003, vol. 13, n^o 4, p. 709–745
http://www.lri.fr/~filliatr/ftp/publis/jphd.pdf.

[6]

J.-C. Filliâtre, P. Letouzey.
Functors for Proofs and Programs, in: Proceedings of The European Symposium on Programming, Barcelona, Spain, Lecture Notes in Computer Science, April 2004, vol. 2986, p. 370–384
http://www.lri.fr/~filliatr/ftp/publis/fpp.pdf.

[7]

J.-C. Filliâtre, C. Marché.
Multi-Prover Verification of C Programs, in: 6th International Conference on Formal Engineering Methods, Seattle, WA, USA, J. Davies, W. Schulte, M. Barnett (editors), Lecture Notes in Computer Science, Springer, November 2004, vol. 3308, p. 15–29
http://www.lri.fr/~filliatr/ftp/publis/caduceus.ps.gz.

[8]

T. Hubert, C. Marché.
A case study of C source code verification: the Schorr-Waite algorithm, in: 3rd IEEE International Conference on Software Engineering and Formal Methods (SEFM'05), Koblenz, Germany, B. K. Aichernig, B. Beckert (editors), IEEE Comp. Soc. Press, September 2005
http://www.lri.fr/~marche/hubert05sefm.ps.

[9]

S. Krstić, S. Conchon.
Canonization for disjoint unions of theories, in: Information and Computation, May 2005, vol. 199, n^o 1-2, p. 87–106.

[10]

C. Marché, C. Paulin-Mohring, X. Urbain.
The Krakatoa Tool for Certification of Java/JavaCard Programs annotated in JML , in: Journal of Logic and Algebraic Programming, 2004, vol. 58, n^o 1–2, p. 89–106
http://krakatoa.lri.fr.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[11]

Y. Moy.
Automatic Modular Static Safety Checking for C Programs, Université Paris-Sud, January 2009
http://www.lri.fr/~marche/moy09phd.pdf, Ph. D. Thesis.

Articles in International Peer-Reviewed Journal

[12]

P. Audebaud, C. Paulin-Mohring.
Proofs of Randomized Algorithms in Coq, in: Science of Computer Programming, 2009, vol. 74, n^o 8, p. 568–589
http://hal.inria.fr/inria-00431771/.

[13]

S. Boldo.
Kahan's algorithm for a correct discriminant computation at last formally proven, in: IEEE Transactions on Computers, February 2009, vol. 58, n^o 2, p. 220-225
http://hal.inria.fr/inria-00171497/.

[14]

S. Boldo, M. Daumas, R.-C. Li.
Formally Verified Argument Reduction with a Fused-Multiply-Add, in: IEEE Transactions on Computers, 2009, vol. 58, n^o 8, p. 1139-1145
http://arxiv.org/abs/0708.3722.

[15]

M. Daumas, G. Melquiond.
Certification of bounds on expressions involving rounded operators, in: Transactions on Mathematical Software, 2009, vol. 37, n^o 1.

[16]

S. M. Rump, P. Zimmermann, S. Boldo, G. Melquiond.
Computing predecessor and successor in rounding to nearest, in: BIT, June 2009, vol. 49, n^o 2, p. 419–431
http://hal.inria.fr/inria-00337537/.

Invited Conferences

[17]

J.-C. Filliâtre.
Invited tutorial: Why — an intermediate language for deductive program verification, in: Automated Formal Methods (AFM09), Grenoble, France, H. Saïdi, N. Shankar (editors), 2009.

International Peer-Reviewed Conference/Proceedings

[18]

R. Bardou, J.-C. Filliâtre, J. Kanig, S. Lescuyer.
Faire bonne figure avec Mlpost, in: Vingtièmes Journées Francophones des Langages Applicatifs, Saint-Quentin sur Isère, INRIA, January 2009
http://www.lri.fr/~filliatr/ftp/publis/mlpost-fra.pdf.

[19]

S. Boldo.
Floats & Ropes: a case study for formal numerical program verification, in: 36th International Colloquium on Automata, Languages and Programming, Rhodos, Greece, Lecture Notes in Computer Science - ARCoSS, Springer, July 2009, vol. 5556, p. 91–102.

[20]

S. Boldo, J.-C. Filliâtre, G. Melquiond.
Combining Coq and Gappa for Certifying Floating-Point Programs, in: 16th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning, Grand Bend, Canada, Lecture Notes in Artificial Intelligence, Springer, July 2009, vol. 5625, p. 59–74.

[21]

P. Caspi, J.-L. Colaço, L. Gérard, M. Pouzet, P. Raymond.
Synchronous Objects with Scheduling Policies: Introducing safe shared memory in Lustre, in: ACM International Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES), Dublin, June 2009.

[22]

A. Cohen, L. Mandel, F. Plateau, M. Pouzet.
Relaxing Synchronous Composition with Clock Abstraction, in: Hardware Design using Functional languages (HFL 09), York, UK, march 2009, p. 35-52.

[23]

W. Edmonson, G. Melquiond.
IEEE interval standard working group - P1788: current status, in: Proceedings of the 19th IEEE Symposium on Computer Arithmetic, Portland, OR, USA, J. D. Bruguera, M. Cornea, D. DasSarma, J. Harrison (editors), 2009, p. 231–234.

[24]

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.lri.fr/~bobot/publis/Hurlin_Bobot_Summers_iwaco09.pdf.

[25]

J. Kanig, J.-C. Filliâtre.
Who: A Verifier for Effectful Higher-order Programs, in: ACM SIGPLAN Workshop on ML, Edinburgh, Scotland, UK, August 2009
http://www.lri.fr/~filliatr/ftp/publis/wml09.pdf.

[26]

S. Lescuyer, S. Conchon.
Improving Coq Propositional Reasoning using a Lazy CNF Conversion Scheme, in: Frontiers of Combining Systems, 7th International Symposium, Proceedings, Trento, Italy, S. Ghilardi, R. Sebastiani (editors), Lecture Notes in Computer Science, Springer, September 2009, vol. 5749, p. 287-303.

[27]

L. Mandel, F. Plateau.
Abstraction d'horloges dans les systèmes synchrones flot de données, in: Vingtièmes Journées Francophones des Langages Applicatifs, Saint-Quentin sur Isère, INRIA, January 2009
http://www.lri.fr/~plateau/papers/jfla09.pdf.

[28]

M. Pouzet, P. Raymond.
Modular Static Scheduling of Synchronous Data-flow Networks: An efficient symbolic representation, in: ACM International Conference on Embedded Software (EMSOFT'09), Grenoble, France, October 2009.

Scientific Books (or Scientific Book chapters)

[29]

J.-M. Muller, N. Brisebarre, F. de Dinechin, C.-P. Jeannerod, V. Lefèvre, G. Melquiond, N. Revol, D. Stehlé, S. Torres.
Handbook of Floating-Point Arithmetic, Birkhäuser, 2009.

[30]

C. Paulin-Mohring.
A constructive denotational semantics for Kahn networks in Coq, in: From Semantics to Computer Science: Essays in Honor of Gilles Kahn, Y. Bertot, G. Huet, J.-J. Lévy, G. Plotkin (editors), Cambridge University Press, 2009
http://hal.inria.fr/inria-00431806/.

Internal Reports

[31]

A. Ayad.
On formal methods for certifying floating-point C programs, INRIA, 2009, n^o RR-6927
http://hal.inria.fr/inria-00383793/, Research Report.

[32]

P. Baudin, J.-C. Filliâtre, C. Marché, B. Monate, Y. Moy, V. Prevosto.
ACSL: ANSI/ISO C Specification Language, version 1.4, 2009
http://frama-c.cea.fr/acsl.html.

[33]

Y. Moy, C. Marché.
Jessie Plugin Tutorial, Beryllium version, INRIA, 2009
http://www.frama-c.cea.fr/jessie.html.

[34]

A. Paskevich.
Algebraic types and pattern matching in the logical language of the Why verification platform, INRIA, 2009, n^o RR-7128
http://hal.inria.fr/inria-00439232/, Technical report.

[35]

E. Tushkanova, A. Giorgetti, C. Marché, O. Kouchnarenko.
Modular Specification of Java Programs, INRIA, 2009, n^o RR-7097
http://hal.inria.fr/inria-00434452/en/, Technical report.

Scientific Popularization

[36]

S. Boldo.
Demandez le programme!, February 2009
http://interstices.info/demandez-le-programme, Interstices.

Other Publications

[37]

A. Ayad, C. Marché.
Behavioral Properties of Floating-Point Programs, 2009
http://hisseo.saclay.inria.fr/ayad09.pdf, Hisseo publications.

[38]

R. Bardou, C. Marché.
Regions and Permissions for Data Invariants, 2009
http://www.lri.fr/cepromi/.

[39]

M. Iguernelala.
Extension modulo Associativité-Commutativité de l'algorithme de clôture par congruence CC(X), Université Paris-Sud, 2009, Masters thesis.

[40]

C. Marché.
The Krakatoa tool for Deductive Verification of Java Programs, January 2009
http://krakatoa.lri.fr/ws/, Winter School on Object-Oriented Verification, Viinistu, Estonia.

[41]

A. Milchior.
Algorithme de matching, modulo égalité, incrémental, typé et persistant, 2009.

[42]

A. Tafat, S. Boulmé, C. Marché.
A Refinement Methodology for Object-Oriented Programs, 2009
http://www.lri.fr/cepromi/.

[43]

A. Tafat.
Invariants et raffinements en présence de partage, Université Paris 6, 2009
http://www.lri.fr/~marche/tafat09master.pdf, Masters thesis.

[44]

W. Urribarrí, C. Paulin-Mohring.
Modules and Refinement in Why, October 2009
http://www.lri.fr/cepromi/.

References in notes

[45]

The MAUDE System.

[46]

J. Andronick, B. Chetali, C. Paulin-Mohring.
Formal Verification of Security Properties of Smart Card Embedded Source Code, in: International Symposium of Formal Methods Europe (FM'05), Newcastle,UK, J. Fitzgerald, I. J. Hayes, A. Tarlecki (editors), Lecture Notes in Computer Science, Springer, July 2005, vol. 3582
http://jandronick.free.fr/publi/FM2005.pdf.

[47]

T. Arts, J. Giesl.
Termination of term rewriting using dependency pairs, in: Theoretical Computer Science, 2000, vol. 236, p. 133–178.

[48]

A. Banerjee, D. A. Naumann, S. Rosenberg.
Regional Logic for Local Reasoning about Global Invariants, in: European Conference on Object-Oriented Programming (ECOOP), Paphos, Cyprus, July 2008.

[49]

M. Barnett, R. DeLine, M. Fähndrich, K. R. M. Leino, W. Schulte.
Verification of object-oriented programs with invariants, in: Journal of Object Technology, June 2004, vol. 3, n^o 6, p. 27–56.

[50]

B. Barras.
Verification of the Interface of a Small Proof System in Coq, in: Types for Proofs and Programs, International Workshop TYPES'96, Aussois, France, December 15-19, 1996, Selected Papers, E. Giménez, C. Paulin-Mohring (editors), Lecture Notes in Computer Science, Springer, 1998, vol. 1512, p. 28-45.

[51]

A. Benveniste, P. Caspi, S. A. Edwards, N. Halbwachs, P. Le Guernic, R. de Simone.
The synchronous languages 12 years later, in: Proceedings of the IEEE, January 2003, vol. 91, n^o 1.

[52]

G. Berry, G. Gonthier.
The Esterel synchronous programming language, design, semantics, implementation, in: Science of Computer Programming, 1992, vol. 19, n^o 2, p. 87-152.

[53]

Y. Bertot, N. Magaud, P. Zimmermann.
A Proof of GMP Square Root, in: Journal of Automated Reasoning, 2002, vol. 29, n^o 3-4, p. 225–252.

[54]

D. Biernacki, J.-L. Colaço, G. Hamon, M. Pouzet.
Clock-directed Modular Code Generation of Synchronous Data-flow Languages, in: ACM International Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES), Tucson, Arizona, June 2008.

[55]

D. Biernacki, J.-L. Colaço, M. Pouzet.
Clock-directed Modular Code Generation from Synchronous Block Diagrams, in: Workshop on Automatic Program Generation for Embedded Systems (APGES 2007), Salzburg, Austria, October 2007
http://www-fp.dcs.st-and.ac.uk/APGES/OnlineProceedings/11-Pouzet.pdf.

[56]

F. Bobot, S. Conchon, É. Contejean, S. Lescuyer.
Implementing Polymorphism in SMT solvers, in: SMT 2008: 6th International Workshop on Satisfiability Modulo, C. Barrett, L. de Moura (editors), ACM International Conference Proceedings Series, 2008, vol. 367, p. 1–5
http://www.lri.fr/~conchon/publis/conchon-smt08.pdf.

[57]

S. Boldo.
Pitfalls of a full floating-point proof: example on the formal proof of the Veltkamp/Dekker algorithms, in: Third International Joint Conference on Automated Reasoning, Seattle, USA, U. Furbach, N. Shankar (editors), Lecture Notes in Computer Science, Springer, August 2006, vol. 4130, p. 52-66
http://www.lri.fr/~sboldo/files/ijcar06.pdf.

[58]

S. Boulmé, M.-L. Potet.
Interpreting invariant composition in the B method using the Spec# ownership relation: a way to explain and relax B restrictions, in: B 2007, J. Julliand, O. Kouchnarenko (editors), Lecture Notes in Computer Science, Springer, 2007, vol. 4355
"http://www-lsr.imag.fr/Les.Personnes/Marie-Laure.Potet/PUBLI/B07boulmePotet.pdf.

[59]

P. Caspi, M. Pouzet.
Synchronous Kahn Networks, in: ACM SIGPLAN International Conference on Functional Programming, Philadelphia, Pensylvania, May 1996
http://www.lri.fr/~pouzet/bib/icfp96.ps.gz.

[60]

P. Caspi, M. Pouzet.
A Co-iterative Characterization of Synchronous Stream Functions, in: Coalgebraic Methods in Computer Science (CMCS'98), Electronic Notes in Theoretical Computer Science, March 1998.

[61]

R. Cavada, A. Cimatti, A. Franzen, K. Kalyanasundaram, M. Roveri, R. Shyamasundar.
Computing Predicate Abstractions by Integrating BDDs and SMT Solvers, in: Formal Methods in Computer Aided Design, 2007, p. 69-76.

[62]

V. Chaudhary.
The Krakatoa tool for certification of Java/JavaCard programs annotated in JML : A Case Study, IIT internship report, July 2004, Technical report.

[63]

A. Cimatti, A. Franzen, A. Griggio, K. Kalyanasundaram, M. Roveri.
Tighter Intergration of BDDs and SMT for Predicate Abstraction, in: Design, Automation & Test in Europe, Dresden. Germany, IEEE, March 2010.

[64]

D. G. Clarke, J. M. Potter, J. Noble.
Ownership Types for Flexible Alias Protection, in: Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA'98), ACM Press, 1998, p. 48–64.

[65]

A. Cohen, M. Duranton, C. Eisenbeis, C. Pagetti, F. Plateau, M. Pouzet.
Synchronizing Periodic Clocks, in: ACM International Conference on Embedded Software (EMSOFT'05), Jersey city, New Jersey, USA, September 2005.

[66]

A. Cohen, M. Duranton, C. Eisenbeis, C. Pagetti, F. Plateau, M. Pouzet.
N-Synchronous Kahn Networks: a Relaxed Model of Synchrony for Real-Time Systems, in: ACM International Conference on Principles of Programming Languages (POPL'06), Charleston, South Carolina, USA, January 2006.

[67]

A. Cohen, L. Mandel, F. Plateau, M. Pouzet.
Abstraction of Clocks in Synchronous Data-flow Systems, in: The Sixth ASIAN Symposium on Programming Languages and Systems (APLAS), Bangalore, India, December 2008
http://www.lri.fr/~plateau/papers/aplas08.pdf.

[68]

J.-L. Colaço, G. Hamon, M. Pouzet.
Mixing Signals and Modes in Synchronous Data-flow Systems, in: ACM International Conference on Embedded Software (EMSOFT'06), Seoul, South Korea, October 2006.

[69]

J.-L. Colaço, M. Pouzet.
Clocks as First Class Abstract Types, in: Third International Conference on Embedded Software (EMSOFT'03), Philadelphia, Pennsylvania, USA, October 2003.

[70]

J.-L. Colaço, M. Pouzet.
Type-based Initialization Analysis of a Synchronous Data-flow Language, in: International Journal on Software Tools for Technology Transfer (STTT), August 2004, vol. 6, n^o 3, p. 245–255.

[71]

S. Conchon, É. Contejean, J. Kanig, S. Lescuyer.
CC(X): Semantical Combination of Congruence Closure with Solvable Theories, in: Proceedings of the 5th International Workshop on Satisfiability Modulo Theories (SMT 2007), Electronic Notes in Computer Science, Elsevier Science Publishers, 2008, vol. 198-2, p. 51–69.

[72]

S. Conchon, J.-C. Filliâtre.
A Persistent Union-Find Data Structure, in: ACM SIGPLAN Workshop on ML, Freiburg, Germany, ACM, October 2007, p. 37–45
http://www.lri.fr/~filliatr/ftp/publis/puf-wml07.pdf.

[73]

S. Conchon, J.-C. Filliâtre.
Union-Find Persistant, in: Dix-huitièmes Journées Francophones des Langages Applicatifs, INRIA, January 2007, p. 135–149
http://www.lri.fr/~filliatr/ftp/publis/puf.pdf.

[74]

S. Conchon, J.-C. Filliâtre.
Semi-Persistent Data Structures, in: 17th European Symposium on Programming (ESOP'08), Budapest, Hungary, April 2008
http://www.lri.fr/~filliatr/ftp/publis/spds-rr.pdf.

[75]

S. Conchon, J.-C. Filliâtre, F. Le Fessant, J. Robert, G. Von Tokarski.
Observation temps-réel de programmes Caml, in: Vingt-et-unièmes Journées Francophones des Langages Applicatifs, Vieux-Port La Ciotat, France, INRIA, January 2010.

[76]

S. Conchon, S. Krstić.
Strategies for Combining Decision Procedures, in: Theoretical Computer Science, 2006, vol. 354, n^o 2, p. 187–210.

[77]

É. Contejean, P. Corbineau.
Reflecting Proofs in First-Order Logic with Equality, in: 20th International Conference on Automated Deduction (CADE-20), Tallinn, Estonia, R. Nieuwenhuis (editor), Lecture Notes in Artificial Intelligence, Springer, July 2005, vol. 3632, p. 7–22.

[78]

É. Contejean, P. Courtieu, J. Forest, A. Paskevich, O. Pons, X. Urbain.
A3PAT, an Approach for Certified Automated Termination Proofs, in: Partial Evaluation and Program Manipulation, Madrid, Spain, ACM Press, january 2010.

[79]

É. Contejean, P. Courtieu, J. Forest, O. Pons, X. Urbain.
Certification of automated termination proofs, in: 6th International Symposium on Frontiers of Combining Systems (FroCos 07), Liverpool,UK, B. Konev, F. Wolter (editors), Lecture Notes in Artificial Intelligence, Springer, September 2007, vol. 4720, p. 148–162.

[80]

É. Contejean, P. Courtieu, J. Forest, O. Pons, X. Urbain.
Certification of automated termination proofs, CEDRIC, May 2007, n^o 1185, Technical report.

[81]

P. Courtieu, J. Forest, X. Urbain.
Certifying a Termination Criterion Based on Graphs, Without Graphs, in: 21th International Conference on Theorem Proving in Higher Order Logics, S. Tahar, O. Ait-Mohamed, C. Muñoz (editors), Lecture Notes in Computer Science, Springer, August 2008, p. 183–198.

[82]

P. Courtieu, G. Gbedo, O. Pons.
Improved matrix interpretations, in: Proceedings of SOFSEM2010, International Conference on Current Trends in Theory and Practice of Computer Science, Lecture Notes in Computer Science, Springer, January 2010.

[83]

K. Crary, D. Walker, G. Morrisett.
Typed Memory Management in a Calculus of Capabilities, in: ACM Symposium on Principles of Programming Languages (POPL), ACM Press, 1999, p. 262–275.

[84]

F. Durán, S. Lucas, J. Meseguer, C. Marché, X. Urbain.
Proving Termination of Membership Equational Programs, in: ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation, Verona, Italy, ACM Press, August 2004.

[85]

J.-C. Filliâtre.
Formal Proof of a Program: Find, in: Science of Computer Programming, 2006, vol. 64, p. 332–240
http://www.lri.fr/~filliatr/ftp/publis/find.pdf.

[86]

J.-C. Filliâtre, S. Owre, H. Rueß, N. Shankar.
ICS: Integrated Canonization and Solving (Tool presentation), in: Proceedings of CAV'2001, G. Berry, H. Comon, A. Finkel (editors), Lecture Notes in Computer Science, Springer, 2001, vol. 2102, p. 246–249.

[87]

B. Gramlich.
On Proving Termination by Innermost Termination, in: 7th International Conference on Rewriting Techniques and Applications, New Brunswick, NJ, USA, H. Ganzinger (editor), Lecture Notes in Computer Science, Springer, July 1996, vol. 1103, p. 93–107.

[88]

N. Halbwachs, P. Caspi, P. Raymond, D. Pilaud.
The Synchronous Dataflow Programming Language Lustre , in: Proceedings of the IEEE, September 1991, vol. 79, n^o 9, p. 1305-1320.

[89]

B. Jacobs, C. Marché, N. Rauch.
Formal Verification of a Commercial Smart Card Applet with Multiple Tools, in: Algebraic Methodology and Software Technology, Stirling, UK, Lecture Notes in Computer Science, Springer, July 2004, vol. 3116.

[90]

Y. Koda, F. Ruskey.
A Gray Code for the Ideals of a Forest Poset, in: Journal of Algorithms, 1993, n^o 15, p. 324–340.

[91]

X. Leroy.
Formal certification of a compiler back-end, or: programming a compiler with a proof assistant, in: Conference Record of the 33rd Symposium on Principles of Programming Languages, Charleston, South Carolina, ACM Press, January 2006.

[92]

S. Lescuyer.
Codage de la logique du premier ordre polymorphe multi-sortée dans la logique sans sortes, Master Parisien de Recherche en Informatique, 2006, Masters thesis.

[93]

P. Letouzey.
A New Extraction for Coq, in: TYPES 2002, H. Geuvers, F. Wiedijk (editors), Lecture Notes in Computer Science, Springer, 2003, vol. 2646
http://www.lri.fr/~letouzey/download/NewExtraction.ps.gz.

[94]

P. Letouzey.
Programmation fonctionnelle certifiée: l'extraction de programmes dans l'assistant Coq, Université Paris-Sud, July 2004
http://www.lri.fr/~letouzey/download/these_letouzey.ps.gz, Thèse de Doctorat.

[95]

L. Mandel, M. Pouzet.
ReactiveML, a Reactive Extension to ML, in: ACM International Conference on Principles and Practice of Declarative Programming (PPDP), Lisboa, July 2005, p. 82–93
http://www.lri.fr/~mandel/papers/MandelPouzet-PPDP-2005.pdf.

[96]

C. Marché, N. Rousset.
Verification of Java Card Applets Behavior with respect to Transactions and Card Tears, in: 4th IEEE International Conference on Software Engineering and Formal Methods (SEFM'06), Pune, India, D. V. Hung, P. Pandya (editors), IEEE Comp. Soc. Press, September 2006
http://www.lri.fr/~marche/marche06sefm.ps.

[97]

C. Marché, X. Urbain.
Modular and Incremental Proofs of AC-Termination, in: Journal of Symbolic Computation, 2004, vol. 38, p. 873–897
http://authors.elsevier.com/sd/article/S074771710400029X.

[98]

C. Marché.
Preuves mécanisées de Propriétés de Programmes, Université Paris 11, December 2005, Thèse d'habilitation.

[99]

G. Melquiond.
Floating-point arithmetic in the Coq system, in: Proceedings of the 8th Conference on Real Numbers and Computers, Santiago de Compostela, Spain, 2008, p. 93–102
http://gappa.gforge.inria.fr/.

[100]

G. Melquiond.
Proving bounds on real-valued functions with computations, in: Proceedings of the 4th International Joint Conference on Automated Reasoning, Sydney, Australia, A. Armando, P. Baumgartner, G. Dowek (editors), Lecture Notes in Artificial Intelligence, 2008, vol. 5195, p. 2–17
http://www.lri.fr/~melquion/soft/coq-interval/.

[101]

E. Ohlebusch, C. Claves, C. Marché.
TALP: A Tool for the Termination Analysis of Logic Programs, in: 11th International Conference on Rewriting Techniques and Applications, Norwich, UK, L. Bachmair (editor), Lecture Notes in Computer Science, Springer, July 2000, vol. 1833, p. 270–273
http://bibiserv.techfak.uni-bielefeld.de/talp/.

[102]

C. Paulin-Mohring.
A library for reasoning on randomized algorithms in Coq - Version 2, Université Paris Sud, December 2007
http://www.lri.fr/~paulin/ALEA/library.pdf, Description of a Coq contribution.

[103]

S. Ranise, C. Tinelli.
The Satisfiability Modulo Theories Library (SMT-LIB), 2006
http://www.smtcomp.org.

[104]

M. Sozeau, N. Oury.
First-Class Type Classes, in: 21th International Conference on Theorem Proving in Higher Order Logics, S. Tahar, O. Ait-Mohamed, C. Muñoz (editors), Lecture Notes in Computer Science, Springer, August 2008
http://www.lri.fr/~sozeau/research/publications/First-Class_Type_Classes.pdf.

[105]

M. Sozeau.
Subset coercions in Coq, in: TYPES 2006, T. Altenkirch, C. M. Bride (editors), Lecture Notes in Computer Science, Springer, 2007, vol. 4502, p. 237–252
http://www.lri.fr/~sozeau/research/publications/Subset_Coercions_in_Coq.pdf.

[106]

D. Stevenson.
A proposed standard for binary floating point arithmetic, in: IEEE Computer, 1981, vol. 14, n^o 3, p. 51-62.

[107]

J.-P. Talpin, P. Jouvelot.
Polymorphic Type, Region and Effect Inference, in: Journal of Functional Programming, 1992, vol. 2, n^o 3, p. 245-271.

[108]

L. Théry.
Proving Pearl: Knuth's algorithm for prime numbers, in: Proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003), D. Basin, B. Wolff (editors), LNCS, Springer-Verlag, 2003, vol. 2758.

[109]

M. Tofte, J.-P. Talpin.
Region-based memory management, in: Information and Computation, 1997, vol. 132, n^o 2, p. 109–176.

[110]

X. Urbain.
Approche incrémentale des preuves automatiques de terminaison, Université Paris-Sud, Orsay, France, October 2001
http://www.lri.fr/~urbain/textes/these.ps.gz, Thèse de Doctorat.

[111]

J. Vuillemin.
On Circuits and Numbers, Digital, Paris Research Laboratory, 1993, Technical report.