Functional equations in shostak theories

Authors:
Sergey P. Shlepakov
Affiliations:
Moscow State University, Russia
Venue:
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Year:
2006

Citing 3
Cited 0

Deciding Combinations of Theories

Journal of the ACM (JACM)
Shostak Light

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Deconstructing Shostak

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider Shostak theories introduced in [1]. The class of Shostak theories consists of decidable first order equality theories, specified by two algorithms: a canoniser and a solver. A canoniser calculates the normal form of a term. A solver tests whether an equality can be reduced to an equivalent substitution and constructs this substitution when it exists. The examples of Shostak theories are linear arithmetics of integers and rational numbers, theories of lists, arrays, ets.[2].