Model Finding for Recursive Functions in SMT

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

doi:10.1007/978-3-319-40229-1_10

Model Finding for Recursive Functions in SMT

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

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

8 Downloads (Pure)

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 language	English
Title of host publication	Automated Reasoning - 8th International Joint Conference
Subtitle of host publication	IJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings
Publisher	Springer
Pages	133-151
ISBN (Print)	978-3-319-40228-4
DOIs	https://doi.org/10.1007/978-3-319-40229-1_10
Publication status	Published - 2016
Externally published	Yes

Access to Document

10.1007/978-3-319-40229-1_10

confAccepted author manuscript, 193 KB

Handle.net

Persistent link

Cite this

@inproceedings{54f3230e62314831a83f8180173448e2,

title = "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.",

author = "Andrew Reynolds and J.C. Blanchette and Simon Cruanes and Cesare Tinelli",

year = "2016",

doi = "10.1007/978-3-319-40229-1_10",

language = "English",

isbn = "978-3-319-40228-4",

pages = "133--151",

booktitle = "Automated Reasoning - 8th International Joint Conference",

publisher = "Springer",

}

Model Finding for Recursive Functions in SMT. / Reynolds, Andrew; Blanchette, J.C.; Cruanes, Simon et al.

Automated Reasoning - 8th International Joint Conference: IJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings. Springer, 2016. p. 133-151.

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Model Finding for Recursive Functions in SMT

AU - Reynolds, Andrew

AU - Blanchette, J.C.

AU - Cruanes, Simon

AU - Tinelli, Cesare

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-319-40229-1_10

DO - 10.1007/978-3-319-40229-1_10

M3 - Conference contribution

SN - 978-3-319-40228-4

SP - 133

EP - 151

BT - Automated Reasoning - 8th International Joint Conference

PB - Springer

ER -

Model Finding for Recursive Functions in SMT

Abstract

Access to Document

Handle.net

Fingerprint

Cite this