Follow
Pascal Fontaine
Title
Cited by
Cited by
Year
veriT: an open, trustable and efficient SMT-solver
T Bouton, D Caminha B. de Oliveira, D Déharbe, P Fontaine
International Conference on Automated Deduction, 151-156, 2009
2572009
Expressiveness+ automation+ soundness: Towards combining SMT solvers and interactive proof assistants
P Fontaine, JY Marion, S Merz, LP Nieto, A Tiu
Tools and Algorithms for the Construction and Analysis of Systems: 12th …, 2006
1262006
SMT solvers for Rodin
D Déharbe, P Fontaine, Y Guyot, L Voisin
International Conference on Abstract State Machines, Alloy, B, VDM, and Z …, 2012
732012
Revisiting enumerative instantiation
A Reynolds, H Barbosa, P Fontaine
Tools and Algorithms for the Construction and Analysis of Systems: 24th …, 2018
642018
Exploiting symmetry in SMT problems
D Déharbe, P Fontaine, S Merz, B Woltzenlogel Paleo
Automated Deduction–CADE-23: 23rd International Conference on Automated …, 2011
562011
: Satisfiability Checking Meets Symbolic Computation: (Project Paper)
E Ábrahám, J Abbott, B Becker, AM Bigatti, M Brain, B Buchberger, ...
International Conference on Intelligent Computer Mathematics, 28-43, 2016
522016
Congruence closure with free variables
H Barbosa, P Fontaine, A Reynolds
International Conference on Tools and Algorithms for the Construction and …, 2017
442017
Integrating SMT solvers in Rodin
D Déharbe, P Fontaine, Y Guyot, L Voisin
Science of Computer Programming 94, 130-143, 2014
442014
Scalable fine-grained proofs for formula processing
H Barbosa, JC Blanchette, M Fleury, P Fontaine
Journal of Automated Reasoning 64 (3), 485-510, 2020
432020
Computing prime implicants
D Déharbe, P Fontaine, D Le Berre, B Mazure
2013 Formal Methods in Computer-Aided Design, 46-52, 2013
402013
Proofs in satisfiability modulo theories
C Barrett, L De Moura, P Fontaine
All about proofs, Proofs for all 55 (1), 23-44, 2015
372015
Combinations of theories for decidable fragments of first-order logic
P Fontaine
International Symposium on Frontiers of Combining Systems, 263-278, 2009
362009
A flexible proof format for SMT: A proposal
F Besson, P Fontaine, L Théry
First International Workshop on Proof eXchange for Theorem Proving-PxTP 2011, 2011
352011
Compression of propositional resolution proofs via partial regularization
P Fontaine, S Merz, B Woltzenlogel Paleo
Automated Deduction–CADE-23: 23rd International Conference on Automated …, 2011
352011
Techniques for verification of concurrent systems with invariants
P Fontaine
PhD thesis, Institut Montefiore, Université de Liege, Belgium, 2004
302004
Subtropical satisfiability
P Fontaine, M Ogawa, T Sturm, XT Vu
International Symposium on Frontiers of Combining Systems, 189-206, 2017
272017
Quantifier inference rules for SMT proofs
D Déharbe, P Fontaine, BW Paleo
First International Workshop on Proof eXchange for Theorem Proving-PxTP 2011, 2011
252011
Combining lists with non-stably infinite theories
P Fontaine, S Ranise, CG Zarba
Logic for Programming, Artificial Intelligence, and Reasoning: 11th …, 2005
222005
A gentle non-disjoint combination of satisfiability procedures
P Chocron, P Fontaine, C Ringeissen
International Joint Conference on Automated Reasoning, 122-136, 2014
212014
Decidability of invariant validation for paramaterized systems
P Fontaine, EP Gribomont
International Conference on Tools and Algorithms for the Construction and …, 2003
202003
The system can't perform the operation now. Try again later.
Articles 1–20