Efficient Instantiation Techniques in SMT (Work In Progress)

Haniel Barbosa 1, 2, 3
3 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
Abstract : In SMT solving one generally applies heuristic instantiation to handle quantified formulas. This has the side effect of producing many spurious instances and may lead to loss of performance. Therefore deriving both fewer and more meaningful instances as well as eliminating or dismissing , i.e., keeping but ignoring, those not significant for the solving are desirable features for dealing with first-order problems. This paper presents preliminary work on two approaches: the implementation of an efficient instantiation framework with an incomplete goal-oriented search; and the introduction of dismissing criteria for heuristic instances. Our experiments show that while the former improves performance in general the latter is highly dependent on the problem structure, but its combination with the classic strategy leads to competitive results w.r.t. state-of-the-art SMT solvers in several benchmark libraries.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01388976
Contributor : Haniel Barbosa <>
Submitted on : Thursday, October 27, 2016 - 6:26:23 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:03 PM

File

paper-01.pdf
Files produced by the author(s)

Licence


Public Domain

Identifiers

  • HAL Id : hal-01388976, version 1

Collections

Citation

Haniel Barbosa. Efficient Instantiation Techniques in SMT (Work In Progress). PAAR 2016 - 5th Workshop on Practical Aspects of Automated Reasoning co-located with IJCAR 2016 - 8th International Joint Conference on Automated Reasoning, Jul 2016, Coimbra, Portugal. pp.1-10. ⟨hal-01388976⟩

Share

Metrics

Record views

109

Files downloads

106