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.
https://hal.inria.fr/hal-01246036
Contributeur : Pascal Fontaine
<>
Soumis le : vendredi 18 décembre 2015 - 10:21:58
Dernière modification le : mardi 18 décembre 2018 - 16:38:25
Document(s) archivé(s) le : samedi 29 avril 2017 - 20:37:22
