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~\cite{reynolds2014fmcad}. An enhanced version of the classical congruence closure algorithm, able to handle free variables, is presented.
Document type :
Reports
Liste complète des métadonnées

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-01235912
Contributor : Haniel Barbosa <>
Submitted on : Monday, November 30, 2015 - 11:08:09 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:03 PM
Document(s) archivé(s) le : Tuesday, March 1, 2016 - 4:20:56 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01235912, version 1

Collections

Citation

Haniel Barbosa, Pascal Fontaine. Congruence Closure with Free Variables (Work in Progress). [Research Report] Inria Nancy - Grand Est (Villers-lès-Nancy, France). 2015. ⟨hal-01235912⟩

Share

Metrics

Record views

128

Files downloads

93