Congruence Closure with Free Variables - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Congruence Closure with Free Variables


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
Barbosa1.pdf (567 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01590918 , version 1 (20-09-2017)



Haniel Barbosa, Pascal Fontaine, Andrew Reynolds. Congruence Closure with Free Variables. TACAS 2017 - 23rd International Conference on Tools and Algorithms for Construction and Analysis of Systems, Apr 2017, Uppsala, Sweden. pp.220 - 230, ⟨10.1007/10721959_17⟩. ⟨hal-01590918⟩
143 View
163 Download



Gmail Facebook X LinkedIn More