Revisiting Enumerative Instantiation

Abstract : 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.
Type de document :
[Research Report] University of Iowa; Inria. 2018
Liste complète des métadonnées

Littérature citée [33 références]  Voir  Masquer  Télécharger
Contributeur : Haniel Barbosa <>
Soumis le : mardi 27 mars 2018 - 18:04:24
Dernière modification le : lundi 16 juillet 2018 - 18:36:03


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01744956, version 1



Andrew Reynolds, Haniel Barbosa, Pascal Fontaine. Revisiting Enumerative Instantiation. [Research Report] University of Iowa; Inria. 2018. 〈hal-01744956〉



Consultations de la notice


Téléchargements de fichiers