Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Shostak Light


Ganzinger,  Harald
Programming Logics, MPI for Informatics, Max Planck Society;


Voronkov,  Andrei
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Ganzinger, H. (2002). Shostak Light. In Automated deduction, CADE-18: 18th International Conference on Automated Deduction (pp. 332-346). Heidelberg, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-307A-4
We represent the essential ingredients of Shostak's procedure at a high level of abstraction, and as a refinement of the Nelson-Oppen procedure. We analyze completeness issues of the method based on a general notion of theories. We also formalize a notion of sigma-models and show that on the basis of Shostak's procedure we cannot distinguish a theory from its approximation represented by the class of its sigma-models.