Travelled to:1 × Canada
1 × Germany
1 × United Kingdom
2 × Austria
2 × Poland
Collaborated with:S.Merz P.Chocron C.Ringeissen B.W.Paleo D.Déharbe E.P.Gribomont C.Weidenbach H.Barbosa J.C.Blanchette T.Bouton D.C.B.d.Oliveira J.Marion L.P.Nieto A.F.Tiu
Talks about:combin (4) disjoint (3) proof (3) smt (3) theori (2) solver (2) decid (2) non (2) paramater (1) trustabl (1)
Person: Pascal Fontaine
DBLP: Fontaine:Pascal
Facilitated 2 volumes:
Ed
EdContributed to:
2015
2014201220112009
200620032017Wrote 9 papers:
- CADE-2015-ChocronFR #revisited
- A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited (PC, PF, CR), pp. 419–433.
- IJCAR-2014-ChocronFR #satisfiability
- A Gentle Non-disjoint Combination of Satisfiability Procedures (PC, PF, CR), pp. 122–136.
- IJCAR-2012-FontaineMW #decidability
- Combination of Disjoint Theories: Beyond Decidability (PF, SM, CW), pp. 256–270.
- CADE-2011-DeharbeFMP #problem #smt #symmetry
- Exploiting Symmetry in SMT Problems (DD, PF, SM, BWP), pp. 222–236.
- CADE-2011-FontaineMP #proving
- Compression of Propositional Resolution Proofs via Partial Regularization (PF, SM, BWP), pp. 237–251.
- CADE-2009-BoutonODF #named #performance
- veriT: An Open, Trustable and Efficient SMT-Solver (TB, DCBdO, DD, PF), pp. 151–156.
- TACAS-2006-FontaineMMNT #automation #interactive #proving #smt #towards
- Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants (PF, JYM, SM, LPN, AFT), pp. 167–181.
- TACAS-2003-FontaineG #decidability #invariant #validation
- Decidability of Invariant Validation for Paramaterized Systems (PF, EPG), pp. 97–112.
- CADE-2017-BarbosaBF #fine-grained #proving #scalability
- Scalable Fine-Grained Proofs for Formula Processing (HB, JCB, PF), pp. 398–412.