Model Finding for Recursive Functions in SMT

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [39 references]  Display  Hide  Download

https://hal.inria.fr/hal-01336082
Contributor : Jasmin Blanchette <>
Submitted on : Wednesday, June 22, 2016 - 3:57:27 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:03 PM

File

conf.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

218

Files downloads

73