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].
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Shostak, R.E.: Deciding combinations of theories. Journal of the ACM 31, 1–12 (1984)
Manna, Z., Zarba, C.G.: Combining decision procedures. In: Aichernig, B.K., Maibaum, T. (eds.) Formal Methods at the Crossroads. From Panacea to Foundational Support. LNCS, vol. 2757, pp. 381–422. Springer, Heidelberg (2003)
Krstić, S., Conchon, S.: Canonization for disjoint unions of theories. In: Baader, F. (ed.) CADE 2003. LNCS, vol. 2741, pp. 197–211. Springer, Heidelberg (2003)
Ganzinger, H.: Shostak light. In: Voronkov, A. (ed.) CADE 2002. LNCS, vol. 2392, pp. 332–346. Springer, Heidelberg (2002)
Rueß, H., Shankar, N.: Deconstructing Shostak. In: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science. Boston, Massachusetts, USA, pp. 19–28. IEEE Computer Society, Los Alamitos (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shlepakov, S.P. (2006). Functional Equations in Shostak Theories. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds) Computer Science – Theory and Applications. CSR 2006. Lecture Notes in Computer Science, vol 3967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753728_35
Download citation
DOI: https://doi.org/10.1007/11753728_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34166-6
Online ISBN: 978-3-540-34168-0
eBook Packages: Computer ScienceComputer Science (R0)