Efficient Instantiation Techniques in SMT (Work In Progress) - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Efficient Instantiation Techniques in SMT (Work In Progress)

(1, 2, 3)
1
2
3

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.
Fichier principal
Vignette du fichier
paper-01.pdf (574.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01388976 , version 1 (27-10-2016)

Licence

Public Domain

Identifiers

  • HAL Id : hal-01388976 , version 1

Cite

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⟩
79 View
57 Download

Share

Gmail Facebook Twitter LinkedIn More