An abstract decision procedure for satisfiability in the theory of inductive data types, J. Satisf. Boolean Model. Comput, vol.3, pp.21-46, 2007. ,
Extending Sledgehammer with SMT Solvers, J. Autom. Reasoning, vol.37, issue.1-2, pp.109-128, 2013. ,
DOI : 10.1007/BFb0028402
Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder, ITP 2010, pp.131-146, 2010. ,
DOI : 10.1007/978-3-642-14052-5_11
On Rational Trees, CSL 2006, pp.225-239, 2006. ,
DOI : 10.1007/11874683_15
URL : https://hal.archives-ouvertes.fr/hal-00620171
Abstract, Theory and Practice of Logic Programming, vol.2, issue.04, pp.431-489, 2008. ,
DOI : 10.1007/BF03037057
DPLL(T): Fast Decision Procedures, CAV 2004, pp.175-188, 2004. ,
DOI : 10.1007/978-3-540-27813-9_14
Sharing is caring: Combination of theories, FroCoS 2011, pp.195-210, 2011. ,
Combining Superposition and Induction: A Practical Realization, FroCoS 2013, pp.7-22, 2013. ,
DOI : 10.1007/978-3-642-40885-4_2
URL : https://hal.archives-ouvertes.fr/hal-00934610
Archive of Formal Proofs ,
Results on the Propositional ??-Calculus, DAIMI Report Series, vol.11, issue.146, pp.333-354, 1983. ,
DOI : 10.7146/dpb.v11i146.7420
Co-induction simply?Automatic co-inductive proofs in a program verifier, FM 2014, pp.382-398, 2014. ,
A Formally Verified Compiler Back-end, Journal of Automated Reasoning, vol.27, issue.1, pp.363-446, 2009. ,
DOI : 10.1007/s10817-009-9155-4
URL : https://hal.archives-ouvertes.fr/inria-00360768
Verifying a Compiler for Java Threads, ESOP 2010, pp.427-447, 2010. ,
DOI : 10.1007/978-3-642-11957-6_23
Making the java memory model safe, ACM Transactions on Programming Languages and Systems, vol.35, issue.4, pp.1-65, 2014. ,
DOI : 10.1145/2518191
Efficient E-Matching for SMT Solvers, CADE-21, pp.183-198, 2007. ,
DOI : 10.1007/978-3-540-73595-3_13
Z3: An Efficient SMT Solver, TACAS 2008, pp.337-340, 2008. ,
DOI : 10.1007/978-3-540-78800-3_24
Simplification by Cooperating Decision Procedures, ACM Transactions on Programming Languages and Systems, vol.1, issue.2, pp.245-257, 1979. ,
DOI : 10.1145/357073.357079
RADA: a tool for reasoning about algebraic data types with abstractions, Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering, ESEC/FSE 2013, pp.611-614, 2013. ,
DOI : 10.1145/2491411.2494597
A decision procedure for (co)datatypes in SMT solvers, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01212585
Induction for SMT Solvers, VMCAI 2015, pp.80-98, 2014. ,
DOI : 10.1007/978-3-662-46081-8_5
Quantifier Instantiation Techniques for Finite Model Finding in SMT, CADE-24, pp.377-391, 2013. ,
DOI : 10.1007/978-3-642-38574-2_26
Finding conflicting instances of quantified formulas in SMT, 2014 Formal Methods in Computer-Aided Design (FMCAD), pp.195-202, 2014. ,
DOI : 10.1109/FMCAD.2014.6987613
Universal coalgebra: a theory of systems, Theoretical Computer Science, vol.249, issue.1, pp.3-80, 2000. ,
DOI : 10.1016/S0304-3975(00)00056-6
StarExec: A Cross-Community Infrastructure for Logic Solving, IJCAR 2014, pp.367-373, 2014. ,
DOI : 10.1007/978-3-319-08587-6_28
Satisfiability Modulo Recursive Programs, SAS 2011, pp.298-315, 2011. ,
DOI : 10.1007/978-3-540-77395-5_17
Polymorphic+typeclass superposition, p.2014, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01098078
SAT-Based Finite Model Generation for Higher-Order Logic, 2008. ,