Refinement Algebra for Formal Bytecode Generation

Duran, A.A. and Sampaio, A.C.A and Cavalcanti, A.L.C. (2002) Refinement Algebra for Formal Bytecode Generation. In: Lecture Notes in Computer Science. Springer-Verlag pp. 347-358. ISBN 978-3-540-00029-7. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1007/3-540-36103-0_36

Abstract

In this paper we propose an strategy for the design of compilers correct by construction for object-oriented languages. The process is formalized within a single and uniform semantic framework of an object-oriented language based on a subset of sequential Java and its algebraic laws. The strategy is to reduce an arbitrary source program to a particular normal form which describes the behavior of the target machine. This behavior is defined by an interpreter written in the same language. From the interpreter we can capture the sequence of generated bytecodes of the target machine. The normal form reduction is formalized as algebraic transformations where the central notion is refinement of programs.

Item Type: Conference or workshop item (Paper)
Additional information: To appear
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 17:59
Last Modified: 20 Feb 2009 14:29
Resource URI: http://kar.kent.ac.uk/id/eprint/13646 (The current URI for this page, for reference purposes)
  • Depositors only (login required):