Productive coprogramming with guarded recursion, ICFP '13, pp.197-208, 2013. ,
The SMT-LIB standard?Version 2.5, 2015. ,
Proving Infinite Satisfiability, LPAR-19, pp.86-95, 2013. ,
DOI : 10.1007/978-3-642-45221-5_6
Computing finite models by reduction to function-free clause logic, Journal of Applied Logic, vol.7, issue.1, pp.58-74, 2009. ,
DOI : 10.1016/j.jal.2007.07.005
An overview of the Leon verification system?Verification by translation to recursive functions, Scala '13, 2013. ,
Relational analysis of (co)inductive predicates, (co)algebraic datatypes, and (co)recursive functions, Software Quality Journal, vol.20, issue.1, pp.101-126, 2013. ,
DOI : 10.1007/s11219-011-9148-5
Extending Sledgehammer with SMT Solvers, J. Autom. Reasoning, vol.37, issue.1-2, pp.109-128, 2013. ,
DOI : 10.1007/BFb0028402
Monotonicity Inference for Higher-Order Formulas, Journal of Automated Reasoning, vol.178, issue.1, pp.369-398, 2011. ,
DOI : 10.1007/s10817-011-9234-1
Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder, LNCS, vol.6172, pp.131-146, 2010. ,
DOI : 10.1007/978-3-642-14052-5_11
Foundational extensible corecursion: A proof assistant perspective, p.15, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01212589
QuickCheck: A lightweight tool for random testing of Haskell programs, ICFP '00, pp.268-279, 2000. ,
Sort It Out with Monotonicity, LNCS, vol.5, issue.2, pp.207-221, 2011. ,
DOI : 10.1007/BF00243005
New techniques that improve MACE-style model finding, MODEL, 2003. ,
Efficient E-Matching for SMT Solvers, LNCS, vol.4603, pp.21-183, 2007. ,
DOI : 10.1007/978-3-540-73595-3_13
Relevancy propagation, 2007. ,
Z3: An Efficient SMT Solver, LNCS, vol.4963, pp.337-340, 2008. ,
DOI : 10.1007/978-3-540-78800-3_24
Automated Flaw Detection in Algebraic Specifications, Journal of Automated Reasoning, vol.20, issue.1, pp.359-395, 2010. ,
DOI : 10.1007/s10817-010-9166-1
Complete instantiation for quantified formulas in satisfiability modulo theories, CAV '09, pp.306-320, 2009. ,
Institutions: abstract model theory for specification and programming, Journal of the ACM, vol.39, issue.1, pp.95-146, 1992. ,
DOI : 10.1145/147508.147524
Nitpick: A checkable specification language, FMSP '96, pp.60-69, 1996. ,
Case-Analysis for Rippling and Inductive Proof, ITP 2010, pp.291-306, 2010. ,
DOI : 10.1007/978-3-642-14052-5_21
Non-cyclic Sorts for First-Order Satisfiability, FroCoS 2013, pp.214-228, 2013. ,
DOI : 10.1007/978-3-642-40885-4_15
Automating Recursive Definitions and Termination Proofs in Higher-Order Logic, 2009. ,
Relational analysis of algebraic datatypes, 2005. ,
Property directed generation of first-order test data, Intellect, pp.105-123, 2007. ,
Prover9 and Mace4 ,
A Davis?Putnam program and its application to finite first-order model search: Quasigroup existence problems, 1994. ,
A decision procedure for (co)datatypes in SMT solvers, LNCS, p.25, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01212585
Model Finding for Recursive Functions in SMT, 2015. ,
DOI : 10.1007/978-3-319-40229-1_10
URL : https://hal.archives-ouvertes.fr/hal-01242509
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
Finite Model Finding in SMT, CAV 2013, pp.640-655, 2013. ,
DOI : 10.1007/978-3-642-39799-8_42
Quantifier Instantiation Techniques for Finite Model Finding in SMT, LNCS, vol.7898, issue.24, pp.377-391, 2013. ,
DOI : 10.1007/978-3-642-38574-2_26
Finite Model Finding in Satisfiability Modulo Theories, 2013. ,
SmallCheck and Lazy SmallCheck: Automatic exhaustive testing for small values, pp.37-48, 2008. ,
FINDER: Finite domain enumerator system description, LNCS, vol.814, issue.12, pp.798-801, 1994. ,
DOI : 10.1007/3-540-58156-1_63
Kodkod: A Relational Model Finder, TACAS 2007, pp.632-647, 2007. ,
DOI : 10.1007/978-3-540-71209-1_49
Elementary strong functional programming, FPLE '95, pp.1-13, 1995. ,
DOI : 10.1007/3-540-60675-0_35
SAT-Based Finite Model Generation for Higher-Order Logic, 2008. ,
SEM: A system for enumerating models, IJCAI-95, pp.298-303, 1995. ,