Skip to Main content Skip to Navigation

Congruence Closure with Free Variables (Work in Progress)

Haniel Barbosa 1 Pascal Fontaine 1
1 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est, MPII - Max-Planck-Institut für Informatik
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.
Keywords : SMT instantiation quantifiers
Document type :
Conference papers
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download
https://hal.inria.fr/hal-01246036
Contributor : Pascal Fontaine <>
Submitted on : Friday, December 18, 2015 - 10:21:58 AM
Last modification on : Tuesday, February 19, 2019 - 3:40:03 PM
Document(s) archivé(s) le : Saturday, April 29, 2017 - 8:37:22 PM

File

Vignette du document
BarbosaFontaine-QUANTIFY2015.p...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01246036, version 1

Collections

CNRS | INRIA | UNIV-LORRAINE | LORIA-FM | LORIA

Citation

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

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

183

Files downloads

108

 

Contact                    Legal Notice                    Personal Data