Skip to Main content Skip to Navigation
Conference papers

Model Finding for Recursive Functions in SMT

Andrew Reynolds 1 Jasmin Christian Blanchette 2, 3 Simon Cruanes 2, 3 Cesare Tinelli 1
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
3 MOSEL - Proof-oriented development of computer-based systems
LORIA - FM - Department of Formal Methods
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 metadata

Cited literature [39 references]  Display  Hide  Download

https://hal.inria.fr/hal-01336082
Contributor : Jasmin Blanchette Connect in order to contact the contributor
Submitted on : Wednesday, June 22, 2016 - 3:57:27 PM
Last modification on : Saturday, October 16, 2021 - 11:26:09 AM

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. IJCAR 2016 - 8th International Joint Conference on Automated Reasoning, Jun 2016, Coimbra, Portugal. ⟨10.1007/978-3-319-40229-1_10⟩. ⟨hal-01336082⟩

Share

Metrics

Record views

292

Files downloads

204