Advice On Structuring Compiler Back Ends And Proving Them Correct

Advice On Structuring Compiler Back Ends And Proving Them Correct (1993)

by Of The College , Dino P. Oliva

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Advice On Structuring Compiler Back Ends And Proving Them Correct	user correction - Legacy Corrections
AUTHOR NAME	Of The College	user correction - Legacy Corrections
AUTHOR NAME	Dino P. Oliva	user correction - Legacy Corrections
ABSTRACT	In this dissertation we present a methodology for the verification of language implementations based on formal semantics. While this is not a new concept, the methodology presented is interesting for several reasons: ffl It is easy to use ffl It can be applied to languages specified by traditional denotational techniques ffl It mirrors traditional language implementation schemes ffl It is powerful enough to generate code for contemporary machine architectures Our approach advocates the use of denotational semantics to verify compiler front ends (machine independent transformations) and operational semantics to verify compiler back ends (machine dependent transformations). To illustrate the methodology, we present and verify an implementation of the language -LISP, a dialect of the Scheme programming language [13]. -LISP is restricted to obey stack discipline which introduces a number of issues we must deal with to ensure that the language is implemented properly (i.e. using only a st...	user correction - Legacy Corrections
YEAR	1993	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
TECH	PhD thesis	INFERENCE
CITATIONS	9 found	ParsCit 1.0