Pascal Fontaine
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
25
Venues
6
Active years
2002–2026
Best venue rank
A*
Where they publish
Papers
25 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | TACAS | Exploring the SMT-LIB Benchmark Library. | Hans-Jrg Schurr, Franois Bobot, Mathias Preiner, Aina Niemetz, Clark W. Barrett, Pascal Fontaine, Cesare Tinelli |
| 2023 | CADE | Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates. | Bernard Boigelot, Pascal Fontaine, Baptiste Vergain |
| 2023 | LPAR | Representation, Verification, and Visualization of Tarskian Interpretations for Typed First-order Logic. | Alexander Steen, Geoff Sutcliffe, Pascal Fontaine, Jack McKeown |
| 2021 | FMCAD | Fair and Adventurous Enumeration of Quantifier Instantiations. | Mikols Janota, Haniel Barbosa, Pascal Fontaine, Andrew Reynolds |
| 2021 | IJCAI | Politeness for the Theory of Algebraic Datatypes (Extended Abstract). | Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett |
| 2020 | CADE | Politeness for the Theory of Algebraic Datatypes. | Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett |
| 2018 | TACAS | Revisiting Enumerative Instantiation. | Andrew Reynolds, Haniel Barbosa, Pascal Fontaine |
| 2017 | CADE | SC-square: when Satisfiability Checking and Symbolic Computation join forces. | Erika brahm, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Vijay Ganesh, Alberto Griggio, Daniel Kroening, Werner M. Seiler |
| 2017 | CADE | Scalable Fine-Grained Proofs for Formula Processing. | Haniel Barbosa, Jasmin Christian Blanchette, Pascal Fontaine |
| 2017 | CADE | Towards Strong Higher-Order Automation for Fast Interactive Verification. | Jasmin Christian Blanchette, Pascal Fontaine, Stephan Schulz, Uwe Waldmann |
| 2017 | TACAS | Congruence Closure with Free Variables. | Haniel Barbosa, Pascal Fontaine, Andrew Reynolds |
| 2015 | CADE | A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited. | Paula Daniela Chocron, Pascal Fontaine, Christophe Ringeissen |
| 2014 | CADE | A Gentle Non-disjoint Combination of Satisfiability Procedures. | Paula Daniela Chocron, Pascal Fontaine, Christophe Ringeissen |
| 2013 | FMCAD | Computing prime implicants. | David Dharbe, Pascal Fontaine, Daniel Le Berre, Bertrand Mazure |
| 2012 | CADE | Combination of Disjoint Theories: Beyond Decidability. | Pascal Fontaine, Stephan Merz, Christoph Weidenbach |
| 2011 | CADE | Exploiting Symmetry in SMT Problems. | David Dharbe, Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel Paleo |
| 2011 | CADE | Compression of Propositional Resolution Proofs via Partial Regularization. | Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel Paleo |
| 2010 | CADE | GridTPT: a distributed platform for Theorem Prover Testing. | Thomas Bouton, Diego Caminha, David Dharbe, Pascal Fontaine |
| 2009 | CADE | veriT: An Open, Trustable and Efficient SMT-Solver. | Thomas Bouton, Diego Caminha Barbosa De Oliveira, David Dharbe, Pascal Fontaine |
| 2007 | CADE | Combinations of Theories and the Bernays-Schnfinkel-Ramsey Class. | Pascal Fontaine |
| 2006 | ICTAC | Decision Procedures for the Formal Analysis of Software. | David Dharbe, Pascal Fontaine, Silvio Ranise, Christophe Ringeissen |
| 2006 | TACAS | Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants. | Pascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prensa Nieto, Alwen Fernanto Tiu |
| 2004 | LPAR | Combining Lists with Non-stably Infinite Theories. | Pascal Fontaine, Silvio Ranise, Calogero G. Zarba |
| 2003 | TACAS | Decidability of Invariant Validation for Paramaterized Systems. | Pascal Fontaine, E. Pascal Gribomont |
| 2002 | LPAR | Using BDDs with Combinations of Theories. | Pascal Fontaine, E. Pascal Gribomont |