Satisfiability Modulo Bounded Checking - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Satisfiability Modulo Bounded Checking

Abstract

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.
Fichier principal
Vignette du fichier
paper.pdf (447.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01572531 , version 1 (08-08-2017)

Identifiers

Cite

Simon Cruanes. Satisfiability Modulo Bounded Checking. International Conference on Automated Deduction (CADE), Leonardo de Moura, Aug 2017, Gothenburg, Sweden. pp.114-129, ⟨10.1007/978-3-319-63046-5_8⟩. ⟨hal-01572531⟩
252 View
292 Download

Altmetric

Share

Gmail Facebook X LinkedIn More