Revisiting Enumerative Instantiation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2018

Revisiting Enumerative Instantiation


Formal methods applications often rely on SMT solvers to automatically discharge proof obligations. SMT solvers handle quantified formulas using incomplete heuristic techniques like E-matching, and often resort to model-based quantifier instantiation (MBQI) when these techniques fail. This paper revisits enumerative instantiation, a technique that considers instantiations based on exhaustive enumeration of ground terms. Although simple, we argue that enumer-ative instantiation can supplement other instantiation techniques and be a viable alternative to MBQI for valid proof obligations. We first present a stronger Her-brand Theorem, better suited as a basis for the instantiation loop used in SMT solvers; it furthermore requires considering less instances than classical Herbrand instantiation. Based on this result, we present different strategies for combining enumerative instantiation with other instantiation techniques in an effective way. The experimental evaluation shows that the implementation of these new techniques in the SMT solver CVC4 leads to significant improvements in several benchmark libraries, including many stemming from verification efforts.
Fichier principal
Vignette du fichier
rep.pdf (442.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01744956 , version 1 (27-03-2018)


  • HAL Id : hal-01744956 , version 1


Andrew J Reynolds, Haniel Barbosa, Pascal Fontaine. Revisiting Enumerative Instantiation. [Research Report] University of Iowa; Inria. 2018. ⟨hal-01744956⟩
132 View
101 Download


Gmail Facebook Twitter LinkedIn More