A Compiler Correctness Proof For The Static Link Technique By Means Of Evolving Algebras

Authors:
Markus Mohnen
Affiliations:
RWTH Aachen, Lehrstuhl für Informatik II, Ahornstraße 55, 52056 Aachen, Germany e-mail: mohnen@informatik.rwth-aachen.de
Venue:
Fundamenta Informaticae
Year:
1997

Citing 4
Cited 0

Shallow binding in Lisp 1.5

Communications of the ACM
Compiler Specification and Verification

Compiler Specification and Verification
A Theory of Programming Language Semantics

A Theory of Programming Language Semantics
Algebraic Operational Semantics and Modula-2

CSL '87 Proceedings of the 1st Workshop on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

The well-known static link technique is used for stack-based implementations of imperative programming languages which admit nested recursive procedure declarations. Its basic idea is to access non-local variables by tracing a static link chain to lower stack elements. Evolving algebras are a new method for defining operational semantics of abstract machines. Based on an appropriate stack machine, defined as an evolving algebra, and a functional description of a compiler for a sample language, we give a complete proof of correctness for this technique using the method of refinement.