Abstract
The execution of OBJ algebraic specification languages is based on the term rewriting system (TRS), which is an efficient theory to perform equational reasoning. We focus on the equality predicate implemented in OBJ languages. The equality predicate is used to test the equality of given terms by TRS. Unfortunately, it is well known that the current execution engine of OBJ languages with the equality predicate is not sound. To solve this problem, we define a modular term rewriting system (MTRS), which is suitable for the module system of OBJ languages, and propose a new equality predicate based on MTRS.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
CafeOBJ, http://www.ldl.jaist.ac.jp/cafeobj/
CiME, http://cime.lri.fr/
Maude, http://maude.cs.uiuc.edu/
Tyrolean Termination Tool, http://cl2-informatik.uibk.ac.at/ttt/
Burstall, R.M., Goguen, J.A.: The Semantics of CLEAR, A Specification Language. In: Bjorner, D. (ed.) Abstract Software Specifications. LNCS, vol. 86, pp. 292–332. Springer, Heidelberg (1980)
Diaconescu, R., Futatsugi, K.: CafeOBJ Report. World Scientific, Singapore (1998)
Futatsugi, K., Goguen, J.A., Jouannaud, J.-P., Meseguer, J.: Principles of OBJ2. In: POPL. Proceedings of the 12th ACM Symposium on Principles of Programming Languages, pp. 52–66. ACM Press, New York (1985)
Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated Termination Proofs with AProVE. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 210–220. Springer, Heidelberg (2004)
Goguen, J.A., Malcolm, G.: Algebraic Semantics of Imperative Programs, Massachusetts Institute of Technology (1996)
Goguen, J.A., Winkler, T., Meseguer, J., Futatsugi, K., Jouannaud, J.-P.: Software Engineering with OBJ: Algebraic Specification in Action. Kluwers Academic Publishers, Boston, MA (2000) (chapter Introducing OBJ*)
Meinke, K., Tucker, J.V.: Universal Algebra. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science: Background - Mathematical Structures, vol. 1, pp. 189–411. Clarendon Press, Oxford (1992)
Ohlebusch, E.: Advanced topics in term rewriting. Springer, Heidelberg (2002)
Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)
Wirsing, M.: Algebraic Specification. In: Handbook of Theoretical Computer Science. Formal Models and Sematics (B), pp. 675–788 (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Masaki, N., Kokichi, F. (2007). On Equality Predicates in Algebraic Specification Languages. In: Jones, C.B., Liu, Z., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2007. ICTAC 2007. Lecture Notes in Computer Science, vol 4711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75292-9_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-75292-9_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75290-5
Online ISBN: 978-3-540-75292-9
eBook Packages: Computer ScienceComputer Science (R0)