Skip to Main content
Number of documents

59

Pascal Fontaine - Publications


Journal articles8 documents

  • Haniel Barbosa, Jasmin Blanchette, Mathias Fleury, Pascal Fontaine. Scalable Fine-Grained Proofs for Formula Processing. Journal of Automated Reasoning, Springer Verlag, 2020, 64 (3), pp.485-510. ⟨10.1007/s10817-018-09502-y⟩. ⟨hal-02515103⟩
  • Paula Chocron, Pascal Fontaine, Christophe Ringeissen. Politeness and Combination Methods for Theories with Bridging Functions. Journal of Automated Reasoning, Springer Verlag, 2020, 64, pp.97-134. ⟨10.1007/s10817-019-09512-4⟩. ⟨hal-01988452⟩
  • Andreas Fellner, Pascal Fontaine, Bruno Woltzenlogel Paleo. NP-completeness of small conflict set generation for congruence closure. Formal Methods in System Design, Springer Verlag, 2017, 51 (3), pp.533 - 544. ⟨10.1007/s10703-017-0283-x⟩. ⟨hal-01908684⟩
  • Thomas Sturm, Erika Abraham, John Abbott, Bern W. Becker, Anna Bigatti, et al.. Satisfiability Checking and Symbolic Computation. ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2016, 50 (4), pp.145-147. ⟨10.1145/3055282.3055285⟩. ⟨hal-01648695⟩
  • Stefano Bosi, Pascal Fontaine, Cuong Le Van. Interest rates parity and no arbitrage as equivalent equilibrium conditions in the international financial assets and goods markets. Mathematical Social Sciences, Elsevier, 2016, 82, pp.26-36. ⟨10.1016/j.mathsocsci.2016.04.002⟩. ⟨hal-01302524⟩
  • David Déharbe, Pascal Fontaine, Laurent Voisin, Yoann Guyot. Integrating SMT solvers in Rodin. Science of Computer Programming, Elsevier, 2014, Abstract State Machines, Alloy, B, VDM, and Z — Selected and extended papers from ABZ 2012, 94, pp.14. ⟨hal-01094999⟩
  • Diego Caminha B. de Oliveira, David Déharbe, Pascal Fontaine. Combining decision procedures by (model-)equality propagation. Science of Computer Programming, Elsevier, 2010, 240 (2 July 2009), pp.113-128. ⟨10.1016/j.entcs.2009.05.048⟩. ⟨inria-00543801⟩
  • Diego Caminha B. de Oliveira, David Déharbe, Pascal Fontaine. Combining Decision Procedures by (Model-)Equality Propagation. Electronic Notes in Theoretical Computer Science, Elsevier, 2009, Proceedings of the Eleventh Brazilian Symposium on Formal Methods (SBMF 2008), 240 (2), pp.113-128. ⟨10.1016/j.entcs.2009.05.048⟩. ⟨inria-00430636⟩

Conference papers40 documents

  • Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, et al.. Politeness for the Theory of Algebraic Datatypes. 10th International Joint Conference on Automated Reasoning, IJCAR, Jul 2020, Paris, France. pp.238--255, ⟨10.1007/978-3-030-51074-9_14⟩. ⟨hal-02962716⟩
  • Haniel Barbosa, Jasmin Blanchette, Mathias Fleury, Pascal Fontaine, Hans-Jörg Schurr. Better SMT Proofs for Easier Reconstruction. AITP 2019 - 4th Conference on Artificial Intelligence and Theorem Proving, Apr 2019, Obergurgl, Austria. ⟨hal-02381819⟩
  • Jasmin Blanchette, Daniel Ouraoui, Pascal Fontaine, Cezary Kaliszyk. Machine Learning for Instance Selection in SMT Solving. AITP 2019 - 4th Conference on Artificial Intelligence and Theorem Proving, Apr 2019, Obergurgl, Austria. ⟨hal-02381430⟩
  • Andrew Reynolds, Haniel Barbosa, Pascal Fontaine. Revisiting Enumerative Instantiation. TACAS 2018 - 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Apr 2018, Thessaloniki, Greece. pp.20. ⟨hal-01877055⟩
  • Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Van Khanh To, Xuan Tung Vu. Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT. SC-square 2018 - Third International Workshop on Satisfiability Checking and Symbolic Computation, Jul 2018, Oxford, United Kingdom. ⟨hal-01946733⟩
  • Haniel Barbosa, Pascal Fontaine, Andrew Reynolds. Congruence Closure with Free Variables. Tools and Algorithms for Construction and Analysis of Systems (TACAS), 2017, Uppsala, Sweden. pp.220 - 230, ⟨10.1007/10721959_17⟩. ⟨hal-01590918⟩
  • Haniel Barbosa, Jasmin Blanchette, Pascal Fontaine. Scalable Fine-Grained Proofs for Formula Processing. Proc. Conference on Automated Deduction (CADE), 2017, Gotenburg, Sweden. pp.398 - 412, ⟨10.1007/978-3-642-02959-2_10⟩. ⟨hal-01590922⟩
  • Jasmin Christian Blanchette, Pascal Fontaine, Stephan Schulz, Uwe Waldmann. Towards Strong Higher-Order Automation for Fast Interactive Verification. ARCADE 2017 - 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, 2017, Göteborg, Sweden. pp.16-7, ⟨10.29007/3ngx⟩. ⟨hal-02359588⟩
  • Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan Vu. Subtropical Satisfiability. FroCoS 2017 - 11th International Symposium on Frontiers of Combining Systems, Sep 2017, Brasilia, Brazil. ⟨10.1007/978-3-319-66167-4⟩. ⟨hal-01590899v2⟩
  • Eriká Abrahám, John Abbott, Bernd Becker, Anna Bigatti, Martin Brain, et al.. SC 2 : Satisfiability Checking meets Symbolic Computation (Project Paper). Intelligent Computer Mathematics, Jul 2016, Bialystok, Poland. ⟨hal-01377655⟩
  • Thomas Sturm, Erika Ábrahám, John Abbott, Bernd Becker, Anna Bigatti, et al.. SC2: Satisfiability Checking Meets Symbolic Computation (Project Paper). Proc. CICM 2016, Jul 2016, Bialystok, Poland. pp.28 - 43, ⟨10.1007/978-3-319-42547-4⟩. ⟨hal-01648696⟩
  • Maximilian Jaroschek, Pablo Federico Dobal, Pascal Fontaine. Adapting Real Quantifier Elimination Methods for Conflict Set Computation. Frontiers of Combining Systems (FroCoS), 2015, Wroclaw, Poland. pp.151-166, ⟨10.1007/978-3-319-24246-0_10⟩. ⟨hal-01240343⟩
  • Haniel Barbosa, Pascal Fontaine. Congruence Closure with Free Variables (Work in Progress). Quantify 2015 : 2nd International Workshop on Quantification, 2015, Berlin, Germany. ⟨hal-01246036⟩
  • Paula Chocron, Pascal Fontaine, Christophe Ringeissen. A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited. 25th International Conference on Automated Deduction, CADE-25, Christoph Benzmueller, Aug 2015, Berlin, Germany. pp.419-433, ⟨10.1007/978-3-319-21401-6_29⟩. ⟨hal-01157898⟩
  • Paula Chocron, Pascal Fontaine, Christophe Ringeissen. A Rewriting Approach to the Combination of Data Structures with Bridging Theories. Frontiers of Combining Systems - 10th International Symposium, FroCoS 2015, Sep 2015, Wroclaw, Poland. pp.275--290, ⟨10.1007/978-3-319-24246-0_17⟩. ⟨hal-01206187⟩
  • Paula Chocron, Pascal Fontaine, Christophe Ringeissen. A Gentle Non-Disjoint Combination of Satisfiability Procedures. Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, Jul 2014, Vienna, Austria. pp.122-136, ⟨10.1007/978-3-319-08587-6_9⟩. ⟨hal-01087162⟩
  • Clark Barrett, Leonardo de Moura, Pascal Fontaine. Proofs in satisfiability modulo theories. APPA (All about Proofs, Proofs for All), Jul 2014, Vienna, Austria. ⟨hal-01095009⟩
  • Paula Chocron, Pascal Fontaine, Christophe Ringeissen. Satisfiability Modulo Non-Disjoint Combinations of Theories Connected via Bridging Functions. Workshop on Automated Deduction: Decidability, Complexity, Tractability, ADDCT 2014. Held as Part of the Vienna Summer of Logic, affiliated with IJCAR 2014 and RTA 2014, Silvio Ghilardi, Ulrike Sattler, Viorica Sofronie-Stokkermans, Jul 2014, Vienna, Austria. ⟨hal-01087218⟩
  • David Déharbe, Pascal Fontaine, Daniel Le Berre, Bertrand Mazure. Computing prime implicant. FMCAD - Formal Methods in Computer-Aided Design 2013, Oct 2013, Portland, United States. pp.46-52. ⟨hal-00910363⟩
  • Carlos Areces, David Déharbe, Pascal Fontaine, Orbe Ezequiel. SyMT: finding symmetries in SMT formulas. 11th International Workshop on Satisfiability Modulo Theories - SMT, Jul 2013, Helsinki, Finland. ⟨hal-00867816⟩
  • Pascal Fontaine, Stephan Merz, Christoph Weidenbach. Combination of disjoint theories: beyond decidability. IJCAR - 6th International Joint Conference on Automated Reasoning - 2012, Jun 2012, Manchester, United Kingdom. pp.256-270, ⟨10.1007/978-3-642-31365-3_21⟩. ⟨hal-00747271⟩
  • David Déharbe, Pascal Fontaine, Yoann Guyot, Laurent Voisin. SMT solvers for Rodin. ABZ - Third International Conference on Abstract State Machines, Alloy, B, VDM, and Z - 2012, Jun 2012, Pisa, Italy. pp.194-207, ⟨10.1007/978-3-642-30885-7_14⟩. ⟨hal-00747269⟩
  • Frédéric Besson, Pascal Fontaine, Laurent Théry. A Flexible Proof Format for SMT: a Proposal. First International Workshop on Proof eXchange for Theorem Proving - PxTP 2011, Aug 2011, Wrocław, Poland. ⟨hal-00642544⟩
  • Carlos Areces, Pascal Fontaine. Combining theories: the Ackerman and Guarded Fragments. 8th International Symposium Frontiers of Combining Systems - FroCoS 2011, Viorica Sofronie-Stokkermans, Oct 2011, Saarbrücken, Germany. pp.40--54, ⟨10.1007/978-3-642-24364-6_4⟩. ⟨hal-00642529⟩
  • Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel Paleo. Compression of Propositional Resolution Proofs via Partial Regularization. 23rd International Conference on Automated Deduction - CADE-23, Jul 2011, Wroclaw, Poland. pp.237-251, ⟨10.1007/978-3-642-22438-6_19⟩. ⟨inria-00617846⟩
  • David Déharbe, Pascal Fontaine, Bruno Woltzenlogel Paleo. Quantifier Inference Rules for SMT proofs. First International Workshop on Proof eXchange for Theorem Proving - PxTP 2011, Aug 2011, Wrocław, Poland. ⟨hal-00642535⟩
  • David Déharbe, Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel Paleo. Exploiting Symmetry in SMT Problems. International Conference on Automated Deduction (CADE), Jul 2011, Wroclaw, Poland. pp.222-236, ⟨10.1007/978-3-642-22438-6_18⟩. ⟨inria-00617843⟩
  • Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel Paleo. Exploring and Exploiting Algebraic and Graphical Properties of Resolution. 8th International Workshop on Satisfiability Modulo Theories - SMT 2010, Jul 2010, Edinburgh, United Kingdom. ⟨inria-00544658⟩
  • Thomas Bouton, Diego Caminha B. de Oliveira, David Déharbe, Pascal Fontaine. GridTPT: a distributed platform for Theorem Prover Testing. 2nd Workshop on Practical Aspects of Automated Reasoning (PAAR), Jul 2010, Edinburgh, United Kingdom. ⟨inria-00543805⟩
  • Thomas Bouton, Diego Caminha B. de Oliveira, David Déharbe, Pascal Fontaine. veriT: an open, trustable and efficient SMT-solver. 22nd International Conference on Automated Deduction - CADE 22, Aug 2009, Montreal, Canada. pp.151-156, ⟨10.1007/978-3-642-02959-2_12⟩. ⟨inria-00430634⟩
  • David Déharbe, Pascal Fontaine, Anamaria Martins Moreira, Stephan Merz, Anderson Santana de Oliveira. Automating model-based software engineering. Colloque d'Informatique: Brésil/INRIA (COLIBRI), Jul 2009, Bento Gonçalves, Brazil. pp.22-27. ⟨inria-00430637⟩
  • Pascal Fontaine. Combinations of theories for decidable fragments of first-order logic. 7th International Symposium, FroCoS 2009, Sep 2009, Trento, Italy. pp.263-278, ⟨10.1007/978-3-642-04222-5_16⟩. ⟨inria-00430631⟩
  • Diego Caminha B. de Oliveira, David Déharbe, Pascal Fontaine. Combining decision procedures by (model-)equality propagation. Brazilian Symposium on Formal Methods - SBMF 2008, Aug 2008, Salvador, Bahia, Brazil. ⟨inria-00337979⟩
  • Diego Caminha B. de Oliveira, David Déharbe, Pascal Fontaine. haRVey : satisfaisabilité et théories. Approches Formelles dans l'Assistance au Développement de Logiciels - AFADL'07, Jun 2007, Namur, Belgique. pp.287-288. ⟨inria-00186640⟩
  • Pascal Fontaine. Combinations of Theories and the Bernays-Schönfinkel-Ramsey Class. 4th International Verification Workshop - VERIFY'07, Jul 2007, Bremen, Germany. pp.37-54. ⟨inria-00186639⟩
  • Clément Hurlin, Amine Chaib, Pascal Fontaine, Stephan Merz, Tjark Weber. Practical Proof Reconstruction for First-order Logic and Set-Theoretical Constructions. The Isabelle Workshop 2007 - Isabelle'07, Jul 2007, Bremen, Germany. pp.2-13. ⟨inria-00186638⟩
  • David Déharbe, Pascal Fontaine. haRVey: combining reasoners. Automatic Verification of Critical Systems - AVoCS 2006, Sep 2006, Nancy/France, pp.152-156. ⟨inria-00091662⟩
  • Pascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prensa Nieto, Alwen Tiu. Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants. 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems - TACAS'06, Mar 2006, Vienna/Austria, pp.167-181, ⟨10.1007/11691372_11⟩. ⟨inria-00001088⟩
  • David Déharbe, Pascal Fontaine, Silvio Ranise, Christophe Ringeissen. Decision Procedures for the Formal Analysis of Software. 3rd International Colloquium on Theoretical Aspects of Computing, ICTAC, Nov 2006, Tunis, Tunisia, pp.366--370, ⟨10.1007/11921240_26⟩. ⟨inria-00117277⟩
  • Pascal Fontaine, Silvio Ranise, Calogero Zarba. Combining Lists with Non-Stably Infinite Theories. 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'04), Mar 2005, Montevideo/Uruguay, pp.51--66, ⟨10.1007/b106931⟩. ⟨inria-00000481⟩

Book sections2 documents

  • Maria Paola Bonacina, Pascal Fontaine, Christophe Ringeissen, Cesare Tinelli. Theory Combination: Beyond Equality Sharing. Carsten Lutz; Uli Sattler; Cesare Tinelli; Anni-Yasmin Turhan; Frank Wolter. Description Logic, Theory Combination, and All That - Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday, 11560, Springer, pp.57-89, 2019, Theoretical Computer Science and General Issues, 978-3-030-22101-0. ⟨hal-02194001⟩
  • Carlos Areces, Pascal Fontaine, Stephan Merz. Modal Satisfiability via SMT Solving. Software, Services, and Systems. Essays Dedicated to Martin Wirsing on the Occasion of His Retirement from the Chair of Programming and Software Engineering, 8950, Springer, pp.30-45, 2015, Lecture Notes in Computer Science, ⟨10.1007/978-3-319-15545-6_5⟩. ⟨hal-01127966⟩

Directions of work or proceedings3 documents

  • Pascal Fontaine. Automated Deduction – CADE-27: 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings. Pascal Fontaine. CADE 27 - 27th International Conference on Automated Deduction, Aug 2019, Natal, Brazil. 11716, Springer, 2019, Lecture Notes in Artificial Intelligence. ⟨hal-02194007⟩
  • Pascal Fontaine, Thomas Sturm, Uwe Waldmann. Foreword to the Special Focus on Constraints and Combinations. Dongming Wang. Switzerland. 9 (3), Springer, 2015, Mathematics in Computer Science, ⟨10.1007/s11786-015-0239-8⟩. ⟨hal-01239438⟩
  • Pascal Fontaine, Christophe Ringeissen, Renate Schmidt. Frontiers of Combining Systems. Pascal Fontaine and Christophe Ringeissen and Renate Schmidt. 8152, Springer, pp.359, 2013, Lecture Notes in Artificial Intelligence, 978-3-642-40884-7. ⟨hal-00868424⟩

Reports5 documents

  • Andrew Reynolds, Haniel Barbosa, Pascal Fontaine. Revisiting Enumerative Instantiation. [Research Report] University of Iowa; Inria. 2018. ⟨hal-01744956⟩
  • Haniel Barbosa, Pascal Fontaine, Andrew Reynolds. Congruence Closure with Free Variables. [Research Report] Inria, Loria, Universite de Lorraine, UFRN, University of Iowa. 2017. ⟨hal-01442691v2⟩
  • Haniel Barbosa, Jasmin Blanchette, Pascal Fontaine. Scalable Fine-Grained Proofs for Formula Processing. [Research Report] Universite de Lorraine, CNRS, Inria, LORIA, Nancy, France; Universidade Federal do Rio Grande do Norte, Natal, Brazil; Vrije Universiteit Amsterdam, Amsterdam, The Netherlands; Max-Planck-Institut für Informatik, Saarbrücken, Germany. 2017, pp.25. ⟨hal-01526841⟩
  • Haniel Barbosa, Pascal Fontaine. Congruence Closure with Free Variables (Work in Progress). [Research Report] Inria Nancy - Grand Est (Villers-lès-Nancy, France). 2015. ⟨hal-01235912⟩
  • Paula Chocron, Pascal Fontaine, Christophe Ringeissen. A Gentle Non-Disjoint Combination of Satisfiability Procedures (Extended Version). [Research Report] RR-8529, INRIA. 2014. ⟨hal-00985135⟩

Habilitation à diriger des recherches1 document

  • Pascal Fontaine. Satisfiability Modulo Theories: state-of-the-art, contributions, project. Logic in Computer Science [cs.LO]. Université de lorraine, 2018. ⟨tel-01968404⟩