Conference proceeding
Model Finding for Recursive Functions in SMT
Automated Reasoning, Vol.9706, pp.133-151
Automated Reasoning - 8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings
IJCAR 2016 - 8th International Joint Conference on Automated Reasoning
06/12/2016
DOI: 10.1007/978-3-319-40229-1_10
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.
Details
- Title: Subtitle
- Model Finding for Recursive Functions in SMT
- Creators
- Andrew Reynolds - University of Iowa [Iowa City]Jasmin Christian Blanchette - Modeling and Verification of Distributed Algorithms and SystemsSimon Cruanes - Modeling and Verification of Distributed Algorithms and SystemsCesare Tinelli - University of Iowa [Iowa City]
- Resource Type
- Conference proceeding
- Publication Details
- Automated Reasoning, Vol.9706, pp.133-151
- Conference
- IJCAR 2016 - 8th International Joint Conference on Automated Reasoning
- Series
- Automated Reasoning - 8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings
- DOI
- 10.1007/978-3-319-40229-1_10
- ISSN
- 0302-9743
- eISSN
- 1611-3349
- Language
- English
- Date published
- 06/12/2016
- Academic Unit
- Computer Science
- Record Identifier
- 9984002319702771
Metrics
21 Record Views