Satisfiability Modulo Bounded Checking [chapter]

Simon Cruanes
2017 Lecture Notes in Computer Science  
We describe a new approach to find models for a computational higher-order logic with datatypes. The goal is to find counterexamples for conjectures stated in proof assistants. The technique builds on narrowing [14] but relies on a tight integration with a SAT solver to analyze conflicts precisely, eliminate sets of choices that lead to failures, and sometimes prove unsatisfiability. The architecture is reminiscent of that of an SMT solver. We present the rules of the calculus, an implementation, and some promising experimental results.
doi:10.1007/978-3-319-63046-5_8 fatcat:llkw2d2mdrca3k67zsiqizntjq