Congruence Closure with Free Variables - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2017

Congruence Closure with Free Variables

Abstract

Many verification techniques nowadays successfully rely on SMT solvers as back-ends to automatically discharge proof obligations. These solvers generally rely on various instantiation techniques to handle quantifiers. We here show that the major instantiation techniques in SMT solving can be cast in a unifying framework for handling quantified formulas with equality and uninterpreted functions. This framework is based on the problem of E-ground (dis)unification, a variation of the classic rigid E-unification problem. We introduce a sound and complete calculus to solve this problem in practice: Congruence Closure with Free Variables (CCFV). Experimental evaluations of implementations of CCFV in the state-of-the-art solver CVC4 and in the solver veriT exhibit improvements in the former and makes the latter competitive with state-of-the-art solvers in several benchmark libraries stemming from verification efforts.
Fichier principal
Vignette du fichier
main.pdf (600.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01442691 , version 1 (20-01-2017)
hal-01442691 , version 2 (23-01-2017)

Identifiers

  • HAL Id : hal-01442691 , version 2

Cite

Haniel Barbosa, Pascal Fontaine, Andrew Reynolds. Congruence Closure with Free Variables. [Research Report] Inria, Loria, Universite de Lorraine, UFRN, University of Iowa. 2017. ⟨hal-01442691v2⟩
469 View
303 Download

Share

Gmail Facebook X LinkedIn More