Skip to Main content Skip to Navigation
Conference papers

Congruence Closure with Free Variables (Work in Progress)

Haniel Barbosa 1 Pascal Fontaine 1
1 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : This paper presents preliminary work on the definition of a general framework for handling quantified formulas in SMT solving. Its focus is on the derivation of instances conflicting with a ground context, redefining the approach introduced in [11]. An enhanced version of the classical congruence closure algorithm, able to handle free variables, is presented.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Pascal Fontaine Connect in order to contact the contributor
Submitted on : Friday, December 18, 2015 - 10:21:58 AM
Last modification on : Saturday, October 16, 2021 - 11:26:05 AM
Long-term archiving on: : Saturday, April 29, 2017 - 8:37:22 PM


Files produced by the author(s)


  • HAL Id : hal-01246036, version 1



Haniel Barbosa, Pascal Fontaine. Congruence Closure with Free Variables (Work in Progress). QUANTIFY 2015 - 2nd International Workshop on Quantification, Aug 2015, Berlin, Germany. ⟨hal-01246036⟩



Les métriques sont temporairement indisponibles