Abstract
Machine functions have been introduced by Earley and Sturgis in [6] in order to provide a mathematical foundation of the use of the T-diagrams proposed by Bratman in [5]. Machine functions describe the operation of a machine at a very abstract level. A theory of hardware and software based on machine functions may be called a machine function theory, or alternatively when focusing on inputs and outputs for machine functions a control code algebra (CCA). In this paper we develop some control code algebras from first principles. Machine function types are designed specifically for various application such as program compilation, assembly, interpretation, managed interpretation and just-in-time compilation. Machine function dependent CCA’s are used to formalize the well-known compiler fixed point, the managed execution of JIT compiled text and the concept of a verifying compiler.
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
Appel, A.W.: Axiomatic bootstrapping, a guide for compiler hackers. ACM TOPLAS 16(6), 1699–1719 (1994)
Bergstra, J.A., Loots, M.E.: Program algebra for sequential code. Journal of Logic and Algebraic Programming 51(2), 125–156 (2002)
Bergstra, J.A., van Vlijmen, S.F.M.: Theoretische Software-Engineering. In: Dutch, ZENOInstitute, Leiden, Utrecht, The Netherlands (1998)
Hoare, C.A.: The verifying compiler, a grand challenge for computer research. JACM 50(1), 63–69 (2003)
Bratman, H.: An alternate form of the UNCOL diagram. CACM 4(3), 142 (1961)
Earley, J., Sturgis, H.: A formalism for translator interactions. CACM 13(10), 607–617 (1970)
Halpern, M.I.: Machine independence: Its technology and economics. CACM 8(12), 782–785 (1965)
Floyd, R.W.: Assigning meanings to programs. Proc. Amer. Soc. Symp. Appl. Math. 19, 19–31 (1967)
Turing, A.: On computable numbers, with an application to the entscheidungsproblem. Proc. London Math. Soc. Ser 2 42(43), 230–265, 544–564 (1936)
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
Bergstra, J.A. (2004). Machine Function Based Control Code Algebras. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, WP. (eds) Formal Methods for Components and Objects. FMCO 2003. Lecture Notes in Computer Science, vol 3188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30101-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-30101-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22942-1
Online ISBN: 978-3-540-30101-1
eBook Packages: Springer Book Archive