Abstract
We present an extension of Kleene algebra (KA) that can be used for modeling a record based view of pointer structures. This is achieved by transferring some concepts of fuzzy relation theory to KAs. The defined framework enables us to maintain within a single extended Kleene algebra several equally shaped KAs modeling distinct record selectors.
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
Clenaghan, K.: Calculational graph algorithmics: reconciling two approaches with dynamic algebra. Technical report CS-R9518, CWI - Centrum voor Wiskunde en Informatica (March 1995)
Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 45–59. Springer, Heidelberg (2000)
Conway, J.H.: Regular Algebra and Finite Machines. Chapman & Hall, London (1971)
Desharnais, J., Möller, B., Struth, G.: Kleene algebra with a domain operator. Technical report 2003-7, Institut für Informatik, Universität Augsburg (2003)
Desharnais, J., Möller, B., Tchier, F.: Kleene under a Demonic Star. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, pp. 355–370. Springer, Heidelberg (2000)
Ehm, T.: Properties of overwriting for updates in typed Kleene algebras. Technical report 2000-7, Institut für Informatik, Universität Augsburg (2000)
Ehm, T.: Transformational Construction of Correct Pointer Algorithms. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol. 2244, pp. 116–130. Springer, Heidelberg (2001)
Ehm, T.: The Kleene Algebra of Nested Pointer Structures: Theory and Applications. PhD thesis, Universität Augsburg (2003)
Ehm, T., Möller, B., Struth, G.: Kleene modules. In: Berghammer, R., Möller, B., Struth, G. (eds.) RelMiCS 2003. LNCS, vol. 3051, Springer, Heidelberg (2004)
Freyd, P.J., Scedrov, A.: Categories, Allegories. North-Holland Mathematical Library, vol. 39. North-Holland, Amsterdam (1990)
Hoare, C.A.R., Jifeng, H.: A trace model for pointers and objects. In: Guerraoui, R. (ed.) ECOOP 1999. LNCS, vol. 1628, pp. 1–17. Springer, Heidelberg (1999)
Kawahara, Y., Furusawa, H.: Crispness and representation theorems in Dedekind categories. Technical report DOI-TR 143, Kyushu University (1997)
Kozen, D.: Kleene algebra with tests. ACM Transactions on Programming Languages and Systems 19(3), 427–443 (1997)
Möller, B.: Calculating with pointer structures. In: Bird, R., Meertens, L. (eds.) Algorithmic Languages and Calculi, Proc. IFIP TC2/WG2.1 Working Conference, Le Bischenberg, February 1997, pp. 24–48. Chapman & Hall, Boca Raton (1997)
Pratt, V.: Action logic and pure induction. In: van Benthem, J., Eijck, J. (eds.) Proceedings of JELIA 1990, European Workshop on Logics in AI, Amsterdam (September 1990)
Pratt, V.: Dynamic Algebras as a well-behaved fragment of Relation Algebras. In: Bergman, C.H., Pigozzi, D.L., Maddux, R.D. (eds.) Algebraic Logic and Universal Algebra in Computer Science. LNCS, vol. 425, Springer, Heidelberg (1990)
von Wright, J.: From Kleene algebra to refinement algebra. In: Boiten, E.A., Möller, B. (eds.) MPC 2002. LNCS, vol. 2386, pp. 233–262. Springer, Heidelberg (2002)
Winter, M.: Relational constructions in Goguen categories. In: de Swart, H. (ed.) 6th International Seminar on Relational Methods in Computer Science (RelMiCS), pp. 222–236 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ehm, T. (2004). Pointer Kleene Algebra. In: Berghammer, R., Möller, B., Struth, G. (eds) Relational and Kleene-Algebraic Methods in Computer Science. RelMiCS 2003. Lecture Notes in Computer Science, vol 3051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24771-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-24771-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22145-6
Online ISBN: 978-3-540-24771-5
eBook Packages: Springer Book Archive