A Strategy for Compiling Classes, Inheritance, and Dynamic Binding

Duran, A. and Cavalcanti, A.L.C. and Sampaio, A.C.A. (2003) A Strategy for Compiling Classes, Inheritance, and Dynamic Binding. In: FME 2003: Formal Methods - International Symposium of Formal Methods Europe, SEP 08-14, 2003, Pisa Italy . (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/b13229

Abstract

This paper presents a refinement strategy for the compilation of a subset of Java that includes classes, inheritance, dynamic binding, visibility control, and recursion. We tackle the problem of compiler correctness by reducing the task of compilation to that of program refinement. More specifically, refinement laws are used as compilation rules to reduce the source program to a normal form that models an interpreter running the target code. The compilation process is formalized within a single and uniform semantic framework, where translations or comparisons between semantics are avoided. Each compilation rule can be proved correct with respect to the algebraic laws of the language.

Item Type: Conference or workshop item (UNSPECIFIED)
Uncontrolled keywords: compiler correctness; object-orientation; transformation
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:00
Last Modified: 11 Jun 2012 13:47
Resource URI: http://kar.kent.ac.uk/id/eprint/13907 (The current URI for this page, for reference purposes)
  • Depositors only (login required):