
Pascal Fontaine
60
Documents
Publications
Publications
|
Polite Combination of Algebraic DatatypesJournal of Automated Reasoning, 2022, 66 (3), pp.331-355. ⟨10.1007/s10817-022-09625-3⟩
Article dans une revue
hal-03853159
v1
|
|
Politeness and Combination Methods for Theories with Bridging FunctionsJournal of Automated Reasoning, 2020, 64, pp.97-134. ⟨10.1007/s10817-019-09512-4⟩
Article dans une revue
hal-01988452
v1
|
|
Scalable Fine-Grained Proofs for Formula ProcessingJournal of Automated Reasoning, 2020, 64 (3), pp.485-510. ⟨10.1007/s10817-018-09502-y⟩
Article dans une revue
hal-02515103
v1
|
|
NP-completeness of small conflict set generation for congruence closureFormal Methods in System Design, 2017, 51 (3), pp.533 - 544. ⟨10.1007/s10703-017-0283-x⟩
Article dans une revue
hal-01908684
v1
|
|
Satisfiability Checking and Symbolic ComputationACM Communications in Computer Algebra, 2016, 50 (4), pp.145-147. ⟨10.1145/3055282.3055285⟩
Article dans une revue
hal-01648695
v1
|
|
Interest rates parity and no arbitrage as equivalent equilibrium conditions in the international financial assets and goods marketsMathematical Social Sciences, 2016, 82, pp.26-36. ⟨10.1016/j.mathsocsci.2016.04.002⟩
Article dans une revue
hal-01302524
v1
|
Integrating SMT solvers in RodinScience of Computer Programming, 2014, Abstract State Machines, Alloy, B, VDM, and Z — Selected and extended papers from ABZ 2012, 94, pp.14
Article dans une revue
hal-01094999
v1
|
|
|
Combining decision procedures by (model-)equality propagationScience of Computer Programming, 2010, 240 (2 July 2009), pp.113-128. ⟨10.1016/j.entcs.2009.05.048⟩
Article dans une revue
inria-00543801
v1
|
|
Combining Decision Procedures by (Model-)Equality PropagationElectronic Notes in Theoretical Computer Science, 2009, Proceedings of the Eleventh Brazilian Symposium on Formal Methods (SBMF 2008), 240 (2), pp.113-128. ⟨10.1016/j.entcs.2009.05.048⟩
Article dans une revue
inria-00430636
v1
|
|
Politeness for the Theory of Algebraic Datatypes (Extended Abstract)IJCAI 2021 - International Joint Conference on Artificial Intelligence (Sister Conferences Best Papers), Aug 2021, Montreal, Canada. pp.4829-4833, ⟨10.24963/ijcai.2021/660⟩
Communication dans un congrès
hal-03346697
v1
|
|
Quantifier Simplification by Unification in SMTFroCos 2021 - 13th International Symposium on Frontiers of Combining Systems, Sep 2021, Birmingham, United Kingdom. pp.232-249, ⟨10.1007/978-3-030-86205-3_13⟩
Communication dans un congrès
hal-03341368
v1
|
|
Politeness for the Theory of Algebraic Datatypes10th International Joint Conference on Automated Reasoning, IJCAR, Jul 2020, Paris, France. pp.238--255, ⟨10.1007/978-3-030-51074-9_14⟩
Communication dans un congrès
hal-02962716
v1
|
|
Lifting congruence closure with free variables to λ-free higher-order logic via SAT encodingSMT 2020 - 18th International Workshop on Satisfiability Modulo Theories, Jul 2020, Online COVID-19, France
Communication dans un congrès
hal-03049088
v1
|
|
Machine Learning for Instance Selection in SMT SolvingAITP 2019 - 4th Conference on Artificial Intelligence and Theorem Proving, Apr 2019, Obergurgl, Austria
Communication dans un congrès
hal-02381430
v1
|
|
Better SMT Proofs for Easier ReconstructionAITP 2019 - 4th Conference on Artificial Intelligence and Theorem Proving, Apr 2019, Obergurgl, Austria
Communication dans un congrès
hal-02381819
v1
|
|
Revisiting Enumerative InstantiationTACAS 2018 - 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Apr 2018, Thessaloniki, Greece. pp.20
Communication dans un congrès
hal-01877055
v1
|
|
Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMTSC-square 2018 - Third International Workshop on Satisfiability Checking and Symbolic Computation, Jul 2018, Oxford, United Kingdom
Communication dans un congrès
hal-01946733
v1
|
|
Scalable Fine-Grained Proofs for Formula ProcessingProc. Conference on Automated Deduction (CADE), 2017, Gotenburg, Sweden. pp.398 - 412, ⟨10.1007/978-3-642-02959-2_10⟩
Communication dans un congrès
hal-01590922
v1
|
|
Congruence Closure with Free VariablesTACAS 2017 - 23rd International Conference on Tools and Algorithms for Construction and Analysis of Systems, Apr 2017, Uppsala, Sweden. pp.220 - 230, ⟨10.1007/10721959_17⟩
Communication dans un congrès
hal-01590918
v1
|
|
Subtropical SatisfiabilityFroCoS 2017 - 11th International Symposium on Frontiers of Combining Systems, Sep 2017, Brasilia, Brazil. ⟨10.1007/978-3-319-66167-4⟩
Communication dans un congrès
hal-01590899
v2
|
|
Towards Strong Higher-Order Automation for Fast Interactive VerificationARCADE 2017 - 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, 2017, Göteborg, Sweden. pp.16-7, ⟨10.29007/3ngx⟩
Communication dans un congrès
hal-02359588
v1
|
|
SC 2 : Satisfiability Checking meets Symbolic Computation (Project Paper)Intelligent Computer Mathematics, Jul 2016, Bialystok, Poland
Communication dans un congrès
hal-01377655
v1
|
|
A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited25th International Conference on Automated Deduction, CADE-25, Christoph Benzmueller, Aug 2015, Berlin, Germany. pp.419-433, ⟨10.1007/978-3-319-21401-6_29⟩
Communication dans un congrès
hal-01157898
v1
|
|
A Rewriting Approach to the Combination of Data Structures with Bridging TheoriesFrontiers of Combining Systems - 10th International Symposium, FroCoS 2015, Sep 2015, Wroclaw, Poland. pp.275--290, ⟨10.1007/978-3-319-24246-0_17⟩
Communication dans un congrès
hal-01206187
v1
|
|
Congruence Closure with Free Variables (Work in Progress)QUANTIFY 2015 - 2nd International Workshop on Quantification, Aug 2015, Berlin, Germany
Communication dans un congrès
hal-01246036
v1
|
|
Adapting Real Quantifier Elimination Methods for Conflict Set ComputationFrontiers of Combining Systems (FroCoS), 2015, Wroclaw, Poland. pp.151-166, ⟨10.1007/978-3-319-24246-0_10⟩
Communication dans un congrès
hal-01240343
v1
|
Proofs in satisfiability modulo theoriesAPPA (All about Proofs, Proofs for All), Jul 2014, Vienna, Austria
Communication dans un congrès
hal-01095009
v1
|
|
A Gentle Non-Disjoint Combination of Satisfiability ProceduresAutomated 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⟩
Communication dans un congrès
hal-01087162
v1
|
|
Satisfiability Modulo Non-Disjoint Combinations of Theories Connected via Bridging FunctionsWorkshop 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
Communication dans un congrès
hal-01087218
v1
|
|
Computing prime implicants13th International Conference on Formal Methods in Computer-Aided Design (FMCAD'13), Oct 2013, Portland, Oregon, United States. pp.46-52, ⟨10.1109/FMCAD.2013.6679390⟩
Communication dans un congrès
hal-03300802
v1
|
|
SyMT: finding symmetries in SMT formulas11th International Workshop on Satisfiability Modulo Theories - SMT, Jul 2013, Helsinki, Finland
Communication dans un congrès
hal-00867816
v1
|
|
SMT solvers for RodinABZ - 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⟩
Communication dans un congrès
hal-00747269
v1
|
|
Combination of disjoint theories: beyond decidabilityIJCAR - 6th International Joint Conference on Automated Reasoning - 2012, Jun 2012, Manchester, United Kingdom. pp.256-270, ⟨10.1007/978-3-642-31365-3_21⟩
Communication dans un congrès
hal-00747271
v1
|
|
Exploiting Symmetry in SMT ProblemsInternational Conference on Automated Deduction (CADE), Jul 2011, Wroclaw, Poland. pp.222-236, ⟨10.1007/978-3-642-22438-6_18⟩
Communication dans un congrès
istex
inria-00617843
v1
|
|
|
Quantifier Inference Rules for SMT proofsFirst International Workshop on Proof eXchange for Theorem Proving - PxTP 2011, Aug 2011, Wrocław, Poland
Communication dans un congrès
hal-00642535
v1
|
Compression of Propositional Resolution Proofs via Partial Regularization23rd International Conference on Automated Deduction - CADE-23, Jul 2011, Wroclaw, Poland. pp.237-251, ⟨10.1007/978-3-642-22438-6_19⟩
Communication dans un congrès
istex
inria-00617846
v1
|
|
Combining theories: the Ackerman and Guarded Fragments8th 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⟩
Communication dans un congrès
istex
hal-00642529
v1
|
|
|
A Flexible Proof Format for SMT: a ProposalFirst International Workshop on Proof eXchange for Theorem Proving - PxTP 2011, Aug 2011, Wrocław, Poland
Communication dans un congrès
hal-00642544
v1
|
GridTPT: a distributed platform for Theorem Prover Testing2nd Workshop on Practical Aspects of Automated Reasoning (PAAR), Jul 2010, Edinburgh, United Kingdom
Communication dans un congrès
inria-00543805
v1
|
|
|
Exploring and Exploiting Algebraic and Graphical Properties of Resolution8th International Workshop on Satisfiability Modulo Theories - SMT 2010, Jul 2010, Edinburgh, United Kingdom
Communication dans un congrès
inria-00544658
v1
|
veriT: an open, trustable and efficient SMT-solver22nd International Conference on Automated Deduction - CADE 22, Aug 2009, Montreal, Canada. pp.151-156, ⟨10.1007/978-3-642-02959-2_12⟩
Communication dans un congrès
istex
inria-00430634
v1
|
|
Automating model-based software engineeringColloque d'Informatique: Brésil/INRIA (COLIBRI), Jul 2009, Bento Gonçalves, Brazil. pp.22-27
Communication dans un congrès
inria-00430637
v1
|
|
Combinations of theories for decidable fragments of first-order logic7th International Symposium, FroCoS 2009, Sep 2009, Trento, Italy. pp.263-278, ⟨10.1007/978-3-642-04222-5_16⟩
Communication dans un congrès
istex
inria-00430631
v1
|
|
Combining decision procedures by (model-)equality propagationBrazilian Symposium on Formal Methods - SBMF 2008, Aug 2008, Salvador, Bahia, Brazil
Communication dans un congrès
inria-00337979
v1
|
|
haRVey : satisfaisabilité et théoriesApproches Formelles dans l'Assistance au Développement de Logiciels - AFADL'07, Jun 2007, Namur, Belgique. pp.287-288
Communication dans un congrès
inria-00186640
v1
|
|
Practical Proof Reconstruction for First-order Logic and Set-Theoretical ConstructionsThe Isabelle Workshop 2007 - Isabelle'07, Jul 2007, Bremen, Germany. pp.2-13
Communication dans un congrès
inria-00186638
v1
|
|
Combinations of Theories and the Bernays-Schönfinkel-Ramsey Class4th International Verification Workshop - VERIFY'07, Jul 2007, Bremen, Germany. pp.37-54
Communication dans un congrès
inria-00186639
v1
|
|
|
Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants12th 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⟩
Communication dans un congrès
inria-00001088
v1
|
Decision Procedures for the Formal Analysis of Software3rd International Colloquium on Theoretical Aspects of Computing, ICTAC, Nov 2006, Tunis, Tunisia, pp.366--370, ⟨10.1007/11921240_26⟩
Communication dans un congrès
istex
inria-00117277
v1
|
|
|
haRVey: combining reasonersAutomatic Verification of Critical Systems - AVoCS 2006, Sep 2006, Nancy/France, pp.152-156
Communication dans un congrès
inria-00091662
v1
|
|
Combining Lists with Non-Stably Infinite Theories11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'04), Mar 2005, Montevideo/Uruguay, pp.51--66, ⟨10.1007/b106931⟩
Communication dans un congrès
inria-00000481
v1
|
|
Foreword to the Special Focus on Constraints and CombinationsDongming Wang. Springer, 9 (3), 2015, Mathematics in Computer Science, ⟨10.1007/s11786-015-0239-8⟩
Ouvrages
hal-01239438
v1
|
Frontiers of Combining SystemsPascal Fontaine and Christophe Ringeissen and Renate Schmidt. Springer, 8152, pp.359, 2013, Lecture Notes in Artificial Intelligence, 978-3-642-40884-7
Ouvrages
hal-00868424
v1
|
|
Theory Combination: Beyond Equality SharingCarsten 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
Chapitre d'ouvrage
hal-02194001
v1
|
|
Modal Satisfiability via SMT SolvingSoftware, 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⟩
Chapitre d'ouvrage
hal-01127966
v1
|
|
Revisiting Enumerative Instantiation[Research Report] University of Iowa; Inria. 2018
Rapport
(rapport de recherche)
hal-01744956
v1
|
|
Congruence Closure with Free Variables[Research Report] Inria, Loria, Universite de Lorraine, UFRN, University of Iowa. 2017
Rapport
(rapport de recherche)
hal-01442691
v2
|
|
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
Rapport
(rapport de recherche)
hal-01526841
v1
|
|
A Gentle Non-Disjoint Combination of Satisfiability Procedures (Extended Version)[Research Report] RR-8529, INRIA. 2014
Rapport
(rapport de recherche)
hal-00985135
v1
|
|
Satisfiability Modulo Theories: state-of-the-art, contributions, projectLogic in Computer Science [cs.LO]. Université de lorraine, 2018
HDR
tel-01968404
v1
|
Chargement...
Chargement...