A Generalized Framework for Virtual Substitution

Marek Kosta 1, 2 Thomas Sturm 2, 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 : We generalize the framework of virtual substitution for real quantifier elimination to arbitrary but bounded degrees. We make explicit the representation of test points in elimination sets using roots of parametric univariate polynomials described by Thom codes. Our approach follows an early suggestion by Weispfenning, which has never been carried out explicitly. Inspired by virtual substitution for linear formulas, we show how to systematically construct elimination sets containing only test points representing lower bounds.
Type de document :
Autre publication
preprint. 2015, pp.17
Liste complète des métadonnées

Contributeur : Stephan Merz <>
Soumis le : lundi 7 décembre 2015 - 17:37:04
Dernière modification le : mardi 19 février 2019 - 15:40:03

Lien texte intégral


  • HAL Id : hal-01239431, version 1
  • ARXIV : 1501.05826



Marek Kosta, Thomas Sturm. A Generalized Framework for Virtual Substitution. preprint. 2015, pp.17. 〈hal-01239431〉



Consultations de la notice