Skip to Main content Skip to Navigation
Conference papers

Model Finding for Recursive Functions in SMT

Abstract : SMT solvers have recently been extended with techniques for finding models in presence of universally quantified formulas in some restricted fragments. This paper introduces a translation which reduces axioms specifying a large class of recursive functions, including well-founded (terminating) functions, to universally quantified formulas for which these techniques are applicable. An empirical evaluation confirms that the approach improves the performance of existing solvers on benchmarks from two sources. The translation is implemented as a preprocessor in the solver CVC4.
Document type :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download
Contributor : Jasmin Blanchette <>
Submitted on : Saturday, December 12, 2015 - 8:23:59 PM
Last modification on : Monday, November 9, 2020 - 4:30:35 PM
Long-term archiving on: : Saturday, April 29, 2017 - 12:16:58 PM


Files produced by the author(s)


  • HAL Id : hal-01242509, version 1



Andrew Reynolds, Jasmin Christian Blanchette, Cesare Tinelli. Model Finding for Recursive Functions in SMT. SMT Workshop 2015 - 13th International Workshop on on Satisfiability Modulo Theories, Jul 2015, San Francisco, United States. ⟨hal-01242509⟩



Record views


Files downloads