Model Finding for Recursive Functions in SMT

Andrew Reynolds, J.C. Blanchette, Simon Cruanes, Cesare Tinelli

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

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.
Original languageEnglish
Title of host publicationAutomated Reasoning - 8th International Joint Conference
Subtitle of host publicationIJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings
PublisherSpringer
Pages133-151
ISBN (Print)978-3-319-40228-4
DOIs
Publication statusPublished - 2016
Externally publishedYes

Fingerprint Dive into the research topics of 'Model Finding for Recursive Functions in SMT'. Together they form a unique fingerprint.

  • Cite this

    Reynolds, A., Blanchette, J. C., Cruanes, S., & Tinelli, C. (2016). Model Finding for Recursive Functions in SMT. In Automated Reasoning - 8th International Joint Conference: IJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings (pp. 133-151). Springer. https://doi.org/10.1007/978-3-319-40229-1_10