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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/hal-01590918
Contributor : Pascal Fontaine <>
Submitted on : Wednesday, September 20, 2017 - 2:23:28 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM

File

Barbosa1.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Haniel Barbosa, Pascal Fontaine, Andrew Reynolds. Congruence Closure with Free Variables. Tools and Algorithms for Construction and Analysis of Systems (TACAS), 2017, Uppsala, Sweden. pp.220 - 230, ⟨10.1007/10721959_17⟩. ⟨hal-01590918⟩

Share

Metrics

Record views

256

Files downloads

139