Proving the Correctness of Compiler Optimisations Based on a Global Analysis: A Study of Strictness Analysis

Proving the Correctness of Compiler Optimisations Based on a Global Analysis: A Study of Strictness Analysis (1992)

by Geoffrey Burn , Daniel Le Métayer

Citations:

15 - 3 self

User correction supplied by mph

Datum	Value	Source
TITLE	Proving the Correctness of Compiler Optimisations Based on a Global Analysis: A Study of Strictness Analysis	user correction - Legacy Corrections
AUTHOR NAME	Geoffrey Burn	user correction
AUTHOR AFFIL	Department of Computing,; Imperial College of Science, Technology and Medicine,	user correction
AUTHOR ADDR	180 Queen's Gate,; United Kingdom	user correction
AUTHOR NAME	Daniel Le Métayer	user correction
AUTHOR AFFIL	Irisa/Inria,; Campus de Beaulieu,	user correction
AUTHOR ADDR	35042 Rennes Cedex,; France	user correction
ABSTRACT	A substantial amount of work has been devoted to the proof of correctness of various program analyses but much less attention has been paid to the correctness of compiler optimisations based on these analyses. In this paper we tackle the problem in the context of strictness analysis for lazy functional languages. 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.	user correction
YEAR	1992	user correction - Legacy Corrections
CITATIONS	0 found	ParsCit 1.0