Proving the Correctness of Compiler Optimisations Based on Strictness Analysis

Proving the Correctness of Compiler Optimisations Based on Strictness Analysis (1993)

Cached

Download Links

[sunsite.doc.ic.ac.uk]

by Geoffrey Burn , Daniel Le Métayer

Venue:	in Proceedings 5th int. Symp. on Programming Language Implementation and Logic Programming, LNCS 714
Citations:	4 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Proving the Correctness of Compiler Optimisations Based on Strictness Analysis	user correction - Legacy Corrections
AUTHOR NAME	Geoffrey Burn	user correction - Legacy Corrections
AUTHOR AFFIL	1	user correction - Legacy Corrections
AUTHOR NAME	Daniel Le Métayer	user correction - Legacy Corrections
AUTHOR AFFIL	; 2; 1; Department of Computing, Imperial College of Science, Technology and Medicine,; 2	user correction - Legacy Corrections
AUTHOR ADDR	; 180 Queen's Gate, London SW7 2BZ, United Kingdom; Irisa/Inria, Campus de Beaulieu, 35042 Rennes Cedex, France	user correction - Legacy Corrections
ABSTRACT	. We show that compiler optimisations based on strictness analysis can be expressed formally in the functional framework using continuations. This formal presentation has two benefits: it allows us to give a rigorous correctness proof of the optimised compiler; and it exposes the various optimisations made possible by a strictness analysis. 1 Introduction Realistic compilers for imperative or functional languages include a number of optimisations based on non-trivial global analyses. Proving the correctness of such optimising compilers can be done in three steps: 1. proving the correctness of the original (unoptimised) compiler; 2. proving the correctness of the analysis; and 3. proving the correctness of the modifications of the simple-minded compiler to exploit the results of the analysis. A substantial amount of work has been devoted to steps (1) and (2) but there have been surprisingly few attempts at tackling step (3). In this paper we show how to carry out this third step in the...	user correction - Legacy Corrections
YEAR	1993	INFERENCE
VENUE	in Proceedings 5th int. Symp. on Programming Language Implementation and Logic Programming, LNCS 714	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	346--364	INFERENCE
VOLUME	6	INFERENCE
CITATIONS	45 found	ParsCit 1.0