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.
Type de document :
Communication dans un congrès
8th International Joint Conference on Automated Reasoning (IJCAR 2016), Jun 2016, Coimbra, Portugal. Automated Reasoning - 8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings. 〈10.1007/978-3-319-40229-1_10〉
Liste complète des métadonnées

Littérature citée [39 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01336082
Contributeur : Jasmin Christian Blanchette <>
Soumis le : mercredi 22 juin 2016 - 15:57:27
Dernière modification le : mardi 13 décembre 2016 - 15:40:26

Fichier

conf.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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. Automated Reasoning - 8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings. 〈10.1007/978-3-319-40229-1_10〉. 〈hal-01336082〉

Partager

Métriques

Consultations de
la notice

140

Téléchargements du document

45