Model Finding for Recursive Functions in SMT - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Model Finding for Recursive Functions in SMT


SMT solvers have recently been extended with techniques for finding models of universally quantified formulas in some restricted fragments of first-order logic. This paper introduces a translation that reduces axioms specifying a large class of recursive functions, including terminating functions, to universally quantified formulas for which these techniques are applicable. An evaluation confirms that the approach improves the performance of existing solvers on benchmarks from three sources. The translation is implemented as a preprocessor in the CVC4 solver and in a new higher-order model finder called Nunchaku.
Fichier principal
Vignette du fichier
conf.pdf (192.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01336082 , version 1 (22-06-2016)



Andrew Reynolds, Jasmin Christian Blanchette, Simon Cruanes, Cesare Tinelli. Model Finding for Recursive Functions in SMT. IJCAR 2016 - 8th International Joint Conference on Automated Reasoning, Jun 2016, Coimbra, Portugal. ⟨10.1007/978-3-319-40229-1_10⟩. ⟨hal-01336082⟩
158 View
163 Download



Gmail Facebook X LinkedIn More