Bibliography

Major publications by the team in recent years

1F. Blanqui.

Definitions by rewriting in the Calculus of Constructions, in: Mathematical Structures in Computer Science, 2005, vol. 15, n^o 1, pp. 37-92. [ DOI : 10.1017/S0960129504004426 ]

http://hal.inria.fr/inria-00105648/en/
2F. Blanqui, A. Koprowski.

CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates, in: Mathematical Structures in Computer Science, 2011, vol. 21, n^o 4, pp. 827-859.

http://hal.inria.fr/inria-00543157/en/
3M. Boespflug.

Conception d'un noyau de vérification de preuves pour le lambda-Pi-calcul modulo, École Polytechnique, 2011.
4G. Burel.

Experimenting with Deduction Modulo, in: CADE 2011, V. Sofronie-Stokkermans, N. Bjørner (editors), Lecture Notes in Artificial Intelligence, Springer, 2011, vol. 6803, pp. 162–176.
5D. Delahaye, M. Jacquel.

Recovering Intuition from Automated Formal Proofs using Tableaux with Superdeduction, in: Electronic Journal of Mathematics and Technology (eJMT), February 2013, vol. 7, n^o 2.
6G. Dowek.

Polarized Resolution Modulo, in: IFIP Theoretical Computer Science, 2010.
7G. Dowek, T. Hardin, C. Kirchner.

Theorem proving modulo, in: Journal of Automated Reasoning, 2003, vol. 31, pp. 33-73.
8C. Dubois, T. Hardin, V. Donzeau-Gouge.

Building certified components within FOCAL, in: Revised Selected Papers from the Fifth Symposium on Trends in Functional Programming, TFP 2004, München, Germany, 25-26 November 2004, H.-W. Loidl (editor), Trends in Functional Programming, Intellect, 2006, vol. 5, pp. 33-48.
9O. Hermant.

Resolution is Cut-Free, in: Journal of Automated Reasoning, March 2010, vol. 44, n^o 3, pp. 245-276.
10M. Jacquel, K. Berkani, D. Delahaye, C. Dubois.

Verifying B Proof Rules using Deep Embedding and Automated Theorem Proving, in: Software and Systems Modeling (SoSyM), June 2013, To appear.

Publications of the year

Doctoral Dissertations and Habilitation Theses

11P. Neron.

A Quest for Exactness: Program Transformation for Reliable Real Numbers, Ecole Polytechnique X, October 2013.

http://hal.inria.fr/tel-00924379

Articles in International Peer-Reviewed Journals

12P. Arrighi, G. Dowek.

Causal graph dynamics, in: Information and Computation, 2013, vol. 223, pp. 78-93. [ DOI : 10.1016/j.ic.2012.10.019 ]

http://hal.inria.fr/hal-00944459
13P. Arrighi, G. Dowek.

Lineal: A linear-algebraic lambda-calculus, in: Logical Methods in Computer Science, 2013.

http://hal.inria.fr/hal-00919625
14N. Dershowitz, G. Dowek.

Universality in two dimensions, in: Journal of Logic and Computation, 2013. [ DOI : 10.1093/logcom/ext022 ]

http://hal.inria.fr/hal-00919604
15H. Macedo, J. Oliveira.

Typing linear algebra: A biproduct-oriented approach, in: Science of Computer Programming, 2013, vol. 78, n^o 11, pp. 2160-2191. [ DOI : 10.1016/j.scico.2012.07.012 ]

http://hal.inria.fr/hal-00919866
16P. Neron.

A Formal Proof of Square Root and Division Elimination in Embedded Programs, in: Journal of Formalized Reasoning, December 2013, vol. 6, n^o 1, pp. 89-111.

http://hal.inria.fr/hal-00924367

Invited Conferences

17G. Dowek.

Real numbers, chaos, and the principle of a bounded density of information, in: CSR 2013 - 8th International Computer Science Symposium in Russia, Ekaterinburg, Russian Federation, A. A. Bulatov, A. M. Shur (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 7913, pp. 347-353. [ DOI : 10.1007/978-3-642-38536-0_30 ]

http://hal.inria.fr/hal-00919543

International Conferences with Proceedings

18L. Allali, O. Hermant.

Semantic A-translation and Super-consistency entail Classical Cut Elimination, in: LPAR 19 - 19th Conference on Logic for Programming, Artificial Intelligence, and Reasoning - 2013, Stellenbosch, South Africa, K. McMillan, A. Middeldorp, A. Voronkov (editors), Lecture Notes in Computer Science, Springer, December 2013, vol. 8312, pp. 407-422. [ DOI : 10.1007/978-3-642-45221-5_28 ]

http://hal.inria.fr/hal-00923915
19M. Boudard, O. Hermant.

Polarizing Double Negation Translations, in: LPAR, Stellenbosch, South Africa, K. McMillan, A. Middeldorp, A. Voronkov (editors), LNCS ARCoSS, Springer, 2013, vol. 8312, pp. 182-197.

http://hal.inria.fr/hal-00920224
20G. Burel.

A Shallow Embedding of Resolution and Superposition Proofs into the $λ$ $Π$ -Calculus Modulo, in: PxTP - Third International Workshop on Proof Exchange for Theorem Proving - 2013, Lake Placid, United States, J. C. Blanchette, J. Urban (editors), EasyChair, June 2013, vol. 14, pp. 43-57.

http://hal.inria.fr/hal-00921513
21G. Burel, S. Cruanes.

Detection of First Order Axiomatic Theories, in: FroCoS - 9th International Symposium on Frontiers of Combining Systems - 2013, Nancy, France, P. Fontaine, C. Ringeissen, R. A. Schmidt (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 8152, pp. 229-244. [ DOI : 10.1007/978-3-642-40885-4_16 ]

http://hal.inria.fr/hal-00919759
22D. Delahaye, D. Doligez, F. Gilbert, P. Halmagrand, O. Hermant.

Proof Certiﬁcation in Zenon Modulo: When Achilles Uses Deduction Modulo to Outrun the Tortoise with Shorter Steps, in: IWIL - 10th International Workshop on the Implementation of Logics - 2013, Stellenbosch, South Africa, S. Schulz, G. Sutcliffe, B. Konev (editors), EasyChair, December 2013.

http://hal.inria.fr/hal-00909688
23D. Delahaye, D. Doligez, F. Gilbert, P. Halmagrand, O. Hermant.

Zenon Modulo: When Achilles Outruns the Tortoise using Deduction Modulo, in: LPAR - Logic for Programming Artificial Intelligence and Reasoning - 2013, Stellenbosch, South Africa, K. McMillan, A. Middeldorp, A. Voronkov (editors), LNCS, Springer, December 2013, vol. 8312, pp. 274-290. [ DOI : 10.1007/978-3-642-45221-5_20 ]

http://hal.inria.fr/hal-00909784
24A. Díaz-Caro, G. Dowek.

Non determinism through type isomorphism, in: LSFA - 7th Workshop on Logical and Semantic Frameworks with Applications - 2012, Rio de Janeiro, Brazil, D. Kesner, P. Viana (editors), Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, March 2013, vol. 113, pp. 137-144. [ DOI : 10.4204/EPTCS.113.13 ]

http://hal.inria.fr/hal-00925001
25A. Díaz-Caro, G. Dowek.

The probability of non-confluent systems, in: DCM - 9th International Workshop on Developments in Computational Models - 2013, Buenos Aires, Argentina, M. A. Rincón, E. Bonelli, I. Mackie (editors), 2013, To appear in EPTCS.

http://hal.inria.fr/hal-00919546
26A. Díaz-Caro, G. Manzonetto, M. Pagani.

Call-by-value non-determinism in a linear logic type discipline, in: LFCS - Logical Foundations of Computer Science - 2013, San Diego, CA, United States, S. Artemov, A. Nerode (editors), Lecture Notes in Computer Science, Springer, January 2013, vol. 7734, pp. 164-178. [ DOI : 10.1007/978-3-642-35722-0_12 ]

http://hal.inria.fr/hal-00919463
27T. G. Le, D. Fedosov, O. Hermant, M. Manceny, R. Pawlak, R. Rioboo.

Programming Robots With Events, in: IESS 2013 - 4th IFIP TC 10 International Embedded Systems Symposium, Paderborn, Germany, G. Schirner, M. Götz, A. Rettberg, M. C. Zanella, F. J. Rammig (editors), IFIP Advances in Information and Communication Technology, Springer, 2013, vol. 403, pp. 14-25. [ DOI : 10.1007/978-3-642-38853-8_2 ]

http://hal.inria.fr/hal-00924489
28T. G. Le, O. Hermant, M. Manceny, R. Pawlak, R. Rioboo.

Using Event-Based Style for Developing M2M Applications, in: GPC - 8th International Conference on Grid and Pervasive Computing - 2013, Seoul, Korea, Republic Of, J. Park, H. Arabnia, C. Kim, W. Shi, J.-M. Gil (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 7861, pp. 348-357. [ DOI : 10.1007/978-3-642-38027-3_37 ]

http://hal.inria.fr/hal-00924491
29H. Macedo, T. Touili.

Mining Malware Specifications through Static Reachability Analysis, in: ESORICS - European Symposium on Research in Computer Security, Egham, United Kingdom, J. Crampton, S. Jajodia, K. Mayes (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 8134, pp. 517-535. [ DOI : 10.1007/978-3-642-40203-6_29 ]

http://hal.inria.fr/hal-00919782
30P. Neron.

Square root and division elimination in PVS, in: ITP - 4th Conference on Interactive Theorem Proving, Rennes, France, S. Blazy, C. Paulin-Mohring, D. Pichardie (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 7998, pp. 457-462. [ DOI : 10.1007/978-3-642-39634-2_33 ]

http://hal.inria.fr/hal-00924359
31R. Saillard.

Towards explicit rewrite rules in the $λ$ $Π$ -calculus modulo, in: IWIL - 10th International Workshop on the Implementation of Logics, Stellenbosch, South Africa, December 2013.

http://hal.inria.fr/hal-00921340

Scientific Books (or Scientific Book chapters)

32J. Courant, M. de Falco, S. Gonnord, J.-C. Filliâtre, S. Conchon, G. Dowek, B. Wack.

Informatique pour tous en classes préparatoires aux grandes écoles : Manuel d'algorithmique et programmation structurée avec Python, Eyrolles, 2013, 408 p.

http://hal.inria.fr/hal-00880268

Internal Reports

33A. Rousseau, A. Darnaud, B. Goglin, C. Acharian, C. Leininger, C. Godin, C. Holik, C. Kirchner, D. Rives, E. Darquie, E. Kerrien, F. Neyret, F. Masseglia, F. Dufour, G. Berry, G. Dowek, H. Robak, H. Xypas, I. Illina, I. Gnaedig, J. Jongwane, J. Ehrel, L. Viennot, L. Guion, L. Calderan, L. Kovacic, M. Collin, M.-A. Enard, M.-H. Comte, M. Quinson, M. Olivi, M. Giraud, M. Dorémus, M. Ogouchi, M. Droin, N. Lacaux, N. Rougier, N. Roussel, P. Guitton, P. Peterlongo, R.-M. Cornus, S. Vandermeersch, S. Maheo, S. Lefebvre, S. Boldo, T. Viéville, V. Poirel, A. Chabreuil, A. Fischer, C. Farge, C. Vadel, I. Astic, J.-P. Dumont, L. Féjoz, P. Rambert, P. Paradinas, S. De Quatrebarbes, S. Laurent.

Médiation Scientifique : une facette de nos métiers de la recherche, March 2013, 34 p.

http://hal.inria.fr/hal-00804915

Other Publications

34P. Arrighi, A. Díaz-Caro, B. Valiron.

The Vectorial Lambda-Calculus, 2013, Under review.

http://hal.inria.fr/hal-00921087
35G. Dowek.

On the definition of the classical connectives and quantifiers, December 2013.

http://hal.inria.fr/hal-00919437
36G. Dowek, Y. Jiang.

A Logical Approach to CTL, January 2014.

http://hal.inria.fr/hal-00919467
37G. Dowek, Y. Jiang.

Axiomatizing truth in a finite model, January 2014.

http://hal.inria.fr/hal-00919469
38P. Neron.

Elimination des racines et divisions pour du code embarqué, in: Journées du GDR-GPL, Nancy, France, April 2013, Journées du GDR-GPL.

http://hal.inria.fr/hal-00924394

References in notes

39T. Arts, J. Giesl.

Termination of Term Rewriting Using Dependency Pairs, in: Theoretical Computer Science, 2000, vol. 236, pp. 133-178.
40A. Asperti, W. Ricciotti, C. Sacerdoti Coen, E. Tassi.

A compact kernel for the calculus of inductive constructions, in: Sadhana, 2009, vol. 34, n^o 1, pp. 71-144.

http://dx.doi.org/10.1007/s12046-009-0003-3
41A. Assaf, S. Perdrix.

Completeness of algebraic CPS simulations, in: DCM'11, EPTCS, 2012, vol. 88, pp. 16–27.
42L. Benthem Jutting, J. McKinna, R. Pollack.

Checking algorithms for Pure Type Systems, in: Types for Proofs and Programs, H. Barendregt, T. Nipkow (editors), Lecture Notes in Computer Science, Springer Berlin Heidelberg, 1994, vol. 806, pp. 19-61.
43Y. Bertot, P. Castéran.

Interactive Theorem Proving and Program Development Coq'Art: The Calculus of Inductive Constructions, Springer-Verlag, 2004.
44F. Blanqui.

Terminaison des systèmes de réécriture d'ordre supérieur basée sur la notion de clôture de calculabilité, Université Paris-Diderot - Paris VII, July 2012, HDR.

http://tel.archives-ouvertes.fr/tel-00724233
45F. Blanqui, J.-P. Jouannaud, A. Rubio.

The Computability Path Ordering: the End of a Quest, in: Proceedings of the 22nd International Conference on Computer Science Logic, Lecture Notes in Computer Science 5213, 2008, Invited paper.
46D. Cousineau, G. Dowek.

Embedding Pure Type Systems in the lambda-Pi-calculus modulo, in: Typed lambda calculi and applications, S. Ronchi della Rocca (editor), Lecture Notes in Computer Science, Springer-Verlag, 2007, vol. 4583, pp. 102-117.
47A. Díaz-Caro, S. Perdrix, C. Tasson, B. Valiron.

Equivalence of Algebraic $λ$ -calculi, in: Informal proceedings of HOR-2010, Edinburgh, UK, July 14, 2010, pp. 6–11.
48R. Gandy.

Church's Thesis and Principles for Mechanisms, in: The Kleene Symposium, North-Holland, 1980.
49R. Harper, F. Honsell, G. Plotkin.

A Framework for Defining Logics, in: Journal of the association for computing machinery, 1993, pp. 194–204.
50J. Harrison.

HOL Light: An Overview, in: Theorem Proving in Higher Order Logics, S. Berghofer, T. Nipkow, C. Urban, M. Wenzel (editors), Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2009, vol. 5674, pp. 60-66.

http://dx.doi.org/10.1007/978-3-642-03359-9_4
51J. Hurd.

The OpenTheory Standard Theory Library, in: NASA Formal Methods, M. Bobaru, K. Havelund, G. Holzmann, R. Joshi (editors), Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2011, vol. 6617, pp. 177-191.

http://dx.doi.org/10.1007/978-3-642-20398-5_14
52K. Korovin.

iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description), in: IJCAR, A. Armando, P. Baumgartner (editors), Lecture Notes in Artificial Intelligence, Springer, 2008, vol. 5195, pp. 292-298.
53F. Rabe, M. Kohlhase.

A Scalable Module System, in: Inf. Comput., September 2013, vol. 230, pp. 1–54.

http://dx.doi.org/10.1016/j.ic.2013.06.001

Previous |

Home